/external/bison/doc/ |
H A D | refcard.tex | 348 {\%union\{{\it field list}\} }
|
/external/bison/lib/ |
H A D | abitset.c | 45 /* Find list of up to NUM bits set in BSET starting from and including 49 abitset_small_list (bitset src, bitset_bindex *list, argument 78 list[count++] = bitno; 88 list[count++] = bitno; 137 /* Find list of up to NUM bits set in BSET in reverse order, starting 142 abitset_list_reverse (bitset src, bitset_bindex *list, argument 179 list[count++] = bitoff + bitcnt; 198 /* Find list of up to NUM bits set in BSET starting from and including 202 abitset_list (bitset src, bitset_bindex *list, argument 250 list[coun [all...] |
H A D | bbitset.h | 34 BITSET_LIST: Linked list of arrays of bits (variable size, least storage 150 bitset_bindex (*list) (bitset, bitset_bindex *, bitset_bindex, member in struct:bitset_vtable 269 /* Find list of up to NUM bits set in BSET starting from and including 273 (BSET)->b.vtable->list (BSET, LIST, NUM, NEXT) 275 /* Find reverse list of up to NUM bits set in BSET starting from and
|
H A D | bitset.c | 367 bitset_bindex list[BITSET_LIST_SIZE]; local 377 for (count = 0; (num = bitset_list (src, list, BITSET_LIST_SIZE, &next));
|
H A D | bitset.h | 70 struct lbitset_elt_struct *head; /* First element in linked list. */ 71 struct lbitset_elt_struct *tail; /* Last element in linked list. */ 93 bitset_bindex list[BITSET_LIST_SIZE]; member in struct:__anon315 270 /* Find list of up to NUM bits set in BSET starting from and including 276 /* Find reverse list of up to NUM bits set in BSET starting from and 318 && (ITER.num = bitset_list (BSET, ITER.list, \ 321 ITER.i < ITER.num && ((INDEX) = ITER.list[ITER.i], 1); \ 340 && (ITER.num = bitset_list_reverse (BSET, ITER.list, \ 343 ITER.i < ITER.num && ((INDEX) = ITER.list[ITER.i], 1); \
|
H A D | bitset_stats.c | 572 bitset_stats_list (bitset bset, bitset_bindex *list, argument 580 count = BITSET_LIST_ (bset->s.bset, list, num, next); 609 bitset_stats_list_reverse (bitset bset, bitset_bindex *list, argument 612 return BITSET_LIST_REVERSE_ (bset->s.bset, list, num, next);
|
H A D | ebitset.c | 87 static ebitset_elt *ebitset_free_list; /* Free list of bitset elements. */ 223 list. */ 562 /* Find list of up to NUM bits set in BSET starting from and including 566 ebitset_list_reverse (bitset bset, bitset_bindex *list, argument 626 list[count++] = boffset + bcount; 651 /* Find list of up to NUM bits set in BSET starting from and including 655 ebitset_list (bitset bset, bitset_bindex *list, argument 698 list[count++] = bitno; 751 list[count++] = bitno; 769 list[coun [all...] |
H A D | gnulib.mk | 734 # which is shared with other installed packages. We use a list of referencing 2646 ## begin gnulib module vc-list-files 2649 EXTRA_DIST += $(top_srcdir)/build-aux/vc-list-files 2651 ## end gnulib module vc-list-files
|
H A D | lbitset.c | 1 /* Functions to support link list bitsets. 31 /* This file implements linked-list bitsets. These bitsets can be of 36 from the list. However, a side effect of the bit caching is that we 60 These are linked together in a doubly-linked list. */ 79 static lbitset_elt *lbitset_free_list; /* Free list of bitset elements. */ 135 list. */ 255 /* Link the bitset element into the current bitset linked list. */ 386 /* Weed out the zero elements from the list. */ 412 /* Clear a bitset by freeing the linked list at the head element. */ 565 /* Find list o 569 lbitset_list_reverse(bitset bset, bitset_bindex *list, bitset_bindex num, bitset_bindex *next) argument 664 lbitset_list(bitset bset, bitset_bindex *list, bitset_bindex num, bitset_bindex *next) argument [all...] |
H A D | vbitset.c | 157 /* Find list of up to NUM bits set in BSET in reverse order, starting 162 vbitset_list_reverse (src, list, num, next) 164 bitset_bindex *list; 202 list[count++] = bitoff + bitcnt; 221 /* Find list of up to NUM bits set in BSET starting from and including 225 vbitset_list (src, list, num, next) 227 bitset_bindex *list; 276 list[count++] = bitno; 300 list[count++] = bitno; 310 list[coun [all...] |
/external/bison/ |
H A D | maint.mk | 42 # Check that $(VARIABLE) is in the space-separated list of VALID-VALUES, and 63 VC_LIST = $(srcdir)/$(_build-aux)/vc-list-files -C $(srcdir) 222 # the regexp is used to select matching files from the list of all 604 # The following list was generated by running: 656 # Get the list of symbol names with this: 794 # Convert the list of names to upper case, and replace each space with "|". 833 # Create a list of regular expressions matching the names
|
/external/bison/src/ |
H A D | AnnotationList.c | 1 /* IELR's inadequacy annotation list. 71 * - \c self annotates the same state as every other node in \c list, and 74 * - If the list \c list already contains an identical annotation to \c self, 77 * - Otherwise, \c list now contains the node \c self, \c result is true, and 78 * \c list assumes responsibility for the memory of \c self. 79 * - The sort in \c list is: 83 * annotation list is usually near the beginning with other 98 AnnotationList__insertInto (AnnotationList *self, AnnotationList **list, argument 102 for (node = list; *nod [all...] |
H A D | InadequacyList.c | 1 /* IELR's inadequacy list. 74 InadequacyList__prependTo (InadequacyList *self, InadequacyList **list) argument 76 InadequacyList *head_old = *list; 77 *list = self;
|
H A D | InadequacyList.h | 1 /* IELR's inadequacy list. 71 * A node in a list that describes all the inadequacies that manifest in a 119 * - All memory associated with all nodes in the list \c self was freed. 149 * - <tt>list != NULL</tt>. 151 * - \c list now contains \c self as its first node. 152 * - \c list assumes responsibility for the memory of \c self. 154 void InadequacyList__prependTo (InadequacyList *self, InadequacyList **list);
|
H A D | LR0.c | 341 state_list *list = NULL; 350 for (list = first_state; list; list = list->next) 352 state *s = list->state; 339 state_list *list = NULL; local
|
H A D | parse-gram.c | 341 symbol_list *list; member in union:GRAM_STYPE 663 /* YYRHS -- A `-1'-separated list of the rules' RHS. */ 2443 symbol_list *list; local 2444 for (list = (yyvsp[(3) - (3)].list); list; list = list->next) 2445 symbol_list_destructor_set (list, &code); 2446 symbol_list_free ((yyvsp[(3) - (3)].list)); 2459 symbol_list *list; local 2559 symbol_list *list; local 2571 symbol_list *list; local [all...] |
H A D | parse-gram.h | 182 symbol_list *list; member in union:GRAM_STYPE
|
H A D | parse-gram.y | 117 symbol_list *list; 224 %type <list> symbols.1 symbols.prec generic_symlist generic_symlist_item 355 symbol_list *list; 356 for (list = $3; list; list = list->next) 357 symbol_list_destructor_set (list, &code); 367 symbol_list *list; 368 for (list [all...] |
H A D | symlist.c | 29 | Create a list containing SYM at LOC. | 60 | Create a list containing TYPE_NAME at LOC. | 79 | Create a list containing a <*> at LOC. | 97 | Create a list containing a <> at LOC. | 115 | Print this list, for which every content_type must be SYMLIST_SYMBOL. | 136 symbol_list_prepend (symbol_list *list, symbol_list *node) argument 138 node->next = list; 148 symbol_list_free (symbol_list *list) argument 151 for (node = list; node; node = next) 177 | Get item N in symbol list [all...] |
H A D | symlist.h | 29 /* A list of symbols, used during the parsing to store the rules. */ 80 /* The list. */ 85 /** Create a list containing \c sym at \c loc. */ 88 /** Create a list containing \c type_name at \c loc. */ 91 /** Create a list containing a \c <*> at \c loc. */ 93 /** Create a list containing a \c <> at \c loc. */ 96 /** Print this list. 98 \pre For every node \c n in the list, <tt>n->content_type = 102 /** Prepend \c node to \c list. */ 103 symbol_list *symbol_list_prepend (symbol_list *list, symbol_lis [all...] |
/external/bison/tests/ |
H A D | testsuite | 1002 --list | -l ) 1243 -l, --list describes all the tests, or the selected TESTS 1583 # If ChangeLog exists, list a few lines in case it might help determining 1732 # Copy the files in the list on stdout with a "> " prefix, and exit the shell 2171 # Turn jobs into a list of numbers, starting from 1. 2248 # Use ?..???? when the list must remain sorted, the faster * otherwise. 2382 $SHELL "$at_myself" $at_fail_list --list 2387 $SHELL "$at_myself" $at_skip_list --list 2392 $SHELL "$at_myself" $at_xpass_list --list 11309 if_stmt1: IF expr[cond] THEN stmt[then] ELSE stmt.list[els [all...] |
/external/blktrace/ |
H A D | blktrace.c | 53 #include "btt/list.h" 103 * data onto. It's list is protected above (tracer_devpath_head.mutex) 120 * tack buffers read from the relay queues on a per-device list. 124 * We will use a mutex to guard each of the trace_buf list. The tracers 198 * are connected on the devpaths list. 213 * list, and the network server conn_list) are also included. 1269 struct list_head *list) 1275 list_for_each_safe(p, q, list) { 1306 * so it had been taken off of the list 1323 struct list_head *list) 1268 handle_list_net(__attribute__((__unused__))struct tracer_devpath_head *hd, struct list_head *list) argument 1322 handle_list_file(struct tracer_devpath_head *hd, struct list_head *list) argument 1391 struct list_head list; local [all...] |
/external/blktrace/btreplay/ |
H A D | btreplay.c | 47 #include "list.h" 88 * @naios_free: Number of AIOs on the free list (short cut for list_len) 560 * add_input_dev - Add a device ('sd*') to the list of devices to handle 1207 * @list: List of AIOs created 1211 static void iocbs_map(struct thr_info *tip, struct iocb **list, argument 1239 list[i] = &iocbp->iocb; 1255 struct iocb *list[bunch->hdr.npkts]; local 1263 iocbs_map(tip, list, &bunch->pkts[i], ntodo); 1270 ndone = io_submit(tip->ctx, ntodo, list); 1456 * handle_args: Parse passed in argument list [all...] |
/external/blktrace/btt/doc/ |
H A D | btt.tex | 890 a list of executable \emph{names} separated by commas (,). An example 950 The \texttt{-P} option will generate a file that contains a list of all IO
|
/external/blktrace/btt/ |
H A D | list.h | 29 * non-initialized list entries. 43 static inline void INIT_LIST_HEAD(struct list_head *list) argument 45 list->next = list; 46 list->prev = list; 52 * This is only for internal list manipulation where we know 68 * @head: list head to add it after 81 * @head: list head to add it before 92 * Delete a list entr 184 list_move_tail(struct list_head *list, struct list_head *head) argument 191 __list_splice(struct list_head *list, struct list_head *head) argument 210 list_splice(struct list_head *list, struct list_head *head) argument [all...] |