HomeSort by: relevance | last modified time | path
    Searched defs:new_node (Results 1 - 25 of 61) sorted by relevancy

1 2 3

  /src/external/bsd/kyua-cli/dist/utils/config/
nodes.cpp 76 base_node* new_node = (*iter).second->deep_copy(); local
78 node->_children[(*iter).first] = new_node;
80 delete new_node;
136 /// \param new_node A function that returns a new leaf node of the desired
148 new_node_hook new_node)
156 static_cast< base_node* >(new_node()) :
179 return child.lookup_rw(key, key_pos + 1, new_node);
226 std::unique_ptr< inner_node > new_node(new static_inner_node());
227 copy_into(new_node.get());
228 return new_node.release()
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/
dw5-rnglist-test.cc 34 node *new_node = &(node_array[CUR_IDX++]); local
35 new_node->left = NULL;
36 new_node->right = NULL;
37 new_node->id = val;
38 new_node->visited = false;
40 return new_node;
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/
dw5-rnglist-test.cc 34 node *new_node = &(node_array[CUR_IDX++]); local
35 new_node->left = NULL;
36 new_node->right = NULL;
37 new_node->id = val;
38 new_node->visited = false;
40 return new_node;
  /src/external/lgpl2/userspace-rcu/dist/doc/examples/list/
cds_list_replace_rcu.c 63 struct mynode *new_node; local
65 new_node = malloc(sizeof(*node));
66 if (!new_node) {
71 new_node->value = -node->value;
72 cds_list_replace_rcu(&node->node, &new_node->node);
  /src/external/mpl/bind/dist/lib/dns/
iptable.c 96 isc_radix_node_t *node, *new_node; local
100 new_node = NULL;
101 result = isc_radix_insert(tab->radix, &new_node, node, NULL);
118 new_node->data[i] = &dns_iptable_neg;
  /src/external/mpl/dhcp/bind/dist/lib/dns/
iptable.c 110 isc_radix_node_t *node, *new_node; local
114 new_node = NULL;
115 result = isc_radix_insert(tab->radix, &new_node, node, NULL);
132 new_node->data[i] = &dns_iptable_neg;
  /src/sys/external/bsd/compiler_rt/dist/lib/profile/
PGOProfiling.c 46 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); local
47 new_node->fn = fn;
48 new_node->next = NULL;
51 writeout_fn_head = writeout_fn_tail = new_node;
53 writeout_fn_tail->next = new_node;
54 writeout_fn_tail = new_node;
  /src/external/bsd/ntp/dist/ntpd/
ntp_prio_q.c 85 node *new_node; local
88 new_node = emalloc(sizeof(*new_node) + size);
90 new_node = debug_erealloc(NULL, sizeof(*new_node) + size,
93 new_node->node_next = NULL;
95 return new_node + 1;
156 node *new_node = (node *)my_node - 1; local
161 (*my_queue->get_order)(new_node + 1, j + 1) > 0) {
167 new_node->node_next = my_queue->front
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
ipa-utils.h 30 bool new_node; member in struct:ipa_dfs_info
ggc-tests.cc 365 test_node *new_node = ggc_cleared_alloc <test_node> ();
366 tail_node->m_next = new_node;
367 new_node->m_prev = tail_node;
368 new_node->m_idx = i;
369 tail_node = new_node;
358 test_node *new_node = ggc_cleared_alloc <test_node> (); local
multiple_target.cc 282 cgraph_node *new_node; local
286 new_node
289 if (new_node == NULL)
291 new_node->force_output = true;
296 new_node = cgraph_node::get_create (new_decl);
300 symtab->change_decl_assembler_name (new_node->decl, fname);
302 return new_node;
402 cgraph_node *new_node = create_target_clone (node, definition, suffix, local
405 if (new_node == NULL)
411 new_node->local = false
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-utils.h 30 bool new_node; member in struct:ipa_dfs_info
ggc-tests.cc 365 test_node *new_node = ggc_cleared_alloc <test_node> ();
366 tail_node->m_next = new_node;
367 new_node->m_prev = tail_node;
368 new_node->m_idx = i;
369 tail_node = new_node;
358 test_node *new_node = ggc_cleared_alloc <test_node> (); local
multiple_target.cc 283 cgraph_node *new_node; local
287 new_node
290 if (new_node == NULL)
292 new_node->force_output = true;
297 new_node = cgraph_node::get_create (new_decl);
301 symtab->change_decl_assembler_name (new_node->decl, fname);
303 return new_node;
401 cgraph_node *new_node = create_target_clone (node, definition, suffix, local
403 if (new_node == NULL)
405 new_node->local = false
    [all...]
  /src/external/gpl2/xcvs/dist/lib/
pagealign_alloc.c 92 memnode_t *new_node = (memnode_t *) xmalloc (sizeof (memnode_t)); local
93 new_node->aligned_ptr = aligned_ptr;
94 new_node->info = info;
95 new_node->next = memnode_table;
96 memnode_table = new_node;
  /src/external/gpl3/gcc/dist/libobjc/
objc-sync.c 181 lock_node_ptr new_node; local
187 new_node = objc_malloc (sizeof (struct lock_node));
188 new_node->lock = objc_mutex_allocate ();
189 new_node->object = nil;
190 new_node->usage_count = 0;
191 new_node->recursive_usage_count = 0;
192 new_node->next = NULL;
194 sync_pool_array[i] = new_node;
320 lock_node_ptr new_node; local
323 new_node = objc_malloc (sizeof (struct lock_node))
    [all...]
class.c 185 class_node_ptr new_node; local
191 new_node = objc_malloc (sizeof (struct class_node));
192 new_node->name = class_name;
193 new_node->length = length;
194 new_node->pointer = class_pointer;
201 new_node->next = class_table_array[hash];
202 class_table_array[hash] = new_node;
  /src/external/gpl3/gcc.old/dist/libobjc/
objc-sync.c 181 lock_node_ptr new_node; local
187 new_node = objc_malloc (sizeof (struct lock_node));
188 new_node->lock = objc_mutex_allocate ();
189 new_node->object = nil;
190 new_node->usage_count = 0;
191 new_node->recursive_usage_count = 0;
192 new_node->next = NULL;
194 sync_pool_array[i] = new_node;
320 lock_node_ptr new_node; local
323 new_node = objc_malloc (sizeof (struct lock_node))
    [all...]
class.c 185 class_node_ptr new_node; local
191 new_node = objc_malloc (sizeof (struct class_node));
192 new_node->name = class_name;
193 new_node->length = length;
194 new_node->pointer = class_pointer;
201 new_node->next = class_table_array[hash];
202 class_table_array[hash] = new_node;
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_stackdepotbase.h 142 Node &new_node = nodes[s]; local
143 new_node.store(s, args, h);
144 new_node.link = s2;
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_stackdepotbase.h 142 Node &new_node = nodes[s]; local
143 new_node.store(s, args, h);
144 new_node.link = s2;
  /src/sys/arch/sparc64/dev/
pci_machdep.c 140 int node, new_node, len; local
218 new_node = prom_firstchild(node);
219 if (new_node == 0)
221 node = new_node;
  /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
gl_anylinked_list2.h 562 gl_list_node_t new_node = local
565 ASYNCSAFE(const void *) new_node->value = elt;
567 new_node->h.hashcode =
569 ? list->base.hashcode_fn (new_node->value)
570 : (size_t)(uintptr_t) new_node->value);
572 /* Add new_node to the hash table. */
573 add_to_bucket (list, new_node);
576 /* Add new_node to the list. */
577 ASYNCSAFE(gl_list_node_t) new_node->next = node;
578 new_node->prev = node->prev
593 gl_list_node_t new_node = local
625 gl_list_node_t new_node; local
    [all...]
  /src/external/mpl/bind/dist/lib/isc/
radix.c 292 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
490 new_node = isc_mem_get(radix->mctx, sizeof(isc_radix_node_t));
494 new_node->bit = bitlen;
495 new_node->prefix = NULL;
496 result = _ref_prefix(radix->mctx, &new_node->prefix, prefix);
498 isc_mem_put(radix->mctx, new_node, sizeof(isc_radix_node_t));
505 new_node->parent = NULL;
506 new_node->l = new_node->r = NULL;
508 new_node->node_num[i] = -1
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/isc/
radix.c 298 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
496 new_node = isc_mem_get(radix->mctx, sizeof(isc_radix_node_t));
500 new_node->bit = bitlen;
501 new_node->prefix = NULL;
502 result = _ref_prefix(radix->mctx, &new_node->prefix, prefix);
504 isc_mem_put(radix->mctx, new_node, sizeof(isc_radix_node_t));
511 new_node->parent = NULL;
512 new_node->l = new_node->r = NULL;
514 new_node->node_num[i] = -1
    [all...]

Completed in 53 milliseconds

1 2 3