Home
last modified time | relevance | path

Searched refs:traversal (Results 1 – 25 of 55) sorted by relevance

123

/llvm-project/mlir/docs/Tools/
H A Dmlir-reduce.md25 to the tree traversal strategy. The different strategies may lead to different
27 `-reduction-tree='traversal-mode=0'` to select the mode for example.
49 mlir-reduce $INPUT -reduction-tree='traversal-mode=0 test=$TEST_SCRIPT'
122 * `-reduction-tree` now only supports `Single-Path` traversal mode, extends it
123 with different traversal strategies may reduce the input better.
/llvm-project/mlir/lib/Analysis/
H A DTopologicalSortUtils.cpp161 llvm::ReversePostOrderTraversal<Block *> traversal(&b); in getBlocksSortedByDominance() local
162 blocks.insert(traversal.begin(), traversal.end()); in getBlocksSortedByDominance()
/llvm-project/mlir/include/mlir/Reducer/
H A DPasses.td33 Option<"traversalModeId", "traversal-mode", "unsigned",
35 "The graph traversal mode, the default is single-path mode">,
/llvm-project/llvm/test/Transforms/StructurizeCFG/workarounds/
H A Dneeds-unified-loop-exits.ll4 ; The structurizer uses an RPO traversal over a region, along with a
15 ; any confusion in the hacked RPO traversal.
19 ; the incorrect traversal, B1 dominates all the blocks in the
96 ; traversal, H2 dominates H3 in the structurized program, and the
/llvm-project/mlir/test/mlir-reduce/
H A Dsimple-test.mlir2 // RUN: mlir-reduce %s -reduction-tree='traversal-mode=0 test=%S/test.sh'
H A Dcrashop-reduction.mlir2 // RUN: mlir-reduce %s -reduction-tree='traversal-mode=0 test=%S/failure-test.sh' | FileCheck %s
H A Dmultiple-function.mlir2 // RUN: mlir-reduce %s -reduction-tree='traversal-mode=0 test=%S/failure-test.sh' | FileCheck %s
/llvm-project/clang/test/Analysis/
H A Dretain-release-cache-out.m4 // checkers, testing that the traversal order in the CFG does not affect the
/llvm-project/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll3 ; The structurize cfg pass used to do a post-order traversal to generate a list
6 ; The fix for this was to do a reverse post-order traversal which is what the
H A Dinterleaved-loop-order.ll5 ; for which there is an interleaved post-order traversal.
155 ; interleaved post-order traversal.
/llvm-project/compiler-rt/lib/xray/
H A Dxray_profiling_flags.inc21 "Maximum size of the traversal stack allocator.")
/llvm-project/llvm/test/Other/
H A Dcgscc-disconnected-invalidation.ll2 ; graph mid-traversal and then invalidate it function correctly.
/llvm-project/llvm/test/Bitcode/
H A Dmdnodes-distinct-nodes-break-cycles.ll7 ; entry point is !2, a naive post-order traversal would give !3, !1, !2; but
H A Dmetadata-function-blocks.ll19 ; Each node gets a new number. Bottom-up traversal of nodes.
/llvm-project/llvm/test/CodeGen/ARM/
H A D2011-04-27-IfCvtBug.ll6 ; traversal of all BBs work just fine.
/llvm-project/clang/docs/
H A DLibClang.rst62 The elements of an AST can be recursively visited with pre-order traversal with ``clang_visitChildr…
89 #. ``CXChildVisit_Break``: Terminates the cursor traversal
91 #. ``CXChildVisit_Continue``: Continues the cursor traversal with the next sibling of the cursor ju…
H A DIntroductionToTheClangAST.rst86 It allows traversal of the whole translation unit starting from
H A DRAVFrontendAction.rst82 // Return false to stop the traversal of the AST.
/llvm-project/mlir/docs/Tutorials/
H A DUnderstandingTheIRStructure.md13 and so will our traversal:
27 wraps a list of `Operation`s. Our traversal will follow this structure with
203 `AllocOp` nested inside the function and interrupt the traversal if one of them
/llvm-project/llvm/test/Transforms/LoopPredication/
H A Dunswitch-exit-loop.ll21 ;; synthetic corner case that demonstrates the need for more careful traversal
/llvm-project/clang/test/Modules/
H A Dcrash-vfs-path-traversal.m4 // FIXME: Canonicalizing paths to remove relative traversal components
/llvm-project/mlir/docs/
H A DPatternRewriter.md330 The driver performs a post-order traversal. Note that it walks regions of the
371 * Top-down traversal: Traverse the container op/region top down and in
373 * Bottom-up traversal: This is the default setting. It builds the initial
374 worklist with a postorder traversal and then reverses the worklist. This may
/llvm-project/mlir/include/mlir/Dialect/Linalg/IR/
H A DLinalgInterfaces.td733 (i.e. the data traversal order) is not a simple permutation of the loop
734 traversal order. It is then possible to define ops with skewed data
735 traversal order for which we can still easily compute hyperrectangular
/llvm-project/clang/docs/analyzer/developer-docs/
H A DDebugChecks.rst47 path traversal. This is indented to show the call stack, but does NOT do any
52 during a path traversal ("IfStmt", "WhileStmt", etc). Currently used to check
/llvm-project/llvm/test/CodeGen/AMDGPU/
H A Dsi-lower-i1-copies-order-of-phi-incomings.mir7 # traversal. Because of that, incomings in phis created by SDAG are sorted,

123