HomeSort by: relevance | last modified time | path
    Searched defs:Insert (Results 1 - 25 of 31) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/clang/tools/libclang/
Rewrite.cpp 28 const char *Insert) {
31 R.InsertTextBefore(clang::cxloc::translateSourceLocation(Loc), Insert);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
CFGUpdate.h 9 // This file defines a CFG Edge Update: Insert or Delete, and two Nodes as the
25 enum class UpdateKind : unsigned char { Insert, Delete };
44 OS << (getKind() == UpdateKind::Insert ? "Insert " : "Delete ");
79 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1);
90 NumInsertions > 0 ? UpdateKind::Insert : UpdateKind::Delete;
GenericDomTree.h 112 OtherChildren.insert(Nd);
242 static constexpr UpdateKind Insert = UpdateKind::Insert;
521 /// - {{Insert, A, B}, {Delete, A, B}, {Insert, A, B}} is fine, because
523 /// - {{Insert, A, B}, {Insert, A, B}} is invalid, because it doesn't make
524 /// sense to insert the same edge twice.
  /src/sys/external/bsd/compiler_rt/dist/lib/asan/
asan_memory_profile.cc 42 Insert(id, cv.UsedSize());
86 void Insert(u32 id, uptr size) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LiveRangeShrink.cpp 168 MachineInstr *Insert = nullptr;
183 Insert = nullptr;
189 Insert = nullptr;
203 Insert = FindDominatedInstruction(DefInstr, Insert, IOM);
205 Insert = nullptr;
211 // after Insert, if yes, then we should not hoist.
212 for (MachineInstr *I = Insert; I && IOM[I] == Barrier;
215 Insert = nullptr;
219 if (DefMO && Insert && NumEligibleUse > 1 && Barrier <= IOM[Insert])
    [all...]
  /src/external/gpl3/gcc/dist/libsanitizer/asan/
asan_memory_profile.cpp 40 Insert(id, cv.UsedSize());
84 void Insert(u32 id, uptr size) {
  /src/external/gpl3/gcc.old/dist/libsanitizer/asan/
asan_memory_profile.cpp 41 Insert(id, cv.UsedSize());
85 void Insert(u32 id, uptr size) {
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerTracePC.h 38 void Insert(size_t Idx, const T &Arg1, const T &Arg2) {
  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ASTDiff/
ASTDiff.h 31 Insert, // (Src, Dst, Pos): insert Src as child of Dst at offset Pos.
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
map.bench.cpp 80 hints.push_back(map.insert(std::make_pair(2 * I + 2, 0)).first);
237 struct Insert : Base {
248 benchmark::DoNotOptimize(Map.insert(std::make_pair(K, 1)));
250 bool Inserted = Map.insert(std::make_pair(K, 1)).second;
256 State.SkipWithError("Failed to insert e new element");
290 benchmark::DoNotOptimize(Map.insert(*H, std::make_pair(K, 1)));
292 auto Inserted = Map.insert(*H, std::make_pair(K, 1));
298 State.SkipWithError("Failed to insert a new element");
324 benchmark::DoNotOptimize(Map.insert(Itor, std::make_pair(K, 1)));
327 Map.insert(Itor, std::make_pair(K, 1))
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h 110 /// before we actually need to insert something.
113 /// Tell if the insert point has already been materialized.
147 /// MachineBasicBlock::insert. I.e., additional code happens
166 /// MachineBasicBlock::insert and ::getPoint. The new code should
179 /// Insert \p MI in the just before ::getPoint()
180 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint
181 return getInsertMBB().insert(getPoint(), &MI);
257 // If we try to insert before phis, we should use the insertion
261 // If we try to insert after the terminators, we should use the
321 Insert,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIAnnotateControlFlow.cpp 227 Instruction *Insert;
229 Insert = Parent->getTerminator();
231 Insert = L->getHeader()->getFirstNonPHIOrDbgOrLifetime();
235 return CallInst::Create(IfBreak, Args, "", Insert);
238 // Insert IfBreak in the loop header TERM for constant COND other than true.
240 Instruction *Insert = Cond == BoolTrue ?
244 return CallInst::Create(IfBreak, Args, "", Insert);
291 // We can't insert an EndCF call into a loop header, because it will
AMDGPUAtomicOptimizer.cpp 613 B.Insert(NewI);
641 Value *const Insert =
643 BroadcastI = B.CreateBitCast(Insert, Ty);
R600ISelLowering.cpp 714 SDValue Insert = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, Op.getValueType(),
716 return vectorToVerticalVector(DAG, Insert);
1832 // Insert the element
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
StackSafetyAnalysis.cpp 423 auto Insert =
425 if (!Insert.second)
426 Insert.first->second = Insert.first->second.unionWith(Offsets);
431 if (Visited.insert(I).second)
563 WorkList.insert(CallerID);
813 Info->SafeAllocas.insert(AI);
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyRegStackify.cpp 266 static MachineInstr *getVRegDef(unsigned Reg, const MachineInstr *Insert,
275 LIS.getInstructionIndex(*Insert)))
308 // Test whether it's safe to move Def to just before Insert.
314 const MachineInstr *Insert, AliasAnalysis &AA,
319 assert(DefI->getParent() == Insert->getParent());
320 assert(UseI->getParent() == Insert->getParent());
354 if (NextI == Insert)
369 // If the register is dead here and at Insert, ignore it.
370 if (MO.isDead() && Insert->definesRegister(Reg) &&
371 !Insert->readsRegister(Reg)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86MachineFunctionInfo.h 216 auto Insert = PreallocatedIds.insert({CS, PreallocatedIds.size()});
217 if (Insert.second) {
221 return Insert.first->second;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VectorCombine.cpp 101 // Match insert into fixed vector of scalar value.
102 // TODO: Handle non-zero insert index.
195 /* Insert */ true, HasExtract);
468 // to create an extract to that same element. The extract/insert can be
470 // TODO: If we add a larger pattern match that starts from an insert, this
618 "Unexpected types for insert element into binop or cmp");
630 // Get cost estimate for the insert element. This cost will factor into
671 Value *Insert = Builder.CreateInsertElement(NewVecC, Scalar, Index);
672 replaceValue(I, *Insert);
788 // TODO: Combine more complicated patterns (multiple insert) by referencin
    [all...]
LoadStoreVectorizer.cpp 570 InstructionsToMove.insert(IM);
939 continue; // Should not insert.
1017 InstructionsProcessed->insert(Chain.begin(), Chain.end());
1024 InstructionsProcessed->insert(Chain.begin(), Chain.end());
1029 InstructionsProcessed->insert(NewChain.front());
1069 InstructionsProcessed->insert(Chain.begin(), Chain.end());
1111 Value *Insert =
1113 Vec = Insert;
1124 Value *Insert =
1126 Vec = Insert;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMappingReader.cpp 564 FunctionRecords.insert(std::make_pair(NameRef, Records.size()));
650 auto Insert =
651 FileRangeMap.insert(std::make_pair(FilenamesRef, FileRange));
652 if (!Insert.second) {
656 FilenameRange &OrigRange = Insert.first->getSecond();
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64TargetTransformInfo.cpp 357 CandidatesForRemoval.insert(CandidatesForRemoval.begin(), IntrinsicCursor);
383 // The intrinsic is inserting into lane zero so use an insert instead.
385 auto *Insert = InsertElementInst::Create(
387 Insert->insertBefore(&II);
388 Insert->takeName(&II);
390 return IC.replaceInstUsesWith(II, Insert);
945 // All other insert/extracts cost this much.
  /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/
RISCVISelDAGToDAG.cpp 1064 // insert which doesn't naturally align to a vector register. These must
1092 SDValue Insert = CurDAG->getTargetInsertSubreg(SubRegIdx, DL, VT, V, SubV);
1093 ReplaceNode(Node, Insert.getNode());
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
Scalarizer.cpp 56 "scalarize-variable-insert-extract", cl::init(true), cl::Hidden,
88 // insert them before BBI in BB. If Cache is nonnull, use it to cache
295 InsertElementInst *Insert = dyn_cast<InsertElementInst>(V);
296 if (!Insert)
298 ConstantInt *Idx = dyn_cast<ConstantInt>(Insert->getOperand(2));
302 V = Insert->getOperand(0);
304 CV[J] = Insert->getOperand(1);
310 CV[J] = Insert->getOperand(1);
StructurizeCFG.cpp 417 Nodes.insert(Order.begin() + I, Order.begin() + E - 1);
536 Visited.insert(RN->getEntry());
543 /// Insert the missing branch conditions
735 BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :
738 Func, Insert);
817 Visited.insert(Node->getEntry());
826 // Insert extra prefix node (or reuse last one)
829 // Insert extra postfix node (or use exit instead)
869 // insert a new dummy entry block.
  /src/external/apache2/llvm/dist/clang/lib/ARCMigrate/
ObjCMT.cpp 126 // FIXME: StringSet should have insert(iter, iter) to use here.
128 WhiteListFilenames.insert(Val);
1395 // Insert CF_IMPLICIT_BRIDGING_ENABLE/CF_IMPLICIT_BRIDGING_DISABLED
1720 commit.insert(IFaceM->getEndLoc(), " NS_DESIGNATED_INITIALIZER");
1739 commit.insert(Loc, "#ifndef NS_ENUM\n@import Foundation;\n#endif\n");
1741 commit.insert(Loc, "#ifndef NS_ENUM\n#import <Foundation/Foundation.h>\n#endif\n");
1755 void insert(SourceLocation loc, StringRef text) override {
1819 void insert(SourceLocation Loc, StringRef Text) override {
1862 ObjCProtocolDecls.insert(PDecl->getCanonicalDecl());
2179 commit.insert(Loc, Entry.Text)
    [all...]

Completed in 60 milliseconds

1 2