Home
last modified time | relevance | path

Searched refs:uses (Results 251 - 275 of 386) sorted by relevance

1...<<111213141516

/third_party/libunwind/libunwind/doc/
H A Dlibunwind-ia64.tex14 The IA-64 version of \Prog{libunwind} uses a platform-string of
/third_party/node/deps/v8/src/compiler/
H A Dnode-matchers.h312 for (Node* use : input->uses()) { in OwnsInput()
754 // Skip addressing uses. in OwnedByAddressingOperand()
H A Dmemory-lowering.cc122 for (Node* use : graph()->start()->uses()) { in GetWasmInstanceNode()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DMachineCSE.cpp207 // If (and only if) we've eliminated all uses of the copy, also in PerformTrivialCopyPropagation()
276 /// instruction does not uses a physical register.
282 // First, add all uses to PhysRefs. in hasLivePhysRegDefUses()
298 // (which currently contains only uses), set the PhysUseDef flag. in hasLivePhysRegDefUses()
436 // If CSReg is used at all uses of Reg, CSE should not increase register in isProfitableToCSE()
557 // It's also not safe if the instruction uses physical registers. in ProcessBlockCSE()
568 // in between and the physical register uses were not clobbered. in ProcessBlockCSE()
569 // This can never be the case if the instruction both uses and in ProcessBlockCSE()
664 // their uses in all the instructions between CSMI and MI. in ProcessBlockCSE()
681 // kill flag on all uses o in ProcessBlockCSE()
[all...]
H A DSafeStack.cpp278 /// stack or not. The function analyzes all uses of AI and checks whether it is
281 // Go through all uses of this alloca and check whether all accesses to the in IsSafeStackAlloca()
288 // A DFS search through all uses of the alloca in bitcasts/PHI/GEPs/etc. in IsSafeStackAlloca()
291 for (const Use &UI : V->uses()) { in IsSafeStackAlloca()
345 // analysis here, which would look at all uses of an argument inside in IsSafeStackAlloca()
366 // All uses of the alloca are safe, we can place it on the safe stack. in IsSafeStackAlloca()
595 // Replace uses of the alloca with the new location. in moveStaticAllocasToUnsafeStack()
H A DStackColoring.cpp73 /// The user may write code that uses allocas outside of the declared lifetime
233 // <uses of b1, b3>;
237 // <uses of b2, b4, b5>;
266 // 3| <uses of b1, b3> | 6| <uses of b2, b4, b5> |
300 // uses of a variable outside of its lifetime start/end region. Here
306 // <uses of b2>
309 // <uses of b1>
312 // <uses of b3>
326 // 2| <uses o
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp750 for (const SDNode *U : Glue->uses()) in Schedule()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
H A DInstruction.cpp497 for (const Use &U : uses()) { in isUsedOutsideOfBlock()
498 // PHI nodes uses values in the corresponding predecessor block. For other in isUsedOutsideOfBlock()
/third_party/skia/third_party/externals/angle2/tools/flex-bison/third_party/skeletons/
H A Dyacc.c112 # uses only C89 types, so that the user can override the shorter
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DGlobalsModRef.cpp353 for (Use &U : V->uses()) { in AnalyzeUsesOfPointer()
388 // Ignore constants which don't have any live uses. in AnalyzeUsesOfPointer()
442 // Analyze all uses of the allocation. If any of them are used in a in AnalyzeIndirectGlobalMemory()
H A DIVDescriptors.cpp263 // - All uses of the PHI must be the reduction (safe). in AddReductionVar()
267 // uses must be of the same value. in AddReductionVar()
309 // A conditional reduction operation must only have 2 or less uses in in AddReductionVar()
350 // node is being used. In this case the user uses the value of the in AddReductionVar()
706 return all_of(I->uses(), [DT, DominatedBy](Use &U) { in isFirstOrderRecurrence()
992 // uses outside the induction def-use chain. in getCastsForInductionPHI()
H A DLoopInfo.cpp345 // No uses outside of the loop
421 // Check that 'BB' doesn't have any uses outside of the 'L'
431 for (const Use &U : I.uses()) {
440 // entry are special; uses in them don't need to go through PHIs.
450 // For each block we check that it doesn't have any uses outside of this loop.
457 // For each block we check that it doesn't have any uses outside of its
H A DModuleSummaryAnalysis.cpp180 bool HasNonAssumeUses = llvm::any_of(CI->uses(), [](const Use &CIU) { in addIntrinsicToSummary()
213 // Any non-call uses of the result of llvm.type.checked.load will in addIntrinsicToSummary()
653 // promotion, but we may have opaque uses e.g. in inline asm. We collect them in buildModuleSummaryIndex()
H A DMemorySSA.cpp388 /// uses no cache, etc., it can be relatively expensive.
941 // This walker pretends uses don't exist. If we're handed one, silently grab in findClobber()
942 // its def. (This has the nice side-effect of ensuring we never cache uses) in findClobber()
1187 /// being uses of the live on entry definition.
1314 /// Optimize the uses in a given block This is basically the SSA renaming
1479 /// Optimize uses to point to their actual clobbering definitions.
1510 // We do not define a live on exit for the immediate uses, and thus our in buildMemorySSA()
1511 // semantics do *not* imply that something with no immediate uses can simply in buildMemorySSA()
1556 // Mark the uses in unreachable blocks as live on entry, so that they go in buildMemorySSA()
1811 "Trying to remove memory access that still has uses"); in removeFromLookups()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DPredicateInfo.cpp93 // Operations that must appear last in a block, like successor phi node uses.
97 // Associate global and local DFS info with defs and uses, so we can sort them
126 // necessary to compare uses/defs in the same block. Doing so allows us to walk
146 // We want to put the def that will get used for a given set of phi uses, in operator ()()
147 // before those phi uses. in operator ()()
149 // Note that only phi nodes uses and defs can come last. in operator ()()
201 // Now sort by edge destination and then defs before uses. in comparePHIRelated()
209 // It's possible for the defs and uses to be null. For branches, the local in getMiddleDef()
239 // See if we have real values or uses. If we have real values, we are in localComesBefore()
262 // EdgeOnly, we need to pop the stack. We deliberately sort phi uses nex in stackIsInScope()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DSIShrinkInstructions.cpp413 return instAccessReg(MI->uses(), Reg, SubReg, TRI); in instReadsReg()
H A DSIWholeQuadMode.cpp271 /// Mark all instructions defining the uses in \p MI with \p Flag.
274 for (const MachineOperand &Use : MI.uses()) { in markInstructionUses()
320 // defs before uses, in particular so that we don't accidentally mark an in scanInstructions()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp29 /// the *uses* of an instruction, which allows us to answer the question "if I
341 // *uses* of a value, rather than its operands. Thus, if VN(A) == VN(B) we know
346 /// field of BasicExpression is used to store uses, not operands.
362 for (auto &U : I->uses())
392 /// Create an expression for I based on its opcode and its uses. If I
528 /// \c Inst uses or touches memory. Return an ID describing the memory state
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DLoopInfo.h1041 // \c L, but the pointer remains valid for non-dereferencing uses. in destroy()
1132 // we need to check two sets of uses for possible LCSSA violations at in movementPreservesLCSSAForm()
1136 // then the uses *of* Inst don't need to be checked. in movementPreservesLCSSAForm()
1139 for (Use &U : Inst->uses()) { in movementPreservesLCSSAForm()
/third_party/skia/third_party/externals/microhttpd/doc/
H A Dtexinfo.tex459 % Do not use \next, perhaps the caller of \parsearg uses it; reuse \temp:
1107 % PDF uses PostScript string constants for the names of xref targets,
2424 % Can't use plain's \frenchspacing because it uses the `\x notation, and
2481 % Unfortunately, TeX uses one parameter (\hyphenchar) to control
2676 % @url synonym for @uref, since that's how everyone uses it.
2697 % @kbdinputstyle -- arg is `distinct' (@kbd uses slanted tty font always),
2698 % `example' (@kbd uses ttsl only inside of @example and friends),
2699 % or `code' (@kbd uses normal tty font always).
2804 % which is what @var uses.
2813 % FYI, plain.tex uses \\ a
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dregister-allocator.cc2533 // Without this hack, all uses with "any" policy would get the constant in BuildLiveRanges()
3295 // There are no beneficial register uses. Look at any use at in ChooseOneOfTwoPredecessorStates()
3296 // all. We do not account for all uses, like flowing into a phi. in ChooseOneOfTwoPredecessorStates()
3298 TRACE("Looking at only uses\n"); in ChooseOneOfTwoPredecessorStates()
3397 int uses = val.second.used_registers[idx]; in ComputeStateFromManyPredecessors()
3398 if (uses == 0) continue; in ComputeStateFromManyPredecessors()
3399 if (uses > register_max || (conflict && uses == register_max)) { in ComputeStateFromManyPredecessors()
3401 register_max = uses; in ComputeStateFromManyPredecessors()
3786 // based on what to do based on forward uses, tryin in AllocateRegisters()
[all...]
/third_party/ffmpeg/tests/fate/
H A Dfilter-audio.mak315 # first 5 seconds uses packet format A and max LLE of -7.0db
316 # second 5 seconds uses packet format B and has a gain mismatch between channels
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h261 /// which link together all the uses of an SDNode.
268 /// Prev, Next - Pointers to the uses list of the SDNode referred by
628 /// List of uses for this SDNode.
728 /// Return true if there are no uses of this node.
736 /// Return the number of uses of this node. This method takes
737 /// time proportional to the number of uses.
785 /// Return true if this iterator is at the end of uses list.
816 /// Provide iteration support to walk over all uses of an SDNode.
823 inline iterator_range<use_iterator> uses() { in uses() function in llvm::SDNode
826 inline iterator_range<use_iterator> uses() cons in uses() function in llvm::SDNode
[all...]
/third_party/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_program.c811 return (src->ssa->uses.next == &src->use_link && in ntq_src_is_only_ssa_def_user()
812 src->ssa->uses.next->next == &src->ssa->uses); in ntq_src_is_only_ssa_def_user()
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_instr_alu.cpp453 if (m_dest->uses().size() > 1) in replace_dest()
741 for (auto b : r->uses()) { in register_priority()
1051 /* If a register is updates, we have to make sure that uses before that in do_ready()
1054 for (auto u : m_dest->uses()) { in do_ready()

Completed in 59 milliseconds

1...<<111213141516