| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Use.h | 1 //===- llvm/Use.h - Definition of the Use class -----------------*- C++ -*-===//
10 /// This defines the Use class. The Use class represents the operand of an
11 /// instruction or some other User instance which refers to a Value. The Use
12 /// class keeps the "use list" of the referenced value up to date.
14 /// Pointer tagging is used to efficiently find the User corresponding to a Use
15 /// without having to store a User pointer in every Use. A User is preceded in
17 /// one of the fields (Prev) of the Use class are used to encode offsets to be
18 /// able to find that User given a pointer to any Use. For details, see
[all...] |
| Metadata.h | 184 /// Drop use of metadata (during teardown).
276 /// Shared implementation of use-lists for replaceable metadata.
279 /// use-lists and associated API for the two that support it (\a ValueAsMetadata
296 assert(UseMap.empty() && "Cannot destroy in-use replaceable metadata");
487 /// yet, and even once it does, changing each metadata schema to use it is its
1182 /// For use in constructing cyclic MDNode structures. A temporary MDNode is
1339 /// fairly expensive. Leave them unimplemented to discourage their use
1340 /// (clients can use std::deque, std::list, BumpPtrAllocator, etc.).
1344 Metadata **Use = nullptr;
1357 if (Use)
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/dsymutil/ |
| Reproducer.h | 22 Use,
61 /// Reproducer instance used to use an existing reproducer. The VFS returned by
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_dlsym.h | 23 static bool Use() {
24 // Fuchsia doesn't use dlsym-based interceptors.
29 // Fuchsia doesn't use dlsym-based interceptors.
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_dlsym.h | 23 static bool Use() {
24 // Fuchsia doesn't use dlsym-based interceptors.
29 // Fuchsia doesn't use dlsym-based interceptors.
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonOptimizeSZextends.cpp | 79 Instruction* Use = cast<Instruction>(*UI);
80 SExtInst* SI = new SExtInst(&Arg, Use->getType());
82 (EVT::getEVT(Use->getType())));
84 Use->replaceAllUsesWith(SI);
87 Use->eraseFromParent();
133 const Use &TheUse = UI.getUse();
|
| HexagonHardwareLoops.cpp | 231 /// instruction would not use a bumped value that has not yet been
736 // If so, use the immediate value rather than the register.
926 // If the loop has been unrolled, we should use the original loop count
991 // Call is not allowed because the callee may use a hardware loop except for
1011 /// the use of the hardware loop instruction.
1049 // parent block, and the only use of that phi node is this instruction, then
1067 MachineOperand &Use = *J;
1068 MachineInstr *UseMI = Use.getParent();
1101 MachineOperand &Use = *I;
1105 if (Use.isDebug()
[all...] |
| HexagonLoopIdiomRecognition.cpp | 246 void use(Value *V);
366 use(Root);
377 void Simplifier::Context::use(Value *V) { function in class:Simplifier::Context
378 auto Use = [this](Instruction *U) -> bool {
382 traverse(V, Use);
427 use(Root);
455 use(Root);
677 Use &TheUse = UI.getUse();
2195 // header to use the new preheader.
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNDPPCombine.cpp | 9 // operand. If any of the use instruction cannot be combined with the mov the
435 // We could use: assert(!OldOpndValue || OldOpndValue->isImm())
493 for (auto &Use : MRI->use_nodbg_operands(DPPMovReg)) {
494 Uses.push_back(&Use);
498 MachineOperand *Use = Uses.pop_back_val();
501 auto &OrigMI = *Use->getParent();
542 if (Use != Src0 && !(Use == Src1 && OrigMI.isCommutable())) { // [1]
558 if (Use == Src0) {
565 assert(Use == Src1 && OrigMI.isCommutable()); // by check [1
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| SystemZElimCompare.cpp | 52 Use |= Other.Use;
56 explicit operator bool() const { return Def || Use; }
61 bool Use = false;
153 Ref.Use = true;
373 // If the caller will change MI to use ConvOpc, only test whether
413 // Use CCMASK_CMP_EQ to match with CCUsers. On success CCMask:s will be
433 // Fail if this isn't a use of CC that we understand.
518 // deleted as dead. CCUsers is the list of instructions that use the CC
538 if (!CCRefs.Use && !SrcRefs)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| DeadArgumentElimination.cpp | 38 #include "llvm/IR/Use.h"
98 /// deletes arguments to functions which are external. This is only for use
113 "Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)",
219 // Finally, remove the old call from the program, reducing the use-count of
305 for (Use &U : Fn.uses()) {
356 /// MarkIfNotLive - This checks Use for liveness in LiveValues. If Use is not
357 /// live, it adds Use to the MaybeLiveUses argument. Returns the determined
358 /// liveness of Use
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| UninitializedValues.cpp | 217 // Classification of DeclRefExprs as use or initialization.
262 /// Classify each DeclRefExpr as an initialization or a use. Any
269 Use,
385 // use.
387 classify(BO->getLHS(), Use);
396 classify(UO->getSubExpr(), Use);
401 classify(cast<Expr>(S), Use);
422 classify(CE->getArg(0), Use);
448 classify(CE->getSubExpr(), Use);
505 UninitUse Use(ex, isAlwaysUninit(v))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| FixupStatepointCallerSaved.cpp | 130 MachineInstr *Def = nullptr, *Use = nullptr;
132 if (It->readsRegister(Reg, &TRI) && !Use)
133 Use = &*It;
162 if (!Use) {
196 // Cache used frame indexes during statepoint re-write to re-use them in
|
| RDFLiveness.cpp | 279 // for cases where the reached use is not covered by any of the defs
281 // of that use to the entry of the block.
285 // ..., u3<D1>(d2) This use needs to be live on entry.
347 // Go over all phi uses and get the reaching defs for each use.
348 for (auto U : PA.Addr->members_if(DFG.IsRef<NodeAttrs::Use>, DFG)) {
380 NodeAddr<RefNode*> Clob, Use;
382 // is the closest to the output of I, i.e. def > clobber > use.
392 Use = R;
397 if (Use.Id != 0)
398 return Use;
[all...] |
| MachineInstr.cpp | 167 /// this instruction from their respective use lists. This requires that the
168 /// operands already be on their use lists.
176 /// this instruction from their respective use lists. This requires that the
177 /// operands not be on their use lists yet.
186 assert(MBB && "Use MachineInstrBuilder to add operands to dangling instrs");
188 assert(MF && "Use MachineInstrBuilder to add operands to dangling instrs");
193 /// ranges. If MRI is non-null also update use-def chains.
198 // MachineOperand is a trivially copyable type so we can just use memmove.
270 // Copy Op into place. It still needs to be inserted into the MRI use lists.
940 // Check if Reg is constrained by some of its use/def from MI
[all...] |
| ScheduleDAGInstrs.cpp | 70 cl::desc("Enable use of AA during MI DAG construction"));
72 static cl::opt<bool> UseTBAA("use-tbaa-in-sched-mi", cl::Hidden,
73 cl::init(true), cl::desc("Enable use of TBAA during MI DAG construction"));
82 cl::init(1000), cl::desc("The limit to use while constructing the DAG "
240 // Only use any non-zero latency for real defs/uses, in contrast to
252 // Adjust the dependence latency using operand def/use information,
260 // Set the hasPhysRegDefs only for physreg defs that have a use within
302 // dependencies we use a latency of 0 because for a multi-issue
332 // Push this SUnit on the use list.
445 MachineInstr *Use = UseSU->getInstr()
[all...] |
| ModuloSchedule.cpp | 73 // stage difference for each use. Keep the maximum value.
349 /// Return true if the register has a use that occurs outside the
369 // comes from the prolog. The prolog to use depends on to which kernel/
435 // If the Phi hasn't been scheduled, then use the initial Phi operand
436 // value. Otherwise, use the scheduled version of the instruction. This
485 // Use the loop value defined in the kernel, unless the kernel
491 // Use the value defined by the Phi. We add one because we switch
496 // Use the loop value defined in the kernel.
500 // Use the value defined by the Phi, unless we're generating the first
566 // If the Phi has been scheduled, use the new name for rewriting
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyRegStackify.cpp | 13 /// such that they form single-use expression trees. Registers fitting this form
73 "Reorder instructions to use the WebAssembly value stack",
137 // All calls can use the stack pointer.
281 // Test whether Reg, as defined at Def, has exactly one use. This is a
313 static bool isSafeToMove(const MachineOperand *Def, const MachineOperand *Use,
318 const MachineInstr *UseI = Use->getParent();
342 if (&PriorUse == Use)
387 // different times, and we need to make sure we don't move our use across
429 /// Test whether OneUse, a use of Reg, dominates all of Reg's other uses.
441 for (const MachineOperand &Use : MRI.use_nodbg_operands(Reg))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| AnalysisBasedWarnings.cpp | 811 /// uninitialized use of a variable.
812 static void DiagUninitUse(Sema &S, const VarDecl *VD, const UninitUse &Use,
816 switch (Use.getKind()) {
818 S.Diag(Use.getUser()->getBeginLoc(), diag::warn_uninit_var)
820 << Use.getUser()->getSourceRange();
827 << (Use.getKind() == UninitUse::AfterDecl ? 4 : 5)
830 S.Diag(Use.getUser()->getBeginLoc(), diag::note_uninit_var_use)
831 << IsCapturedByBlock << Use.getUser()->getSourceRange();
841 // Diagnose each branch which leads to a sometimes-uninitialized use.
842 for (UninitUse::branch_iterator I = Use.branch_begin(), E = Use.branch_end()
1553 getUses(uses, vd).getPointer()->push_back(use); variable
1558 getUses(constRefUses, vd).getPointer()->push_back(use); variable
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| RDFGraph.h | 19 // instance of accessing a register, e.g. a definition or a use. Nodes are
73 // the id of the first reached use, and the id of the first reached def.
74 // Each def and use will contain the id of the reaching def, and also the
75 // id of the next reached def (for def nodes) or use (for use nodes).
79 // reached use.
80 // - Use node contains: reaching def and sibling.
86 // |Def |Use | |
102 // the def-def, def-use links shown above.
123 // ment, d - def, u - use)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 138 UseMBPI("use-mbpi",
139 cl::desc("use Machine Branch Probability Info"),
632 // Otherwise this is another use or second copy use.
638 // Use MI's debug location, which describes where Variable was
1054 // We use bit-negation to more clearly enforce that node id -1 can only be
1402 // Use SelectionDAG argument lowering
1572 // Use a different message for terminator misses.
1691 /// allocation, use physical registers. This creates an issue for us since
1875 // Since we're not going to use the final bit test, remove it
[all...] |
| DAGCombiner.cpp | 92 cl::desc("Enable DAG combiner's use of IR alias analysis"));
95 UseTBAA("combiner-use-tbaa", cl::Hidden, cl::init(true),
96 cl::desc("Enable DAG combiner's use of TBAA"));
101 cl::desc("Only use DAG-combiner alias analysis in this"
217 // Before we do any work, remove nodes that are not in use.
247 // We use the minimum store size here, since that's all we can guarantee
268 // zero-use deletion strategy.
757 /// single-use) and if missed an empty SDValue is returned.
925 /// Return true if this is a SetCC-equivalent operation with only one use.
1073 // iff (op x, c1) has one use
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/ |
| CoroFrame.cpp | 475 /// This function use StackLifetime algorithm to partition the AllocaInsts in
496 // can just point to any index in the frame. Use index 0.
568 // function has multiple exits, so we use this helper to avoid redundant code.
902 /// 1. For all the value in the Frame, we search the use of dbg.declare to find
1010 // many i32 and i64 types in one coroutine. And we would use i32_0 and
1192 // We use a pointer use visitor to track how an alloca is being used.
1200 // a. List of all BasicBlocks that use this alloca or any of the aliases of
1529 // AllocaInst. So We cast GEP to the AllocaInst here to re-use
1595 // If we have not seen the use block, create a load instruction to reloa
[all...] |
| /src/external/apache2/llvm/dist/llvm/bindings/go/llvm/ |
| ir.go | 26 // We use these weird structs here because *Ref types are pointers and
58 Use struct {
90 func (c Use) IsNil() bool { return c.C == nil }
794 func (v Value) FirstUse() (u Use) { u.C = C.LLVMGetFirstUse(v.C); return }
795 func (u Use) NextUse() (ru Use) { ru.C = C.LLVMGetNextUse(u.C); return }
796 func (u Use) User() (v Value) { v.C = C.LLVMGetUser(u.C); return }
797 func (u Use) UsedValue() (v Value) { v.C = C.LLVMGetUsedValue(u.C); return }
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 62 #include "llvm/IR/Use.h"
427 for (Use &Op : I->operands())
1105 for (Use &U : make_early_inc_range(BonusInst.uses())) {
1109 else // Use is in the same block as, and comes before, NewBonusInst.
1612 // Make the PHI node use the select for all incoming values for BB1/BB2
1668 // exactly zero or one use, and we check later that use is by a single, common
1690 // Each instruction must have zero or one use.
1703 // use, check that the only user is a PHI or in the same block as the
1849 // Arbitrarily use I0 as the new "common" instruction; remap its operand
[all...] |
