HomeSort by: relevance | last modified time | path
    Searched refs:newnodes (Results 1 - 3 of 3) sorted by relevancy

  /src/common/lib/libc/gen/
radixtree.c 453 struct radix_tree_node *newnodes[RADIX_TREE_MAX_HEIGHT]; local in function:radix_tree_grow
463 newnodes[h] = radix_tree_alloc_node();
464 if (__predict_false(newnodes[h] == NULL)) {
466 newnodes[h]->n_ptrs[0] = NULL;
467 radix_tree_free_node(newnodes[h]);
471 newnodes[h]->n_ptrs[0] = root;
472 root = entry_compose(newnodes[h], tagmask);
radixtree.c 453 struct radix_tree_node *newnodes[RADIX_TREE_MAX_HEIGHT]; local in function:radix_tree_grow
463 newnodes[h] = radix_tree_alloc_node();
464 if (__predict_false(newnodes[h] == NULL)) {
466 newnodes[h]->n_ptrs[0] = NULL;
467 radix_tree_free_node(newnodes[h]);
471 newnodes[h]->n_ptrs[0] = root;
472 root = entry_compose(newnodes[h], tagmask);
radixtree.c 453 struct radix_tree_node *newnodes[RADIX_TREE_MAX_HEIGHT]; local in function:radix_tree_grow
463 newnodes[h] = radix_tree_alloc_node();
464 if (__predict_false(newnodes[h] == NULL)) {
466 newnodes[h]->n_ptrs[0] = NULL;
467 radix_tree_free_node(newnodes[h]);
471 newnodes[h]->n_ptrs[0] = root;
472 root = entry_compose(newnodes[h], tagmask);

Completed in 38 milliseconds