Lines Matching refs:node
20 extent_node_t *node;
24 node = base_nodes;
25 base_nodes = *(extent_node_t **)node;
26 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
27 return (node);
32 base_node_dalloc(extent_node_t *node)
35 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
36 *(extent_node_t **)node = base_nodes;
37 base_nodes = node;
44 extent_node_t *node;
49 node = base_node_try_alloc();
50 /* Allocate enough space to also carve a node out if necessary. */
51 nsize = (node == NULL) ? CACHELINE_CEILING(sizeof(extent_node_t)) : 0;
55 if (node != NULL)
56 base_node_dalloc(node);
60 if (node == NULL) {
61 node = (extent_node_t *)addr;
69 extent_node_init(node, NULL, addr, csize, true, true);
70 return (node);
83 extent_node_t *node;
95 node = extent_tree_szad_nsearch(&base_avail_szad, &key);
96 if (node != NULL) {
98 extent_tree_szad_remove(&base_avail_szad, node);
101 node = base_chunk_alloc(csize);
103 if (node == NULL) {
108 ret = extent_node_addr_get(node);
109 if (extent_node_size_get(node) > csize) {
110 extent_node_addr_set(node, (void *)((uintptr_t)ret + csize));
111 extent_node_size_set(node, extent_node_size_get(node) - csize);
112 extent_tree_szad_insert(&base_avail_szad, node);
114 base_node_dalloc(node);
