ESAPI-C 1.0
The OWASP Enterprise Security API for C
|
A dynamic array implementation using macros. More...
#include <stddef.h>
#include <string.h>
#include <stdlib.h>
Go to the source code of this file.
Data Structures | |
struct | UT_icd |
struct | UT_array |
Defines | |
#define | UTARRAY_VERSION 1.9.1 |
#define | _UNUSED_ {sizeof(int),NULL,NULL,NULL} |
#define | oom() exit(-1) |
#define | utarray_init(a, _icd) |
#define | utarray_done(a) |
#define | utarray_new(a, _icd) |
#define | utarray_free(a) |
#define | utarray_reserve(a, by) |
#define | utarray_push_back(a, p) |
#define | utarray_pop_back(a) |
#define | utarray_extend_back(a) |
#define | utarray_len(a) ((a)->i) |
#define | utarray_eltptr(a, j) (((j) < (a)->i) ? _utarray_eltptr(a,j) : NULL) |
#define | _utarray_eltptr(a, j) ((char*)((a)->d + ((a)->icd->sz*(j) ))) |
#define | utarray_insert(a, p, j) |
#define | utarray_inserta(a, w, j) |
#define | utarray_resize(dst, num) |
#define | utarray_concat(dst, src) |
#define | utarray_erase(a, pos, len) |
#define | utarray_clear(a) |
#define | utarray_sort(a, cmp) |
#define | utarray_front(a) (((a)->i) ? (_utarray_eltptr(a,0)) : NULL) |
#define | utarray_next(a, e) (((e)==NULL) ? utarray_front(a) : ((((a)->i) > (utarray_eltidx(a,e)+1)) ? _utarray_eltptr(a,utarray_eltidx(a,e)+1) : NULL)) |
#define | utarray_back(a) (((a)->i) ? (_utarray_eltptr(a,(a)->i-1)) : NULL) |
#define | utarray_eltidx(a, e) (((char*)(e) >= (char*)((a)->d)) ? (((char*)(e) - (char*)((a)->d))/(a)->icd->sz) : -1) |
Typedefs | |
typedef void( | ctor_f )(void *dst, const void *src) |
typedef void( | dtor_f )(void *elt) |
typedef void( | init_f )(void *elt) |
A dynamic array implementation using macros.
Definition in file utarray.h.
#define utarray_clear | ( | a | ) |
#define utarray_concat | ( | dst, | |
src | |||
) |
#define utarray_done | ( | a | ) |
#define utarray_erase | ( | a, | |
pos, | |||
len | |||
) |
do { \ if ((a)->icd->dtor) { \ size_t _ut_i; \ for(_ut_i=0; _ut_i < len; _ut_i++) { \ (a)->icd->dtor(utarray_eltptr(a,pos+_ut_i)); \ } \ } \ if ((a)->i > (pos+len)) { \ memmove( _utarray_eltptr(a,pos), _utarray_eltptr(a,pos+len), \ ((a->i)-(pos+len))*((a)->icd->sz)); \ } \ (a)->i -= (len); \ } while(0)
#define utarray_extend_back | ( | a | ) |
#define utarray_free | ( | a | ) |
#define utarray_init | ( | a, | |
_icd | |||
) |
#define utarray_insert | ( | a, | |
p, | |||
j | |||
) |
do { \ utarray_reserve(a,1); \ if (j > (a)->i) break; \ if ((j) < (a)->i) { \ memmove( _utarray_eltptr(a,(j)+1), _utarray_eltptr(a,j), \ ((a)->i - (j))*((a)->icd->sz)); \ } \ if ((a)->icd->copy) { (a)->icd->copy( _utarray_eltptr(a,j), p); } \ else { memcpy(_utarray_eltptr(a,j), p, (a)->icd->sz); }; \ (a)->i++; \ } while(0)
#define utarray_inserta | ( | a, | |
w, | |||
j | |||
) |
do { \ if (utarray_len(w) == 0) break; \ if (j > (a)->i) break; \ utarray_reserve(a,utarray_len(w)); \ if ((j) < (a)->i) { \ memmove(_utarray_eltptr(a,(j)+utarray_len(w)), \ _utarray_eltptr(a,j), \ ((a)->i - (j))*((a)->icd->sz)); \ } \ if (a->icd->copy) { \ size_t _ut_i; \ for(_ut_i=0;_ut_i<(w)->i;_ut_i++) { \ (a)->icd->copy(_utarray_eltptr(a,j+_ut_i), _utarray_eltptr(w,_ut_i)); \ } \ } else { \ memcpy(_utarray_eltptr(a,j), _utarray_eltptr(w,0), \ utarray_len(w)*((a)->icd->sz)); \ } \ (a)->i += utarray_len(w); \ } while(0)
#define utarray_new | ( | a, | |
_icd | |||
) |
#define utarray_pop_back | ( | a | ) |
#define utarray_push_back | ( | a, | |
p | |||
) |
#define utarray_reserve | ( | a, | |
by | |||
) |
#define utarray_resize | ( | dst, | |
num | |||
) |
do { \ size_t _ut_i; \ if (dst->i > (size_t)(num)) { \ if ((dst)->icd->dtor) { \ for(_ut_i=num; _ut_i < dst->i; _ut_i++) { \ (dst)->icd->dtor(utarray_eltptr(dst,_ut_i)); \ } \ } \ } else if (dst->i < (size_t)(num)) { \ utarray_reserve(dst,num-dst->i); \ if ((dst)->icd->init) { \ for(_ut_i=dst->i; _ut_i < num; _ut_i++) { \ (dst)->icd->init(utarray_eltptr(dst,_ut_i)); \ } \ } else { \ memset(_utarray_eltptr(dst,dst->i),0,(dst)->icd->sz*(num-dst->i)); \ } \ } \ dst->i = num; \ } while(0)
#define utarray_sort | ( | a, | |
cmp | |||
) |
#define UTARRAY_VERSION 1.9.1 |
Copyright (c) 2008-2010, Troy D. Hanson http://uthash.sourceforge.net All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.