Searched refs:nelem (Results 1 - 25 of 26) sorted by relevance

12

/haiku-buildtools/legacy/gcc/libiberty/
H A Dcalloc.c14 calloc (nelem, elsize)
15 size_t nelem, elsize;
19 if (nelem == 0 || elsize == 0)
20 nelem = elsize = 1;
22 ptr = malloc (nelem * elsize);
23 if (ptr) bzero (ptr, nelem * elsize);
H A Dxmalloc.c99 xcalloc (nelem, elsize)
100 size_t nelem, elsize;
104 if (nelem == 0 || elsize == 0)
105 nelem = elsize = 1;
107 newmem = calloc (nelem, elsize);
121 (unsigned long) (nelem * elsize), (unsigned long) allocated);
126 (unsigned long) (nelem * elsize));
/haiku-buildtools/binutils/libiberty/
H A Dcalloc.c6 @deftypefn Supplemental void* calloc (size_t @var{nelem}, size_t @var{elsize})
8 Uses @code{malloc} to allocate storage for @var{nelem} objects of
23 calloc (size_t nelem, size_t elsize) argument
27 if (nelem == 0 || elsize == 0)
28 nelem = elsize = 1;
30 ptr = malloc (nelem * elsize);
31 if (ptr) bzero (ptr, nelem * elsize);
H A Dxmalloc.c39 @deftypefn Replacement void* xcalloc (size_t @var{nelem}, size_t @var{elsize})
156 xcalloc (size_t nelem, size_t elsize) argument
160 if (nelem == 0 || elsize == 0)
161 nelem = elsize = 1;
163 newmem = calloc (nelem, elsize);
165 xmalloc_failed (nelem * elsize);
/haiku-buildtools/gcc/libiberty/
H A Dcalloc.c6 @deftypefn Supplemental void* calloc (size_t @var{nelem}, size_t @var{elsize})
8 Uses @code{malloc} to allocate storage for @var{nelem} objects of
23 calloc (size_t nelem, size_t elsize) argument
27 if (nelem == 0 || elsize == 0)
28 nelem = elsize = 1;
30 ptr = malloc (nelem * elsize);
31 if (ptr) bzero (ptr, nelem * elsize);
H A Dxmalloc.c38 @deftypefn Replacement void* xcalloc (size_t @var{nelem}, size_t @var{elsize})
155 xcalloc (size_t nelem, size_t elsize) argument
159 if (nelem == 0 || elsize == 0)
160 nelem = elsize = 1;
162 newmem = calloc (nelem, elsize);
164 xmalloc_failed (nelem * elsize);
/haiku-buildtools/legacy/binutils/libiberty/
H A Dcalloc.c6 @deftypefn Supplemental void* calloc (size_t @var{nelem}, size_t @var{elsize})
8 Uses @code{malloc} to allocate storage for @var{nelem} objects of
23 calloc (size_t nelem, size_t elsize) argument
27 if (nelem == 0 || elsize == 0)
28 nelem = elsize = 1;
30 ptr = malloc (nelem * elsize);
31 if (ptr) bzero (ptr, nelem * elsize);
H A Dxmalloc.c38 @deftypefn Replacement void* xcalloc (size_t @var{nelem}, size_t @var{elsize})
155 xcalloc (size_t nelem, size_t elsize) argument
159 if (nelem == 0 || elsize == 0)
160 nelem = elsize = 1;
162 newmem = calloc (nelem, elsize);
164 xmalloc_failed (nelem * elsize);
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/
H A Dcmplxdivide.c12 #define nelem(x) (sizeof(x)/sizeof((x)[0])) macro
59 for(i=0; i<nelem(f); i++)
60 for(j=0; j<nelem(f); j++)
61 for(k=0; k<nelem(f); k++)
62 for(l=0; l<nelem(f); l++) {
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/
H A Dbug027.go15 nelem int
21 v.nelem = 0
31 v.elem[v.nelem] = e
32 v.nelem++
54 for i := 0; i < v.nelem; i++ {
59 for i := 0; i < v.nelem; i++ {
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/sparc/
H A Dultrasp6.c104 long int i, nelem, ipHi, ipLo; local
128 for( nelem=0; nelem < 30L; nelem++ )
136 for( ipLo=1+iCase; ipLo<(((6)<(iso.numLevels[ipH_LIKE][nelem])) ? (6) : (5)); ++ipLo )
138 for( ipHi=ipLo+1; ipHi< (((ipLo+5)<(iso.numLevels[ipH_LIKE][nelem])) ? (ipLo+5) : (iso.numLevels[ipH_LIKE][nelem])); ++ipHi )
142 hbetab = HSRate( ipHi,ipLo , nelem+1, phycon.te , dense.eden, chAB[iCase] );
144 CaseBHS.lgHCaseBOK[iCase][nelem] = 0;
147 hbetab *= abund.xIonFracs[nelem][nele
[all...]
/haiku-buildtools/legacy/gcc/libobjc/
H A Dmisc.c123 objc_calloc(size_t nelem, size_t size) argument
125 void* res = (void*) (*_objc_calloc)(nelem, size);
151 static void *GC_calloc (size_t nelem, size_t size) argument
153 void* p = GC_malloc (nelem * size);
157 memset (p, 0, nelem * size);
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dpr36908.c6 extern void *foo(size_t nelem, size_t elsize);
/haiku-buildtools/gcc/libcilkrts/runtime/
H A Dreducer_impl.cpp147 size_t nelem; member in struct:cilkred_map
220 bool is_empty() { return nelem == 0; }
298 nelem = 0;
320 static size_t minsz(size_t nelem) argument
322 return 1U + nelem + nelem / 8U;
325 static size_t nextsz(size_t nelem) argument
327 return 2 * nelem;
332 return minsz(nelem) > nbuckets;
377 CILK_ASSERT(nelem
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/arm/
H A Dpr59858.c13 int nelem; member in struct:__anon1676
127 for (i = 0; i < cur_nodes->nelem; ++i)
/haiku-buildtools/gcc/gcc/fortran/
H A Dclass.c1251 gfc_symbol *nelem,
1409 iter->end = gfc_lval_expr_from_sym (nelem);
1462 iter->end = gfc_lval_expr_from_sym (nelem);
1513 gfc_symbol *ptr = NULL, *idx, *idx2, *is_contiguous, *offset, *nelem; local
1905 gfc_get_symbol ("nelem", sub_ns, &nelem);
1906 nelem->ts.type = BT_INTEGER;
1907 nelem->ts.kind = gfc_index_integer_kind;
1908 nelem->attr.flavor = FL_VARIABLE;
1909 nelem
1248 finalizer_insert_packed_call(gfc_code *block, gfc_finalizer *fini, gfc_symbol *array, gfc_symbol *byte_stride, gfc_symbol *idx, gfc_symbol *ptr, gfc_symbol *nelem, gfc_symbol *strides, gfc_symbol *sizes, gfc_symbol *idx2, gfc_symbol *offset, gfc_symbol *is_contiguous, gfc_expr *rank, gfc_namespace *sub_ns) argument
[all...]
H A Dtrans-array.c825 gfc_array_info * info, tree size, tree nelem,
850 tmp = fold_build2_loc (input_location, MINUS_EXPR, TREE_TYPE (nelem),
851 nelem, gfc_index_one_node);
1027 tree nelem; local
1194 nelem = size;
1206 nelem = size;
1210 gfc_trans_allocate_array_storage (pre, post, info, size, nelem, initial,
1973 unsigned HOST_WIDE_INT nelem = 0; local
1983 nelem++;
1985 return nelem;
824 gfc_trans_allocate_array_storage(stmtblock_t * pre, stmtblock_t * post, gfc_array_info * info, tree size, tree nelem, tree initial, bool dynamic, bool dealloc) argument
1997 HOST_WIDE_INT nelem; local
2318 unsigned HOST_WIDE_INT nelem = gfc_constant_array_constructor_p (c); local
[all...]
H A Dsimplify.c401 int i, nelem; local
412 nelem = 1;
414 nelem *= mpz_get_ui (result->shape[i]);
416 for (i = 0; i < nelem; ++i)
H A Dtrans-expr.c8626 unsigned HOST_WIDE_INT nelem; local
8632 nelem = gfc_constant_array_constructor_p (expr2->value.constructor);
8633 if (nelem == 0)
8649 if (compare_tree_int (len, nelem) != 0)
/haiku-buildtools/legacy/gcc/libobjc/objc/
H A Dobjc-api.h395 objc_calloc(size_t nelem, size_t size);
/haiku-buildtools/gcc/gcc/
H A Dvec.h309 unsigned nelem = v ? v->length () : 0; local
311 v->embedded_init (alloc, nelem);
399 unsigned nelem = v ? v->length () : 0; local
402 v->embedded_init (alloc, nelem);
H A Dgcse.c632 gcalloc (size_t nelem, size_t elsize)
634 bytes_used += nelem * elsize;
635 return xcalloc (nelem, elsize);
625 gcalloc(size_t nelem, size_t elsize) argument
/haiku-buildtools/legacy/binutils/bfd/
H A Dxsym.c1667 long lower, upper, nelem; local
1674 bfd_sym_fetch_long (buf, len, offset, &offset, &nelem);
1677 (unsigned long) nelem);
1679 for (i = 0; i < nelem; i++)
/haiku-buildtools/binutils/bfd/
H A Dxsym.c1671 long lower, upper, nelem; local
1678 bfd_sym_fetch_long (buf, len, offset, &offset, &nelem);
1681 (unsigned long) nelem);
1683 for (i = 0; i < nelem; i++)
/haiku-buildtools/legacy/gcc/gcc/
H A Dtree.c718 perm_calloc (nelem, size)
719 int nelem;
722 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
723 bzero (rval, nelem * size);

Completed in 290 milliseconds

12