HomeSort by relevance Sort by last modified time
    Searched refs:Blocks (Results 51 - 75 of 77) sorted by null

1 23 4

  /external/llvm/lib/CodeGen/
RegAllocGreedy.cpp 255 /// All basic blocks where the current register has uses.
578 // large blocks on targets with many physical registers.
    [all...]
MachineTraceMetrics.cpp 248 /// by all blocks preceding MBB in its trace. It does not include instructions
262 /// by this block and all blocks following it in its trace.
280 // pickTracePred() is called on the post-ordered blocks. During the downwards
405 // revisit blocks.
409 MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> Blocks;
413 LoopBounds(MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> blocks,
415 : Blocks(blocks), Loops(loops), Downward(false) {}
430 // Skip already visited To blocks.
431 MachineTraceMetrics::TraceBlockInfo &TBI = LB.Blocks[To->getNumber()]
    [all...]
MIRPrinter.cpp 406 Entry.Blocks.push_back(StrOS.str());
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 29 /// getExitingBlocks - Return all blocks inside the loop that have successors
30 /// outside of the loop. These are the blocks _inside of the current loop_
59 /// getExitBlocks - Return all of the successor blocks of this loop. These
60 /// are the blocks _outside of the current loop_ which are branched to.
188 assert((Blocks.empty() || LIB[getHeader()] == this) &&
226 assert(!Blocks.empty() && "Loop header is missing");
240 // Check the individual blocks.
294 "Loop does not contain all the blocks of a subloop!");
342 /// Discover a subloop with the specified backedges such that: All blocks within
436 // We reach this point once per subloop after processing all the blocks i
    [all...]
  /external/llvm/lib/Analysis/
VectorUtils.cpp 443 llvm::computeMinimumValueSizes(ArrayRef<BasicBlock *> Blocks, DemandedBits &DB,
459 for (auto *BB : Blocks)
  /external/clang/lib/AST/
CommentParser.cpp 764 SmallVector<BlockContentComment *, 8> Blocks;
766 Blocks.push_back(parseBlockContent());
772 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
CommentSema.cpp 547 ArrayRef<BlockContentComment *> Blocks) {
548 FullComment *FC = new (Allocator) FullComment(Blocks, ThisDeclInfo);
    [all...]
  /external/clang/lib/Frontend/Rewrite/
RewriteObjC.cpp 124 SmallVector<BlockExpr *, 32> Blocks;
    [all...]
RewriteModernObjC.cpp 132 SmallVector<BlockExpr *, 32> Blocks;
    [all...]
  /external/llvm/lib/Transforms/Utils/
LoopSimplify.cpp 18 // Loop exit-block insertion guarantees that all exit blocks from the loop
19 // (blocks which are outside of the loop that have predecessors inside of the
31 // Note that the simplifycfg pass will clean up blocks which are split out but
74 STATISTIC(NumInserted, "Number of pre-header or exit blocks inserted");
154 /// \brief Ensure that the loop preheader dominates all exit blocks.
156 /// This method is used to split exit blocks that have predecessors outside of
189 std::set<BasicBlock*> &Blocks) {
194 if (Blocks.insert(BB).second && BB != StopBlock)
311 // Determine which blocks should stay in L and which should be moved out to
329 // Now that we know which blocks are in L and which need to be moved t
    [all...]
  /external/clang/lib/Basic/
Module.cpp 64 .Case("blocks", LangOpts.Blocks)
  /external/v8/src/crankshaft/
lithium.h 289 bool Blocks(LOperand* operand) const {
  /external/clang/lib/Frontend/
InitPreprocessor.cpp 578 if (LangOpts.Blocks) {
    [all...]
CompilerInvocation.cpp     [all...]
  /external/llvm/lib/AsmParser/
LLParser.cpp     [all...]
  /external/v8/src/compiler/
instruction.h 662 bool Blocks(const InstructionOperand& destination) const {
915 // register allocation, to avoid searching for blocks from instruction
    [all...]
  /external/clang/lib/Analysis/
CFG.cpp 364 /// implicit fall-throughs without extra basic blocks.
388 // A list of blocks that end with a "goto" that must be backpatched to their
    [all...]
  /external/clang/lib/Lex/
PPMacroExpansion.cpp     [all...]
  /external/clang/lib/Sema/
SemaLambda.cpp 638 // In addition, in blocks in non-C++ modes, if all of the return
    [all...]
SemaType.cpp     [all...]
  /external/libvpx/libvpx/vpx_dsp/arm/
idct32x32_add_neon.asm 444 ; final coefficients are cut into four blocks:
449 ; Blocks A and C are straight calculation through the various stages. In
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/arm/neon/
vp9_idct32x32_add_neon.asm 444 ; final coefficients are cut into four blocks:
449 ; Blocks A and C are straight calculation through the various stages. In
    [all...]
  /external/llvm/test/Bindings/OCaml/
core.ml 775 (*===-- Basic Blocks ------------------------------------------------------===*)
    [all...]
  /art/compiler/optimizing/
nodes.h 275 // Control-flow graph of a method. Contains a list of basic blocks.
350 // Iterate over blocks to compute try block membership. Needs reverse post
367 // Need to add a couple of blocks to test if the loop body is entered and
372 // other blocks and has no instructions or phis.
377 // between the blocks, the lowest indices are used.
557 // List of blocks in insertion order.
560 // List of blocks to perform a reverse post order tree traversal.
563 // List of blocks to perform a linear order tree traversal.
584 // Flag whether there are any try/catch blocks in the graph. We will skip
655 // Make bit vector growable, as the number of blocks may change
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
winnt.h     [all...]

Completed in 1773 milliseconds

1 23 4