Home
last modified time | relevance | path

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

12345678910>>...20

/llvm-project/polly/lib/External/isl/
H A Disl_schedule_tree.c35 int isl_schedule_tree_is_leaf(__isl_keep isl_schedule_tree *tree) in isl_schedule_tree_is_leaf() argument
37 return isl_schedule_tree_get_type(tree) == isl_schedule_node_leaf; in isl_schedule_tree_is_leaf()
50 isl_schedule_tree *tree; in isl_schedule_tree_alloc() local
55 tree = isl_calloc_type(ctx, isl_schedule_tree); in isl_schedule_tree_alloc()
56 if (!tree) in isl_schedule_tree_alloc()
59 tree->ref = 1; in isl_schedule_tree_alloc()
60 tree->ctx = ctx; in isl_schedule_tree_alloc()
62 tree->type = type; in isl_schedule_tree_alloc()
63 tree->anchored = 0; in isl_schedule_tree_alloc()
65 return tree; in isl_schedule_tree_alloc()
[all …]
H A Disl_schedule_tree.h75 isl_ctx *isl_schedule_tree_get_ctx(__isl_keep isl_schedule_tree *tree);
77 __isl_keep isl_schedule_tree *tree);
80 int isl_schedule_tree_is_leaf(__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);
124 __isl_take isl_schedule_tree *tree, __isl_take isl_union_set *domain);
126 __isl_keep isl_schedule_tree *tree);
128 __isl_take isl_schedule_tree *tree,
[all …]
H A Disl_schedule_node.c27 __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree, in isl_schedule_node_alloc() argument
36 if (!schedule || !tree || n < 0) in isl_schedule_node_alloc()
46 node->tree = tree; in isl_schedule_node_alloc()
57 isl_schedule_tree_free(tree); in isl_schedule_node_alloc()
86 isl_schedule_tree *tree; in isl_schedule_node_from_extension() local
93 tree = isl_schedule_tree_from_extension(extension); in isl_schedule_node_from_extension()
94 schedule = isl_schedule_from_schedule_tree(ctx, tree); in isl_schedule_node_from_extension()
129 return node ? isl_schedule_tree_get_type(node->tree) in isl_schedule_node_get_type()
172 return isl_schedule_tree_copy(node->tree); in isl_schedule_node_get_tree()
194 isl_schedule_tree_copy(node->tree), in isl_schedule_node_dup()
[all …]
H A Disl_schedule_read.c75 isl_schedule_tree *tree; in read_context() local
103 tree = isl_schedule_tree_from_context(context); in read_context()
111 tree = isl_stream_read_schedule_tree(s); in read_context()
112 tree = isl_schedule_tree_insert_context(tree, context); in read_context()
115 return tree; in read_context()
126 isl_schedule_tree *tree; in read_domain() local
154 tree = isl_schedule_tree_from_domain(domain); in read_domain()
162 tree = isl_stream_read_schedule_tree(s); in read_domain()
163 tree = isl_schedule_tree_insert_domain(tree, domain); in read_domain()
166 return tree; in read_domain()
[all …]
H A Disl_schedule.c39 __isl_take isl_schedule_tree *tree) in isl_schedule_from_schedule_tree() argument
44 if (!tree) in isl_schedule_from_schedule_tree()
46 type = isl_schedule_tree_get_type(tree); in isl_schedule_from_schedule_tree()
49 isl_die(isl_schedule_tree_get_ctx(tree), isl_error_unsupported, in isl_schedule_from_schedule_tree()
58 schedule->root = tree; in isl_schedule_from_schedule_tree()
65 isl_schedule_tree_free(tree); in isl_schedule_from_schedule_tree()
76 isl_schedule_tree *tree; in isl_schedule_from_domain() local
79 tree = isl_schedule_tree_from_domain(domain); in isl_schedule_from_domain()
80 return isl_schedule_from_schedule_tree(ctx, tree); in isl_schedule_from_domain()
108 isl_schedule_tree *tree; in isl_schedule_cow() local
[all …]
H A Dcodegen.c122 isl_ast_node *tree; in construct_ast_from_union_map() local
132 tree = isl_ast_build_node_from_schedule_map(build, schedule); in construct_ast_from_union_map()
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()
[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/mlir/tools/mlir-tblgen/
H A DRewriterGen.cpp74 void emitStaticMatcher(DagNode tree, std::string funcName);
78 void emitMatchLogic(DagNode tree, StringRef opName);
88 void emitMatch(DagNode tree, StringRef name, int depth);
91 void emitStaticMatchCall(DagNode tree, StringRef name);
98 void emitNativeCodeMatch(DagNode tree, StringRef name, int depth);
101 // `tree` returning the op's variable name.
102 void emitOpMatch(DagNode tree, StringRef opName, int depth);
105 // DAG `tree` as an operand. `operandName` and `operandMatcher` indicate the
107 void emitOperandMatch(DagNode tree, StringRef opName, StringRef operandName,
114 void emitEitherOperandMatch(DagNode tree, DagNod
367 emitStaticMatcher(DagNode tree,std::string funcName) emitStaticMatcher() argument
395 emitMatch(DagNode tree,StringRef name,int depth) emitMatch() argument
409 emitStaticMatchCall(DagNode tree,StringRef opName) emitStaticMatchCall() argument
450 emitNativeCodeMatch(DagNode tree,StringRef opName,int depth) emitNativeCodeMatch() argument
561 emitOpMatch(DagNode tree,StringRef opName,int depth) emitOpMatch() argument
677 emitOperandMatch(DagNode tree,StringRef opName,StringRef operandName,int operandIndex,DagLeaf operandMatcher,StringRef argName,int argIndex,std::optional<int> variadicSubIndex) emitOperandMatch() argument
727 emitEitherOperandMatch(DagNode tree,DagNode eitherArgTree,StringRef opName,int argIndex,int & operandIndex,int depth) emitEitherOperandMatch() argument
806 emitVariadicOperandMatch(DagNode tree,DagNode variadicArgTree,StringRef opName,int argIndex,int & operandIndex,int depth) emitVariadicOperandMatch() argument
867 emitAttributeMatch(DagNode tree,StringRef opName,int argIndex,int depth) emitAttributeMatch() argument
955 emitMatchLogic(DagNode tree,StringRef opName) emitMatchLogic() argument
1030 collectOps(DagNode tree,llvm::SmallPtrSetImpl<const Operator * > & ops) collectOps() argument
1261 handleVariadic(DagNode tree,int depth) handleVariadic() argument
1284 handleReplaceWithValue(DagNode tree) handleReplaceWithValue() argument
1299 handleLocationDirective(DagNode tree) handleLocationDirective() argument
1398 handleReplaceWithNativeCodeCall(DagNode tree,int depth) handleReplaceWithNativeCodeCall() argument
1484 getTrailingDirectives(DagNode tree) getTrailingDirectives() argument
1528 handleOpCreation(DagNode tree,int resultIndex,int depth) handleOpCreation() argument
[all...]
/llvm-project/clang-tools-extra/pseudo/tool/
H A DHTMLForest.css
H A DHTMLForest.js
/llvm-project/libc/docs/
H A Ddate_and_time.rst
H A Dporting.rst31 `Linux <https://github.com/llvm/llvm-project/tree/main/libc/config/linux>`_ and
32 `Windows <https://github.com/llvm/llvm-project/tree/main/libc/config/windows>`_,
38 `Darwin <https://github.com/llvm/llvm-project/tree/main/libc/config/darwin>`_
44 source tree.
60 `x86_64 <https://github.com/llvm/llvm-project/tree/main/libc/config/linux/x86_64>`_
61 and `aarch64 <https://github.com/llvm/llvm-project/tree/main/libc/config/linux/aarch64>`_.
77 architecture separately: `aarch64 <https://github.com/llvm/llvm-project/tree/main/libc/config/linux/aarch64>`_,
78 `arm32 <https://github.com/llvm/llvm-project/tree/main/libc/config/linux/arm>`_ and
79 `x86_64 <https://github.com/llvm/llvm-project/tree/main/libc/config/linux/x86_64>`_. On the
81 `file <https://github.com/llvm/llvm-project/tree/mai
[all...]
/llvm-project/mlir/utils/tree-sitter-mlir/
H A DREADME.md1 # tree-sitter-mlir
3 [tree-sitter](https://github.com/tree-sitter/tree-sitter) grammar for MLIR
5 incomplete, and the bench statistics on the test files in the MLIR tree are as
/llvm-project/lldb/examples/python/
H A Dlldbtk.py482 self.tree = ttk.Treeview(columns=column_ids)
484 scroll_bar_v = ttk.Scrollbar(orient=VERTICAL, command=self.tree.yview)
485 scroll_bar_h = ttk.Scrollbar(orient=HORIZONTAL, command=self.tree.xview)
486 self.tree["yscroll"] = scroll_bar_v.set
487 self.tree["xscroll"] = scroll_bar_h.set
491 self.tree.heading(
496 self.tree.column(columns_dict["id"], stretch=columns_dict["stretch"])
499 self.tree.grid(in_=frame, row=0, column=0, sticky=NSEW)
508 self.tree.bind("<<TreeviewOpen>>", self._update_tree)
521 item_id = self.tree.insert(
[all …]
/llvm-project/llvm/test/Transforms/Inline/
H A D2009-01-13-RecursiveInlineCrash.ll68 define internal fastcc ptr @child(ptr nocapture %tree, i32 %ct) nounwind readonly {
78 %0 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 3 ; <ptr> [#uses=1]
83 %2 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 2 ; <ptr> [#uses=1]
88 %4 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 5 ; <ptr> [#uses=1]
93 %6 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 4 ; <ptr> [#uses=1]
101 define internal fastcc ptr @gtequal_adj_neighbor(ptr nocapture %tree, i32 %d) nounwind readonly {
103 %0 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 6 ; <ptr> [#uses=1]
105 %2 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 1 ; <ptr> [#uses=1]
141 define i32 @perimeter(ptr nocapture %tree, i32 %size) nounwind readonly {
143 %0 = getelementptr %struct.quad_struct, ptr %tree, i32 0, i32 0 ; <ptr> [#uses=1]
[all …]
/llvm-project/mlir/lib/TableGen/
H A DPattern.cpp152 // We want to get number of operations recursively involved in the DAG tree. in getNumOps()
734 void Pattern::collectBoundSymbols(DagNode tree, SymbolInfoMap &infoMap, in collectBoundSymbols()
736 auto treeName = tree.getSymbol(); in collectBoundSymbols()
737 auto numTreeArgs = tree.getNumArgs(); in collectBoundSymbols()
739 if (tree.isNativeCodeCall()) { in collectBoundSymbols()
745 infoMap.bindValues(treeName, tree.getNumReturnsOfNativeCode()), in collectBoundSymbols()
756 if (auto treeArg = tree.getArgAsNestedDag(i)) { in collectBoundSymbols()
767 auto treeArgName = tree.getArgName(i); in collectBoundSymbols()
771 DagLeaf leaf = tree.getArgAsLeaf(i); in collectBoundSymbols()
798 if (tree in collectBoundSymbols()
731 collectBoundSymbols(DagNode tree,SymbolInfoMap & infoMap,bool isSrcPattern) collectBoundSymbols() argument
848 __anon839c710b0102(DagNode parent, DagNode tree, int opArgIdx) collectBoundSymbols() argument
849 __anon839c710b0202(DagNode parent, DagNode tree, int opArgIdx) collectBoundSymbols() argument
[all...]
/llvm-project/lldb/docs/use/
H A Dpython.rst12 large binary tree.
20 searching for the word in the tree (using Binary Search), and reporting
21 to the user whether or not it found the word in the tree.
51 into the tree or not. Since "Romeo and Juliet" has thousands of words,
52 trying to examine our binary search tree by hand is completely
53 impractical. Therefore we will write a Python script to search the tree
55 traverses the entire tree searching for a word, and maintaining
56 information about the path from the root of the tree to the current
57 node. If it finds the word in the tree, it returns the path from the
98 binary search tree, put into a Python variable. The second parameter is
[all …]
/llvm-project/llvm/test/tools/llc/new-pm/
H A Dpipeline.mir2 # RUN: llc -mtriple=x86_64-pc-linux-gnu -x mir -passes='require<machine-dom-tree>,print<machine-dom-tree>' -print-pipeline-passes < %s | FileCheck --check-prefix=ANALYSIS %s
6 # ANALYSIS: require<machine-dom-tree>,print<machine-dom-tree>
/llvm-project/llvm/cmake/modules/
H A DCMakeLists.txt14 # Then for users who want to link against the LLVM build tree, provide the
15 # normal targets and the build tree only targets.
30 # projects building out of tree will have CMake errors. This only gets hit when
44 # Generate LLVMConfig.cmake for the build tree.
48 # LLVM_BUILD_* values available only from LLVM build tree.
89 # one from the build tree. This is due to our cmake files being split between
90 # this source dir and the binary dir in the build tree configuration and the
92 # tree, both the generated LLVMExports.cmake file and the rest of the cmake
118 # Generate LLVMConfig.cmake for the install tree.
160 # Generate LLVMConfigVersion.cmake for build and install tree
[all...]
/llvm-project/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/clang/test/Driver/
H A Dsolaris-sparc-gcc-search.test4 /// Check sparc-sun-solaris2.11, 32-bit, GCC 4.8 tree
13 /// Check sparc-sun-solaris2.11, 32-bit, GCC 10 tree
22 /// Check sparc-sun-solaris2.11, 32-bit, GCC 11 tree
31 /// Check sparcv9-sun-solaris2.11, 64-bit, GCC 4.8 tree
40 /// Check sparcv9-sun-solaris2.11, 64-bit, GCC 10 tree
49 /// Check sparcv9-sun-solaris2.11, 64-bit, GCC 11 tree
/llvm-project/libc/docs/math/
H A Dindex.rst
/llvm-project/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/llvm/test/Analysis/Dominators/
H A Dprint-dot-dom.ll9 ; TEST1: digraph "Dominator tree for 'test1' function"
10 ; TEST1-NEXT: label="Dominator tree for 'test1' function"
43 ; TEST2: digraph "Dominator tree for 'test2' function"
44 ; TEST2-NEXT: label="Dominator tree for 'test2' function"
/llvm-project/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>>...20