mirror/mariadb
1
0
Fork 0
mirror of https://github.com/MariaDB/server.git synced 2025-01-27 17:33:44 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

Rename ib_vector typedef to ib_vector_t.

Browse source
This commit is contained in:
osku 2006-04-06 10:02:44 +00:00
parent be5145c94b
commit c37316d9a8
5 changed files with 14 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
include/pars0pars.h
View file

@ -542,9 +542,9 @@ pars_info_get_bound_lit(
struct pars_info_struct {
mem_heap_t* heap; /* our own memory heap */
ib_vector* funcs; /* user functions, or NUll
ib_vector_t* funcs; /* user functions, or NUll
(pars_user_func_t*) */
ib_vector* bound_lits; /* bound literals, or NULL
ib_vector_t* bound_lits; /* bound literals, or NULL
(pars_bound_lit_t*) */
ibool graph_owns_us; /* if TRUE (which is the default),

10
include/ut0vec.h
View file

@ -4,7 +4,7 @@
#include "univ.i"
#include "mem0mem.h"
typedef struct ib_vector_struct ib_vector;
typedef struct ib_vector_struct ib_vector_t;
/* An automatically resizing vector datatype with the following properties:
@ -23,7 +23,7 @@ typedef struct ib_vector_struct ib_vector;
/********************************************************************
Create a new vector with the given initial size. */
ib_vector*
ib_vector_t*
ib_vector_create(
/*=============*/
/* out: vector */
@ -36,7 +36,7 @@ Push a new element to the vector, increasing its size if necessary. */
void
ib_vector_push(
/*===========*/
ib_vector* vec, /* in: vector */
ib_vector_t* vec, /* in: vector */
void* elem); /* in: data element */
/********************************************************************
@ -46,7 +46,7 @@ ulint
ib_vector_size(
/*===========*/
/* out: number of elements in vector */
ib_vector* vec); /* in: vector */
ib_vector_t* vec); /* in: vector */
/********************************************************************
Get the n'th element. */
@ -55,7 +55,7 @@ void*
ib_vector_get(
/*==========*/
/* out: n'th element */
ib_vector* vec, /* in: vector */
ib_vector_t* vec, /* in: vector */
ulint n); /* in: element index to get */
/* See comment at beginning of file. */

4
include/ut0vec.ic
View file

@ -5,7 +5,7 @@ ulint
ib_vector_size(
/*===========*/
/* out: number of elements in vector */
ib_vector* vec) /* in: vector */
ib_vector_t* vec) /* in: vector */
{
return(vec->used);
}
@ -17,7 +17,7 @@ void*
ib_vector_get(
/*==========*/
/* out: n'th element */
ib_vector* vec, /* in: vector */
ib_vector_t* vec, /* in: vector */
ulint n) /* in: element index to get */
{
ut_a(n < vec->used);

4
pars/pars0pars.c
View file

@ -2054,7 +2054,7 @@ pars_info_get_user_func(
const char* name) /* in: function name to find*/
{
ulint i;
ib_vector* vec;
ib_vector_t* vec;
if (!info || !info->funcs) {
return(NULL);
@ -2085,7 +2085,7 @@ pars_info_get_bound_lit(
const char* name) /* in: bound literal name to find */
{
ulint i;
ib_vector* vec;
ib_vector_t* vec;
if (!info || !info->bound_lits) {
return(NULL);

6
ut/ut0vec.c
View file

@ -7,14 +7,14 @@
/********************************************************************
Create a new vector with the given initial size. */
ib_vector*
ib_vector_t*
ib_vector_create(
/*=============*/
/* out: vector */
mem_heap_t* heap, /* in: heap */
ulint size) /* in: initial size */
{
ib_vector* vec;
ib_vector_t* vec;
ut_a(size > 0);
@ -34,7 +34,7 @@ Push a new element to the vector, increasing its size if necessary. */
void
ib_vector_push(
/*===========*/
ib_vector* vec, /* in: vector */
ib_vector_t* vec, /* in: vector */
void* elem) /* in: data element */
{
if (vec->used >= vec->total) {