Home
last modified time | relevance | path

Searched refs:tree_node (Results 1 – 24 of 24) sorted by relevance

/external/llvm/test/CodeGen/Generic/
D2006-03-01-dagcombineinfloop.ll6 %struct.lang_type = type { i32, [1 x %struct.tree_node*] }
9 %struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, i8, i8, i8, i8 }
10 …tree_node*, i32, i8, i8, i8, i8, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %stru…
11 %struct.tree_list = type { [12 x i8], %struct.tree_node*, %struct.tree_node* }
12 %struct.tree_node = type { %struct.tree_decl }
13 …tree_node*, %struct.tree_node*, %struct.tree_node*, i32, i8, i8, i8, i8, i32, %struct.tree_node*, …
14 @void_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1]
15 @char_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1]
16 @short_integer_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1]
17 @short_unsigned_type_node = external global %struct.tree_node* ; <%struct.tree_node**> [#uses=1]
[all …]
D2006-08-30-CoalescerCrash.ll5 …%struct.basic_block_def = type { %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.V…
6 %struct.bb_ann_d = type { %struct.tree_node*, i8, %struct.edge_prediction* }
11 %struct.dataflow_d = type { %struct.varray_head_tag*, [2 x %struct.tree_node*] }
12 %struct.def_operand_ptr = type { %struct.tree_node** }
21 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.function*, i32, i3…
24 …%struct.iv = type { %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*…
25 …%struct.iv_cand = type { i32, i1, i32, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*,…
26 …%struct.iv_use = type { i32, i32, %struct.iv*, %struct.tree_node*, %struct.tree_node**, %struct.bi…
31 …ct.rtx_def*, %struct.rtx_def*, %struct.rtx_def*, i32, %struct.tree_node*, %struct.tree_node*, %str…
34 …%struct.nb_iter_bound = type { %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct…
[all …]
/external/llvm/test/CodeGen/X86/
D2008-04-09-BranchFolding.ll4 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struc…
7 …tree_node*, i32, i8, i8, i8, i8, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %stru…
8 %struct.tree_node = type { %struct.tree_decl }
10 define fastcc %struct.tree_node* @pushdecl(%struct.tree_node* %x) nounwind {
17 ret %struct.tree_node* null
19 %tmp8.i43 = load %struct.tree_node** null, align 4 ; <%struct.tree_node*> [#uses=1]
22 ret %struct.tree_node* null
24 …%t.0.reg2mem.0 = phi %struct.tree_node* [ null, %bb140 ], [ %tmp8.i43, %bb143 ] ; <%struct.tree_n…
25 %tmp162 = icmp eq %struct.tree_node* %t.0.reg2mem.0, null ; <i1> [#uses=2]
36 ret %struct.tree_node* null
[all …]
D2006-09-01-CycleInDAG.ll7 %struct.VEC_tree = type { i32, i32, [1 x %struct.tree_node*] }
11 %struct._var_map = type { %struct.partition_def*, i32*, i32*, %struct.tree_node**, i32, i32, i32* }
12 …%struct.basic_block_def = type { %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.V…
13 %struct.bb_ann_d = type { %struct.tree_node*, i8, %struct.edge_prediction* }
21 %struct.dataflow_d = type { %struct.varray_head_tag*, [2 x %struct.tree_node*] }
22 %struct.def_operand_ptr = type { %struct.tree_node** }
34 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.function*, i32, i3…
47 %struct.phi_arg_d = type { %struct.tree_node*, i1 }
49 %struct.ptr_info_def = type { i8, %struct.bitmap_head_def*, %struct.tree_node* }
61 %struct.tree_ann_common_d = type { i32, i8*, %struct.tree_node* }
[all …]
Dloop-strength-reduce8.ll16 …*, %struct.eh_region**, %struct.eh_region*, %struct.eh_region*, %struct.tree_node*, %struct.rtx_de…
17 ….rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.sequence_stack*, i32, i32, i8*, i32, i8*,…
20 …tree_node*, %struct.function*, i32, i32, i32, i32, %struct.rtx_def*, %struct.CUMULATIVE_ARGS, %str…
21 …up*, %struct.rtx_def*, %struct.tree_node*, %struct.tree_node*, %struct.rtx_def*, i32, %struct.rtx_…
23 %struct.label_chain = type { %struct.label_chain*, %struct.tree_node* }
24 %struct.lang_decl = type { %struct.c_lang_decl, %struct.tree_node* }
25 %struct.language_function = type { %struct.stmt_tree_s, %struct.tree_node* }
27 …uct.nesting*, %struct.tree_node*, %struct.tree_node*, %struct.label_chain*, i32, i32, i32, i32, %s…
31 …%struct.sequence_stack = type { %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.se…
32 …%struct.nesting*, %struct.nesting*, %struct.nesting*, i32, i32, %struct.tree_node*, %struct.rtx_de…
[all …]
D2006-10-12-CycleInDAG.ll6 …%struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %union.tree_ann_d*, i8, i8, i…
7 …tree_node*, i8, i8, i8, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, %struct.tree_node*, %struct…
10 %struct.tree_node = type { %struct.tree_decl }
32 %tmp490 = load %struct.tree_node** null ; <%struct.tree_node*> [#uses=1]
33 %tmp492 = getelementptr %struct.tree_node* %tmp490, i32 0, i32 0, i32 0, i32 3 ; <i8*> [#uses=1]
D2008-05-21-CoalescerBug.ll14 %struct.VEC_tree_base = type { i32, i32, [1 x %struct.tree_node*] }
18 …tree_node*, %struct.VEC_edge_gc*, %struct.VEC_edge_gc*, i8*, %struct.loop*, [2 x %struct.et_node*]…
26 %struct.def_optype_d = type { %struct.def_optype_d*, %struct.tree_node** }
34 …tree_node*, %struct.function*, i32, i32, i32, i32, %struct.rtx_def*, %struct.CUMULATIVE_ARGS, %str…
39 …p*, %struct.loop*, %struct.loop*, %struct.loop*, i8*, %struct.tree_node*, %struct.tree_node*, %str…
41 …%struct.maydef_optype_d = type { %struct.maydef_optype_d*, %struct.tree_node*, %struct.tree_node*,…
42 %struct.nb_iter_bound = type { %struct.tree_node*, %struct.tree_node*, %struct.nb_iter_bound* }
49 …{ %struct.ssa_use_operand_d*, %struct.ssa_use_operand_d*, %struct.tree_node*, %struct.tree_node** }
53 %struct.tree_ann_common_d = type { i32, i8*, %struct.tree_node* }
55 …%struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %struct.tree_ann_d*, i8, i8, …
[all …]
D2010-02-12-CoalescerBug-Impdef.ll43 %"struct VEC_tree_base" = type { i32, i32, [1 x %"union tree_node"*] }
53 …= type { %"struct iv_cand"*, %"struct comp_cost", %"struct bitmap_head_def"*, %"union tree_node"* }
54 %"struct def_optype_d" = type { %"struct def_optype_d"*, %"union tree_node"** }
56 …ef"*, %"struct basic_block_def"*, %"union edge_def_insns", i8*, %"union tree_node"*, i32, i32, i32…
59 …truct loops"*, %"struct htab"*, %"union tree_node"*, %"union tree_node"*, %"union tree_node"*, %"u…
61 …t VEC_tree_gc"*, %"union tree_node"*, %"struct pt_solution", %"struct pt_solution", %"struct point…
64 …tement_base" = type { i8, i8, i16, i32, i32, i32, %"struct basic_block_def"*, %"union tree_node"* }
66 …tement_phi" = type { %"struct gimple_statement_base", i32, i32, %"union tree_node"*, %"struct phi_…
68 %"struct iv" = type { %"union tree_node"*, %"union tree_node"*, %"union tree_node"*, %"union tree_n…
69 …= type { i32, i8, i32, %"union gimple_statement_d"*, %"union tree_node"*, %"union tree_node"*, %"s…
[all …]
D2007-10-15-CoalescerCrash.ll6 %struct.VEC_tree = type { i32, i32, [1 x %struct.tree_node*] }
13 …%struct.basic_block_def = type { %struct.rtx_def*, %struct.rtx_def*, %struct.tree_node*, %struct.V…
29 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.function*, i32, i3…
38 %struct.mem_attrs = type { i64, %struct.tree_node*, %struct.rtx_def*, %struct.rtx_def*, i32 }
40 %struct.phi_arg_d = type { %struct.tree_node*, i8 }
43 %struct.reg_attrs = type { %struct.tree_node*, i64 }
53 …t.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.VEC_tree*, %stru…
54 …_common, i32, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %str…
55 …%struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %union.tree_ann_d*, i8, i8, i…
56 %struct.tree_complex = type { %struct.tree_common, %struct.tree_node*, %struct.tree_node* }
[all …]
Dtail-opts.ll175 …tree_node*, i32, i8, i8, i8, i8, %union.tree_node*, %union.tree_node*, %union.tree_node*, %union.t…
178 %union.tree_node = type { %struct.tree_decl }
180 define fastcc void @c_expand_expr_stmt(%union.tree_node* %expr) nounwind {
202 %tmp21 = load %union.tree_node** null, align 8 ; <%union.tree_node*> [#uses=3]
203 …%tmp22 = getelementptr inbounds %union.tree_node* %tmp21, i64 0, i32 0, i32 0, i64 0 ; <i8*> [#use…
212 %tmp25 = getelementptr inbounds %union.tree_node* %tmp21, i64 0, i32 0, i32 2 ; <i32*> [#uses=1]
213 %tmp26 = bitcast i32* %tmp25 to %union.tree_node** ; <%union.tree_node**> [#uses=1]
214 %tmp27 = load %union.tree_node** %tmp26, align 8 ; <%union.tree_node*> [#uses=2]
215 …%tmp28 = getelementptr inbounds %union.tree_node* %tmp27, i64 0, i32 0, i32 0, i64 16 ; <i8*> [#us…
224 %tmp34 = tail call fastcc i32 @lvalue_p(%union.tree_node* null) nounwind ; <i32> [#uses=1]
[all …]
/external/llvm/test/Transforms/SimplifyCFG/
D2006-08-03-Crash.ll10 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.function*, i32, i3…
22 …%struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %union.tree_ann_d*, i8, i8, i…
23 …tree_node*, i8, i8, i8, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, %struct.tree_node*, %struct…
26 %struct.tree_node = type { %struct.tree_decl }
27 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, i32, i16, i8, i8, i32, %st…
45 %tmp146 = load %struct.tree_node** null ; <%struct.tree_node*> [#uses=1]
46 …%tmp148 = getelementptr %struct.tree_node* %tmp146, i32 0, i32 0, i32 0, i32 1 ; <%struct.tree_no…
47 %tmp149 = load %struct.tree_node** %tmp148 ; <%struct.tree_node*> [#uses=1]
48 …%tmp150 = bitcast %struct.tree_node* %tmp149 to %struct.tree_type* ; <%struct.tree_type*> [#uses=…
60 %tmp172 = load %struct.tree_node** null ; <%struct.tree_node*> [#uses=1]
[all …]
/external/lldb/examples/scripting/
Ddictionary.c14 typedef struct tree_node struct
17 struct tree_node *left; argument
18 struct tree_node *right; argument
19 } tree_node; typedef
52 insert (tree_node *root, char *word) in insert()
68 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); in insert()
81 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); in insert()
94 populate_dictionary (tree_node **dictionary, char *filename) in populate_dictionary()
108 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); in populate_dictionary()
124 find_word (tree_node *dictionary, char *word) in find_word()
[all …]
/external/llvm/test/CodeGen/ARM/
D2007-03-21-JoinIntervalsCrash.ll6 …%struct.c_arg_info = type { %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tr…
12 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.function*, i32, i3…
16 …nguage_function = type { %struct.c_language_function, %struct.tree_node*, %struct.tree_node*, %str…
22 %struct.stmt_tree_s = type { %struct.tree_node*, i32 }
24 …%struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %union.tree_ann_d*, i8, i8, i…
25 …tree_node*, i8, i8, i8, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, %struct.tree_node*, %struct…
29 %struct.tree_node = type { %struct.tree_decl }
D2007-03-30-RegScavengerAssert.ll9 …tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.tree_node*, %struct.function*, i32, i3…
19 …%struct.tree_common = type { %struct.tree_node*, %struct.tree_node*, %union.tree_ann_d*, i8, i8, i…
20 …tree_node*, i8, i8, i8, i8, i8, i8, i8, i8, i32, %struct.tree_decl_u1, %struct.tree_node*, %struct…
23 %struct.tree_node = type { %struct.tree_decl }
/external/srec/srec/clib/
Dsrec_arb.c69 tree_node* tnode = allotree->pdata[cphon].model_nodes; in get_modelid_for_pic()
74 tnode = (ans == ANSWER_FAIL ? (tree_node*)tnode->node.fail : (tree_node*)tnode->node.pass); in get_modelid_for_pic()
178 tree_node* read_tree_node_f(char **buffer, PFile *fp) in read_tree_node_f()
180 tree_node* tnode = (tree_node*) * buffer; in read_tree_node_f()
187 ASSERT(sizeof(asr_int16_t)*2 + sizeof(tree_branch_info *)*2 == sizeof(tree_node)); in read_tree_node_f()
189 *buffer += sizeof(tree_node); in read_tree_node_f()
210 pfread(&(pd->model_nodes), sizeof(tree_node *), 1, fp); in read_phoneme_data()
213 pfread(&(pd->state_nodes), sizeof(tree_node *), MAX_PHONE_STATES, fp); in read_phoneme_data()
216 …ASSERT(sizeof(phoneme_data) == MAX_PHONEME_NAME_LEN + sizeof(asr_int16_t)*4 + sizeof(tree_node *)*… in read_phoneme_data()
383 static int traverse_tree(tree_node* node, tree_head *tree_topo, int *num_terminal_nodes) in traverse_tree()
[all …]
/external/clang/test/CodeGen/
D2005-09-24-BitFieldCrash.c23 union tree_node { union
29 void foo (union tree_node * decl) { in foo()
/external/srec/srec/include/
Dhmm_desc.h126 } tree_node; typedef
135 tree_node *root[MAX_PHONE_STATES];
Dsrec_arb.h66 tree_node* model_nodes; /* pelid at the bottom, is really a HMM model ID */
68 tree_node* state_nodes[MAX_PHONE_STATES];
/external/chromium_org/third_party/bintrees/bintrees/
Dctrees.h14 typedef struct tree_node node_t;
16 struct tree_node { struct
/external/chromium_org/content/browser/accessibility/
Daccessibility_tree_formatter.h106 base::DictionaryValue* tree_node);
107 void RecursiveFormatAccessibilityTree(const base::DictionaryValue& tree_node,
/external/srec/tools/test_g2g/
Dtest_g2g.c346 int traverse_tree(tree_node* node, tree_head *tree_topo, int *num_terminal_nodes) in traverse_tree()
359 traverse_tree( (tree_node*)node->node.fail, tree_topo, num_terminal_nodes); in traverse_tree()
360 traverse_tree( (tree_node*)node->node.pass, tree_topo, num_terminal_nodes); in traverse_tree()
366 int num_nodes_in_tree(tree_node* node, int *num_terminal_nodes) in num_nodes_in_tree()
/external/chromium_org/chrome/browser/extensions/api/bookmarks/
Dbookmarks_api.cc368 scoped_ptr<BookmarkTreeNode> tree_node( in BookmarkNodeAdded() local
372 *tree_node)); in BookmarkNodeAdded()
743 scoped_ptr<BookmarkTreeNode> tree_node( in RunOnReady() local
746 results_ = bookmarks::Move::Results::Create(*tree_node); in RunOnReady()
799 scoped_ptr<BookmarkTreeNode> tree_node( in RunOnReady() local
802 results_ = bookmarks::Update::Results::Create(*tree_node); in RunOnReady()
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Ddebug.rb60 def copy_node( tree_node ) argument
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb706 def copy_node( tree_node ) argument
707 tree_node and tree_node.dup