| /external/bison/src/ |
| gram.h | 90 NRITEMS is the total length of RITEM. Each element of RITEM is
118 extern unsigned int nritems;
|
| gram.c | 35 unsigned int nritems = 0; variable
148 for (i = 0; i < nritems; ++i)
246 "ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nritems = %d\n\n",
247 ntokens, nvars, nsyms, nrules, nritems);
|
| output.c | 222 item_number *rhs = xnmalloc (nritems, sizeof *rhs);
251 aver (i == nritems);
253 muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems);
|
| nullable.c | 69 Supposedly NRITEMS - NRULES is enough. But why take the risk? */
70 rule_list *relts = xnmalloc (nritems + nvars + 1, sizeof *relts);
|
| print_graph.c | 203 new_closure (nritems);
|
| LR0.c | 343 new_closure (nritems);
|
| reader.c | 195 ++nritems;
388 ++nritems;
509 ritem = xnmalloc (nritems + 1, sizeof *ritem);
587 aver (itemno == nritems);
722 nritems += 3;
|
| reduce.c | 269 /* Adjust NRITEMS. */
276 nritems -= length + 1;
|
| print-xml.c | 519 new_closure (nritems);
|
| print.c | 522 new_closure (nritems);
|
| ielr.c | 43 * - \c result = a new \c bitset of size \c ::nritems such that any bit \c i
51 bitset result = bitset_create (nritems, BITSET_FIXED);
52 unsigned int i = nritems-1;
[all...] |
| /external/syslinux/core/fs/btrfs/ |
| btrfs.c | 251 path->itemsnr[tree_buf->header.level] = tree_buf->header.nritems;
257 tree_buf->header.nritems, &slot);
268 path->itemsnr[tree_buf->header.level] = tree_buf->header.nritems;
274 tree_buf->header.nritems, &slot);
|
| btrfs.h | 160 __le32 nritems; member in struct:btrfs_header
|
