/freebsd-11-stable/contrib/gcc/cp/ |
H A D | decl.c | 3089 tree *const node; member in struct:predefined_identifier [all...] |
H A D | decl2.c | 2734 tree node, init_if_stmt, cond; local 3033 struct cgraph_node *node; local [all...] |
H A D | lex.c | 718 cxx_dup_lang_specific_decl(tree node) argument 755 copy_lang_type(tree node) argument [all...] |
H A D | mangle.c | 381 canonicalize_for_substitution (tree node) argument 396 add_substitution (tree node) argument 438 is_std_substitution(const tree node, const substitution_identifier_index_t index) argument 471 is_std_substitution_char(const tree node, const substitution_identifier_index_t index) argument 527 find_substitution(tree node) argument 952 write_prefix(const tree node) argument 1017 write_template_prefix(const tree node) argument 2298 write_template_arg(tree node) argument [all...] |
H A D | parser.c | 2547 tree node; local 7018 tree node; local 17914 tree quals = NULL_TREE, node; local [all...] |
H A D | ptree.c | 33 cxx_print_decl (FILE *file, tree node, int indent) argument 64 cxx_print_type(FILE *file, tree node, int indent) argument 152 cxx_print_identifier(FILE *file, tree node, int indent) argument 169 cxx_print_xnode(FILE *file, tree node, int indent) argument [all...] |
H A D | semantics.c | 440 anon_aggr_type_p (tree node) argument
|
H A D | tree.c | 1818 handle_java_interface_attribute(tree* node, tree name, tree args ATTRIBUTE_UNUSED , int flags, bool* no_add_attrs) argument 1843 handle_com_interface_attribute(tree* node, tree name, tree args ATTRIBUTE_UNUSED , int flags ATTRIBUTE_UNUSED , bool* no_add_attrs) argument 1872 handle_init_priority_attribute(tree* node, tree name, tree args, int flags ATTRIBUTE_UNUSED , bool* no_add_attrs) argument [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | dominance.c | 569 assign_dfs_numbers(struct et_node *node, int *num) argument 677 struct et_node *node = bb->dom[dir]; local 693 struct et_node *node = bb->dom[dir]; local 717 struct et_node *node = bb->dom[dir], *son = node->son, *ason; local [all...] |
H A D | dwarf2asm.c | 714 splay_tree_node node; local 773 dw2_output_indirect_constant_1(splay_tree_node node, void *data ATTRIBUTE_UNUSED) argument
|
H A D | dwarf2out.c | 5022 struct indirect_string_node *node; local 5056 struct indirect_string_node *node; local 6421 limbo_die_node *node, **pnode; local 10064 struct cgraph_varpool_node *node = cgraph_varpool_node (*tp); local 10071 struct cgraph_node *node = cgraph_node (*tp); local 10415 struct var_loc_node *node; local 11521 gen_formal_parameter_die(tree node, dw_die_ref context_die) argument 14102 struct indirect_string_node *node = (struct indirect_string_node *) *h; local 14332 limbo_die_node *node; local 14388 limbo_die_node *node, *next_node; local [all...] |
H A D | et-forest.c | 444 et_new_occ (struct et_node *node) argument
|
H A D | except.c | 3573 struct cgraph_varpool_node *node; local
|
H A D | flow.c | 3103 splay_tree_node node; local 3179 flush_reg_cond_reg_1(splay_tree_node node, void *data) argument 3881 splay_tree_node node; local [all...] |
H A D | ipa-cp.c | 156 ipcp_method_is_cloned (struct cgraph_node *node) argument 163 ipcp_method_set_orig_node (struct cgraph_node *node, argument 197 ipcp_method_set_scale (struct cgraph_node *node, gcov_type count) argument 379 struct cgraph_node *node; local 494 ipcp_method_compute_scale(struct cgraph_node *node) argument 516 struct cgraph_node *node; local 553 struct cgraph_node *node; local 639 struct cgraph_node *node; local 685 struct cgraph_node *node; local 699 struct cgraph_node *node; local 713 struct cgraph_node *node; local 732 struct cgraph_node *node; local 761 FOR_EACH_BB_FN(bb, DECL_STRUCT_FUNCTION (node->decl)) argument 788 struct cgraph_node *node; local 802 FOR_EACH_BB_FN(bb, DECL_STRUCT_FUNCTION (node->decl)) argument 922 struct cgraph_node *node, *orig_callee; local 948 ipcp_update_bb_counts(struct cgraph_node *node, gcov_type scale) argument 958 ipcp_update_edges_counts(struct cgraph_node *node, gcov_type scale) argument 974 struct cgraph_node *node, *orig_node; local 1005 struct cgraph_node *node, *node1 = NULL; local [all...] |
H A D | ipa-inline.c | 223 cgraph_estimate_growth (struct cgraph_node *node) argument 419 update_caller_keys(fibheap_t heap, struct cgraph_node *node, bitmap updated_nodes) argument 472 update_callee_keys(fibheap_t heap, struct cgraph_node *node, bitmap updated_nodes) argument 489 lookup_recursive_calls(struct cgraph_node *node, struct cgraph_node *where, fibheap_t heap) argument 516 cgraph_find_cycles(struct cgraph_node *node, htab_t cycles) argument 545 cgraph_flatten_node(struct cgraph_node *node, htab_t cycles) argument 573 cgraph_decide_recursive_inlining(struct cgraph_node *node) argument 698 cgraph_set_inline_failed(struct cgraph_node *node, const char *reason) argument 719 struct cgraph_node *node; local 899 struct cgraph_node *node; local 1084 cgraph_decide_inlining_incrementally(struct cgraph_node *node, bool early) argument 1186 struct cgraph_node *node; local [all...] |
H A D | ipa-prop.c | 97 struct cgraph_node *node; local 515 ipa_node_create (struct cgraph_node *node) argument 525 struct cgraph_node *node; local 535 struct cgraph_node *node; local 547 struct cgraph_node *node; local 560 struct cgraph_node *node; local 575 struct cgraph_node *node; local 604 struct cgraph_node *node; local 629 struct cgraph_node *node; local [all...] |
H A D | ipa-pure-const.c | 81 get_function_state (struct cgraph_node *node) argument 598 struct cgraph_node *node; local [all...] |
H A D | ipa-reference.c | 112 get_reference_vars_info_from_cgraph (struct cgraph_node * node) argument 745 struct cgraph_node *node; local 895 struct cgraph_node *node; local [all...] |
H A D | ipa-type-escape.c | 1676 struct cgraph_node *node; local [all...] |
H A D | ipa-utils.c | 161 struct cgraph_node *node; local [all...] |
H A D | ipa.c | 33 struct cgraph_node *node, *node2; local 100 struct cgraph_node *node, *next; local [all...] |
H A D | lambda-code.c | 2343 tree node, op = USE_FROM_PTR (use_a); local [all...] |
H A D | lists.c | 92 rtx node; local 104 rtx node; local [all...] |
H A D | modulo-sched.c | 114 ddg_node_ptr node; member in struct:ps_insn 2091 create_ps_insn(ddg_node_ptr node, int rest_count, int cycle) argument 2253 add_node_to_ps(partial_schedule_ptr ps, ddg_node_ptr node, int cycle, sbitmap must_precede, sbitmap must_follow) argument [all...] |