/haiku-buildtools/binutils/zlib/ |
H A D | trees.c | 425 /* Index within the heap array of least frequent node in the Huffman tree */ 448 * Restore the heap property by moving down the tree starting at node k, 449 * exchanging a node with the smallest of its two sons if necessary, stopping 456 int k; /* node to move down */ 519 if (n > max_code) continue; /* not a leaf node */ 626 int node; /* new node being created */ local 649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 650 tree[node].Freq = 1; 651 s->depth[node] [all...] |
/haiku-buildtools/binutils/opcodes/ |
H A D | aarch64-gen.c | 61 /* List of opcodes; only valid for the leaf node. */ 186 struct bittree* node; local 187 node = malloc (sizeof (struct bittree)); 188 if (!node) 190 node->bitno = -1; 191 node->bits[0] = NULL; 192 node->bits[1] = NULL; 193 return node; 196 /* The largest number of opcode entries that exist at a leaf node of the 347 /* Record the opcode entries on this leaf node 622 const opcode_node *node = table + i; local 661 const opcode_node *node = table + i; local 767 opcode_node *node = new_opcode_node (); local 819 opcode_node *node = ret + i; local 839 opcode_node *node = alias_info; local [all...] |
/haiku-buildtools/binutils/ld/ |
H A D | ldmisc.c | 249 etree_type node; local 254 tp = &node;
|
H A D | ldlang.c | 505 /* Find the correct node to append this section. */ 525 lang_section_bst_type *node; local 534 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type)); 535 node->left = 0; 536 node->right = 0; 537 node->section = section; 541 *tree = node; 950 function for each node, except those inside output section statements 1031 /* Build a new statement node for the parse tree. */ 1047 /* Build a new input file node fo [all...] |
/haiku-buildtools/binutils/gold/ |
H A D | arm-reloc-property.cc | 40 // Parse an S-expression S and build a tree and return the root node. 58 // Remember the node stack position for start of a new internal node. 63 // children to build a new internal node. Push internal node back. 67 Tree_node* node = local 71 node_stack.push_back(node); 74 // Just push a leaf node to node_stack. 83 // contain the root node. 165 Tree_node* node local [all...] |
/haiku-buildtools/binutils/gas/config/ |
H A D | tc-bfin.c | 955 Expr_Node *node = (Expr_Node *) allocate (sizeof (Expr_Node)); local 956 node->type = type; 957 node->value = value; 958 node->Left_Child = Left_Child; 959 node->Right_Child = Right_Child; 960 return node; 1133 fprintf (stderr, "%s:%d:Unknown node expression found during " "arithmetic relocation generation", __FILE__, __LINE__);
|
/haiku-buildtools/binutils/etc/ |
H A D | texi2pod.pl | 91 |node # @node: useful only in .info file
|
/haiku-buildtools/binutils/binutils/ |
H A D | objcopy.c | 1343 need_sym_before (struct addsym_node **node, const char *sym) 1357 *node = ptr; 1613 /* Add a node to a symbol redefine list. */ 1341 need_sym_before(struct addsym_node **node, const char *sym) argument
|
/haiku-buildtools/binutils/bfd/ |
H A D | elf32-xtensa.c | 5460 splay_tree_node node = splay_tree_lookup (l->tree, (splay_tree_key)&a); 5461 if (node) 5462 return (text_action *)node->value; 5541 splay_tree_node node = splay_tree_min (action_list->tree); 5542 return node ? (text_action *)node->value : NULL; 5548 splay_tree_node node = splay_tree_successor (action_list->tree, 5550 return node ? (text_action *)node->value : NULL; 5581 splay_tree_node node 5445 splay_tree_node node = splay_tree_lookup (l->tree, (splay_tree_key)&a); local 5526 splay_tree_node node = splay_tree_min (action_list->tree); local 5533 splay_tree_node node = splay_tree_successor (action_list->tree, local 5566 splay_tree_node node = splay_tree_lookup (l->tree, (splay_tree_key)&a); local 5635 splay_tree_node node = splay_tree_lookup (action_list->tree, local 5683 map_action_fn(splay_tree_node node, void *p) argument 5800 splay_tree_node node; local 5845 print_action_list_fn(splay_tree_node node, void *p) argument 8316 xlate_map_fn(splay_tree_node node, void *p) argument 9360 action_remove_bytes_fn(splay_tree_node node, void *p) argument [all...] |
H A D | elf32-sh-symbian.c | 116 symbol_rename * node; local 121 for (node = rename_list; node; node = node->next) 122 if (strcmp (node->current_name, current_name) == 0) 124 if (strcmp (node->new_name, new_name) == 0) 135 if ((node = bfd_malloc (sizeof * node)) == NULL) 138 fprintf (stderr, "IMPORT AS: No mem for new rename node\ [all...] |
H A D | dwarf2.c | 378 a symbol. We waste a bit of memory for list with one node but that 465 struct info_list_node *node; local 472 node = (struct info_list_node *) bfd_hash_allocate (&hash_table->base, 473 sizeof (*node)); 474 if (!node) 477 node->info = info; 478 node->next = entry->head; 479 entry->head = node; 3613 struct info_list_node *node; local 3618 for (node 3666 struct info_list_node *node; local 3727 struct info_list_node *node; local [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | tree-sra.c | 4903 some_callers_have_mismatched_arguments_p (struct cgraph_node *node, argument 4907 for (cs = node->callers; cs; cs = cs->next_caller) 4917 some_callers_have_no_vuse_p (struct cgraph_node *node, argument 4921 for (cs = node->callers; cs; cs = cs->next_caller) 4931 convert_callers_for_node (struct cgraph_node *node, argument 4938 for (cs = node->callers; cs; cs = cs->next_caller) 4954 for (cs = node->callers; cs; cs = cs->next_caller) 4966 convert_callers (struct cgraph_node *node, tree old_decl, argument 4971 node->call_for_symbol_and_aliases (convert_callers_for_node, 4993 gimple_call_set_fndecl (stmt, node 5006 modify_function(struct cgraph_node *node, ipa_parm_adjustment_vec adjustments) argument 5049 ipa_sra_check_caller(struct cgraph_node *node, void *data) argument 5095 ipa_sra_preliminary_function_checks(struct cgraph_node *node) argument 5194 struct cgraph_node *node = cgraph_node::get (current_function_decl); local [all...] |
H A D | tree-parloops.c | 212 gimple reduc_phi; /* The phi node defining the reduction. */ 221 gphi *new_phi; /* (helper field) Newly created phi node whose result 593 /* In the phi node at the header, replace the argument coming 1043 This function creates a phi node reflecting these values. 1115 /* Create phi node. */ 1434 cgraph_node *node = cgraph_node::get (fndecl); local 1435 gcc_assert (node != NULL); 1436 return node->parallelized_function;
|
H A D | tree-ssa-alias.c | 1787 struct cgraph_node *node = cgraph_node::get (callee); local 1791 node yet. We should enforce that there are nodes for all decls in the 1793 if (node 1794 && (not_read = ipa_reference_get_not_read_global (node)) 2176 struct cgraph_node *node = cgraph_node::get (callee); local 2179 if (node 2180 && (not_written = ipa_reference_get_not_written_global (node)) 2484 /* An already visited PHI node ends the walk successfully. */ 2564 dominate each other, but still we can easily skip this PHI node 2586 /* Starting from a PHI node fo [all...] |
H A D | omp-low.c | 283 oacc_get_reduction_array_id (tree node) argument 285 const char *id = IDENTIFIER_POINTER (DECL_NAME (node)); 7321 /* Make phi node for trip. */ 8993 struct cgraph_node *node = cgraph_node::get (child_fn); 8994 node->mark_force_output (); 12524 simd_clone_clauses_extract (struct cgraph_node *node, tree clauses, 12527 vec<tree> args = simd_clone_vector_of_formal_parm_types (node->decl); 12542 DECL_ATTRIBUTES (node->decl))); 12644 simd_clone_compute_base_data_type (struct cgraph_node *node, 12648 tree fndecl = node 8992 struct cgraph_node *node = cgraph_node::get (child_fn); local 12519 simd_clone_clauses_extract(struct cgraph_node *node, tree clauses, bool *inbranch_specified) argument 12639 simd_clone_compute_base_data_type(struct cgraph_node *node, struct cgraph_simd_clone *clone_info) argument 12686 simd_clone_mangle(struct cgraph_node *node, struct cgraph_simd_clone *clone_info) argument 12804 simd_clone_adjust_return_type(struct cgraph_node *node) argument 12883 simd_clone_adjust_argument_types(struct cgraph_node *node) argument 13034 simd_clone_init_simd_arrays(struct cgraph_node *node, ipa_parm_adjustment_vec adjustments) argument 13183 ipa_simd_modify_function_body(struct cgraph_node *node, ipa_parm_adjustment_vec adjustments, tree retval_array, tree iter) argument 13254 FOR_EACH_BB_FN(bb, DECL_STRUCT_FUNCTION (node->decl)) argument 13302 simd_clone_adjust(struct cgraph_node *node) argument 13606 expand_simd_clones(struct cgraph_node *node) argument 13722 struct cgraph_node *node; local [all...] |
H A D | modulo-sched.c | 136 /* The minimum (absolute) cycle that a node of ps was scheduled in. */ 139 /* The maximum (absolute) cycle that a node of ps was scheduled in. */ 161 Same as SCHED_TIME (node). */ 212 trying to schedule a node in a full row; that is, to avoid running 260 #define NODE_ASAP(node) ((node)->aux.count) 268 /* The scheduling parameters held for each node. */ 276 /* The column of a node inside the ps. If nodes u, v are on the same row, 478 /* Allocate sched_params for each node and initialize it. */ 494 /* Update the sched_params (time, row and stage) for node [all...] |
H A D | lto-streamer.h | 36 to output the numeric value for the memory address of the tree node 40 to trace how the faulty node is being emitted. */ 150 /* Special for streamer. Reference to previously-streamed node. */ 173 /* Shared INTEGER_CST node. */ 191 /* EH try/catch node. */ 461 symtab_node *node; member in struct:lto_encoder_entry 462 /* Is the node in this partition (i.e. ltrans of this partition will 483 /* Iterator structure for cgraph node sets. */ 716 If the current node differs from these, it needs to insert 1080 symtab_node *node) 1079 lto_symtab_encoder_lookup(lto_symtab_encoder_t encoder, symtab_node *node) argument [all...] |
H A D | rtlanal.c | 2228 in_expr_list_p (const_rtx listp, const_rtx node) 2233 if (node == XEXP (x, 0)) 2245 remove_node_from_expr_list (const_rtx node, rtx_expr_list **listp) 2252 if (node == temp->element ()) 2254 /* Splice the node out of the list. */ 2274 remove_node_from_insn_list (const rtx_insn *node, rtx_insn_list **listp) 2281 if (node == temp->insn ()) 2283 /* Splice the node out of the list. */ 2209 in_expr_list_p(const_rtx listp, const_rtx node) argument 2226 remove_node_from_expr_list(const_rtx node, rtx_expr_list **listp) argument 2255 remove_node_from_insn_list(const rtx_insn *node, rtx_insn_list **listp) argument
|
H A D | sched-deps.c | 269 /* Init node being inserted. */ 273 /* Fix next node. */ 281 /* Fix prev node. */ 1141 dep_node_t node = DEP_LINK_NODE (*sd_it.linkp); 1142 dep_link_t link = DEP_NODE_BACK (node); 1143 dep_t dep = DEP_NODE_DEP (node); 1396 dep_node_t node = DEP_LINK_NODE (*sd_it.linkp); 1397 dep_t dep = DEP_NODE_DEP (node); 1402 move_dep_link (DEP_NODE_BACK (node), INSN_SPEC_BACK_DEPS (con), 1405 move_dep_link (DEP_NODE_BACK (node), INSN_HARD_BACK_DEP 1136 dep_node_t node = DEP_LINK_NODE (*sd_it.linkp); local 1391 dep_node_t node = DEP_LINK_NODE (*sd_it.linkp); local 1412 dep_node_t node = DEP_LINK_NODE (*sd_it.linkp); local 3873 dep_node_t node = DEP_LINK_NODE (link); local 4775 dep_node_t node = DEP_LINK_NODE (*sd_it.linkp); local [all...] |
H A D | sched-int.h | 276 /* Dep node with all the data. */ 277 dep_node_t node; member in struct:_dep_link 291 #define DEP_LINK_NODE(N) ((N)->node) 365 . | : | |node|-+----+ | | |node|-+--+--+ : | |node|-+----+ 405 . : | |node|-+----+ | | |node|-+--+--+ : | |node|-+----+
|
H A D | stmt.c | 102 node chain. 118 struct case_node *right; /* Right son in binary tree; also node chain */ 119 struct case_node *parent; /* Parent of node in binary tree */ 122 tree code_label; /* Label to jump to when node matches */ 124 /* Probability of reaching subtree rooted at this node */ 190 which is a LABEL_DECL tree node. 819 UNIQ is number of unique case node targets, not counting the default case. 1224 number of unique case node targets seen. */ 1470 /* Search the parent sections of the case node tree argument 1476 known that if a parent node check 1516 node_has_high_bound(case_node_ptr node, tree index_type) argument 1561 node_is_bounded(case_node_ptr node, tree index_type) argument 1595 emit_case_nodes(rtx index, case_node_ptr node, rtx default_label, int default_prob, tree index_type) argument [all...] |
H A D | gimple-ssa-strength-reduction.c | 625 cand_chain_t node; 630 node = (cand_chain_t) obstack_alloc (&chain_obstack, sizeof (cand_chain)); 631 node->base_expr = base; 632 node->cand = c; 633 node->next = NULL; 634 slot = base_cand_map->find_slot (node, INSERT); 639 node->next = head->next; 640 head->next = node; 643 *slot = node; 2258 is hidden by the phi node FROM_PH 622 cand_chain_t node; local [all...] |
H A D | gimple.c | 2334 #define TYPE_OK(node) \ 2335 (TYPE_MODE (type) == TYPE_MODE (node) \ 2336 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
|
/haiku-buildtools/gcc/gcc/lto/ |
H A D | lto-partition.c | 64 static void add_symbol_to_partition (ltrans_partition part, symtab_node *node); 100 symbol_partitioned_p (symtab_node *node) argument 102 return node->aux; 107 add_references_to_partition (ltrans_partition part, symtab_node *node) argument 113 for (i = 0; node->iterate_reference (i, ref); i++) 136 add_symbol_to_partition_1 (ltrans_partition part, symtab_node *node) argument 138 enum symbol_partitioning_class c = node->get_partitioning_class (); 143 if (lto_symtab_encoder_in_partition_p (part->encoder, node)) 151 if (c == SYMBOL_PARTITION && !DECL_COMDAT (node->decl) 152 && symbol_partitioned_p (node)) 221 contained_in_symbol(symtab_node *node) argument 242 add_symbol_to_partition(ltrans_partition part, symtab_node *node) argument 275 symtab_node *node = lto_symtab_encoder_deref (partition->encoder, local 297 symtab_node *node; local 347 symtab_node *node; local 408 symtab_node *node; variable 464 struct cgraph_node *node; local 791 must_not_rename(symtab_node *node, const char *name) argument 861 validize_symbol_for_target(symtab_node *node) argument 884 privatize_symbol_name_1(symtab_node *node, tree decl) argument 917 privatize_symbol_name(symtab_node *node) argument 952 promote_symbol(symtab_node *node) argument 981 may_need_named_section_p(lto_symtab_encoder_t encoder, symtab_node *node) argument 1001 rename_statics(lto_symtab_encoder_t encoder, symtab_node *node) argument 1087 symtab_node *node = lsei_node (lsei); local 1116 symtab_node *node; local [all...] |
/haiku-buildtools/gcc/libgomp/ |
H A D | oacc-mem.c | 43 struct splay_tree_key_s node; local 46 node.host_start = (uintptr_t) h; 47 node.host_end = (uintptr_t) h + s; 50 key = splay_tree_lookup (&dev->mem_map, &node);
|