Searched refs:erase (Results 1 - 25 of 478) sorted by relevance

1234567891011>>

/freebsd-10.0-release/contrib/apr/
H A Dapr.mak44 -@erase "$(INTDIR)\apr-1.idb"
45 -@erase "$(INTDIR)\apr-1.pdb"
46 -@erase "$(INTDIR)\apr_atomic.obj"
47 -@erase "$(INTDIR)\apr_cpystrn.obj"
48 -@erase "$(INTDIR)\apr_fnmatch.obj"
49 -@erase "$(INTDIR)\apr_getpass.obj"
50 -@erase "$(INTDIR)\apr_hash.obj"
51 -@erase "$(INTDIR)\apr_pools.obj"
52 -@erase "$(INTDIR)\apr_random.obj"
53 -@erase "
[all...]
H A Dlibapr.mak45 -@erase "$(INTDIR)\apr_atomic.obj"
46 -@erase "$(INTDIR)\apr_cpystrn.obj"
47 -@erase "$(INTDIR)\apr_fnmatch.obj"
48 -@erase "$(INTDIR)\apr_getpass.obj"
49 -@erase "$(INTDIR)\apr_hash.obj"
50 -@erase "$(INTDIR)\apr_pools.obj"
51 -@erase "$(INTDIR)\apr_random.obj"
52 -@erase "$(INTDIR)\apr_snprintf.obj"
53 -@erase "$(INTDIR)\apr_strings.obj"
54 -@erase "
[all...]
/freebsd-10.0-release/contrib/opie/libopie/
H A Dreadpass.c25 erase and kill keys if on a terminal. To do so, use RAW
80 char erase[5]; local
84 memset(erase, 0, sizeof(erase));
120 erase[0] = CONTROL('H');
121 erase[1] = 127;
125 char *e = erase;
137 char *e = erase;
212 erase[0] = CONTROL('H');
213 erase[
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DTrace.h104 iterator erase(iterator q) { return BasicBlocks.erase (q); } function in class:llvm::Trace
105 iterator erase(iterator q1, iterator q2) { return BasicBlocks.erase (q1, q2); } function in class:llvm::Trace
H A DDominanceFrontier.h75 I->second.erase(BB);
76 Frontiers.erase(BB);
87 I->second.erase(Node);
102 if (tmpSet.erase(Node) == 0)
134 tmpFrontiers.erase(Node);
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp50 erase(const_key_reference r_key) function in class:PB_DS_CLASS_C_DEC
55 erase(it);
62 erase(iterator it) function in class:PB_DS_CLASS_C_DEC
77 erase(reverse_iterator it) function in class:PB_DS_CLASS_C_DEC
103 it = erase(it);
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DDenseSet.h49 bool erase(const ValueT &V) { function in class:llvm::DenseSet
50 return TheMap.erase(V);
114 void erase(Iterator I) { return TheMap.erase(I.I); } function in class:llvm::DenseSet
115 void erase(ConstIterator CI) { return TheMap.erase(CI.I); } function in class:llvm::DenseSet
H A DSetOperations.h44 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2
66 S1.erase(*SI);
H A DSetVector.h119 if (set_.erase(X)) {
123 vector_.erase(I);
135 /// V.erase(std::remove_if(V.begin(), V.end(), P), V.end());
149 vector_.erase(I, vector_.end());
169 set_.erase(back());
191 /// call set_.erase(x) on each element which is slated for removal.
204 set_.erase(Arg);
H A DSmallSet.h86 bool erase(const T &V) { function in class:llvm::SmallSet
88 return Set.erase(V);
91 Vector.erase(I);
H A Dilist.h462 // erase - remove a node from the controlled sequence... and delete it.
463 iterator erase(iterator where) { function in class:llvm::iplist
542 iterator erase(iterator first, iterator last) { function in class:llvm::iplist
544 first = erase(first);
548 void clear() { if (Head) erase(begin(), end()); }
555 erase(begin());
559 iterator t = end(); erase(--t);
588 // they actually do the job of erase, rename them accordingly.
590 void erase(const NodeTy &val) { function in class:llvm::iplist
593 if (*I == val) erase(
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Support/
H A DThreadLocal.h57 // erase - Removes the pointer associated with the current thread.
58 void erase() { removeInstance(); } function in class:llvm::sys::ThreadLocal
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DSDNodeOrdering.h44 OrderMap.erase(Itr);
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Derase_fn_imps.hpp107 erase(point_iterator it) function in class:PB_DS_CLASS_C_DEC
110 base_type::erase(it);
/freebsd-10.0-release/contrib/llvm/include/llvm/IR/
H A DTypeFinder.h56 iterator erase(iterator I, iterator E) { return StructTypes.erase(I, E); } function in class:llvm::TypeFinder
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DConstantProp.cpp75 WorkList.erase(WorkList.begin()); // Get an element from the worklist...
89 WorkList.erase(I);
/freebsd-10.0-release/contrib/llvm/lib/MC/
H A DMCAtom.cpp58 Data.erase(I, Data.end());
69 Text.erase(I, Text.end());
93 Text.erase(I, Text.end());
H A DMCModule.cpp32 // Find and erase the old mapping.
36 I.erase();
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Rewrite/Core/
H A DRewriteRope.cpp116 /// erase - Remove NumBytes from this node at the specified offset. We are
118 void erase(unsigned Offset, unsigned NumBytes);
218 /// erase - Remove NumBytes from this node at the specified offset. We are
220 void erase(unsigned Offset, unsigned NumBytes);
334 /// erase - Remove NumBytes from this node at the specified offset. We are
336 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {
343 assert(PieceOffs == Offset && "Split didn't occur before erase!");
356 // If we completely cover some RopePieces, erase them now.
454 /// erase - Remove NumBytes from this node at the specified offset. We are
456 void erase(unsigne
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/
H A DStmtViz.cpp47 if (OutStr[0] == '\n') OutStr.erase(OutStr.begin());
/freebsd-10.0-release/contrib/llvm/lib/Transforms/InstCombine/
H A DInstCombineWorklist.h73 WorklistMap.erase(It);
79 WorklistMap.erase(I);
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp50 erase(const_key_reference r_key) function in class:PB_DS_CLASS_C_DEC
176 erase(const_iterator it) function in class:PB_DS_CLASS_C_DEC
195 erase(iterator it) function in class:PB_DS_CLASS_C_DEC
213 erase(const_reverse_iterator it) function in class:PB_DS_CLASS_C_DEC
232 erase(reverse_iterator it) function in class:PB_DS_CLASS_C_DEC
264 it = erase(it);
/freebsd-10.0-release/contrib/libstdc++/include/debug/
H A Dmultiset.h165 erase(iterator __position) function in class:std::__debug::multiset
169 _Base::erase(__position.base());
173 erase(const key_type& __x) function in class:std::__debug::multiset
181 _Base::erase(__victim.base());
188 erase(iterator __first, iterator __last) function in class:std::__debug::multiset
194 this->erase(__first++);
206 { this->erase(begin(), end()); }
H A Dset.h170 erase(iterator __position) function in class:std::__debug::set
174 _Base::erase(__position.base());
178 erase(const key_type& __x) function in class:std::__debug::set
186 _Base::erase(__victim.base());
192 erase(iterator __first, iterator __last) function in class:std::__debug::set
199 this->erase(__first++);
211 { this->erase(begin(), end()); }
/freebsd-10.0-release/contrib/atf/atf-run/
H A Dfs.cpp78 // The erase parameter in this routine is to control nested mount points.
81 // this traversal. In other words, we erase files until we cross the
85 cleanup_aux(const atf::fs::path& p, dev_t parent_device, bool erase) argument
96 if (erase) {
111 bool erase)
113 if (erase && ((fi.get_mode() & S_IRWXU) != S_IRWXU)) {
153 cleanup_aux(p / name, fi.get_device(), erase);
110 cleanup_aux_dir(const atf::fs::path& p, const atf::fs::file_info& fi, bool erase) argument

Completed in 166 milliseconds

1234567891011>>