Lines Matching refs:node
20 extent_node_t *node;
26 node = base_nodes;
27 base_nodes = *(extent_node_t **)node;
28 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
29 return (node);
33 base_node_dalloc(tsdn_t *tsdn, extent_node_t *node)
38 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
39 *(extent_node_t **)node = base_nodes;
40 base_nodes = node;
44 base_extent_node_init(extent_node_t *node, void *addr, size_t size)
48 extent_node_init(node, NULL, addr, size, sn, true, true);
54 extent_node_t *node;
60 node = base_node_try_alloc(tsdn);
61 /* Allocate enough space to also carve a node out if necessary. */
62 nsize = (node == NULL) ? CACHELINE_CEILING(sizeof(extent_node_t)) : 0;
66 if (node != NULL)
67 base_node_dalloc(tsdn, node);
71 if (node == NULL) {
72 node = (extent_node_t *)addr;
80 base_extent_node_init(node, addr, csize);
81 return (node);
94 extent_node_t *node;
106 node = extent_tree_szsnad_nsearch(&base_avail_szsnad, &key);
107 if (node != NULL) {
109 extent_tree_szsnad_remove(&base_avail_szsnad, node);
112 node = base_chunk_alloc(tsdn, csize);
114 if (node == NULL) {
119 ret = extent_node_addr_get(node);
120 if (extent_node_size_get(node) > csize) {
121 extent_node_addr_set(node, (void *)((uintptr_t)ret + csize));
122 extent_node_size_set(node, extent_node_size_get(node) - csize);
123 extent_tree_szsnad_insert(&base_avail_szsnad, node);
125 base_node_dalloc(tsdn, node);