Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 428) sorted by relevance

12345678910>>...18

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_schedule_tree.c511 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_update_anchored()
614 return tree ? tree->ctx : NULL; in isl_schedule_tree_get_ctx()
763 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_reset_children()
778 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_drop_child()
813 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_replace_child()
858 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_set_children()
1053 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_band_member_set_coincident()
1091 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_band_set_permutable()
1161 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_band_set_partial_schedule()
1201 tree = isl_schedule_tree_cow(tree); in isl_schedule_tree_band_member_set_ast_loop_type()
[all …]
H A Disl_schedule_tree.h77 __isl_keep isl_schedule_tree *tree);
86 __isl_keep isl_schedule_tree *tree);
88 __isl_take isl_schedule_tree *tree);
119 __isl_keep isl_schedule_tree *tree);
122 __isl_keep isl_schedule_tree *tree);
126 __isl_keep isl_schedule_tree *tree);
128 __isl_take isl_schedule_tree *tree,
159 __isl_take isl_schedule_tree *tree,
165 __isl_take isl_schedule_tree *tree,
204 __isl_take isl_schedule_tree *tree,
[all …]
H A Disl_schedule_node.c46 node->tree = tree; in isl_schedule_node_alloc()
1121 node->tree = tree; in isl_schedule_node_ancestor()
1190 tree = node->tree; in isl_schedule_node_child()
1196 node->tree = tree; in isl_schedule_node_child()
1244 node->tree = tree; in isl_schedule_node_previous_sibling()
1280 node->tree = tree; in isl_schedule_node_next_sibling()
2432 if (pos->tree == tree) { in isl_schedule_node_graft_tree()
2442 pos->tree = tree; in isl_schedule_node_graft_tree()
3135 tree = group_band(tree, pos, data); in group_ancestor()
4773 data.tree = tree; in isl_schedule_node_expand()
[all …]
H A Disl_schedule_read.c106 tree = isl_schedule_tree_insert_context(tree, context); in read_context()
109 return tree; in read_context()
157 tree = isl_schedule_tree_insert_domain(tree, domain); in read_domain()
160 return tree; in read_domain()
212 if (!tree) in read_expansion()
231 if (!tree) in read_expansion()
334 tree = isl_schedule_tree_insert_filter(tree, filter); in read_filter()
385 tree = isl_schedule_tree_insert_guard(tree, guard); in read_guard()
437 tree = isl_schedule_tree_insert_mark(tree, mark); in read_mark()
587 if (tree) in read_band()
[all …]
H A Disl_schedule.c44 if (!tree) in isl_schedule_from_schedule_tree()
58 schedule->root = tree; in isl_schedule_from_schedule_tree()
76 isl_schedule_tree *tree; in isl_schedule_from_domain() local
108 isl_schedule_tree *tree; in isl_schedule_cow() local
140 if (!schedule || !tree) in isl_schedule_set_root()
151 schedule->root = tree; in isl_schedule_set_root()
216 isl_schedule_tree *tree; in isl_schedule_get_root() local
571 tree = isl_schedule_tree_child(tree, 0); in insert_filter_in_child_of_type()
575 tree = isl_schedule_tree_children_insert_filter(tree, filter); in insert_filter_in_child_of_type()
577 tree = isl_schedule_tree_insert_filter(tree, filter); in insert_filter_in_child_of_type()
[all …]
H A Dcodegen.c122 isl_ast_node *tree; in construct_ast_from_union_map() local
135 return tree; in construct_ast_from_union_map()
184 isl_ast_node *tree; in construct_ast_from_schedule() local
191 tree = isl_ast_build_node_from_schedule(build, schedule); in construct_ast_from_schedule()
194 return tree; in construct_ast_from_schedule()
207 isl_ast_node *tree = NULL; in main() local
228 tree = construct_ast_from_union_map(umap, s); in main()
230 tree = construct_ast_from_union_map(obj.v, s); in main()
232 tree = construct_ast_from_schedule(obj.v); in main()
242 p = isl_printer_print_ast_node(p, tree); in main()
[all …]
H A Disl_schedule_node_private.h30 isl_schedule_tree *tree; member
34 __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree,
37 __isl_take isl_schedule_node *pos, __isl_take isl_schedule_tree *tree);
50 __isl_take isl_schedule_tree *tree);
/llvm-project-15.0.7/mlir/tools/mlir-tblgen/
H A DRewriterGen.cpp379 if (tree.isNativeCodeCall()) { in emitMatch()
384 if (tree.isOperation()) { in emitMatch()
581 auto name = tree.getSymbol(); in emitOpMatch()
847 emitMatch(tree, opName, depth); in emitMatchLogic()
922 if (tree.isOperation()) { in collectOps()
1135 if (tree.getNumArgs() != 1) { in handleReplaceWithValue()
1144 return tree.getArgName(0); in handleReplaceWithValue()
1154 if (tree.getNumArgs() == 0) in handleLocationDirective()
1158 if (!tree.getSymbol().empty()) in handleLocationDirective()
1161 if (tree.getNumArgs() == 1) { in handleLocationDirective()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A D2009-08-21-PostRAKill.ll7 %struct.tree = type { i32, double, double, %struct.tree*, %struct.tree*, %struct.tree*, %struct.tre…
8 @g = common global %struct.tree* null
10 define %struct.tree* @tsp(%struct.tree* %t, i32 %nproc) nounwind {
19 %0 = load %struct.tree*, %struct.tree** @g, align 4 ; <%struct.tree*> [#uses=2]
20 %.idx45.i = getelementptr %struct.tree, %struct.tree* %0, i32 0, i32 1 ; <double*> [#uses=1]
22 %.idx46.i = getelementptr %struct.tree, %struct.tree* %0, i32 0, i32 2 ; <double*> [#uses=1]
/llvm-project-15.0.7/polly/lib/External/pet/include/
H A Dpet.h297 isl_ctx *pet_tree_get_ctx(__isl_keep pet_tree *tree);
300 __isl_give pet_tree *pet_tree_copy(__isl_keep pet_tree *tree);
302 __isl_null pet_tree *pet_tree_free(__isl_take pet_tree *tree);
305 __isl_give pet_loc *pet_tree_get_loc(__isl_keep pet_tree *tree);
308 enum pet_tree_type pet_tree_get_type(__isl_keep pet_tree *tree);
317 int pet_tree_block_n_child(__isl_keep pet_tree *tree);
323 int pet_tree_is_decl(__isl_keep pet_tree *tree);
337 int pet_tree_is_loop(__isl_keep pet_tree *tree);
350 int pet_tree_foreach_expr(__isl_keep pet_tree *tree,
353 int pet_tree_foreach_access_expr(__isl_keep pet_tree *tree,
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/tool/
H A DHTMLForest.css29 .node.ambiguous::before, .ancestors.ambiguous::after, .tree-node.ambiguous > header::after {
65 #tree {
75 #tree ul {
82 #tree > ul { border-left: none; }
83 .tree-node.selected > header .name { font-weight: bold; }
84 .tree-node.terminal .name { font-family: monospace; }
85 .tree-node.ambiguous > header .name { color: #803; font-weight: bold; }
86 .tree-node.sequence > header .name { color: darkBlue; }
87 .tree-node.terminal > header .name { color: darkGreen; }
88 .tree-node.opaque > header .name { color: orangeRed; }
H A DHTMLForest.js33 this.tree = this.buildTree();
86 this.children.forEach((c) => sublist.appendChild(c.tree));
94 scrollIntoViewV(document.getElementById('tree'), this.tree.firstChild);
195 old.tree.classList.remove('selected');
201 view.tree.classList.add('selected');
232 parentView.tree.lastChild.replaceChild(newChild.tree, oldChild.tree);
243 var tree = document.getElementById('tree');
247 [code, tree, ancestors].forEach(function(container) {
271 tree.firstChild.appendChild(NodeView.make(0).tree);
/llvm-project-15.0.7/lldb/examples/python/
H A Dlldbtk.py476 self.tree['yscroll'] = scroll_bar_v.set
477 self.tree['xscroll'] = scroll_bar_h.set
481 self.tree.heading(
485 self.tree.column(
534 self.tree.delete(first_child)
567 tree = DelegateTree(
572 tree.mainloop()
592 tree = DelegateTree(
597 tree.mainloop()
613 tree = DelegateTree(
[all …]
/llvm-project-15.0.7/mlir/utils/tree-sitter-mlir/
H A DREADME.md1 tree-sitter-mlir
4 Basic [tree-sitter](https://github.com/tree-sitter/tree-sitter) grammar for
/llvm-project-15.0.7/llvm/test/Transforms/Inline/
H A D2009-01-13-RecursiveInlineCrash.ll68 define internal fastcc %struct.quad_struct* @child(%struct.quad_struct* nocapture %tree, i32 %ct) n…
78 …%0 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 3 ; <%struct.quad_…
83 …%2 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 2 ; <%struct.quad_…
88 …%4 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 5 ; <%struct.quad_…
93 …%6 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 4 ; <%struct.quad_…
103 …%0 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 6 ; <%struct.quad_…
105 …%2 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 1 ; <i32*> [#uses=…
141 define i32 @perimeter(%struct.quad_struct* nocapture %tree, i32 %size) nounwind readonly {
143 …%0 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 0 ; <i32*> [#uses=…
149 …%3 = getelementptr %struct.quad_struct, %struct.quad_struct* %tree, i32 0, i32 4 ; <%struct.quad_…
[all …]
/llvm-project-15.0.7/lldb/docs/use/
H A Dpython.rst12 large binary tree.
24 to the user whether or not it found the word in the tree.
264 the path through the tree to the word. So we do
530 This function assumes the binary search tree is
579 the nodes in the tree. Returns the final count.
581 This function assumes the binary search tree is
602 search order for the binary tree).
604 This function assumes the binary search tree is
667 place in the tree. */
702 binary search tree. */
[all …]
/llvm-project-15.0.7/llvm/cmake/modules/
H A DCMakeLists.txt13 # Then for users who want to link against the LLVM build tree, provide the
14 # normal targets and the build tree only targets.
29 # projects building out of tree will have CMake errors. This only gets hit when
40 # Generate LLVMConfig.cmake for the build tree.
44 # LLVM_BUILD_* values available only from LLVM build tree.
85 # one from the build tree. This is due to our cmake files being split between
86 # this source dir and the binary dir in the build tree configuration and the
88 # tree, both the generated LLVMExports.cmake file and the rest of the cmake
113 # Generate LLVMConfig.cmake for the install tree.
155 # Generate LLVMConfigVersion.cmake for build and install tree.
/llvm-project-15.0.7/clang/docs/CommandGuide/
H A Ddiagtool.rst24 * :ref:`tree` - Show warning flags in a tree view.
49 tree section in SUBCOMMANDS
52 :program:`diagtool` tree [*diagnostic-group*]
/llvm-project-15.0.7/mlir/lib/TableGen/
H A DPattern.cpp712 auto treeName = tree.getSymbol(); in collectBoundSymbols()
713 auto numTreeArgs = tree.getNumArgs(); in collectBoundSymbols()
715 if (tree.isNativeCodeCall()) { in collectBoundSymbols()
732 if (auto treeArg = tree.getArgAsNestedDag(i)) { in collectBoundSymbols()
743 auto treeArgName = tree.getArgName(i); in collectBoundSymbols()
747 DagLeaf leaf = tree.getArgAsLeaf(i); in collectBoundSymbols()
774 if (tree.isOperation()) { in collectBoundSymbols()
775 auto &op = getDialectOp(tree); in collectBoundSymbols()
783 if (auto dagArg = tree.getArgAsNestedDag(i)) { in collectBoundSymbols()
815 auto argName = tree.getArgName(i); in collectBoundSymbols()
[all …]
/llvm-project-15.0.7/polly/lib/External/ppcg/
H A Dexternal.c22 enum pet_tree_type pet_tree_get_type(__isl_keep pet_tree *tree) { in pet_tree_get_type() argument
25 int pet_tree_foreach_access_expr(__isl_keep pet_tree *tree, in pet_tree_foreach_access_expr() argument
93 int pet_tree_foreach_expr(__isl_keep pet_tree *tree, in pet_tree_foreach_expr() argument
174 __isl_give pet_tree *pet_tree_copy(__isl_keep pet_tree *tree) { in pet_tree_copy() argument
177 __isl_null pet_tree *pet_tree_free(__isl_take pet_tree *tree) { in pet_tree_free() argument
180 __isl_give pet_tree *pet_tree_map_call_expr(__isl_take pet_tree *tree, in pet_tree_map_call_expr() argument
/llvm-project-15.0.7/mlir/examples/standalone/include/Standalone/
H A DStandaloneDialect.td20 let summary = "A standalone out-of-tree MLIR dialect.";
22 This dialect is an example of an out-of-tree MLIR dialect designed to
24 working inside of the LLVM source tree.
/llvm-project-15.0.7/lld/test/MachO/
H A Dcompact-unwind-generated.test3 # FIXME(gkm): This test is fast on a Release tree, and slow (~10s) on
4 # a Debug tree mostly because of llvm-mc. Is there a way to prefer the
5 # fast installed llvm-mc rather than the slow one in our Debug tree?
/llvm-project-15.0.7/llvm/test/Analysis/Dominators/
H A Dprint-dot-dom.ll6 ; TEST1: digraph "Dominator tree for 'test1' function"
7 ; TEST1-NEXT: label="Dominator tree for 'test1' function"
40 ; TEST2: digraph "Dominator tree for 'test2' function"
41 ; TEST2-NEXT: label="Dominator tree for 'test2' function"
/llvm-project-15.0.7/llvm/utils/unittest/UnitTestMain/
H A DCMakeLists.txt10 # This library is not meant to be in the install tree, only the build tree.
/llvm-project-15.0.7/llvm/docs/Proposals/
H A DTestSuite.rst136 * b+tree
148 https://github.com/graph500/graph500/tree/v2-spec
164 https://github.com/gtcasl/hpc-benchmarks/tree/master/SSCA2v2.2
168 https://github.com/kokkos/kokkos-kernels/tree/master/perf_test
169 https://github.com/kokkos/kokkos/tree/master/benchmarks
222 https://github.com/dmlc/tvm/tree/main/apps/benchmark
230 https://github.com/ParRes/Kernels/tree/default/Cxx11

12345678910>>...18