Searched refs:nmemb (Results 1 - 25 of 32) sorted by relevance

12

/haiku-fatelf/src/system/libroot/posix/glibc/misc/
H A Dlsearch.c26 lsearch (const void *key, void *base, size_t *nmemb, size_t size, argument
32 result = lfind (key, base, nmemb, size, compar);
36 result = memcpy (base + (*nmemb) * size, key, size);
37 ++(*nmemb);
45 lfind (const void *key, const void *base, size_t *nmemb, size_t size, argument
51 while (cnt < *nmemb && (*compar) (key, result) != 0)
57 return cnt < *nmemb ? (void *) result : NULL;
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dbsearch.c33 @deftypefn Supplemental void* bsearch (const void *@var{key}, const void *@var{base}, size_t @var{nmemb}, size_t @var{size}, int (*@var{compar})(const void *, const void *))
35 Performs a search over an array of @var{nmemb} elements pointed to by
70 bsearch(key, base0, nmemb, size, compar)
73 size_t nmemb;
81 for (lim = nmemb; lim != 0; lim >>= 1) {
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DAreaUtils.h33 void *calloc(size_t nmemb, size_t size);
H A DAreaUtils.cpp60 AreaUtils::calloc(size_t nmemb, size_t size) argument
62 //PRINT(("AreaUtils::calloc(%lu, %lu)\n", nmemb, size));
63 return AreaUtils::malloc(nmemb * size);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DAreaUtils.h33 void *calloc(size_t nmemb, size_t size);
H A DAreaUtils.cpp60 AreaUtils::calloc(size_t nmemb, size_t size) argument
62 //PRINT(("AreaUtils::calloc(%lu, %lu)\n", nmemb, size));
63 return AreaUtils::malloc(nmemb * size);
/haiku-fatelf/src/add-ons/translators/jpeg2000/libjasper/
H A Djas_malloc.c155 void *jas_calloc(size_t nmemb, size_t size) argument
159 n = nmemb * size;
/haiku-fatelf/src/system/libroot/posix/stdlib/
H A Dbsearch.c61 size_t nmemb,
71 for (lim = nmemb; lim != 0; lim >>= 1) {
58 bsearch( void const *key, void const *base0, size_t nmemb, size_t size, int (*compar)(void const *, void const *) ) argument
H A Dheapsort.c76 * There two cases. If j == nmemb, select largest of Ki and Kj. If
77 * j < nmemb, select largest of Ki, Kj and Kj+1.
79 #define CREATE(initval, nmemb, par_i, child_i, par, child, size, count, tmp) { \
80 for (par_i = initval; (child_i = par_i * 2) <= nmemb; \
83 if (child_i < nmemb && compar(child, child + size) < 0) { \
111 #define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \
112 for (par_i = 1; (child_i = par_i * 2) <= nmemb; par_i = child_i) { \
114 if (child_i < nmemb && compar(child, child + size) < 0) { \
142 heapsort(void *vbase, size_t nmemb, size_t size, int (*compar)(void const *, void const *)) argument
156 if (nmemb <
[all...]
H A Dmerge.c100 mergesort(void *base, size_t nmemb, size_t size, int (*cmp)(void const *, void const *)) argument
125 if (nmemb == 0) {
137 if ((list2 = malloc(nmemb * size + PSIZE)) == NULL)
141 setup(list1, list2, nmemb, size, cmp);
142 last = list2 + nmemb * size;
237 last = list2 + nmemb*size;
240 memmove(list2, list1, nmemb*size);
/haiku-fatelf/src/add-ons/translators/jpeg2000/libjasper/jasper/
H A Djas_malloc.h163 void *jas_calloc(size_t nmemb, size_t size);
/haiku-fatelf/src/libs/tiff/
H A Dtif_aux.c38 size_t nmemb, size_t elem_size, const char* what)
41 tsize_t bytes = nmemb * elem_size;
46 if (nmemb && elem_size && bytes / elem_size == nmemb)
53 what,(long) nmemb, (long) elem_size);
59 _TIFFCheckMalloc(TIFF* tif, size_t nmemb, size_t elem_size, const char* what) argument
61 return _TIFFCheckRealloc(tif, NULL, nmemb, elem_size, what);
37 _TIFFCheckRealloc(TIFF* tif, tdata_t buffer, size_t nmemb, size_t elem_size, const char* what) argument
H A Dtif_strip.c52 multiply(TIFF* tif, size_t nmemb, size_t elem_size, const char* where) argument
54 uint32 bytes = nmemb * elem_size;
56 if (elem_size && bytes / elem_size != nmemb) {
H A Dtif_tile.c52 multiply(TIFF* tif, size_t nmemb, size_t elem_size, const char* where) argument
54 uint32 bytes = nmemb * elem_size;
56 if (elem_size && bytes / elem_size != nmemb) {
/haiku-fatelf/src/add-ons/translators/hpgs/lib/
H A Dhpgsostream.c193 static size_t mem_write (void *ptr, size_t size, size_t nmemb, hpgs_mem_ostream_stream *stream) argument
195 if (stream->pptr + size*nmemb > stream->eptr)
196 mem_grow(stream,size*nmemb);
201 memcpy(stream->pptr,ptr,size*nmemb);
202 stream->pptr += size*nmemb;
204 return nmemb;
H A Dhpgsistream.c194 static size_t mem_read (void *ptr, size_t size, size_t nmemb, hpgs_mem_istream_stream *stream) argument
203 if (ret > nmemb) ret = nmemb;
H A Dhpgszostream.c143 static int z_write (void *ptr, size_t size, size_t nmemb, hpgs_z_ostream_stream *stream) argument
145 size_t tot_bytes = size*nmemb;
167 return stream->errflg ? 0 : nmemb;
/haiku-fatelf/src/kits/network/libbind/irs/
H A Dnis_gr.c110 size_t nmemb; /*%< Malloc'd max index of gr_mem[]. */ member in struct:pvt
271 pvt->nmemb = 0;
305 if (num_members+1 >= pvt->nmemb || pvt->group.gr_mem == NULL) {
306 pvt->nmemb += 10;
308 pvt->nmemb * sizeof(char *));
322 pvt->nmemb = 1;
332 pvt->nmemb = 0;
H A Ddns_gr.c73 size_t nmemb; /*%< Malloc'd max index of gr_mem[]. */ member in struct:pvt
243 if (num_members+1 >= pvt->nmemb || pvt->group.gr_mem == NULL) {
244 pvt->nmemb += 10;
246 pvt->nmemb * sizeof(char *));
H A Dlcl_gr.c101 size_t nmemb; /*%< Malloc'd max index of gr_mem[]. */ member in struct:pvt
335 if (n > pvt->nmemb || pvt->group.gr_mem == NULL) {
341 pvt->nmemb = n;
H A Dgen_gr.c64 size_t nmemb; /*%< Malloc'd max index of gr_mem[]. */ member in struct:pvt
339 if (pvt->nmemb < 1) {
346 pvt->nmemb = 1;
358 if ((size_t)n > pvt->nmemb) {
365 pvt->nmemb = n;
/haiku-fatelf/src/add-ons/translators/hpgs/
H A DReadHelper.h88 positionio_read(void *ptr, size_t size, size_t nmemb, my_hpgs_istream *stream) argument
92 for (; i < nmemb; i++) {
/haiku-fatelf/src/bin/findutils/gnulib/lib/
H A Dstdlib.h120 extern void * calloc (size_t nmemb, size_t size);
H A Dstdlib.in.h91 extern void * calloc (size_t nmemb, size_t size);
/haiku-fatelf/src/libs/pdflib/libs/pdcore/
H A Dpc_file.h64 size_t pdc_fread(void *ptr, size_t size, size_t nmemb, pdc_file *sfp);

Completed in 134 milliseconds

12