/freebsd-9.3-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | Internalize.cpp | 80 ExternalNames.insert(APIList.begin(), APIList.end()); 88 ExternalNames.insert(*itr); 104 ExternalNames.insert(Symbol); 149 ExternalNames.insert(V->getName()); 172 ExternalNames.insert("llvm.used"); 173 ExternalNames.insert("llvm.compiler.used"); 177 ExternalNames.insert("llvm.global_ctors"); 178 ExternalNames.insert("llvm.global_dtors"); 179 ExternalNames.insert("llvm.global.annotations"); 184 ExternalNames.insert("__stack_chk_fai [all...] |
/freebsd-9.3-release/contrib/gperf/src/ |
H A D | hash-table.h | 44 /* Attempts to insert ITEM in the table. If there is already an equal 46 KeywordExt * insert (KeywordExt *item);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Edit/ |
H A D | EditsReceiver.h | 25 virtual void insert(SourceLocation loc, StringRef text) = 0;
|
/freebsd-9.3-release/usr.sbin/pkg_install/ |
H A D | tkpkg | 26 .f.t insert end "Double click on a package above to see its 69 .frame.list insert end $line 78 .frame.list insert end "Warning: no compressed tar archives files found." 95 .f.t insert end [read $f] 124 .f.t insert end "You must double click on a package name first!" 131 .f.t insert end "Running: $s\n" 134 .f.t insert end [read $f 64] 142 .f.t insert end "Running: $s\n" 145 .f.t insert end [read $f 64]
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | SmallSet.h | 57 /// insert - Insert an element into the set if it isn't already there. 59 bool insert(const T &V) { function in class:llvm::SmallSet 61 return Set.insert(V).second; 73 Set.insert(Vector.back()); 76 Set.insert(V); 81 void insert(IterT I, IterT E) { function in class:llvm::SmallSet 83 insert(*I);
|
H A D | StringSet.h | 27 /// insert - Insert the specified key into the set. If the key already 28 /// exists in the set, return false and ignore the request, otherwise insert 30 bool insert(StringRef Key) { function in class:llvm::StringSet 32 // type will be default constructed which we use to detect insert.
|
H A D | SetVector.h | 1 //===- llvm/ADT/SetVector.h - Set with insert order iteration ---*- C++ -*-===// 55 insert(Start, End); 102 bool insert(const value_type &X) { 103 bool result = set_.insert(X); 111 void insert(It Start, It End) { 113 if (set_.insert(*Start)) 225 this->insert(Start, End);
|
H A D | ilist.h | 412 iterator insert(iterator where, NodeTy *New) { function in class:llvm::iplist 430 return insert(begin(), New); 432 return insert(++where, New); 553 void push_front(NodeTy *val) { insert(begin(), val); } 554 void push_back(NodeTy *val) { insert(end(), val); } 564 // Special forms of insert... 565 template<class InIt> void insert(iterator where, InIt first, InIt last) { function in class:llvm::iplist 566 for (; first != last; ++first) insert(where, *first); 646 insert(this->begin(), right.begin(), right.end()); 649 insert(thi 664 iterator insert(iterator where, const NodeTy &val) { function in struct:llvm::ilist 673 void insert(iterator where, size_type count, const NodeTy &val) { function in struct:llvm::ilist [all...] |
H A D | SetOperations.h | 28 if (S1.insert(*SI).second) 56 Result.insert(*SI);
|
H A D | EquivalenceClasses.h | 25 /// supports three efficient operations: insert an element into a class of its 38 /// EC.unionSets(1, 2); // insert 1, 2 into the same set 39 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets 127 member_iterator LeaderIt = member_begin(insert(*MI)); 129 unionSets(LeaderIt, member_begin(insert(*MI))); 175 member_iterator MI = findLeader(insert(V)); 193 /// insert - Insert a new value into the union/find set, ignoring the request 195 iterator insert(cons function in class:llvm::EquivalenceClasses [all...] |
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | StringPool.cpp | 32 InternTable.insert(S);
|
H A D | DeltaAlgorithm.cpp | 23 FailedTestsCache.insert(Changes); 36 ((idx < N) ? LHS : RHS).insert(*it); 93 ComplementSets.insert(ComplementSets.end(), Sets.begin(), it); 94 ComplementSets.insert(ComplementSets.end(), it + 1, Sets.end());
|
/freebsd-9.3-release/contrib/llvm/lib/Target/X86/ |
H A D | X86COFFMachineModuleInfo.h | 34 Externals.insert(Symbol);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Tooling/ |
H A D | RefactoringCallbacks.cpp | 43 Replace.insert(tooling::Replacement( 58 Replace.insert(replaceStmtWithStmt( 71 Replace.insert(replaceStmtWithStmt(*Result.SourceManager, *Node, *Body)); 75 Replace.insert(replaceStmtWithText(*Result.SourceManager, *Node, ""));
|
/freebsd-9.3-release/sys/boot/common/ |
H A D | interp_parse.c | 25 static int insert(int *argcp, char *buf); 114 PARSE_FAIL(insert(&ac, buf)); 163 PARSE_FAIL(insert(&ac, buf)); 191 insert(int *argcp, char *buf) function
|
/freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
H A D | AliasDebugger.cpp | 51 Vals.insert(&*I); 54 Vals.insert(*OI); 59 Vals.insert(&*I); 63 Vals.insert(&*AI); 68 Vals.insert(&*BI); 71 Vals.insert(*OI); 126 Vals.insert(To);
|
H A D | PtrUseVisitor.cpp | 21 if (VisitedUses.insert(&UI.getUse())) {
|
/freebsd-9.3-release/share/examples/ppp/ |
H A D | login-auth | 49 .l.prompt insert 1.0 "Login:"; 53 .l.value insert 1.0 $argv; 60 .p.prompt insert 1.0 "Password:";
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Tooling/ |
H A D | FileMatchTrie.h | 69 void insert(StringRef NewPath);
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | LiveStackAnalysis.cpp | 62 I = S2IMap.insert(I, std::make_pair(Slot, 64 S2RCMap.insert(std::make_pair(Slot, RC));
|
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | ConstantProp.cpp | 67 WorkList.insert(&*i); 83 WorkList.insert(cast<Instruction>(*UI));
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/ARCMigrate/ |
H A D | TransARCAssign.cpp | 62 Pass.TA.insert(TLoc.getBeginLoc(), "__strong "); 63 ModifiedVars.insert(var);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Rewrite/Core/ |
H A D | RewriteRope.cpp | 44 /// properly balanced when erases happen. Erases of string data can both insert 46 /// which results in two rope pieces, which is just like an insert) or it can 108 /// insert - Insert the specified ropepiece into this tree node at the 114 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R); 209 /// insert - Insert the specified ropepiece into this tree node at the 215 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R); 259 // We do this by shrinking the RopePiece and then doing an insert of the tail. 266 return insert(Offset, Tail); 270 /// insert - Insert the specified RopePiece into this tree node at the 275 RopePieceBTreeNode *RopePieceBTreeLeaf::insert(unsigne [all...] |
/freebsd-9.3-release/contrib/gcclibs/libcpp/ |
H A D | symtab.c | 89 returns NULL. Otherwise insert and returns a new entry. A new 95 enum ht_lookup_option insert) 98 insert); 104 enum ht_lookup_option insert) 123 if (insert == HT_ALLOCED) 146 if (insert == HT_ALLOCED) 155 if (insert == HT_NO_INSERT) 163 if (insert == HT_ALLOC) 94 ht_lookup(hash_table *table, const unsigned char *str, size_t len, enum ht_lookup_option insert) argument 102 ht_lookup_with_hash(hash_table *table, const unsigned char *str, size_t len, unsigned int hash, enum ht_lookup_option insert) argument
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Serialization/ |
H A D | ContinuousRangeMap.h | 64 void insert(const value_type &Val) { function in class:clang::ContinuousRangeMap 69 "Must insert keys in order."); 80 Rep.insert(I, Val); 122 void insert(const value_type &Val) { function in class:clang::ContinuousRangeMap::Builder
|