/freebsd-10.3-release/contrib/binutils/opcodes/ |
H A D | cgen-dis.c | 147 const CGEN_INSN_LIST *ilist; local 149 for (ilist = insns; ilist != NULL; ilist = ilist->next, ++ hentbuf) 155 if (! (* cd->dis_hash_p) (ilist->insn)) 161 value = CGEN_INSN_BASE_VALUE (ilist->insn); 164 CGEN_INSN_MASK_BITSIZE (ilist->insn), 167 add_insn_to_hash_chain (hentbuf, ilist->insn, htable, hash);
|
H A D | cgen-asm.c | 102 const CGEN_INSN_LIST *ilist; local 104 for (ilist = insns; ilist != NULL; ilist = ilist->next, ++ hentbuf) 108 if (! (* cd->asm_hash_p) (ilist->insn)) 110 hash = (* cd->asm_hash) (CGEN_INSN_MNEMONIC (ilist->insn)); 112 hentbuf->insn = ilist->insn;
|
H A D | mep-asm.c | 1313 CGEN_INSN_LIST *ilist; 1324 ilist = CGEN_ASM_LOOKUP_INSN (cd, str); 1328 for ( ; ilist != NULL ; ilist = CGEN_ASM_NEXT_INSN (ilist)) 1330 const CGEN_INSN *insn = ilist->insn; 1309 CGEN_INSN_LIST *ilist; local
|
/freebsd-10.3-release/contrib/llvm/include/llvm/Analysis/ |
H A D | IVUsers.h | 130 ilist<IVStrideUse> IVUses; 160 typedef ilist<IVStrideUse>::iterator iterator; 161 typedef ilist<IVStrideUse>::const_iterator const_iterator;
|
H A D | AliasSetTracker.h | 21 #include "llvm/ADT/ilist.h" 220 // Can only be created by AliasSetTracker. Also, ilist creates one 296 ilist<AliasSet> AliasSets; 349 const ilist<AliasSet> &getAliasSets() const { return AliasSets; } 391 typedef ilist<AliasSet>::iterator iterator; 392 typedef ilist<AliasSet>::const_iterator const_iterator;
|
/freebsd-10.3-release/contrib/bmake/ |
H A D | mkdeps.sh | 200 ilist=`get_incs $ifile` # recurse needed? 201 [ "$ilist" ] && llen=`gen_deps $llen $ilist` 263 ilist=`get_incs $file` 265 if [ "$ilist" ]; then 274 llen=`gen_deps $llen $ilist`
|
/freebsd-10.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | ilist.h | 1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==// 19 // The ilist class itself, should be a plug in replacement for list, assuming 24 // The ilist class is implemented by allocating a 'tail' node when the list is 73 /// strategy. The sentinel is stored in the prev field of ilist's Head. 83 /// provideInitialHead - when constructing an ilist, provide a starting 215 assert(NodePtr && "--'d off the beginning of an ilist!"); 451 // an ilist (and potentially deleted) with iterators still pointing at it. 640 struct ilist : public iplist<NodeTy> { struct in namespace:llvm 644 ilist() {} function in struct:llvm::ilist 645 ilist(cons function in struct:llvm::ilist 648 explicit ilist(size_type count) { function in struct:llvm::ilist 651 ilist(size_type count, const NodeTy &val) { function in struct:llvm::ilist 654 template<class InIt> ilist(InIt first, InIt last) { function in struct:llvm::ilist [all...] |
H A D | SparseBitVector.h | 18 #include "llvm/ADT/ilist.h" 283 typedef ilist<SparseBitVectorElement<ElementSize> > ElementList;
|
/freebsd-10.3-release/contrib/binutils/gas/config/ |
H A D | tc-mep.c | 478 CGEN_INSN_LIST *ilist; 482 ilist = CGEN_ASM_LOOKUP_INSN (gas_cgen_cpu_desc, 486 for ( ; ilist != NULL ; ilist = CGEN_ASM_NEXT_INSN (ilist)) 488 const CGEN_INSN *insn = ilist->insn; 489 if (strcmp (CGEN_INSN_MNEMONIC (ilist->insn), 491 && MEP_INSN_COP_P (ilist->insn) 476 CGEN_INSN_LIST *ilist; local
|
/freebsd-10.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
H A D | BugReporter.h | 27 #include "llvm/ADT/ilist.h" 345 llvm::ilist<BugReport> Reports; 358 typedef llvm::ilist<BugReport>::iterator iterator; 359 typedef llvm::ilist<BugReport>::const_iterator const_iterator;
|
/freebsd-10.3-release/contrib/gcc/ |
H A D | omp-low.c | 1607 lower_rec_input_clauses (tree clauses, tree *ilist, tree *dlist, 1688 gimplify_and_add (x, ilist); 1724 gimplify_and_add (x, ilist); 1768 gimplify_and_add (x, ilist); 1784 gimplify_and_add (x, ilist); 1799 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c), ilist); 1807 gimplify_and_add (x, ilist); 1827 gimplify_and_add (x, ilist); 1836 build_omp_barrier (ilist); 2029 lower_send_clauses (tree clauses, tree *ilist, tre 1606 lower_rec_input_clauses(tree clauses, tree *ilist, tree *dlist, omp_context *ctx) argument 1798 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c), ilist); local 2028 lower_send_clauses(tree clauses, tree *ilist, tree *olist, omp_context *ctx) argument 2108 lower_send_shared_vars(tree *ilist, tree *olist, omp_context *ctx) argument 3593 tree new_stmt, stmt, body, bind, block, ilist, olist, new_body; local 3604 lower_rec_input_clauses (OMP_SECTIONS_CLAUSES (stmt), &ilist, &dlist, ctx); local 4050 tree t, stmt, ilist, dlist, new_stmt, *body_p, *rhs_p; local 4155 tree olist, ilist, par_olist, par_ilist; local [all...] |
/freebsd-10.3-release/contrib/llvm/include/llvm/IR/ |
H A D | Module.h | 123 typedef ilist<NamedMDNode> NamedMDListType; 509 static ilist<NamedMDNode> Module::*getSublistAccess(NamedMDNode*) {
|
/freebsd-10.3-release/usr.sbin/newsyslog/ |
H A D | newsyslog.c | 213 STAILQ_HEAD(ilist, include_entry); 250 struct conf_entry *defconf_p, struct ilist *inclist); 251 static void add_to_queue(const char *fname, struct ilist *inclist); 802 struct ilist inclist; 1043 struct conf_entry *defconf_p, struct ilist *inclist) 1671 add_to_queue(const char *fname, struct ilist *inclist)
|
/freebsd-10.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineFunction.h | 21 #include "llvm/ADT/ilist.h" 116 typedef ilist<MachineBasicBlock> BasicBlockListType;
|
H A D | SelectionDAG.h | 20 #include "llvm/ADT/ilist.h" 189 ilist<SDNode> AllNodes; 320 typedef ilist<SDNode>::const_iterator allnodes_const_iterator; 323 typedef ilist<SDNode>::iterator allnodes_iterator; 326 ilist<SDNode>::size_type allnodes_size() const {
|
H A D | MachineBasicBlock.h | 63 typedef ilist<MachineInstr> Instructions;
|
H A D | SlotIndexes.h | 26 #include "llvm/ADT/ilist.h" 337 typedef ilist<IndexListEntry> IndexList;
|
/freebsd-10.3-release/contrib/llvm/lib/Analysis/ |
H A D | IVUsers.cpp | 277 for (ilist<IVStrideUse>::const_iterator UI = IVUses.begin(),
|
/freebsd-10.3-release/contrib/llvm/lib/Support/ |
H A D | YAMLParser.cpp | 18 #include "llvm/ADT/ilist.h" 177 typedef ilist<Token> TokenQueueT;
|