| /src/external/gpl3/gdb.old/dist/gdb/ |
| check-include-guards.py | 28 from typing import List
51 def skip_comments_and_blanks(ndx: int, contents: List[str]):
65 def write_header(filename: str, contents: List[str]):
81 contents = list(f)
|
| make-target-delegates.py | 24 from typing import Dict, List, TextIO
99 self, argtypes: List[str], return_type: str, style: str, default_arg: str
146 # Parse arguments into a list.
150 result: list[str] = []
168 # Returns a list of actual argument names.
170 f: TextIO, decl: bool, name: str, return_type: str, argtypes: List[str]
179 argdecls: list[str] = []
180 actuals: list[str] = []
198 def write_declaration(f: TextIO, name: str, return_type: str, argtypes: List[str]):
203 def write_delegator(f: TextIO, name: str, return_type: str, argtypes: List[str])
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| check-include-guards.py | 28 from typing import List
51 def skip_comments_and_blanks(ndx: int, contents: List[str]):
65 def write_header(filename: str, contents: List[str]):
81 contents = list(f)
|
| 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...] |
| make-target-delegates.py | 24 from typing import Dict, List, TextIO
99 self, argtypes: List[str], return_type: str, style: str, default_arg: str
146 # Parse arguments into a list.
150 result: list[str] = []
168 # Returns a list of actual argument names.
170 f: TextIO, decl: bool, name: str, return_type: str, argtypes: List[str]
179 argdecls: list[str] = []
180 actuals: list[str] = []
198 def write_declaration(f: TextIO, name: str, return_type: str, argtypes: List[str]):
203 def write_delegator(f: TextIO, name: str, return_type: str, argtypes: List[str])
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_list_test.cc | 22 typedef IntrusiveList<ListItem> List;
24 static List static_list;
26 static void SetList(List *l, ListItem *x = 0,
34 static void CheckList(List *l, ListItem *i1, ListItem *i2 = 0, ListItem *i3 = 0,
67 List l;
144 List l1, l2;
174 List l;
177 List l2;
|
| /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...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| ASTImporterLookupTable.cpp | 143 const DeclList& List = Entry.second;
144 for (NamedDecl *ND : List) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| ilist_node.h | 1 //===- llvm/ADT/ilist_node.h - Intrusive Linked List Helper -----*- C++ -*-===//
106 /// An intrusive list node.
110 /// \a value_type for the list.
115 /// By default, an \a ilist_node knows whether it is the list sentinel (an
125 /// list. (ilist_sentinel_tracking<false> turns sentinel tracking off all the
130 /// multiple lists simultaneously, where each list is given the same tag.
251 /// An ilist node that can access its parent list.
254 /// \c ParentTy to have \a getSublistAccess() to get a reference to the list.
273 /// Get the previous node, or \c nullptr for the list head.
276 // (and would need the type of the list)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachinePassRegistry.h | 29 /// registration list.
45 /// MachinePassRegistryNode - Machine pass node stored in registration list.
50 MachinePassRegistryNode *Next = nullptr; // Next function pass in list.
75 MachinePassRegistryNode<PassCtorTy> *List; // List of registry nodes.
78 *Listener; // Listener for list adds are removes.
86 MachinePassRegistryNode<PassCtorTy> *getList() { return List; }
104 /// Add - Adds a function pass to the registration list.
107 Node->setNext(List);
108 List = Node
[all...] |
| /src/external/gpl3/gdb/dist/sim/common/ |
| gennltvals.py | 35 from typing import Iterable, List, TextIO
261 def parse_args(argv: List[str]) -> argparse.Namespace:
292 def main(argv: 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/external/apache2/llvm/dist/clang/lib/ARCMigrate/ |
| Internals.h | 17 #include <list>
27 typedef std::list<StoredDiagnostic> ListTy;
28 ListTy List;
31 void push_back(const StoredDiagnostic &diag) { List.push_back(diag); }
41 iterator begin() const { return List.begin(); }
42 iterator end() const { return List.end(); }
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DIEHash.cpp | 94 // Reverse iterate over our list to go from the outermost construct to the
162 // a) If T is in the list of [previously hashed types], use the letter
169 // list] as the attribute value;
234 const DebugLocStream::List &List = Locs.getList(LocList.getValue());
235 for (const DebugLocStream::Entry &Entry : Locs.getEntries(List))
236 DD.emitDebugLocEntry(Streamer, Entry, List.CU);
|
| 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/gpl2/xcvs/dist/src/ |
| 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...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_quarantine.h | 166 // require some tuning). It saves us merge attempt when the batch list
265 // Remove the next batch from the list and account for its size.
268 // Add it to deallocation list.
282 for (List::ConstIterator it = list_.begin(); it != list_.end(); ++it) {
303 typedef IntrusiveList<QuarantineBatch> List;
305 List list_;
|
| /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 788 ArrayRef<TemplateArgument> List =
790 return matchesFirstInRange(InnerMatcher, List.begin(), List.end(), Finder,
791 Builder) != List.end();
1068 ArrayRef<TemplateArgument> List =
1070 if (List.size() <= N)
1072 return InnerMatcher.matches(List[N], Finder, Builder);
1664 /// Matches init list expressions.
1677 /// Matches the syntactic form of init list expressions
1686 /// Matches C++ initializer list expressions
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Syntax/ |
| Tree.h | 244 /// Append \p Child to the list of children and sets the parent pointer.
259 /// Replace a range of children [Begin, End) with a list of
280 /// A list of Elements separated or terminated by a fixed token.
283 /// delimited-list(element, delimiter, termination, canBeEmpty)
284 class List : public Tree {
302 /// For example, in a separated list:
308 /// In a terminated or maybe-terminated list:
315 /// Returns the elements of the list. Missing elements are represented
322 /// Returns the appropriate delimiter for this list.
330 /// Whether this list can be empty in syntactically and semantically correc
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFListTable.h | 25 /// A base class for DWARF list entries, such as range or location list
54 /// A class representing the header of a list table such as the range list
80 /// The name of the section the list is located in.
82 /// A characterization of the list for dumping purposes, e.g. "range" or
145 /// more list entries. The list entries are kept in a map where the keys are
150 /// list based on an offset (obtained from DW_AT_ranges, for example).
152 /// This string is displayed as a heading before the list is dumpe
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Target/ |
| TargetOptions.h | 64 List, // Get list of functions & BBs from a file. Selectively enables
70 Preset, // Similar to list but the blocks are identified by passes which
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/MSF/ |
| MappedBlockStream.cpp | 122 // We really only have to check the last item in the list, since we append
158 std::vector<CacheEntry> List;
159 List.emplace_back(WriteBuffer, Size);
160 CacheMap.insert(std::make_pair(Offset, List));
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_quarantine.h | 166 // require some tuning). It saves us merge attempt when the batch list
265 // Remove the next batch from the list and account for its size.
268 // Add it to deallocation list.
282 for (List::ConstIterator it = list_.begin(); it != list_.end(); ++it) {
303 typedef IntrusiveList<QuarantineBatch> List;
305 List list_;
|
| /src/external/mpl/bind/dist/doc/arm/ |
| conf.py | 18 from typing import List, Tuple
53 def run(self) -> Tuple[List[Node], List[system_message]]:
89 def run(self) -> Tuple[List[Node], List[system_message]]:
134 # list see the documentation:
181 # List of patterns, relative to source directory, that match files and
194 # a list of builtin themes.
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86OptimizeLEAs.cpp | 266 /// Choose the best \p LEA instruction from the \p List to replace
270 bool chooseBestLEA(const SmallVectorImpl<MachineInstr *> &List,
332 // Find the best LEA instruction in the List to replace address recalculation in
342 const SmallVectorImpl<MachineInstr *> &List, const MachineInstr &MI,
352 for (auto DefMI : List) {
369 // Choose the closest LEA instruction from the list, prior to MI if
371 // as well. Also note that the list is sorted by the order in which the LEAs
625 // Try to find similar LEAs in the list and replace one with another.
631 auto &List = E.second;
634 auto I1 = List.begin()
[all...] |
