HomeSort by: relevance | last modified time | path
    Searched refs:Erase (Results 1 - 9 of 9) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
MallocOverflowSecurityChecker.cpp 149 void Erase(const T1 *DR,
156 toScanFor.erase(std::remove_if(toScanFor.begin(), toScanFor.end(), P),
164 Erase<DeclRefExpr>(DR, PredTrue);
166 Erase<MemberExpr>(ME, PredTrue);
181 // Erase if the multiplicand was assigned a constant value.
221 Erase<DeclRefExpr>(DR, pred);
223 Erase<MemberExpr>(ME, pred);
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonGenPredicate.cpp 458 VectOfInst Erase;
486 Erase.insert(&MI);
491 for (VectOfInst::iterator I = Erase.begin(), E = Erase.end(); I != E; ++I)
HexagonSubtarget.cpp 202 SmallVector<SDep, 4> Erase;
205 Erase.push_back(D);
206 for (auto &E : Erase)
306 LastVRegUse.erase(MI->getOperand(1).getReg());
323 LastVRegUse.erase(*AI);
HexagonCommonGEP.cpp 447 Work.erase(First);
611 Uses.erase(Min);
639 // Finally, erase the nodes that are no longer used.
640 NodeSet Erase;
652 Erase.insert(*I);
654 erase_if(Nodes, in_set(Erase));
979 Us.remove(U); // erase takes an iterator.
983 Uses.erase(UF);
1137 Work.erase(First);
1164 Roots.erase(First)
    [all...]
HexagonSplitDouble.cpp 1153 MISet Erase;
1160 Erase.insert(MI);
1177 for (auto MI : Erase) {
1179 B->erase(MI);
  /src/external/apache2/llvm/dist/clang/lib/AST/
ExternalASTMerger.cpp 428 Importers.erase(
440 bool Erase = false;
443 Erase = true;
447 if (Erase)
448 OI = Origins.erase(OI);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
meta.d 29 * $(LREF Erase)
308 template Erase(args...)
313 alias Erase = args[1 .. $];
315 alias Erase = AliasSeq!(args[1 .. pos + 1], args[pos + 2 .. $]);
322 alias TL = Erase!(long, Types);
328 static assert(Pack!(Erase!(int,
332 static assert(Pack!(Erase!(1,
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
map.bench.cpp 715 struct Erase : Base {
726 benchmark::DoNotOptimize(Map.erase(K));
728 size_t I = Map.erase(K);
766 benchmark::DoNotOptimize(Map.erase(H));
770 State.SkipWithError("Did not erase the entire map");
796 benchmark::DoNotOptimize(Map.erase(Map.begin(), Map.end()));
798 Map.erase(Map.begin(), Map.end());
800 State.SkipWithError("Did not erase the entire map");
1025 makeCartesianProductBenchmark<Erase, AllModes, AllOrders>(MapSize);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 4799 import std.meta : Erase, staticIndexOf;
4801 alias UniSizes = Erase!(1, Sizes);

Completed in 74 milliseconds