| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tm/ |
| H A D | 20100615.c | 4 /* Since the non TM version of new_node() gets optimized away, it
19 static node_t *new_node(node_t *next) function
33 max = new_node(NULL);
34 min = new_node(max);
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | cgraphclones.c | 287 set_new_clone_decl_and_node_flags (cgraph_node *new_node) argument
289 DECL_EXTERNAL (new_node->decl) = 0;
290 TREE_PUBLIC (new_node->decl) = 0;
291 DECL_COMDAT (new_node->decl) = 0;
292 DECL_WEAK (new_node->decl) = 0;
293 DECL_VIRTUAL_P (new_node->decl) = 0;
294 DECL_STATIC_CONSTRUCTOR (new_node->decl) = 0;
295 DECL_STATIC_DESTRUCTOR (new_node->decl) = 0;
297 new_node->externally_visible = 0;
298 new_node
448 cgraph_node *new_node = symtab->create_empty (); local
587 cgraph_node *new_node = NULL; variable
632 set_new_clone_decl_and_node_flags (new_node); variable
[all...] |
| H A D | trans-mem.c | 4903 struct cgraph_node *new_node;
4933 new_node = cgraph_node::create_same_body_alias (new_decl, info->new_decl);
4934 new_node->tm_clone = true;
4935 new_node->externally_visible = info->old_node->externally_visible;
4936 new_node->no_reorder = info->old_node->no_reorder;
4938 get_cg_data (&node, false)->clone = new_node;
4944 ipa_tm_mark_force_output_node (new_node);
4946 ipa_tm_mark_forced_by_abi_node (new_node);
4957 struct cgraph_node *new_node;
4976 new_node
[all...] |
| H A D | ipa-utils.h | 30 bool new_node; member in struct:ipa_dfs_info
|
| H A D | symtab.c | 1575 symtab_node *new_node = NULL; local
1582 (void *)&new_node, true);
1583 if (new_node)
1584 return new_node;
1612 new_node = cgraph_node::create_alias (new_decl, node->decl);
1618 new_node = varpool_node::create_alias (new_decl, node->decl);
1620 new_node->resolve_alias (node);
1623 return new_node;
|
| H A D | ipa-cp.c | 3175 struct cgraph_node *new_node)
3180 HOST_WIDE_INT_PRINT_DEC "\n", (HOST_WIDE_INT) new_node->count);
3181 for (cs = new_node->callees; cs ; cs = cs->next_callee)
3199 struct cgraph_node *new_node)
3214 new_node->call_for_symbol_thunks_and_aliases (gather_caller_stats, &stats,
3235 new_node->count = new_sum;
3239 for (cs = new_node->callees; cs ; cs = cs->next_callee)
3253 dump_profile_updates (orig_node, new_node);
3261 update_specialized_profile (struct cgraph_node *new_node, argument
3276 new_node_count = new_node
3174 dump_profile_updates(struct cgraph_node *orig_node, struct cgraph_node *new_node) argument
3198 update_profiling_info(struct cgraph_node *orig_node, struct cgraph_node *new_node) argument
3317 struct cgraph_node *new_node; local
[all...] |
| H A D | ira-color.c | 365 allocno_hard_regs_node_t new_node;
367 new_node = ((struct allocno_hard_regs_node *)
369 new_node->check = 0;
370 new_node->hard_regs = hv;
371 new_node->hard_regs_num = hard_reg_set_size (hv->set);
372 new_node->first = NULL;
373 new_node->used_p = false;
374 return new_node;
381 allocno_hard_regs_node_t new_node)
383 new_node
363 allocno_hard_regs_node_t new_node; local
378 add_new_allocno_hard_regs_node_to_forest(allocno_hard_regs_node_t *roots, allocno_hard_regs_node_t new_node) argument
395 allocno_hard_regs_node_t node, prev, new_node; local
[all...] |
| H A D | ipa-utils.c | 118 v_info->new_node = false;
141 if (w_info->new_node)
222 info->new_node = true;
|
| H A D | tree-ssa.c | 81 edge_var_map new_node; local
87 new_node.def = def;
88 new_node.result = result;
89 new_node.locus = locus;
91 slot.safe_push (new_node);
|
| H A D | var-tracking.c | 2929 location_chain new_node; local
2932 new_node = (location_chain) pool_alloc (loc_chain_pool);
2933 new_node->loc = node->loc;
2934 new_node->init = node->init;
2936 new_node->set_src = NULL;
2938 new_node->set_src = node->set_src;
2939 node2->next = new_node;
2940 node2 = new_node;
2984 location_chain new_node; local
2987 new_node
[all...] |
| H A D | tree-sra.c | 5008 struct cgraph_node *new_node; local
5019 new_node = node->create_version_clone_with_body (redirect_callers, NULL,
5024 push_cfun (DECL_STRUCT_FUNCTION (new_node->decl));
5028 convert_callers (new_node, node->decl, adjustments);
5029 new_node->make_local ();
|
| H A D | gengtype.c | 2636 struct seen_tag *new_node = XCNEW (struct seen_tag);
2637 new_node->tag = tag;
2638 new_node->next = *seen_tags;
2639 *seen_tags = new_node;
2628 struct seen_tag *new_node = XCNEW (struct seen_tag); local
|
| H A D | omp-low.c | 12767 struct cgraph_node *new_node;
12773 new_node = old_node->create_version_clone_with_body (vNULL, NULL, NULL,
12786 new_node = old_node->create_version_clone (new_decl, vNULL, NULL);
12788 new_node->in_other_partition = 1;
12790 if (new_node == NULL)
12791 return new_node;
12793 TREE_PUBLIC (new_node->decl) = TREE_PUBLIC (old_node->decl);
12798 new_node->local.local = old_node->local.local;
12799 new_node->externally_visible = old_node->externally_visible;
12801 return new_node;
12762 struct cgraph_node *new_node; local
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
| H A D | select_type_4.f90 | 24 subroutine append_node (list, new_node)
32 class(node_type), target :: new_node
36 if (.not.associated(list%head)) list%head => new_node
37 if (associated(list%tail)) list%tail%next => new_node
38 list%tail => new_node
|
| /haiku-buildtools/gcc/liboffloadmic/runtime/ |
| H A D | offload_table.h | 191 new_node(node);
201 new_node(m_node->next);
220 void new_node(Node *node) { function in class:VarList::Iterator
|
| /haiku-buildtools/gcc/gcc/fortran/ |
| H A D | bbt.c | 130 gfc_insert_bbt (void *root, void *new_node, compare_fn compare) argument
135 n = (gfc_bbt *) new_node;
|
| /haiku-buildtools/gcc/gcc/cp/ |
| H A D | lambda.c | 929 tree new_node = copy_node (src); local
932 fn_args = tgt = new_node;
935 TREE_CHAIN (tgt) = new_node;
936 tgt = new_node;
|
| /haiku-buildtools/legacy/binutils/binutils/ |
| H A D | objcopy.c | 1004 struct redefine_node *new_node;
1017 new_node = xmalloc (sizeof (struct redefine_node));
1019 new_node->source = strdup (source);
1020 new_node->target = strdup (target);
1021 new_node->next = NULL;
1023 *p = new_node;
1002 struct redefine_node *new_node; local
|
| /haiku-buildtools/gcc/gcc/ada/gcc-interface/ |
| H A D | utils.c | 2825 struct deferred_decl_context_node *new_node;
2827 new_node
2828 = (struct deferred_decl_context_node * ) xmalloc (sizeof (*new_node));
2829 new_node->decl = decl;
2830 new_node->gnat_scope = gnat_scope;
2831 new_node->force_global = force_global;
2832 new_node->types.create (1);
2833 new_node->next = deferred_decl_context_queue;
2834 deferred_decl_context_queue = new_node;
2835 return new_node;
2807 struct deferred_decl_context_node *new_node; local
[all...] |
| /haiku-buildtools/gcc/gcc/c/ |
| H A D | c-array-notation.c | 173 tree t = NULL_TREE, new_var = NULL_TREE, new_node; local
189 new_node = build2 (MODIFY_EXPR, TREE_TYPE (t), new_var, t);
190 add_stmt (new_node);
|
| /haiku-buildtools/binutils/binutils/ |
| H A D | objcopy.c | 1620 struct redefine_node *new_node;
1633 new_node = (struct redefine_node *) xmalloc (sizeof (struct redefine_node));
1635 new_node->source = strdup (source);
1636 new_node->target = strdup (target);
1637 new_node->next = NULL;
1639 *p = new_node;
1618 struct redefine_node *new_node; local
|