Searched refs:new_node (Results 1 – 12 of 12) sorted by relevance
| /openbsd/src/gnu/llvm/lldb/examples/scripting/ |
| D | dictionary.c | 60 tree_node *new_node = (tree_node *)malloc(sizeof(tree_node)); in insert() local
61 new_node->word = strdup(word); in insert()
62 new_node->left = NULL; in insert()
63 new_node->right = NULL; in insert()
64 root->left = new_node; in insert()
70 tree_node *new_node = (tree_node *)malloc(sizeof(tree_node)); in insert() local
71 new_node->word = strdup(word); in insert()
72 new_node->left = NULL; in insert()
73 new_node->right = NULL; in insert()
74 root->right = new_node; in insert()
[all …]
|
| /openbsd/src/gnu/llvm/compiler-rt/lib/profile/ |
| D | GCDAProfiling.c | 114 struct fn_node* new_node = malloc(sizeof(struct fn_node)); in fn_list_insert() local
115 new_node->fn = fn; in fn_list_insert()
116 new_node->next = NULL; in fn_list_insert()
117 new_node->id = CURRENT_ID; in fn_list_insert()
120 list->head = list->tail = new_node; in fn_list_insert()
122 list->tail->next = new_node; in fn_list_insert()
123 list->tail = new_node; in fn_list_insert()
|
| /openbsd/src/gnu/llvm/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_stackdepotbase.h | 142 Node &new_node = nodes[s]; in Put() local
143 new_node.store(s, args, h); in Put()
144 new_node.link = s2; in Put()
|
| /openbsd/src/gnu/llvm/lldb/docs/use/ |
| D | python.rst | 682 tree_node *new_node = (tree_node *)malloc(sizeof(tree_node));
683 new_node->word = strdup(word);
684 new_node->left = NULL;
685 new_node->right = NULL;
686 root->left = new_node;
692 tree_node *new_node = (tree_node *)malloc(sizeof(tree_node));
693 new_node->word = strdup(word);
694 new_node->left = NULL;
695 new_node->right = NULL;
696 root->right = new_node;
[all …]
|
| /openbsd/src/gnu/gcc/gcc/ |
| D | ipa-cp.c | 173 struct cgraph_node *new_node) in ipcp_cloned_create() argument
175 ipa_node_create (new_node); in ipcp_cloned_create()
176 ipcp_method_set_orig_node (new_node, orig_node); in ipcp_cloned_create()
177 ipa_method_formal_compute_count (new_node); in ipcp_cloned_create()
178 ipa_method_compute_tree_map (new_node); in ipcp_cloned_create()
|
| D | cgraph.c | 562 struct cgraph_node *new_node = node->next_clone; in cgraph_remove_node() local
566 for (n = new_node; n; n = n->next_clone) in cgraph_remove_node()
567 n->master_clone = new_node; in cgraph_remove_node()
569 *slot = new_node; in cgraph_remove_node()
|
| D | var-tracking.c | 1192 location_chain new_node; in variable_union() local
1195 new_node = pool_alloc (loc_chain_pool); in variable_union()
1196 new_node->loc = node->loc; in variable_union()
1197 vui[n].lc = new_node; in variable_union()
|
| /openbsd/src/usr.bin/tsort/ |
| D | tsort.c | 117 static struct node *new_node(const char *, const char *);
210 new_node(const char *start, const char *end) in new_node() function
241 n = ohash_insert(h, i, new_node(start, end)); in node_lookup()
|
| /openbsd/src/gnu/usr.bin/binutils/binutils/ |
| D | objcopy.c | 955 struct redefine_node *new_node; in redefine_list_append() local
968 new_node = xmalloc (sizeof (struct redefine_node)); in redefine_list_append()
970 new_node->source = strdup (source); in redefine_list_append()
971 new_node->target = strdup (target); in redefine_list_append()
972 new_node->next = NULL; in redefine_list_append()
974 *p = new_node; in redefine_list_append()
|
| /openbsd/src/gnu/usr.bin/binutils-2.17/binutils/ |
| D | objcopy.c | 1027 struct redefine_node *new_node; in redefine_list_append() local
1040 new_node = xmalloc (sizeof (struct redefine_node)); in redefine_list_append()
1042 new_node->source = strdup (source); in redefine_list_append()
1043 new_node->target = strdup (target); in redefine_list_append()
1044 new_node->next = NULL; in redefine_list_append()
1046 *p = new_node; in redefine_list_append()
|
| /openbsd/src/sys/dev/pci/ |
| D | if_ice.c | 18701 struct ice_sched_node *prev, *new_node; in ice_sched_add_elems() local
18761 new_node = ice_sched_find_node_by_teid(parent, teid); in ice_sched_add_elems()
18762 if (!new_node) { in ice_sched_add_elems()
18769 new_node->sibling = NULL; in ice_sched_add_elems()
18770 new_node->tc_num = tc_node->tc_num; in ice_sched_add_elems()
18775 if (prev && prev != new_node) { in ice_sched_add_elems()
18778 prev->sibling = new_node; in ice_sched_add_elems()
18783 pi->sib_head[tc_node->tc_num][layer] = new_node; in ice_sched_add_elems()
|
| /openbsd/src/gnu/gcc/libstdc++-v3/include/tr1/ |
| D | hashtable | 944 // First find the node, avoid leaking new_node if compare throws.
|