| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | RDFLiveness.cpp | 129 DefQ.insert(RD); in getAllReachingDefs() 133 DefQ.insert(RD); in getAllReachingDefs() 155 DefQ.insert(RD); in getAllReachingDefs() 166 Defs.insert(TA.Id); in getAllReachingDefs() 297 TmpDefs.insert(R.Id); in getAllReachingDefsRecImpl() 302 Result.insert(DA.Id); in getAllReachingDefsRecImpl() 308 Visited.insert(PA.Id); in getAllReachingDefsRecImpl() 399 Uses.insert(U); in getAllReachedUses() 419 NewDefRRs.insert(DR); in getAllReachedUses() 459 DefQ.insert(R.Id); in computePhiInfo() [all …]
|
| H A D | HexagonBlockRanges.cpp | 254 LiveIns.insert(R); in getLiveIns() 257 LiveIns.insert(S); in getLiveIns() 268 SRs.insert(R); in expandToSubRegs() 275 SRs.insert({R.Reg, 0}); in expandToSubRegs() 277 SRs.insert({*I, 0}); in expandToSubRegs() 284 SRs.insert({R.Reg, 0}); in expandToSubRegs() 299 LiveOnEntry.insert(R); in computeInitialLiveRanges() 347 Defs.insert(S); in computeInitialLiveRanges() 401 LiveOnExit.insert(R); in computeInitialLiveRanges() 410 Left.insert(I.first); in computeInitialLiveRanges() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/IPO/ |
| H A D | Internalize.cpp | 63 ExternalNames.insert(APIList.begin(), APIList.end()); in PreserveAPIList() 86 ExternalNames.insert(Symbol); in LoadFile() 150 ExternalComdats.insert(C); in checkComdatVisibility() 181 AlwaysPreserved.insert(V->getName()); in internalizeModule() 201 AlwaysPreserved.insert("llvm.used"); in internalizeModule() 202 AlwaysPreserved.insert("llvm.compiler.used"); in internalizeModule() 206 AlwaysPreserved.insert("llvm.global_ctors"); in internalizeModule() 207 AlwaysPreserved.insert("llvm.global_dtors"); in internalizeModule() 208 AlwaysPreserved.insert("llvm.global.annotations"); in internalizeModule() 213 AlwaysPreserved.insert("__stack_chk_fail"); in internalizeModule() [all …]
|
| H A D | GlobalDCE.cpp | 98 Deps.insert(Parent); in ComputeDependencies() 100 Deps.insert(GV); in ComputeDependencies() 106 Deps.insert(K.begin(), K.end()); in ComputeDependencies() 111 Deps.insert(LocalDeps.begin(), LocalDeps.end()); in ComputeDependencies() 122 GVDependencies[GVU].insert(&GV); in UpdateGVDependencies() 129 auto const Ret = AliveGlobals.insert(&GV); in MarkLive() 159 ComdatMembers.insert(std::make_pair(C, &F)); in run() 162 ComdatMembers.insert(std::make_pair(C, &GV)); in run() 165 ComdatMembers.insert(std::make_pair(C, &GA)); in run()
|
| /freebsd-12.1/contrib/llvm/include/llvm/ADT/ |
| H A D | StringSet.h | 35 insert(X); in StringSet() 38 std::pair<typename base::iterator, bool> insert(StringRef Key) { in insert() function 40 return base::insert(std::make_pair(Key, '\0')); in insert() 44 void insert(const InputIt &Begin, const InputIt &End) { in insert() function 46 base::insert(std::make_pair(*It, '\0')); in insert()
|
| H A D | AllocatorList.h | 189 return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...))); in emplace() 192 iterator insert(iterator I, T &&V) { in insert() function 193 return iterator(List.insert(I.wrapped(), *create(std::move(V)))); in insert() 195 iterator insert(iterator I, const T &V) { in insert() function 196 return iterator(List.insert(I.wrapped(), *create(V))); in insert() 200 void insert(iterator I, Iterator First, Iterator Last) { in insert() function 202 List.insert(I.wrapped(), *create(*First)); in insert() 217 void push_back(T &&V) { insert(end(), std::move(V)); } in push_back() 218 void push_front(T &&V) { insert(begin(), std::move(V)); } in push_front() 219 void push_back(const T &V) { insert(end(), V); } in push_back() [all …]
|
| H A D | SetVector.h | 61 insert(Start, End); in SetVector() 142 bool insert(const value_type &X) { in insert() function 143 bool result = set_.insert(X).second; in insert() 151 void insert(It Start, It End) { in insert() function 153 if (set_.insert(*Start).second) in insert() 251 if (insert(*SI)) in set_union() 306 this->insert(Start, End); in SmallSetVector()
|
| /freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGStackify.cpp | 276 AfterSet.insert(&MI); in placeBlockMarker() 283 BeforeSet.insert(&MI); in placeBlockMarker() 288 AfterSet.insert(&MI); in placeBlockMarker() 317 AfterSet.insert(&MI); in placeBlockMarker() 378 BeforeSet.insert(&MI); in placeLoopMarker() 381 AfterSet.insert(&MI); in placeLoopMarker() 398 AfterSet.insert(&MI); in placeLoopMarker() 501 AfterSet.insert(&MI); in placeTryMarker() 512 AfterSet.insert(&MI); in placeTryMarker() 557 AfterSet.insert(&MI); in placeTryMarker() [all …]
|
| /freebsd-12.1/sys/contrib/ck/src/ |
| H A D | ck_hs.c | 532 const void *insert; in ck_hs_marshal() local 538 insert = key; in ck_hs_marshal() 541 return insert; in ck_hs_marshal() 660 ck_pr_store_ptr(first, insert); in ck_hs_fas() 664 ck_pr_store_ptr(slot, insert); in ck_hs_fas() 734 ck_pr_store_ptr(first, insert); in ck_hs_apply() 745 ck_pr_store_ptr(slot, insert); in ck_hs_apply() 782 ck_pr_store_ptr(first, insert); in ck_hs_set() 800 ck_pr_store_ptr(slot, insert); in ck_hs_set() 842 ck_pr_store_ptr(first, insert); in ck_hs_put_internal() [all …]
|
| /freebsd-12.1/contrib/nvi/vi/ |
| H A D | v_txt.c | 390 ++tp->insert; in v_txt() 750 insert = tp->insert; in v_txt() 772 insert + owrite, insert + owrite + 32)) == NULL) in v_txt() 777 ntp->insert = insert; in v_txt() 818 ntp->insert = wmt.insert; in v_txt() 828 ++ntp->insert; in v_txt() 1363 ++tp->insert; in v_txt() 1616 if (tp->insert) in txt_abbrev() 1836 ++ntp->insert; in txt_backup() 2405 if (tp->insert) in txt_hex() [all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/XRay/ |
| H A D | Graph.h | 393 InNeighbors[I.second].insert(I.first); 394 OutNeighbors[I.first].insert(I.second); 450 return Vertices.insert(Val); in insert() 455 return Vertices.insert(std::move(Val)); in insert() 463 const auto &p = Edges.insert(Val); in insert() 468 InNeighbors[EI.second].insert(EI.first); in insert() 469 OutNeighbors[EI.first].insert(EI.second); in insert() 479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { in insert() function 481 const auto &p = Edges.insert(std::move(Val)); in insert() 485 InNeighbors[EI.second].insert(EI.first); in insert() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | PhiValues.cpp | 59 TrackedValues.insert(PhiValuesCallbackVH(const_cast<PHINode *>(Phi), this)); in processPhi() 71 TrackedValues.insert(PhiValuesCallbackVH(PhiOp, this)); in processPhi() 87 Reachable.insert(ComponentPhi); in processPhi() 97 Reachable.insert(It->second.begin(), It->second.end()); in processPhi() 99 Reachable.insert(Op); in processPhi() 103 ReachableMap.insert({DepthNumber,Reachable}); in processPhi() 109 NonPhi.insert(const_cast<Value*>(V)); in processPhi() 110 NonPhiReachableMap.insert({DepthNumber,NonPhi}); in processPhi()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Tooling/Refactoring/Rename/ |
| H A D | USRFindingAction.cpp | 74 USRSet.insert(getUSRForDecl(OverriddenMethod)); in Find() 83 USRSet.insert(getUSRForDecl(FoundDecl)); in Find() 132 USRSet.insert(getUSRForDecl(CtorDecl)); in addUSRsOfCtorDtors() 134 USRSet.insert(getUSRForDecl(RecordDecl->getDestructor())); in addUSRsOfCtorDtors() 135 USRSet.insert(getUSRForDecl(RecordDecl)); in addUSRsOfCtorDtors() 139 USRSet.insert(getUSRForDecl(MethodDecl)); in addUSRsOfOverridenFunctions() 149 USRSet.insert(getUSRForDecl(MethodDecl)); in addUSRsOfInstantiatedMethods() 151 USRSet.insert(getUSRForDecl(FT)); in addUSRsOfInstantiatedMethods() 155 USRSet.insert(getUSRForDecl(Method)); in addUSRsOfInstantiatedMethods()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Rewrite/ |
| H A D | RewriteRope.cpp | 118 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R); 218 RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R); 269 return insert(Offset, Tail); in split() 277 RopePieceBTreeNode *RopePieceBTreeLeaf::insert(unsigned Offset, in insert() function in RopePieceBTreeLeaf 330 this->insert(Offset, R); in insert() 332 NewNode->insert(Offset - this->size(), R); in insert() 647 RopePieceBTreeNode *RopePieceBTreeNode::insert(unsigned Offset, in insert() function in RopePieceBTreeNode 651 return Leaf->insert(Offset, R); in insert() 652 return cast<RopePieceBTreeInterior>(this)->insert(Offset, R); in insert() 748 void RopePieceBTree::insert(unsigned Offset, const RopePiece &R) { in insert() function in RopePieceBTree [all …]
|
| /freebsd-12.1/contrib/tcsh/nls/C/ |
| H A D | set4 | 14 11 end insert mode 17 14 insert character 18 15 start insert mode 19 16 insert padding 36 33 insert multiple chars
|
| /freebsd-12.1/contrib/tcsh/nls/finnish/ |
| H A D | set4 | 14 11 end insert mode 17 14 insert character 18 15 start insert mode 19 16 insert padding 36 33 insert multiple chars
|
| /freebsd-12.1/contrib/tcsh/nls/ukrainian/ |
| H A D | set4 | 14 11 end insert mode 17 14 insert character 18 15 start insert mode 19 16 insert padding 36 33 insert multiple chars
|
| /freebsd-12.1/contrib/libc++/include/ |
| H A D | set | 312 iterator insert(const value_type& v); 313 iterator insert(value_type&& v); 509 insert(__f, __l); 518 insert(__f, __l); 532 insert(__s.begin(), __s.end()); 557 insert(__s.begin(), __s.end()); 997 insert(__f, __l); 1013 insert(__f, __l); 1138 iterator insert(const value_type& __v) 1154 iterator insert(value_type&& __v) [all …]
|
| H A D | unordered_set | 584 {return insert(__x).first;} 764 insert(__first, __last); 778 insert(__first, __last); 792 insert(__first, __last); 815 insert(__u.begin(), __u.end()); 827 insert(__u.begin(), __u.end()); 1333 insert(__first, __last); 1347 insert(__first, __last); 1361 insert(__first, __last); 1384 insert(__u.begin(), __u.end()); [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUPerfHintAnalysis.cpp | 150 WorkSet.insert(MO); in isIndirectAccess() 156 if (!Visited.insert(V).second) in isIndirectAccess() 171 WorkSet.insert(P); in isIndirectAccess() 173 WorkSet.insert(GEP->getOperand(I)); in isIndirectAccess() 178 WorkSet.insert(U->getOperand(0)); in isIndirectAccess() 183 WorkSet.insert(BO->getOperand(0)); in isIndirectAccess() 184 WorkSet.insert(BO->getOperand(1)); in isIndirectAccess() 189 WorkSet.insert(S->getFalseValue()); in isIndirectAccess() 190 WorkSet.insert(S->getTrueValue()); in isIndirectAccess() 195 WorkSet.insert(E->getVectorOperand()); in isIndirectAccess() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 186 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() 294 Extended.insert(Changes.begin(), Changes.end()); in GetTestResult() 297 Extended.insert(pred_closure_begin(*it), pred_closure_end(*it)); in GetTestResult() 304 FailedTestsCache.insert(Extended); in GetTestResult() 339 Required.insert(CurrentMinSet.begin(), CurrentMinSet.end()); in Run() [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lld/COFF/ |
| H A D | SymbolTable.cpp | 256 Undefs.insert(Sym); in reportRemainingUndefines() 312 std::tie(S, WasInserted) = insert(Name, F); in addUndefined() 330 std::tie(S, WasInserted) = insert(Name); in addLazy() 356 std::tie(S, WasInserted) = insert(N, nullptr); in addAbsolute() 368 std::tie(S, WasInserted) = insert(N, nullptr); in addAbsolute() 380 std::tie(S, WasInserted) = insert(N, nullptr); in addSynthetic() 394 std::tie(S, WasInserted) = insert(N, F); in addRegular() 408 std::tie(S, WasInserted) = insert(N, F); in addComdat() 423 std::tie(S, WasInserted) = insert(N, F); in addCommon() 435 std::tie(S, WasInserted) = insert(N, nullptr); in addImportData() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/TableGen/ |
| H A D | SetTheory.cpp | 59 Elts.insert(*I); in apply() 75 Elts.insert(*I); in apply() 107 Elts.insert(Set.begin() + N, Set.end()); in apply2() 120 Elts.insert(Set.begin(), Set.begin() + N); in apply2() 141 Elts.insert(Set.begin() + N, Set.end()); in apply2() 142 Elts.insert(Set.begin(), Set.begin() + N); in apply2() 154 Elts.insert(Set[I]); in apply2() 173 Elts.insert(Args[i][n]); in apply() 232 Elts.insert(Result->begin(), Result->end()); in apply() 234 Elts.insert(Rec); in apply() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/GlobalISel/ |
| H A D | Combiner.cpp | 59 WorkList.insert(&MI); in createdInstr() 60 LLVM_DEBUG(CreatedInstrs.insert(&MI)); in createdInstr() 64 WorkList.insert(&MI); in changingInstr() 68 WorkList.insert(&MI); in changedInstr() 133 WorkList.insert(CurMI); in combineMachineInstrs()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| H A D | HexagonMCChecker.cpp | 41 ReadOnly.insert(Hexagon::PC); in init() 42 ReadOnly.insert(Hexagon::C9_8); in init() 77 NewPreds.insert(PredReg); in initReg() 85 Uses.insert(*SRI); in initReg() 120 SoftDefs.insert(R); in init() 124 LatePreds.insert(R); in init() 160 SoftDefs.insert(*SRI); in init() 164 LatePreds.insert(*SRI); in init() 172 TmpDefs.insert(*SRI); in init() 176 Uses.insert(*SRI); in init() [all …]
|