| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| p11667.cpp | 11 LIST() { nitems = 16; items = new T[nitems]; };
13 LIST(int u) { nitems = u; items = new T[nitems]; };
23 int i = nitems;
33 nitems = n;
38 int nitems; member in class:LIST
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| p11667.cpp | 11 LIST() { nitems = 16; items = new T[nitems]; };
13 LIST(int u) { nitems = u; items = new T[nitems]; };
23 int i = nitems;
33 nitems = n;
38 int nitems; member in class:LIST
|
| /external/jemalloc/test/unit/ |
| ckh.c | 104 #define NITEMS ZU(1000)
106 void **p[NITEMS];
113 for (i = 0; i < NITEMS; i++) {
118 for (i = 0; i < NITEMS; i++) {
121 for (j = i; j < NITEMS; j++) {
130 assert_zu_eq(ckh_count(&ckh), NITEMS,
132 NITEMS, ckh_count(&ckh));
134 for (j = i + 1; j < NITEMS; j++) {
148 bool seen[NITEMS];
159 for (k = 0; k < NITEMS; k++)
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/ |
| cmalloc.i | 61 TYPE *realloc_##NAME(TYPE *ptr, int nitems)
63 TYPE *realloc_##TYPE(TYPE *ptr, int nitems)
67 return (TYPE *) realloc(ptr, nitems*sizeof(TYPE));
69 return (TYPE *) realloc(ptr, nitems);
74 TYPE *realloc_##NAME(TYPE *ptr, int nitems);
76 TYPE *realloc_##TYPE(TYPE *ptr, int nitems);
|
| /prebuilts/misc/common/swig/include/2.0.11/tcl/ |
| std_vector.i | 87 int nitems;
97 &nitems, &listobjv) == TCL_ERROR)
100 for (i = 0; i < nitems; i++) {
116 int nitems;
126 &nitems, &listobjv) == TCL_ERROR)
129 for (i = 0; i < nitems; i++) {
155 int nitems;
166 &nitems, &listobjv) == TCL_ERROR)
169 if (nitems == 0)
184 int nitems;
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/typemaps/ |
| cmalloc.swg | 61 TYPE *realloc_##NAME(TYPE *ptr, size_t nitems)
63 TYPE *realloc_##TYPE(TYPE *ptr, size_t nitems)
67 return (TYPE *) realloc(ptr, nitems*sizeof(TYPE));
69 return (TYPE *) realloc(ptr, nitems);
74 TYPE *realloc_##NAME(TYPE *ptr, size_t nitems);
76 TYPE *realloc_##TYPE(TYPE *ptr, size_t nitems);
|
| /external/chromium_org/ui/app_list/ |
| app_list_item_list.cc | 133 size_t nitems = app_list_items_.size();
136 index = nitems;
138 for (index = 0; index < nitems; ++index) {
145 if (index == nitems)
146 return app_list_items_[nitems - 1]->position().CreateAfter();
197 size_t nitems = app_list_items_.size();
198 if (nitems == 0) {
201 position = app_list_items_[nitems - 1]->position().CreateAfter();
222 size_t nitems = item_count(); local
223 DCHECK_LT(index, nitems);
[all...] |
| /external/elfutils/0.153/backends/ |
| x86_corenote.c | 29 regs_offset, nregloc, reglocs, nitems, items);
34 size_t *nitems, const Ebl_Core_Item **items)
45 *nitems = 1;
|
| linux-core-note.c | 178 EBLHOOK(core_note) (nhdr, name, regs_offset, nregloc, reglocs, nitems, items)
184 size_t *nitems;
211 *nitems = 1;
227 *nitems = sizeof prstatus_items / sizeof prstatus_items[0];
237 *nitems = sizeof prpsinfo_items / sizeof prpsinfo_items[0];
248 *nitems = 0; \
|
| i386_corenote.c | 107 nitems, items); \
121 size_t *nitems, const Ebl_Core_Item **items)
129 *nitems = sizeof tls_items / sizeof tls_items[0];
|
| /external/bison/src/ |
| AnnotationList.c | 72 * that state has \c nitems kernel items.
99 size_t nitems)
125 for (item = 0; cmp == 0 && item < nitems; ++item)
205 *items = Sbitset__new_on_obstack (s->nitems, annotations_obstackp);
252 Sbitset__new_on_obstack ((*predecessor)->nitems,
258 SBITSET__FOR_EACH (self->contributions[ci], s->nitems,
299 items, (*predecessor)->nitems);
311 predecessor_item < (*predecessor)->nitems;
316 aver (predecessor_item != (*predecessor)->nitems);
332 (*predecessor)->nitems, biter, i
[all...] |
| AnnotationList.h | 121 * - \c nitems is the number of kernel items in the LR(0) state that every
127 void AnnotationList__debug (AnnotationList const *self, size_t nitems,
133 * - \c nitems is the number of kernel items in the LR(0) state that \c self
135 * - The number of rows in \c lookahead_filter is at least \c nitems, and the
142 size_t nitems,
148 * - \c nitems is the number of kernel items in the LR(0) state that \c self
154 * - For any <tt>0 <= i < nitems</tt>, <tt>lookaheads[i]</tt> is either:
179 size_t nitems, bitset *lookaheads,
|
| ielr.c | 203 if (states[i]->nitems > max_nitems)
204 max_nitems = states[i]->nitems;
211 size_t nitems = states[from_state[i]]->nitems; local
214 for (j = 0; j < nitems; ++j)
386 xnmalloc (s->nitems, sizeof item_lookahead_sets[s->number][0]);
387 for (i = 0; i < s->nitems; ++i)
447 predecessor_item < (*predecessor)->nitems;
452 aver (predecessor_item != (*predecessor)->nitems);
529 states[i]->nitems, 2)
[all...] |
| state.c | 131 size_t nitems, item_number *core)
134 size_t items_size = nitems * sizeof *core;
149 res->nitems = nitems;
161 size_t items_size = s->nitems * sizeof *s->items;
177 res->nitems = s->nitems;
314 if (s1->nitems != s2->nitems)
317 for (i = 0; i < s1->nitems; ++i
[all...] |
| /external/tcpdump/ |
| print-vqp.c | 48 * | Constant | Packet type | Error Code | nitems |
58 u_int8_t nitems; member in struct:vqp_common_header_t
118 u_int8_t nitems; local
146 nitems = vqp_common_header->nitems;
153 nitems,
160 while (nitems > 0 && tlen > 0) {
204 nitems--;
|
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| cmstypes.c | 288 void *Type_XYZ_Read(struct _cms_typehandler_struct* self, cmsIOHANDLER* io, cmsUInt32Number* nItems, cmsUInt32Number SizeOfTag)
292 *nItems = 0;
301 *nItems = 1;
308 cmsBool Type_XYZ_Write(struct _cms_typehandler_struct* self, cmsIOHANDLER* io, void* Ptr, cmsUInt32Number nItems)
312 cmsUNUSED_PARAMETER(nItems);
348 void *Type_Chromaticity_Read(struct _cms_typehandler_struct* self, cmsIOHANDLER* io, cmsUInt32Number* nItems, cmsUInt32Number SizeOfTag)
353 *nItems = 0;
385 *nItems = 1;
405 cmsBool Type_Chromaticity_Write(struct _cms_typehandler_struct* self, cmsIOHANDLER* io, void* Ptr, cmsUInt32Number nItems)
418 cmsUNUSED_PARAMETER(nItems);
[all...] |
| /external/icu/icu4c/source/common/ |
| listformatter.cpp | 297 int32_t nItems,
301 return format(items, nItems, appendTo, -1, offset, errorCode);
306 int32_t nItems,
320 if (nItems <= 0) {
323 if (nItems == 1) {
330 if (nItems == 2) {
359 for (i = 2; i < nItems - 1; ++i) {
376 items[nItems - 1],
378 index == nItems - 1,
|
| /external/chromium_org/ui/display/util/x11/ |
| edid_parser_x11.cc | 56 unsigned long nitems = 0; local
68 &nitems,
73 edid->assign(prop, prop + nitems);
|
| /bionic/libc/upstream-openbsd/lib/libc/stdio/ |
| mktemp.c | 38 #ifndef nitems
39 #define nitems(_a) (sizeof((_a)) / sizeof((_a)[0])) macro
78 for (i = 0; i < nitems(rbuf) && cp != ep; i++)
|
| /external/elfutils/0.153/libebl/ |
| eblcorenote.c | 65 regs_offset, nregloc, reglocs, nitems, items)
72 size_t *nitems;
76 regs_offset, nregloc, reglocs, nitems, items);
89 *nitems = sizeof table / sizeof table[0]; \
|
| /bionic/libc/bionic/ |
| fts.c | 77 int nitems; local
110 for (root = NULL, nitems = 0; *argv; ++argv, ++nitems) {
145 if (compar && nitems > 1)
146 root = fts_sort(sp, root, nitems);
168 if (nitems == 0)
553 int nitems, cderrno, descend, level, nlinks, nostat = 0, doadjust; local
650 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
741 ++nitems;
758 if (len == sp->fts_pathlen || nitems == 0
[all...] |
| /external/chromium_org/ui/app_list/test/ |
| app_list_test_model.cc | 136 size_t nitems = top_level_item_list()->item_count(); local
138 if (nitems == 0) {
142 top_level_item_list()->item_at(nitems - 1)->position().CreateAfter();
|
| /prebuilts/misc/common/swig/include/2.0.11/csharp/ |
| arrays_csharp.i | 20 * void myArrayCopy( int* sourceArray, int* targetArray, int nitems );
23 * void myArraySwap( int* array1, int* array2, int nitems );
50 * void myArrayCopy( int *sourceArray, int* targetArray, int nitems );
|
| /external/pdfium/core/src/fpdftext/ |
| fpdf_text_search.cpp | 190 int nItems = pObj->CountItems();
192 for(int i = 1; i < nItems - 1; i += 2) {
207 for (; item_index < nItems; item_index ++) {
220 if(nItems > 3 && !spacing) {
|
| /external/chromium_org/ui/display/chromeos/x11/ |
| touchscreen_device_manager_x11.cc | 44 unsigned long nitems, bytes_after; local
52 &nitems, &bytes_after, &data) != Success) {
|
