| /src/external/gpl2/gettext/dist/gettext-runtime/intl/ |
| loadinfo.h | 73 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
96 furthermore its ->successor[] field contains a list of other lookup
|
| /src/external/gpl2/texinfo/dist/intl/ |
| loadinfo.h | 78 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
101 furthermore its ->successor[] field contains a list of other lookup
|
| /src/external/gpl2/grep/dist/intl/ |
| loadinfo.h | 86 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
|
| /src/external/gpl3/gcc.old/dist/intl/ |
| loadinfo.h | 84 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
107 furthermore its ->successor[] field contains a list of other lookup
|
| /src/external/bsd/flex/dist/src/ |
| sym.c | 81 struct hash_entry *successor; local
97 if ((successor = table[hash_val]) != 0) {
98 new_entry->next = successor;
99 successor->prev = new_entry;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hw-doloop.h | 67 /* The successor block of the loop. This is the one the loop_end insn
69 basic_block successor; variable
|
| typed-splay-tree.h | 43 value_type successor (key_type k);
152 /* Return the immediate successor of KEY, or NULL if there is no
153 successor. KEY need not be present in the tree. */
157 typed_splay_tree<KEY_TYPE, VALUE_TYPE>::successor (key_type key) function in class:typed_splay_tree
602 itself, its predecessor, or its successor at the root. */
619 /* Return the immediate successor KEY, or NULL if there is no
620 successor. KEY need not be present in the tree. */
630 /* If the tree is empty, there is certainly no successor. */
635 itself, its predecessor, or its successor at the root. */
639 /* If the successor is at the root, just return it. *
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hw-doloop.h | 67 /* The successor block of the loop. This is the one the loop_end insn
69 basic_block successor; variable
|
| typed-splay-tree.h | 43 value_type successor (key_type k);
152 /* Return the immediate successor of KEY, or NULL if there is no
153 successor. KEY need not be present in the tree. */
157 typed_splay_tree<KEY_TYPE, VALUE_TYPE>::successor (key_type key) function in class:typed_splay_tree
602 itself, its predecessor, or its successor at the root. */
619 /* Return the immediate successor KEY, or NULL if there is no
620 successor. KEY need not be present in the tree. */
630 /* If the tree is empty, there is certainly no successor. */
635 itself, its predecessor, or its successor at the root. */
639 /* If the successor is at the root, just return it. *
[all...] |
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_ppmd7.c | 316 #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
384 CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
393 CPpmd_Void_Ref successor; local
402 successor = SUCCESSOR(s);
403 if (successor != upBranch)
405 c = CTX(successor);
461 CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState); local
508 successor = REF(p->Text)
[all...] |
| archive_ppmd8.c | 341 #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
459 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart)
462 SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
465 if (SUCCESSOR(s) || order <= 9) /* O_BOUND */
475 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) < p->UnitsStart)
482 SetSuccessor(s, CutOff(p, CTX(SUCCESSOR(s)), order + 1));
517 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder)
518 SetSuccessor(s, RemoveBinContexts(p, CTX(SUCCESSOR(s)), order + 1));
523 if (!SUCCESSOR(s) && (!SUFFIX(ctx)->NumStats || SUFFIX(ctx)->Flags == 0xFF))
533 if ((Byte *)Ppmd8_GetPtr(p, SUCCESSOR(s)) >= p->UnitsStart && order < p->MaxOrder
632 CPpmd_Void_Ref successor; local
783 CTX_PTR successor; local
807 CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState); local
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| rbt.c | 1166 * the successor. All the logic for finding
1816 dns_rbtnode_t *successor; local
1855 * deleted. Find its immediate in-order successor and
1857 * old site of the successor.
1859 successor = item->right;
1860 while (successor->left != NULL) {
1861 successor = successor->left;
1865 * The successor cannot possibly have a left child;
1868 if (successor->right != NULL)
2608 dns_rbtnode_t *current, *successor; local
2674 dns_rbtnode_t *current, *previous, *successor; local
2721 dns_rbtnode_t *current, *previous, *successor; local
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| rbt.c | 1997 * the successor. All the logic for finding
2659 dns_rbtnode_t *successor; local
2698 * deleted. Find its immediate in-order successor and
2700 * old site of the successor.
2702 successor = RIGHT(item);
2703 while (LEFT(successor) != NULL) {
2704 successor = LEFT(successor);
2708 * The successor cannot possibly have a left child;
2711 if (RIGHT(successor) != NULL)
3481 dns_rbtnode_t *current, *successor; local
3547 dns_rbtnode_t *current, *previous, *successor; local
3594 dns_rbtnode_t *current, *previous, *successor; local
[all...] |
| /src/external/apache2/llvm/dist/llvm/bindings/ocaml/llvm/ |
| llvm.mli | 1948 (** [successor v i] returns the successor at index [i] for the value [v].
1950 val successor : llvalue -> int -> llbasicblock var
1952 (** [set_successor v i o] sets the successor of the value [v] at the index [i] to
1964 (** [iter_successors f v] applies function f to each successor [v] in order. Tail recursive. *)
|
