Home
last modified time | relevance | path

Searched refs:erase (Results 1 – 25 of 957) sorted by relevance

12345678910>>...39

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSetVector.h193 vector_.erase(I); in remove()
199 if (set_.erase(X)) { in remove()
202 vector_.erase(I); in remove()
212 iterator erase(const_iterator I) { in erase() function
215 return vector_.erase(I); in erase()
219 set_.erase(V); in erase()
220 return vector_.erase(I); in erase()
229 /// V.erase(remove_if(V, P), V.end());
249 vector_.erase(I, vector_.end()); in remove_if()
281 set_.erase(bac in pop_back()
[all...]
H A Dilist.h204 iterator erase(iterator where) {
209 iterator erase(pointer IT) { return erase(iterator(IT)); }
210 iterator erase(reference IT) { return erase(iterator(IT)); }
240 iterator erase(iterator first, iterator last) {
242 first = erase(first);
246 void clear() { erase(begin(), end()); }
253 erase(begin());
257 iterator t = end(); erase(--t);
H A DMapVector.h182 Map.erase(Pos); in erase()
193 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { in erase()
194 Map.erase(Iterator->first); in erase()
195 auto Next = Vector.erase(Iterator); in erase()
212 size_type erase(const KeyT &Key) { in remove_if()
216 erase(Iterator); in remove_if()
234 Map.erase(I->first);
246 Vector.erase(O, Vector.end());
172 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { erase() function
191 size_type erase(const KeyT &Key) { erase() function
H A DPriorityWorklist.h147 M.erase(back()); in pop_back()
162 bool erase(const T& X) { in erase() function
175 M.erase(I); in erase()
201 V.erase(E, V.end()); in erase_if()
238 M.erase(Arg); in operator()
H A DSetOperations.h33 decltype(std::declval<Set>().erase(std::declval<Set>().begin()));
67 S1.erase(I); // Erase element if not in S2 in set_intersect()
125 S1.erase(SI); in set_subtract()
133 S1.erase(E); in set_subtract()
142 if (S1.erase(E)) in set_subtract()
H A DDenseSet.h101 bool erase(const ValueT &V) { in erase() function
102 return TheMap.erase(V); in erase()
203 void erase(Iterator I) { return TheMap.erase(I.I); } in erase() function
204 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } in erase() function
H A Dsimple_ilist.h39 /// remove(), which takes a reference to the node to remove, \a erase(), which
45 /// \li \c L.erase(L.begin());
156 void pop_front() { erase(begin()); }
159 void pop_back() { erase(--end()); } in insert()
187 /// \see \a erase() for removing by iterator. in removeAndDispose()
202 iterator erase(iterator I) {
211 iterator erase(iterator First, iterator Last) { in eraseAndDispose()
220 erase(I); in eraseAndDispose()
194 iterator erase(iterator I) { erase() function
203 iterator erase(iterator First, iterator Last) { erase() function
/freebsd/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriteRope.cpp121 void erase(unsigned Offset, unsigned NumBytes);
221 void erase(unsigned Offset, unsigned NumBytes);
337 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) { in erase() function in RopePieceBTreeLeaf
462 void erase(unsigned Offset, unsigned NumBytes);
572 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) { in erase() function in RopePieceBTreeInterior
589 CurChild->erase(Offset, NumBytes); in erase()
597 CurChild->erase(Offset, BytesFromChild); in erase()
656 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) { in erase() function in RopePieceBTreeNode
659 return Leaf->erase(Offset, NumBytes); in erase()
660 return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes); in erase()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLostDebugLocObserver.cpp43 if (LostDebugLocs.erase(MI->getDebugLoc())) { in analyzeDebugLocations()
62 if (PotentialMIsForDebugLocs.erase(MI)) in analyzeDebugLocations()
97 PotentialMIsForDebugLocs.erase(&MI); in erasingInstr()
106 PotentialMIsForDebugLocs.erase(&MI); in changingInstr()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DTrace.h98 iterator erase(iterator q) { return BasicBlocks.erase (q); } in erase() function
99 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } in erase() function
H A DDominanceFrontierImpl.h53 Frontiers.erase(BB); in removeBlock()
82 if (tmpSet.erase(Node) == 0) in compareDomSet()
117 tmpFrontiers.erase(Node); in compare()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRemoveRedundantDebugValues.cpp102 VariableMap.erase(VMI); in reduceDbgValsForwardScan()
110 VariableMap.erase(VMI); in reduceDbgValsForwardScan()
134 VariableMap.erase(Var.first); in reduceDbgValsForwardScan()
176 VariableSet.erase(Var); in reduceDbgValsBackwardScan()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DPassManagerImpl.h129 AnalysisResults.erase({IDAndResult.first, &IR}); in clear()
132 AnalysisResultLists.erase(ResultsListI); in clear()
220 I = ResultsList.erase(I); in invalidate()
221 AnalysisResults.erase({ID, &IR}); in invalidate()
226 AnalysisResultLists.erase(&IR); in invalidate()
H A DAnalysis.h137 NotPreservedAnalysisIDs.erase(ID); in preserve()
174 PreservedIDs.erase(ID); in abandon()
192 PreservedIDs.erase(ID); in intersect()
213 PreservedIDs.erase(ID); in intersect()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/Disassembler/
H A DHexagonDisassembler.cpp215 MI.erase(MI.begin () + 1); in remapInstruction()
216 MI.erase(MI.begin ()); in remapInstruction()
223 MI.erase(MI.begin () + 1); in remapInstruction()
224 MI.erase(MI.begin ()); in remapInstruction()
231 MI.erase(MI.begin () + 1); in remapInstruction()
232 MI.erase(MI.begin ()); in remapInstruction()
239 MI.erase(MI.begin () + 2); in remapInstruction()
240 MI.erase(MI.begin ()); in remapInstruction()
247 MI.erase(MI.begin () + 2); in remapInstruction()
248 MI.erase(M in remapInstruction()
[all...]
/freebsd/contrib/llvm-project/lldb/source/Utility/
H A DBroadcaster.cpp69 it = m_listeners.erase(it); in GetListeners()
205 it = m_listeners.erase(it); in RemoveListener()
214 m_listeners.erase(it); in RemoveListener()
424 if (m_listeners.erase(listener_sp) == 0) in UnregisterListenerForEventsNoLock()
451 iter = m_event_map.erase(iter); in UnregisterListenerForEventsNoLock()
487 m_listeners.erase(iter); in RemoveListener()
499 iter = m_event_map.erase(iter); in RemoveListener()
511 if (m_listeners.erase(listener_sp) == 0) in RemoveListener()
520 iter = m_event_map.erase(iter); in RemoveListener()
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_thread_arg_retval.cpp49 data_.erase(t); in Finish()
84 data_.erase(t);
94 data_.erase(t);
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DInstructionPrecedenceTracking.cpp70 FirstSpecialInsts.erase(BB); in fill()
112 FirstSpecialInsts.erase(BB); in insertInstructionTo()
119 FirstSpecialInsts.erase(BB); in removeInstruction()
H A DPhiValues.cpp147 DepthMap.erase(PN); in invalidateValue()
148 NonPhiReachableMap.erase(N); in invalidateValue()
149 ReachableMap.erase(N); in invalidateValue()
154 TrackedValues.erase(It); in invalidateValue()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DRandstruct.cpp104 FieldsOut.erase(FieldIter); in randomizeStructureLayoutImpl()
121 FieldsOut.erase(FieldIter); in randomizeStructureLayoutImpl()
129 FieldsOut.erase(FieldIter); in randomizeStructureLayoutImpl()
141 FieldsOut.erase(FieldIter); in randomizeStructureLayoutImpl()
/freebsd/usr.bin/dtc/
H A Dchecking.cc214 checkers.erase(checkers.begin()); in ~check_manager()
219 disabled_checkers.erase(disabled_checkers.begin()); in ~check_manager()
261 checkers.erase(checker); in disable_checker()
274 disabled_checkers.erase(checker); in enable_checker()
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/MCJIT/
H A DMCJIT.h99 return AddedModules.erase(M) || LoadedModules.erase(M) || in removeModule()
100 FinalizedModules.erase(M); in removeModule()
130 AddedModules.erase(M); in markModuleAsLoaded()
145 LoadedModules.erase(M); in markModuleAsFinalized()
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set68 void erase(const_iterator position);
69 size_type erase(const key_type& k);
70 void erase(const_iterator first, const_iterator last);
154 void erase(const_iterator position);
155 size_type erase(const key_type& k);
156 void erase(const_iterator first, const_iterator last);
285 _LIBCPP_HIDE_FROM_ABI void erase(const_iterator __p) { __table_.erase(__p); }
286 …_LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __table_.__erase_unique(__k); }
287 …_LIBCPP_HIDE_FROM_ABI void erase(const_iterator __first, const_iterator __last) { __table_.erase(_…
463 _LIBCPP_HIDE_FROM_ABI void erase(const_iterator __p) { __table_.erase(__p); }
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/
H A Dinterval_map.h90 void erase(KeyT KS, KeyT KE) { in erase() function
106 Impl.erase(I); in erase()
141 this->Impl.erase(Tmp); in insert()
149 this->Impl.erase(I); in insert()
/freebsd/contrib/llvm-project/lldb/source/Target/
H A DSectionLoadList.cpp125 m_addr_to_sect.erase(it_pos); in SetSectionLoadAddress()
172 m_sect_to_addr.erase(sta_pos); in SetSectionUnloaded()
177 m_addr_to_sect.erase(ats_pos); in SetSectionUnloaded()
207 m_sect_to_addr.erase(sta_pos); in SetSectionUnloaded()
213 m_addr_to_sect.erase(ats_pos); in SetSectionUnloaded()

12345678910>>...39