/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/c-family/ |
c-objc.h | 36 extern tree objc_is_class_name (tree); 37 extern tree objc_is_object_ptr (tree); 38 extern void objc_check_decl (tree); 39 extern void objc_check_global_decl (tree); 40 extern tree objc_common_type (tree, tree); 41 extern bool objc_compare_types (tree, tree, int, tree) [all...] |
c-common.h | 23 #include "splay-tree.h" 26 #include "tree.h" 32 cp-tree.h overrides this for C++. */ 229 extern GTY ((length ("(int) RID_MAX"))) tree *ridpointers; 438 extern GTY(()) tree c_global_trees[CTI_MAX]; 441 tree for size reasons. */ 444 tree GTY((length ("%h.len"))) elts[1]; 483 /* Information about a statement tree. */ 487 vec<tree, va_gc> *x_cur_stmt_list; 508 about the statement-tree that we are building. * [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
langhooks.h | 23 /* FIXME: This file should be #include-d after tree.h (for enum tree_code). */ 32 typedef void (*lang_print_tree_hook) (FILE *, tree, int indent); 42 bool (*var_mod_type_p) (tree, tree); 45 /* The following hooks are used by tree-dump.c. */ 49 /* Dump language-specific parts of tree nodes. Returns nonzero if it 51 bool (*dump_tree) (void *, tree); 63 tree (*make_type) (enum tree_code); 68 enum classify_record (*classify_record) (tree); 70 /* Given MODE and UNSIGNEDP, return a suitable type-tree with tha [all...] |
c-tree.h | 112 for code generation alongside a tree representing its value. */ 116 tree value; 128 tree original_type; 179 tree spec; 188 tree expr; 263 tree type; 266 tree expr; 268 tree decl_attr; 272 tree attrs; 356 tree id [all...] |
tree-inline.h | 0 /* Tree inlining hooks and declarations. 43 tree src_fn; 47 tree dst_fn; 61 tree retvar; 68 tree (*copy_decl) (tree, struct copy_body_data *); 71 tree block; 110 void (*transform_lang_insert_block) (tree); 175 extern tree copy_tree_body_r (tree *, int *, void *) [all...] |
tree-ssa-sccvn.h | 0 /* Tree SCC value numbering 24 /* In tree-ssa-sccvn.c */ 25 bool expressions_equal_p (tree, tree); 29 extern tree VN_TOP; 43 tree result; 44 tree type; 45 tree op[1]; 54 return sizeof (struct vn_nary_op_s) + sizeof (tree) * length - sizeof (tree); [all...] |
tree-pretty-print.h | 34 #define pp_ti_abstract_origin(TI) ((tree *) (TI)->x_data) 36 extern void pp_base_tree_identifier (pretty_printer *, tree); 38 /* In tree-pretty-print.c */ 39 extern void print_declaration (pretty_printer *, tree, int, int); 40 extern int dump_generic_node (pretty_printer *, tree, int, int, bool); 41 extern void print_generic_stmt (FILE *, tree, int); 42 extern void print_generic_stmt_indented (FILE *, tree, int, int); 43 extern void print_generic_expr (FILE *, tree, int); 44 extern void print_generic_decl (FILE *, tree, int); 45 extern void dump_omp_clauses (pretty_printer *, tree, int, int) [all...] |
tree-ssa-alias.h | 0 /* Tree based alias analysis and alias oracle. 60 /* Simplified and cached information about a memory reference tree. 65 /* The original full memory reference tree or NULL_TREE if that is 67 tree ref; 73 tree base; 92 /* In tree-ssa-alias.c */ 93 extern void ao_ref_init (ao_ref *, tree); 94 extern void ao_ref_init_from_ptr_and_size (ao_ref *, tree, tree); 95 extern tree ao_ref_base (ao_ref *) [all...] |
toplev.h | 28 extern void rest_of_decl_compilation (tree, int, int); 29 extern void rest_of_type_compilation (tree, int); 39 extern void announce_function (tree); 41 extern void wrapup_global_declaration_1 (tree); 42 extern bool wrapup_global_declaration_2 (tree); 43 extern bool wrapup_global_declarations (tree *, int); 44 extern void check_global_declaration_1 (tree); 45 extern void check_global_declarations (tree *, int); 46 extern void emit_debug_global_declarations (tree *, int);
|
realmpfr.h | 29 extern tree do_mpc_arg2 (tree, tree, tree, int, int (*)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t)); 34 extern void real_from_mpfr (REAL_VALUE_TYPE *, mpfr_srcptr, tree, mp_rnd_t);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/cp/ |
name-lookup.h | 36 tree name; 37 tree type; 48 extern binding_entry binding_table_find (binding_table, tree); 70 tree value; 72 tree type; 83 tree identifier; 86 tree real_type_value; 90 extern tree identifier_type_value (tree); 91 extern void set_identifier_type_value (tree, tree) [all...] |
cp-tree.h | 201 /* Language-specific tree checkers. */ 243 tree class_template_info; 244 tree label_value; 261 tree decl; 267 tree member; 342 tree function; 374 tree binfo; 375 tree functions; 376 tree access_binfo; 541 vec<tree, va_gc> *instantiations [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/ |
PODRedBlackTreeTest.cpp | 26 // Tests for the red-black tree class. 49 PODRedBlackTree<int> tree(arena); 52 tree.add(i); 60 PODRedBlackTree<int> tree; local 61 tree.add(5); 62 ASSERT_TRUE(tree.checkInvariants()); 63 EXPECT_TRUE(tree.contains(5)); 68 PODRedBlackTree<int> tree; local 69 tree.add(4); 70 ASSERT_TRUE(tree.checkInvariants()) 84 PODRedBlackTree<int> tree; local 97 PODRedBlackTree<int> tree; local 108 PODRedBlackTree<int> tree; local 135 PODRedBlackTree<int> tree; local 159 PODRedBlackTree<int> tree; local 178 PODRedBlackTree<int> tree; local [all...] |
PODIntervalTreeTest.cpp | 26 // Tests for the interval tree class. 60 PODIntervalTree<float> tree; local 61 tree.add(PODInterval<float>(2, 4)); 62 ASSERT_TRUE(tree.checkInvariants()); 67 PODIntervalTree<float> tree; local 68 tree.add(PODInterval<float>(2, 4)); 69 ASSERT_TRUE(tree.checkInvariants()); 70 Vector<PODInterval<float> > result = tree.allOverlaps(PODInterval<float>(1, 3)); 78 PODIntervalTree<float> tree; local 79 tree.add(PODInterval<float>(1, 2.5)) 101 PODIntervalTree<float, int*> tree; local 144 PODIntervalTree<float, UserData1> tree; local 154 PODIntervalTree<float, UserData1> tree; local 201 PODIntervalTree<EndpointType1> tree; local 224 PODIntervalTree<int> tree; local 297 PODIntervalTree<int> tree; local 335 PODIntervalTree<int> tree; local [all...] |
/external/chromium_org/mojo/public/tools/bindings/pylib/mojom/parse/ |
translate.py | 5 """Translates parse tree to Mojom IR.""" 11 def _MapTree(func, tree, name): 12 if not tree: 14 return [func(subtree) for subtree in tree if subtree[0] == name] 56 def _MapField(tree): 57 assert type(tree[3]) is ast.Ordinal 58 return {'name': tree[2], 59 'kind': _MapKind(tree[1]), 60 'ordinal': tree[3].value, 61 'default': tree[4] [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
TreeExtensions.cs | 33 using ITree = Antlr.Runtime.Tree.ITree; 39 public static ITree getNextSibling( this ITree tree ) 41 return tree.Parent.GetChild( tree.ChildIndex + 1 ); 45 public static void setFirstChild( this ITree tree, ITree child ) 47 if ( tree.ChildCount == 0 ) 48 tree.AddChild( child ); 50 tree.SetChild( 0, child );
|
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3basetree.h | 2 /// Definition of the ANTLR3 base tree. 45 /// A generic tree implementation with no payload. You must subclass to 47 /// instead of the child-sibling approach in v2. A flat tree (a list) is 59 /// like to a tree node, in many cases saving the need to create their own tree 60 /// and tree adaptors. ANTLR does not use this pointer, but will copy it for you and so on. 65 /// as they belong to the common tree node that implements this. 70 /// and ascending trees as the tree walk progresses. 79 /// for the payload in the supplied tree. 81 pANTLR3_COMMON_TOKEN (*getToken) (struct ANTLR3_BASE_TREE_struct * tree); [all...] |
/external/chromium_org/third_party/skia/tests/ |
GrRedBlackTreeTest.cpp | 15 typedef GrRedBlackTree<int> Tree; 18 Tree tree; local 26 Tree::Iter xi = tree.insert(x); 31 tree.insert(0); 33 tree.insert(99); 35 REPORTER_ASSERT(reporter, *tree.begin() == 0); 36 REPORTER_ASSERT(reporter, *tree.last() == 99); 37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin()) [all...] |
/external/skia/tests/ |
GrRedBlackTreeTest.cpp | 15 typedef GrRedBlackTree<int> Tree; 18 Tree tree; local 26 Tree::Iter xi = tree.insert(x); 31 tree.insert(0); 33 tree.insert(99); 35 REPORTER_ASSERT(reporter, *tree.begin() == 0); 36 REPORTER_ASSERT(reporter, *tree.last() == 99); 37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin()) [all...] |
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
Tree.js | 1 /** What does a tree look like? ANTLR has a number of support classes 6 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can 9 * This is a tree node without any payload; just navigation and factory stuff. 11 org.antlr.runtime.tree.Tree = function(){};
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
vp9_treewriter.c | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 13 static void tree2tok(struct vp9_token *tokens, const vp9_tree_index *tree, 19 const vp9_tree_index j = tree[i++]; 24 tree2tok(tokens, tree, j, v, l); 30 const vp9_tree_index *tree) { 31 tree2tok(tokens, tree, 0, 0, 0); 34 static unsigned int convert_distribution(unsigned int i, vp9_tree tree, 39 if (tree[i] <= 0) 40 left = num_events[-tree[i]] [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
vp9_treewriter.c | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 13 static void tree2tok(struct vp9_token *tokens, const vp9_tree_index *tree, 19 const vp9_tree_index j = tree[i++]; 24 tree2tok(tokens, tree, j, v, l); 30 const vp9_tree_index *tree) { 31 tree2tok(tokens, tree, 0, 0, 0); 34 static unsigned int convert_distribution(unsigned int i, vp9_tree tree, 39 if (tree[i] <= 0) 40 left = num_events[-tree[i]] [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/ |
Value.java | 30 package org.mockito.asm.tree.analysis;
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
vp9_treewriter.c | 6 * tree. An additional intellectual property rights grant can be found 8 * be found in the AUTHORS file in the root of the source tree. 13 static void tree2tok(struct vp9_token *tokens, const vp9_tree_index *tree, 19 const vp9_tree_index j = tree[i++]; 24 tree2tok(tokens, tree, j, v, l); 30 const vp9_tree_index *tree) { 31 tree2tok(tokens, tree, 0, 0, 0); 34 static unsigned int convert_distribution(unsigned int i, vp9_tree tree, 39 if (tree[i] <= 0) 40 left = num_events[-tree[i]] [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
TreeIterator.java | 28 package org.antlr.runtime.tree; 36 /** Return a node stream from a doubly-linked tree whose nodes 39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure. 44 protected Object tree; field in class:TreeIterator 57 public TreeIterator(Object tree) { 58 this(new CommonTreeAdaptor(),tree); 61 public TreeIterator(TreeAdaptor adaptor, Object tree) { 63 this.tree = tree; 64 this.root = tree; [all...] |