| /src/distrib/sets/ |
| getdirs.awk | 76 items[file]++
86 if (! (file in items))
|
| /src/sys/arch/hpc/stand/libz/ |
| zalloc.c | 35 zcalloc(voidpf opaque, unsigned items, unsigned size)
37 size_t total = items * size;
|
| /src/sys/lib/libz/ |
| zalloc.c | 42 zcalloc(voidpf opaque, unsigned int items, unsigned int size)
46 totalsize = items * size;
|
| /src/usr.bin/make/ |
| lst.h | 161 * A vector is an ordered collection of items, allowing for fast indexed
165 void *items; /* memory holding the items */ member in struct:Vector
180 unsigned char *items = v->items; local in function:Vector_Get
181 return items + i * v->itemSize;
190 free(v->items);
|
| for.c | 66 SubstringWords items; /* Substitution items */ member in struct:ForLoop
97 SubstringWords_Init(&f->items);
111 SubstringWords_Free(f->items);
122 const Substring *items; local in function:ForLoop_Details
126 vars = f->vars.items;
128 items = f->items.words + f->nextItem - n;
136 Buf_AddRange(&buf, items[i].start, items[i].end)
191 char *items; local in function:ForLoop_ParseItems
[all...] |
| lst.c | 248 v->items = bmake_malloc(v->cap * v->itemSize);
260 v->items = bmake_realloc(v->items, v->cap * v->itemSize);
|
| /src/lib/libmenu/ |
| internals.c | 44 * Link all the menu items together to speed up navigation. We need
46 * of items the window will accommodate and then how many rows there will
59 if (menu->items == NULL)
72 menu->items[i]->row = i / menu->item_cols;
73 menu->items[i]->col = i % menu->item_cols;
75 menu->items[i]->row = i % menu->item_rows;
76 menu->items[i]->col = i / menu->item_rows;
96 item = menu->items[item_no];
113 menu->items[menu->item_count - 1];
117 item->up = menu->items[item_no - 1]
[all...] |
| driver.c | 41 * against the items. If the character is a recognised request then the
57 if (menu->items == NULL)
59 if (*menu->items == NULL)
65 if (menu->items[menu->cur_item] == NULL)
68 drv_new_item = menu->items[menu->cur_item];
142 drv_new_item = menu->items[0];
145 drv_new_item = menu->items[menu->item_count - 1];
153 drv_new_item = menu->items[0];
157 menu->items[menu->cur_item + 1];
166 drv_new_item = menu->items[
[all...] |
| menu.c | 40 1, /* number of columns of items that will fit in window */
41 0, /* number of rows of items we have */
42 0, /* number of columns of items we have */
60 0, /* number of items attached to the menu */
61 NULL, /* items in the menu */
212 * Set the maximum number of rows and columns of items that may be displayed.
222 if (menu->items != NULL)
317 * item is actually selected in the items.
319 if (((opts & O_RADIO) == O_RADIO) && (menu->items != NULL) &&
320 (menu->items[0] != NULL))
[all...] |
| post.c | 51 if (menu->items == NULL)
53 if (*menu->items == NULL)
73 menu->items[i]->selected = 0;
|
| item.c | 150 * Returns the number of items that are selected.
151 * The index numbers of the items are placed in the dynamically allocated
164 if (menu->items[i]->selected)
176 if (menu->items[i]->selected)
367 /* check we have items in the menu */
368 if (menu->items == NULL)
388 if (menu->items == NULL)
391 return menu->items[menu->cur_item];
|
| /src/sys/external/bsd/drm2/dist/drm/vmwgfx/ |
| vmwgfx_overlay.c | 122 } *items; local in function:vmw_overlay_send_put
130 fifo_size = sizeof(*cmds) + sizeof(*flush) + sizeof(*items) * num_items;
137 items = (typeof(items))&cmds[1];
138 flush = (struct vmw_escape_video_flush *)&items[num_items];
140 /* the size is header + number of items */
141 fill_escape(&cmds->escape, sizeof(*items) * (num_items + 1));
148 items[i].registerId = i;
153 items[SVGA_VIDEO_ENABLED].value = true;
154 items[SVGA_VIDEO_FLAGS].value = arg->flags
[all...] |
| /src/usr.bin/xlint/lint2/ |
| hash.c | 116 hte_t **items; member in struct:hte_list
126 list->items = xrealloc(list->items,
127 sizeof(list->items[0]) * list->cap);
129 list->items[list->len++] = item;
176 qsort(sorted.items, sorted.len, sizeof(sorted.items[0]), hte_by_name);
179 action(sorted.items[i]);
181 free(sorted.items);
|
| /src/common/dist/zlib/ |
| zutil.c | 204 voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items, unsigned size) {
206 ulg bsize = (ulg)items*size;
265 voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, uInt items, uInt size) {
267 return _halloc((long)items, size);
284 extern voidp calloc(uInt items, uInt size);
288 voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items, unsigned size) {
290 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
291 (voidpf)calloc(items, size);
|
| zutil.h | 254 voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items,
259 #define ZALLOC(strm, items, size) \
260 (*((strm)->zalloc))((strm)->opaque, (items), (size))
|
| /src/sys/external/bsd/drm2/dist/drm/vmwgfx/device_include/ |
| svga_overlay.h | 74 /* May include zero or more items. */
78 } items[1]; member in struct:SVGAEscapeVideoSetRegs
109 } items[1]; member in struct:__anon86a9d9660608
118 } items[SVGA_VIDEO_NUM_REGS]; member in struct:__anon86a9d9660808
|
| /src/usr.bin/xlint/lint1/ |
| mem1.c | 177 pool->items = xrealloc(pool->items,
178 sizeof(*pool->items) * pool->cap);
180 pool->items[pool->len++] = item;
216 debug_memory_pool_item(pool->items + i);
222 set(pool->items[i].p, 'Z', pool->items[i].size);
224 free(pool->items[i].p);
390 free(expr_pool.items);
|
| /src/usr.bin/indent/ |
| lexi.c | 97 const char **items; member in struct:__anon6178c7710108
279 const char **arr = typenames.items;
313 typenames.items = nonnull(realloc(typenames.items,
314 sizeof(typenames.items[0]) * typenames.cap));
322 memmove(typenames.items + pos + 1, typenames.items + pos,
323 sizeof(typenames.items[0]) * (typenames.len++ - (unsigned)pos));
324 typenames.items[pos] = nonnull(strdup(name));
|
| /src/bin/csh/ |
| file.c | 305 print_by_column(Char *dir, Char *items[], size_t count)
314 maxwidth = maxwidth > (r = Strlen(items[i])) ? maxwidth : r;
326 (void)fprintf(cshout, "%s", vis_str(items[i]));
327 (void)fputc(dir ? filetype(dir, items[i]) : ' ', cshout);
329 w = Strlen(items[i]) + 1;
457 free_items(Char **items, size_t numitems)
462 free(items[i]);
463 free(items);
466 #define FREE_ITEMS(items, numitems) { \
472 free_items(items, numitems);
488 Char **items = NULL; local in function:tsearch
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_list_test.cc | 64 ListItem items[6]; local in function:__sanitizer::TEST
70 ListItem *x = &items[0];
71 ListItem *y = &items[1];
72 ListItem *z = &items[2];
73 ListItem *a = &items[3];
74 ListItem *b = &items[4];
75 ListItem *c = &items[5];
|
| /src/usr.bin/xlint/xlint/ |
| xlint.c | 64 char **items; member in struct:__anon941f5c590108
118 l->items = xrealloc(l->items, sizeof(*l->items) * l->cap);
120 l->items[l->len++] = s;
142 if (strcmp(l->items[i], s) == 0)
152 list_add(dst, src->items[i]);
160 free(l->items[--l->len]);
205 (void)remove(lint1.outfiles.items[i]);
294 print_sh_quoted(args->items[0])
[all...] |
| /src/common/dist/zlib/contrib/iostream2/ |
| zstream.h | 114 template <class T, class Items>
115 inline int read(izstream& zs, T* x, Items items) {
116 return ::gzread(zs.fp(), x, items*sizeof(T));
263 template <class T, class Items>
264 inline int write(ozstream& zs, const T* x, Items items) {
265 return ::gzwrite(zs.fp(), (voidp) x, items*sizeof(T));
|
| /src/sys/kern/ |
| kern_ctf.c | 58 z_alloc(void *nil, u_int items, u_int size)
62 ptr = malloc(items * size, M_TEMP, M_NOWAIT);
|
| /src/bin/ps/ |
| ps.c | 842 descendant_sort(struct pinfo *ki, int items)
854 while (src < items) {
859 for (nsrc = 1; src + nsrc < items; nsrc++)
863 for (dst = 0; dst < items; dst++) {
870 if (dst == items) {
875 for (ndst = 1; dst + ndst < items; ndst++)
915 for (src = 0; src < items; src++) {
929 for (siblings = 0, dst = src + 1; dst < items; dst++) {
|
| /src/tests/usr.bin/xlint/lint1/ |
| check-expect.lua | 197 for fname, items in pairs(missing) do
198 for i, item in ipairs(items) do
207 table.sort(items, less)
210 for _, item in ipairs(items) do
|
