| /src/external/gpl2/xcvs/dist/src/ |
| stack.h | 9 void push (List *_stack, void *_elem);
10 void *pop (List *_stack);
11 void unshift (List *_stack, void *_elem);
12 void *shift (List *_stack);
13 void push_string (List *_stack, char *_elem);
14 char *pop_string (List *_stack);
15 void unshift_string (List *_stack, char *_elem);
16 char *shift_string (List *_stack);
17 int isempty (List *_stack);
|
| hardlink.h | 27 extern List *hardlist;
32 List *list_linked_files_on_disk (char *);
33 int compare_linkage_lists (List *, List *);
|
| hash.h | 14 * The number of buckets for the hash table contained in each list. This
24 NT_UNKNOWN, HEADER, ENTRIES, FILES, LIST, RCSNODE,
43 struct list struct
45 Node *list; member in struct:list
47 struct list *next;
49 typedef struct list List;
51 List *getlist (void);
52 Node *findnode (List *list, const char *key)
[all...] |
| stack.c | 21 do_push (List *stack, void *elem, int isstring)
36 push (List *stack, void *elem)
44 push_string (List *stack, char *elem)
52 do_pop (List *stack, int isstring)
60 elem = stack->list->prev->key;
61 stack->list->prev->key = NULL;
65 elem = stack->list->prev->data;
66 stack->list->prev->data = NULL;
69 delnode (stack->list->prev);
76 pop (List *stack
[all...] |
| rcs.h | 87 /* List of nodes, the key of which is the symbolic name and the data
89 List *symbols;
91 /* List of nodes (type RCSVERS), the key of which the numeric revision
93 List *versions;
104 /* List of nodes, the key of which is the numeric revision and the
106 List *locks;
121 /* Newphrases from the RCS header. List of nodes, the key of which
124 List *other;
146 List *other;
162 List *branches
[all...] |
| find_names.c | 30 static int find_dirs (char *dir, List * list, int checkadm,
31 List *entries);
32 static int find_rcs (const char *dir, List * list);
37 * add the key from entry on entries list to the files list
44 List *filelist = closure;
61 list). */
63 List *
[all...] |
| edit.h | 44 void edit_file (void *data, List *ent_list, const char *short_pathname,
|
| hash.c | 12 * Polk's hash list manager. So cool.
19 /* Global caches. The idea is that we maintain a linked list of "free"d
23 static List *listcache = NULL;
52 * create a new list (or get an old one from the cache)
54 List *
58 List *list; local
63 /* get a list from the cache and clear it */
64 list = listcache;
66 list->next = NULL
[all...] |
| cvs.h | 330 * structure used for list-private storage by Entries_Open() and
400 extern List *root_directories;
424 extern List *dirs_sent_to_server; /* used to decide which "Argument
485 List *Find_Directories (char *repository, int which, List *entries);
486 void Entries_Close (List *entries);
487 List *Entries_Open (int aflag, char *update_dir);
488 void Subdirs_Known (List *entries);
489 void Subdir_Register (List *, const char *, const char *);
490 void Subdir_Deregister (List *, const char *, const char *)
[all...] |
| myndbm.h | 21 List *dbm_list; /* cached database */
|
| /src/usr.bin/make/ |
| lst.h | 14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
49 * notice, this list of conditions and the following disclaimer.
51 * notice, this list of conditions and the following disclaimer in the
85 /* A doubly-linked list of pointers. */
86 typedef struct List List;
87 /* A single node in the doubly-linked list. */
91 ListNode *prev; /* previous node in list, or NULL */
92 ListNode *next; /* next node in list, or NULL *
[all...] |
| lst.c | 14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
52 Lst_Done(List *list)
56 for (ln = list->first; ln != NULL; ln = next) {
63 Lst_DoneFree(List *list)
67 for (ln = list->first; ln != NULL; ln = next) {
76 Lst_InsertBefore(List *list, ListNode *ln, void *datum
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineModuleInfoImpls.cpp | 36 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end());
38 array_pod_sort(List.begin(), List.end(), SortSymbolPair);
41 return List;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| AllocatorList.h | 1 //===- llvm/ADT/AllocatorList.h - Custom allocator list ---------*- C++ -*-===//
25 /// A linked-list with a custom, local allocator.
27 /// Expose a std::list-like interface that owns and uses a custom LLVM-style
31 /// Because this list owns the allocator, calling \a splice() with a different
32 /// list isn't generally safe. As such, \a splice has been left out of the
49 list_type List;
134 : AllocatorT(std::move(X.getAlloc())), List(std::move(X.List)) {}
137 List.cloneFrom(X.List, Cloner(*this), Disposer(*this))
[all...] |
| /src/sys/external/bsd/acpica/dist/debugger/ |
| dbstats.c | 15 * notice, this list of conditions, and the following disclaimer,
74 ACPI_MEMORY_LIST *List);
107 * PARAMETERS: List - Memory list/cache to be displayed
111 * DESCRIPTION: Display information about the input memory list or cache.
117 ACPI_MEMORY_LIST *List)
123 AcpiOsPrintf ("\n%s\n", List->ListName);
127 if (List->MaxDepth > 0)
132 List->CurrentDepth,
133 List->MaxDepth
[all...] |
| /src/external/mpl/bind/dist/bin/tests/system/chain/ans4/ |
| ans.py | 16 from typing import AsyncGenerator, List, Optional, Tuple
126 def get_rrsets(self) -> Tuple[List[dns.rrset.RRset], List[dns.rrset.RRset]]:
158 def generate_rrsets(self) -> Tuple[List[dns.rrset.RRset], List[dns.rrset.RRset]]:
173 def generate_rrsets(self) -> Tuple[List[dns.rrset.RRset], List[dns.rrset.RRset]]:
185 def generate_rrsets(self) -> Tuple[List[dns.rrset.RRset], List[dns.rrset.RRset]]:
209 def generate_rrsets(self) -> Tuple[List[dns.rrset.RRset], List[dns.rrset.RRset]]
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| gdbarch_types.py | 20 from typing import List, Optional, Tuple, Union
31 def join_params(params: List[Tuple[str, str]]):
33 list of declarations."""
50 params: Optional[List[Tuple[str, str]]] = None,
51 param_checks: Optional[List[str]] = None,
52 result_checks: Optional[List[str]] = None,
123 params: List[Tuple[str, str]],
130 param_checks: Optional[List[str]] = None,
131 result_checks: Optional[List[str]] = None,
154 "Return the formal parameter list as a string.
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/ |
| gdbarch_types.py | 20 from typing import List, Optional, Tuple, Union
31 def join_params(params: List[Tuple[str, str]]):
33 list of declarations."""
50 params: Optional[List[Tuple[str, str]]] = None,
51 param_checks: Optional[List[str]] = None,
52 result_checks: Optional[List[str]] = None,
123 params: List[Tuple[str, str]],
130 param_checks: Optional[List[str]] = None,
131 result_checks: Optional[List[str]] = None,
154 "Return the formal parameter list as a string.
[all...] |
| /src/external/apache2/llvm/dist/clang/utils/analyzer/ |
| entrypoint.py | 7 from typing import List, Tuple
28 def parse_arguments() -> Tuple[argparse.Namespace, List[str]]:
66 def test(args: List[str]) -> int:
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| DeclContextInternals.h | 41 /// or a pointer to a list with a flag to indicate if there are further
47 Decls List = Data.getPointer();
48 if (!List)
55 if (!ShouldErase(*DeclListNode::iterator(List))) {
57 *NewTail = List;
58 if (auto *Node = List.dyn_cast<DeclListNode*>()) {
60 List = Node->Rest;
64 } else if (DeclListNode *N = List.dyn_cast<DeclListNode*>()) {
65 List = N->Rest;
68 // We're discarding the last declaration in the list. The last node w
[all...] |
| /src/sys/external/bsd/acpica/dist/compiler/ |
| dttable2.c | 15 * notice, this list of conditions, and the following disclaimer,
56 * PARAMETERS: List - Current field list pointer
66 void **List)
71 DT_FIELD **PFieldList = (DT_FIELD **) List;
132 * PARAMETERS: List - Current field list pointer
142 void **List)
147 DT_FIELD **PFieldList = (DT_FIELD **) List;
368 * PARAMETERS: List - Current field list pointe
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Use.h | 12 /// class keeps the "use list" of the referenced value up to date.
40 /// This is notionally a two-dimensional linked list. It supports traversing
99 void addToList(Use **List) {
100 Next = *List;
103 Prev = List;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DebugLocStream.h | 26 /// Stores a unified stream of .debug_loc entries. There's \a List for each
33 struct List {
37 List(DwarfCompileUnit *CU, size_t EntryOffset)
48 SmallVector<List, 4> Lists;
61 const List &getList(size_t LI) const { return Lists[LI]; }
62 ArrayRef<List> getLists() const { return Lists; }
74 /// Start a new .debug_loc entry list.
76 /// Start a new .debug_loc entry list. Return the new list's index so it can
79 /// Until the next call, \a startEntry() will add entries to this list
[all...] |
| /src/external/mpl/bind/dist/bin/tests/system/isctest/log/ |
| watchlog.py | 12 from typing import Any, List, Match, Optional, Pattern, TextIO, TypeVar, Union
22 OneOrMore = Union[T, List[T]]
75 def _setup_wait(self, patterns: OneOrMore[FlexPattern]) -> List[Pattern]:
80 def _prepare_patterns(self, strings: OneOrMore[FlexPattern]) -> List[Pattern]:
82 Convert a mix of string(s) and/or pattern(s) into a list of patterns.
88 if not isinstance(strings, list):
94 def _wait_for_match(self, regexes: List[Pattern]) -> Match:
115 `patterns` accepts one value or a list of values, with each value being
213 def wait_for_sequence(self, patterns: List[FlexPattern]) -> List[Match]
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| Tree.cpp | 291 const auto *L = dyn_cast<List>(T);
340 std::vector<syntax::List::ElementAndDelimiter<syntax::Node>>
341 syntax::List::getElementsAsNodesAndDelimiters() {
345 std::vector<syntax::List::ElementAndDelimiter<Node>> Children;
363 "A list can have only elements and delimiters as children.");
368 case syntax::List::TerminationKind::Separated: {
372 case syntax::List::TerminationKind::Terminated:
373 case syntax::List::TerminationKind::MaybeTerminated: {
386 std::vector<syntax::Node *> syntax::List::getElementsAsNodes() {
407 llvm_unreachable("A list has only elements or delimiters.")
[all...] |
