HomeSort by: relevance | last modified time | path
    Searched refs:Old (Results 1 - 25 of 141) sorted by relevancy

1 2 3 4 5 6

  /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
Mutations.cpp 49 static void replace(syntax::Node *Old, syntax::Node *New) {
50 assert(Old != nullptr);
51 assert(Old->Parent != nullptr);
52 assert(Old->canModify());
58 New->Role = Old->Role;
59 auto *P = Old->getParent();
60 P->replaceChildRangeLowLevel(Old, Old->getNextSibling(), New);
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyRegColoring.cpp 138 unsigned Old = LI->reg();
140 const TargetRegisterClass *RC = MRI->getRegClass(Old);
143 if (!MRI->isLiveIn(Old))
157 Changed |= Old != New;
161 if (Old != New && MFI.isFrameBaseVirtual() && MFI.getFrameBaseVreg() == Old)
171 unsigned Old = SortedIntervals[I]->reg();
173 if (Old != New)
174 MRI->replaceRegWith(Old, New);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
ConstantMerge.cpp 105 static CanMerge makeMergeable(GlobalVariable *Old, GlobalVariable *New) {
106 if (!Old->hasGlobalUnnamedAddr() && !New->hasGlobalUnnamedAddr())
108 if (hasMetadataOtherThanDebugLoc(Old))
111 if (!Old->hasGlobalUnnamedAddr())
116 static void replace(Module &M, GlobalVariable *Old, GlobalVariable *New) {
119 LLVM_DEBUG(dbgs() << "Replacing global: @" << Old->getName() << " -> @"
123 if (Old->getAlign() || New->getAlign())
124 New->setAlignment(std::max(getAlign(Old), getAlign(New)));
126 copyDebugLocMetadata(Old, New);
127 Old->replaceAllUsesWith(NewConstant)
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerValueBitMap.h 37 uintptr_t Old = Map[WordIdx];
38 uintptr_t New = Old | (1UL << BitIdx);
40 return New != Old;
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
Pointer.cpp 42 Block *Old = Pointee;
54 if (Old)
55 Old->cleanup();
59 Block *Old = Pointee;
71 if (Old)
72 Old->cleanup();
  /src/sys/external/bsd/acpica/dist/utilities/
utclib.c 151 char *Old = (char *) Src;
154 if (Old > New)
160 *New = *Old;
162 Old++;
166 else if (Old < New)
171 Old = Old + Count - 1;
174 *New = *Old;
176 Old--;
206 char *Old = (char *) Src
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Allocator.h 86 // Manually implement a move constructor as we must clear the old allocator's
88 BumpPtrAllocatorImpl(BumpPtrAllocatorImpl &&Old)
89 : AllocatorT(static_cast<AllocatorT &&>(Old)), CurPtr(Old.CurPtr),
90 End(Old.End), Slabs(std::move(Old.Slabs)),
91 CustomSizedSlabs(std::move(Old.CustomSizedSlabs)),
92 BytesAllocated(Old.BytesAllocated), RedZoneSize(Old.RedZoneSize) {
93 Old.CurPtr = Old.End = nullptr
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineJumpTableInfo.h 112 /// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update
114 bool ReplaceMBBInJumpTables(MachineBasicBlock *Old, MachineBasicBlock *New);
116 /// ReplaceMBBInJumpTable - If Old is a target of the jump tables, update
118 bool ReplaceMBBInJumpTable(unsigned Idx, MachineBasicBlock *Old,
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LiveRangeShrink.cpp 72 /// Returns \p New if it's dominated by \p Old, otherwise return \p Old.
75 /// If \p New is not in \p M, return \p Old. Otherwise if \p Old is null, return
78 MachineInstr *Old,
82 return Old;
83 if (Old == nullptr)
85 unsigned OrderOld = M.find(Old)->second;
88 return OrderOld < OrderNew ? &New : Old;
89 // OrderOld == OrderNew, we need to iterate down from Old to see if i
    [all...]
MachineFunction.cpp 309 // Remove use of the old number.
911 void MachineFunction::copyCallSiteInfo(const MachineInstr *Old,
913 assert(Old->shouldUpdateCallSiteInfo() &&
918 return eraseCallSiteInfo(Old);
920 const MachineInstr *OldCallMI = getCallInstr(Old);
929 void MachineFunction::moveCallSiteInfo(const MachineInstr *Old,
931 assert(Old->shouldUpdateCallSiteInfo() &&
936 return eraseCallSiteInfo(Old);
938 const MachineInstr *OldCallMI = getCallInstr(Old);
959 void MachineFunction::substituteDebugValuesForInst(const MachineInstr &Old,
    [all...]
InterleavedLoadCombinePass.cpp 14 // pattern that is detectable by InterleavedAccesPass. The old instructions are
417 // | out of the old exponent
422 // | the old exponent
753 VectorInfo Old(VTy);
754 if (!compute(Op, Old, DL))
760 ElementInfo(Old.EI[i / Factor].Ofs + j * NewSize,
761 j == 0 ? Old.EI[i / Factor].LI : nullptr);
765 Result.BB = Old.BB;
766 Result.PV = Old.PV;
767 Result.LIs.insert(Old.LIs.begin(), Old.LIs.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/MSP430/
MSP430FrameLowering.cpp 231 MachineInstr &Old = *I;
232 uint64_t Amount = TII.getFrameSize(Old);
240 if (Old.getOpcode() == TII.getCallFrameSetupOpcode()) {
242 BuildMI(MF, Old.getDebugLoc(), TII.get(MSP430::SUB16ri), MSP430::SP)
246 assert(Old.getOpcode() == TII.getCallFrameDestroyOpcode());
248 Amount -= TII.getFramePoppedByCallee(Old);
250 New = BuildMI(MF, Old.getDebugLoc(), TII.get(MSP430::ADD16ri),
268 MachineInstr &Old = *I;
270 BuildMI(MF, Old.getDebugLoc(), TII.get(MSP430::SUB16ri), MSP430::SP)
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaExceptionSpec.cpp 261 const FunctionProtoType *Old, SourceLocation OldLoc,
287 bool Sema::CheckEquivalentExceptionSpec(FunctionDecl *Old, FunctionDecl *New) {
309 if (exceptionSpecNotKnownYet(Old) || exceptionSpecNotKnownYet(New)) {
310 DelayedEquivalentExceptionSpecChecks.push_back({New, Old});
318 Old->getType()->getAs<FunctionProtoType>(), Old->getLocation(),
327 hasImplicitExceptionSpec(Old) != hasImplicitExceptionSpec(New)) {
329 << hasImplicitExceptionSpec(Old);
330 if (Old->getLocation().isValid())
331 Diag(Old->getLocation(), diag::note_previous_declaration)
    [all...]
SemaDecl.cpp 1563 /// We've determined that \p New is a redeclaration of \p Old. Check that they
1565 bool Sema::CheckRedeclarationModuleOwnership(NamedDecl *New, NamedDecl *Old) {
1571 Old->getOwningModuleForLinkage() != New->getOwningModuleForLinkage()) {
1572 New->setLocalOwningModule(Old->getOwningModule());
1578 Module *OldM = Old->getOwningModule();
1600 Diag(Old->getLocation(), diag::note_previous_declaration);
2168 NamedDecl *Old = Filter.next();
2171 if (S.isVisible(Old))
2176 if (auto *OldTD = dyn_cast<TypedefNameDecl>(Old)) {
2194 bool Sema::isIncompatibleTypedef(TypeDecl *Old, TypedefNameDecl *New)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
CallGraphSCCPass.h 103 /// Old node has been deleted, and New is to be used in its place.
104 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
107 /// Old node has been deleted.
108 void DeleteNode(CallGraphNode *Old);
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
ASTUnresolvedSet.h 62 bool replace(const NamedDecl *Old, NamedDecl *New, AccessSpecifier AS) {
64 if (I->getDecl() == Old) {
UnresolvedSet.h 102 bool replace(const NamedDecl* Old, NamedDecl *New) {
104 if (I->getDecl() == Old)
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
SCCIterator.h 133 /// This informs the \c scc_iterator that the specified \c Old node
135 void ReplaceNode(NodeRef Old, NodeRef New) {
136 assert(nodeVisitNumbers.count(Old) && "Old not in scc_iterator?");
139 auto tempVal = nodeVisitNumbers[Old];
141 nodeVisitNumbers.erase(Old);
  /src/external/apache2/llvm/dist/llvm/include/llvm/DWARFLinker/
DWARFLinkerCompileUnit.h 37 const auto &Old = *I;
38 assert(Old.getType() == DIEValue::isInteger);
39 *I = DIEValue(Old.getAttribute(), Old.getForm(), DIEInteger(New));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 90 SUnit *ScheduleDAGSDNodes::Clone(SUnit *Old) {
91 SUnit *SU = newSUnit(Old->getNode());
92 SU->OrigNode = Old->OrigNode;
93 SU->Latency = Old->Latency;
94 SU->isVRegCycle = Old->isVRegCycle;
95 SU->isCall = Old->isCall;
96 SU->isCallOp = Old->isCallOp;
97 SU->isTwoAddress = Old->isTwoAddress;
98 SU->isCommutable = Old->isCommutable;
99 SU->hasPhysRegDefs = Old->hasPhysRegDefs
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
ValueMapper.cpp 62 DelayedBasicBlock(const BlockAddress &Old)
63 : OldBB(Old.getBasicBlock()),
64 TempBB(BasicBlock::Create(Old.getContext())) {}
633 Metadata *Old = N.getOperand(I);
634 Metadata *New = mapOperand(Old);
635 if (Old != New)
636 LLVM_DEBUG(dbgs() << "Replacing Op " << Old << " with " << New << " in "
639 if (Old != New)
748 remapOperands(*ClonedN, [this, &D, &G](Metadata *Old) {
749 if (Optional<Metadata *> MappedOp = getMappedOp(Old))
    [all...]
BasicBlockUtils.cpp 304 // Finally, erase the old block and update dominator info.
483 // Replace all uses of the old instruction, and delete it.
760 static BasicBlock *SplitBlockImpl(BasicBlock *Old, Instruction *SplitPt,
766 return splitBlockBefore(Old, SplitPt,
774 BasicBlock *New = Old->splitBasicBlock(
775 SplitIt, Name.empty() ? Old->getName() + ".split" : Name);
777 // The new block lives in whichever loop the old one did. This preserves
780 if (Loop *L = LI->getLoopFor(Old))
785 // Old dominates New. New node dominates all other nodes dominated by Old
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/InstCombine/
InstCombiner.h 391 /// Inserts an instruction \p New before instruction \p Old
395 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
398 BasicBlock *BB = Old.getParent();
399 BB->getInstList().insert(Old.getIterator(), New); // Insert inst
405 Instruction *InsertNewInstWith(Instruction *New, Instruction &Old) {
406 New->setDebugLoc(Old.getDebugLoc());
407 return InsertNewInstBefore(New, Old);
436 /// Replace operand of instruction and add old operand to the worklist.
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARC/
ARCFrameLowering.cpp 472 MachineInstr &Old = *I;
473 DebugLoc dl = Old.getDebugLoc();
474 unsigned Amt = Old.getOperand(0).getImm();
477 if (Amt > AFI->MaxCallStackReq && Old.getOpcode() == ARC::ADJCALLSTACKDOWN)
481 assert((Old.getOpcode() == ARC::ADJCALLSTACKDOWN ||
482 Old.getOpcode() == ARC::ADJCALLSTACKUP) &&
484 bool IsAdd = (Old.getOpcode() == ARC::ADJCALLSTACKUP);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Value.cpp 359 // Remove old name.
389 // Remove old name.
1048 // point into the old table. Handle this by checking for reallocation and
1153 void ValueHandleBase::ValueIsRAUWd(Value *Old, Value *New) {
1154 assert(Old->HasValueHandle &&"Should only be called if ValueHandles present");
1155 assert(Old != New && "Changing value into itself!");
1156 assert(Old->getType() == New->getType() &&
1161 LLVMContextImpl *pImpl = Old->getContext().pImpl;
1162 ValueHandleBase *Entry = pImpl->ValueHandles[Old];
1181 // Weak goes to the new value, which will unlink it from Old's list
    [all...]

Completed in 86 milliseconds

1 2 3 4 5 6