Home
last modified time | relevance | path

Searched refs:insert (Results 1 – 25 of 1182) sorted by relevance

12345678910>>...48

/NextBSD/contrib/llvm/lib/Transforms/IPO/
HDInternalize.cpp80 ExternalNames.insert(APIList.begin(), APIList.end()); in InternalizePass()
88 ExternalNames.insert(*itr); in InternalizePass()
104 ExternalNames.insert(Symbol); in LoadFile()
152 ExternalNames.insert(V->getName()); in runOnModule()
175 ExternalNames.insert("llvm.used"); in runOnModule()
176 ExternalNames.insert("llvm.compiler.used"); in runOnModule()
180 ExternalNames.insert("llvm.global_ctors"); in runOnModule()
181 ExternalNames.insert("llvm.global_dtors"); in runOnModule()
182 ExternalNames.insert("llvm.global.annotations"); in runOnModule()
187 ExternalNames.insert("__stack_chk_fail"); in runOnModule()
[all …]
/NextBSD/contrib/llvm/lib/Analysis/
HDLazyCallGraph.cpp42 CalleeIndexMap.insert(std::make_pair(F, Callees.size())).second) { in findCallees()
51 if (Visited.insert(cast<Constant>(Op)).second) in findCallees()
69 if (Visited.insert(C).second) in Node()
82 CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size())); in insertEdgeInternal()
87 CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(), Callees.size())); in insertEdgeInternal()
105 if (EntryIndexMap.insert(std::make_pair(&F, EntryNodes.size())).second) { in LazyCallGraph()
116 if (Visited.insert(GV.getInitializer()).second) in LazyCallGraph()
159 void LazyCallGraph::SCC::insert(Node &N) { in insert() function in LazyCallGraph::SCC
202 CalleeC.ParentSCCs.insert(this); in insertOutgoingEdge()
232 ConnectedSCCs.insert(this); in insertIncomingEdge()
[all …]
HDAliasDebugger.cpp51 Vals.insert(&*I); in runOnModule()
54 Vals.insert(*OI); in runOnModule()
59 Vals.insert(&*I); in runOnModule()
63 Vals.insert(&*AI); in runOnModule()
68 Vals.insert(&*BI); in runOnModule()
71 Vals.insert(*OI); in runOnModule()
HDDivergenceAnalysis.cpp165 DV.insert(&I); in populateWithSourcesOfDivergence()
171 DV.insert(&Arg); in populateWithSourcesOfDivergence()
194 if (!cast<PHINode>(I)->hasConstantValue() && DV.insert(I).second) in exploreSyncDependency()
239 if (DV.insert(UserInst).second) in findUsersOutsideInfluenceRegion()
252 InfluenceRegion.insert(Start); in computeInfluenceRegion()
257 if (End != Succ && InfluenceRegion.insert(Succ).second) in computeInfluenceRegion()
267 if (DV.insert(UserInst).second) in exploreDataDependency()
/NextBSD/contrib/llvm/include/llvm/ADT/
HDilist.h412 iterator insert(iterator where, NodeTy *New) {
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); }
565 template<class InIt> void insert(iterator where, InIt first, InIt last) {
566 for (; first != last; ++first) insert(where, *first);
592 insert(this->begin(), right.begin(), right.end());
595 insert(this->begin(), count, NodeTy());
598 insert(this->begin(), count, val);
[all …]
HDSmallSet.h69 std::pair<NoneType, bool> insert(const T &V) { in insert() function
71 return std::make_pair(None, Set.insert(V).second); in insert()
83 Set.insert(Vector.back()); in insert()
86 Set.insert(V); in insert()
91 void insert(IterT I, IterT E) { in insert() function
93 insert(*I); in insert()
HDSetVector.h55 insert(Start, End); in SetVector()
102 bool insert(const value_type &X) { in insert() function
103 bool result = set_.insert(X).second; in insert()
111 void insert(It Start, It End) { in insert() function
113 if (set_.insert(*Start).second) in insert()
224 this->insert(Start, End); in SmallSetVector()
HDEquivalenceClasses.h128 member_iterator LeaderIt = member_begin(insert(*MI));
130 unionSets(LeaderIt, member_begin(insert(*MI)));
176 member_iterator MI = findLeader(insert(V)); in getOrInsertLeaderValue()
196 iterator insert(const ElemTy &Data) { in insert() function
197 return TheMapping.insert(ECValue(Data)).first; in insert()
217 iterator V1I = insert(V1), V2I = insert(V2); in unionSets()
/NextBSD/contrib/llvm/lib/Target/AArch64/
HDAArch64CollectLOH.cpp317 getSet(ReachableUses, MBB, CurReg, NbReg).insert(&MI); in initReachingDef()
320 getUses(ColorOpToReachedUses, CurReg, *BBGen[CurReg]).insert(&MI); in initReachingDef()
372 getUses(ColorOpToReachedUses, CurReg, *BBGen[CurReg]).insert(DummyOp); in initReachingDef()
406 BBInSet.insert(PredOutSet.begin(), PredOutSet.end()); in reachingDefAlgorithm()
412 OpReachedUses.insert(BBReachableUses.begin(), BBReachableUses.end()); in reachingDefAlgorithm()
416 BBOutSet.insert(BBInSet.begin(), BBInSet.end()); in reachingDefAlgorithm()
418 BBOutSet.insert(Gen[&MBB][CurReg]); in reachingDefAlgorithm()
574 NotCandidate.insert(MI); in reachedUsesToDefs()
579 UseToReachingDefs[MI].insert(DefsIt.first); in reachedUsesToDefs()
583 NotCandidate.insert(MI); in reachedUsesToDefs()
[all …]
HDAArch64AddressTypePromotion.cpp293 ToRemove.insert(Inst); in propagateSignExtension()
350 ToRemove.insert(SExt); in propagateSignExtension()
363 ToRemove.insert(SExt); in propagateSignExtension()
393 ToRemove.insert(Pt); in mergeSExts()
406 ToRemove.insert(Inst); in mergeSExts()
437 bool insert = false; in analyzeSExtension() local
444 insert = true; in analyzeSExtension()
465 if (insert || AlreadySeen != SeenChains.end()) { in analyzeSExtension()
/NextBSD/contrib/nvi/vi/
HDv_txt.c263 size_t owrite, insert; /* Temporary copies of TEXT fields. */ in v_txt() local
303 tp->ai = tp->insert = tp->offset = tp->owrite = 0; in v_txt()
332 tp->insert = (len - tm->cno) - 1; in v_txt()
334 tp->insert = len - tp->cno; in v_txt()
390 ++tp->insert; in v_txt()
720 if (LF_ISSET(TXT_APPENDEOL) && tp->insert > 0) { \ in v_txt()
722 --tp->insert; \ in v_txt()
750 insert = tp->insert; in v_txt()
755 for (; insert > 0 && isblank(*p); in v_txt()
756 ++p, ++tp->R_erase, --insert); in v_txt()
[all …]
/NextBSD/contrib/llvm/tools/clang/lib/Rewrite/
HDRewriteRope.cpp114 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
215 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
266 return insert(Offset, Tail); in split()
275 RopePieceBTreeNode *RopePieceBTreeLeaf::insert(unsigned Offset, in insert() function in RopePieceBTreeLeaf
328 this->insert(Offset, R); in insert()
330 NewNode->insert(Offset - this->size(), R); in insert()
448 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
496 RopePieceBTreeNode *RopePieceBTreeInterior::insert(unsigned Offset, in insert() function in RopePieceBTreeInterior
515 if (RopePieceBTreeNode *RHS = getChild(i)->insert(Offset-ChildOffs, R)) in insert()
639 RopePieceBTreeNode *RopePieceBTreeNode::insert(unsigned Offset, in insert() function in RopePieceBTreeNode
[all …]
/NextBSD/contrib/tcsh/nls/ukrainian/
HDset414 11 end insert mode
17 14 insert character
18 15 start insert mode
19 16 insert padding
36 33 insert multiple chars
/NextBSD/contrib/tcsh/nls/C/
HDset414 11 end insert mode
17 14 insert character
18 15 start insert mode
19 16 insert padding
36 33 insert multiple chars
/NextBSD/contrib/tcsh/nls/finnish/
HDset414 11 end insert mode
17 14 insert character
18 15 start insert mode
19 16 insert padding
36 33 insert multiple chars
/NextBSD/contrib/llvm/lib/Support/
HDDAGDeltaAlgorithm.cpp186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
210 SuccClosure[*it].insert(Change); in DAGDeltaAlgorithmImpl()
211 SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end()); in DAGDeltaAlgorithmImpl()
219 PredClosure.insert(std::make_pair(*it, std::set<change_ty>())); in DAGDeltaAlgorithmImpl()
224 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
286 Extended.insert(Changes.begin(), Changes.end()); in GetTestResult()
289 Extended.insert(pred_closure_begin(*it), pred_closure_end(*it)); in GetTestResult()
296 FailedTestsCache.insert(Extended); in GetTestResult()
331 Required.insert(CurrentMinSet.begin(), CurrentMinSet.end()); in Run()
[all …]
/NextBSD/contrib/llvm/lib/TableGen/
HDSetTheory.cpp48 Elts.insert(*I); in apply()
64 Elts.insert(*I); in apply()
96 Elts.insert(Set.begin() + N, Set.end()); in apply2()
109 Elts.insert(Set.begin(), Set.begin() + N); in apply2()
130 Elts.insert(Set.begin() + N, Set.end()); in apply2()
131 Elts.insert(Set.begin(), Set.begin() + N); in apply2()
143 Elts.insert(Set[I]); in apply2()
162 Elts.insert(Args[i][n]); in apply()
221 Elts.insert(Result->begin(), Result->end()); in apply()
223 Elts.insert(Rec); in apply()
[all …]
/NextBSD/contrib/libc++/include/
Dunordered_set108 pair<iterator, bool> insert(const value_type& obj);
109 pair<iterator, bool> insert(value_type&& obj);
110 iterator insert(const_iterator hint, const value_type& obj);
111 iterator insert(const_iterator hint, value_type&& obj);
113 void insert(InputIterator first, InputIterator last);
114 void insert(initializer_list<value_type>);
256 iterator insert(const value_type& obj);
257 iterator insert(value_type&& obj);
258 iterator insert(const_iterator hint, const value_type& obj);
259 iterator insert(const_iterator hint, value_type&& obj);
[all …]
Dset110 pair<iterator,bool> insert(const value_type& v);
111 pair<iterator,bool> insert(value_type&& v);
112 iterator insert(const_iterator position, const value_type& v);
113 iterator insert(const_iterator position, value_type&& v);
115 void insert(InputIterator first, InputIterator last);
116 void insert(initializer_list<value_type> il);
292 iterator insert(const value_type& v);
293 iterator insert(value_type&& v);
294 iterator insert(const_iterator position, const value_type& v);
295 iterator insert(const_iterator position, value_type&& v);
[all …]
/NextBSD/contrib/llvm/lib/IR/
HDValueSymbolTable.cpp41 if (vmap.insert(V->getValueName())) { in reinsertValue()
59 auto IterBool = vmap.insert(std::make_pair(UniqueName, V)); in reinsertValue()
80 auto IterBool = vmap.insert(std::make_pair(Name, V)); in createValueName()
96 auto IterBool = vmap.insert(std::make_pair(UniqueName, V)); in createValueName()
HDDebugInfo.cpp88 Map.insert(std::make_pair(TypeId, Ty)); in generateDITypeIdentifierMap()
236 if (!NodesSeen.insert(DV).second) in processDeclare()
252 if (!NodesSeen.insert(DV).second) in processValue()
262 if (!NodesSeen.insert(DT).second) in addType()
272 if (!NodesSeen.insert(CU).second) in addCompileUnit()
283 if (!NodesSeen.insert(DIG).second) in addGlobalVariable()
294 if (!NodesSeen.insert(SP).second) in addSubprogram()
308 if (!NodesSeen.insert(Scope).second) in addScope()
388 R.insert(std::make_pair(F, SP)); in makeSubprogramMap()
/NextBSD/contrib/llvm/lib/CodeGen/
HDMachineInstrBundle.cpp153 KilledDefSet.insert(Reg); in finalizeBundle()
155 if (ExternUseSet.insert(Reg).second) { in finalizeBundle()
158 UndefUseSet.insert(Reg); in finalizeBundle()
162 KilledUseSet.insert(Reg); in finalizeBundle()
172 if (LocalDefSet.insert(Reg).second) { in finalizeBundle()
175 DeadDefSet.insert(Reg); in finalizeBundle()
188 if (LocalDefSet.insert(SubReg).second) in finalizeBundle()
200 if (Added.insert(Reg).second) { in finalizeBundle()
/NextBSD/contrib/gcclibs/libcpp/
HDsymtab.c95 enum ht_lookup_option insert) in ht_lookup() argument
98 insert); in ht_lookup()
104 enum ht_lookup_option insert) in ht_lookup_with_hash() argument
123 if (insert == HT_ALLOCED) in ht_lookup_with_hash()
146 if (insert == HT_ALLOCED) in ht_lookup_with_hash()
155 if (insert == HT_NO_INSERT) in ht_lookup_with_hash()
163 if (insert == HT_ALLOC) in ht_lookup_with_hash()
/NextBSD/contrib/gcc/
HDlcm.c353 sbitmap *later, sbitmap *laterin, sbitmap *insert, in compute_insert_delete() argument
368 sbitmap_difference (insert[x], later[x], laterin[last_basic_block]); in compute_insert_delete()
370 sbitmap_difference (insert[x], later[x], laterin[b->index]); in compute_insert_delete()
381 sbitmap **insert, sbitmap **delete) in pre_edge_lcm() argument
453 *insert = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm()
455 compute_insert_delete (edge_list, antloc, later, laterin, *insert, *delete); in pre_edge_lcm()
463 dump_sbitmap_vector (dump_file, "pre_insert_map", "", *insert, num_edges); in pre_edge_lcm()
688 sbitmap *insert, sbitmap *delete) in compute_rev_insert_delete() argument
701 sbitmap_difference (insert[x], nearer[x], nearerout[last_basic_block]); in compute_rev_insert_delete()
703 sbitmap_difference (insert[x], nearer[x], nearerout[b->index]); in compute_rev_insert_delete()
[all …]
/NextBSD/contrib/llvm/lib/Transforms/Utils/
HDASanStackFrameLayout.cpp73 SB.insert(SB.end(), Offset / Granularity, kAsanStackLeftRedzoneMagic); in ComputeASanStackFrameLayout()
89 SB.insert(SB.end(), Size / Granularity, 0); in ComputeASanStackFrameLayout()
91 SB.insert(SB.end(), Size % Granularity); in ComputeASanStackFrameLayout()
92 SB.insert(SB.end(), (SizeWithRedzone - Size) / Granularity, in ComputeASanStackFrameLayout()
100 SB.insert(SB.end(), ExtraRedzone / Granularity, in ComputeASanStackFrameLayout()

12345678910>>...48