20 	extent_node_t *node;  in base_node_try_alloc()  local
24 	node = base_nodes;  in base_node_try_alloc()
25 	base_nodes = *(extent_node_t **)node;  in base_node_try_alloc()
26 	JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));  in base_node_try_alloc()
27 	return (node);  in base_node_try_alloc()
32 base_node_dalloc(extent_node_t *node)  in base_node_dalloc()  argument
35 	JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));  in base_node_dalloc()
36 	*(extent_node_t **)node = base_nodes;  in base_node_dalloc()
37 	base_nodes = node;  in base_node_dalloc()
44 	extent_node_t *node;  in base_chunk_alloc()  local
49 	node = base_node_try_alloc();  in base_chunk_alloc()
51 	nsize = (node == NULL) ? CACHELINE_CEILING(sizeof(extent_node_t)) : 0;  in base_chunk_alloc()
55 		if (node != NULL)  in base_chunk_alloc()
56 			base_node_dalloc(node);  in base_chunk_alloc()
60 	if (node == NULL) {  in base_chunk_alloc()
61 		node = (extent_node_t *)addr;  in base_chunk_alloc()
69 	extent_node_init(node, NULL, addr, csize, true, true);  in base_chunk_alloc()
70 	return (node);  in base_chunk_alloc()
83 	extent_node_t *node;  in base_alloc()  local
95 	node = extent_tree_szad_nsearch(&base_avail_szad, &key);  in base_alloc()
96 	if (node != NULL) {  in base_alloc()
98 		extent_tree_szad_remove(&base_avail_szad, node);  in base_alloc()
101 		node = base_chunk_alloc(csize);  in base_alloc()
103 	if (node == NULL) {  in base_alloc()
108 	ret = extent_node_addr_get(node);  in base_alloc()
109 	if (extent_node_size_get(node) > csize) {  in base_alloc()
110 		extent_node_addr_set(node, (void *)((uintptr_t)ret + csize));  in base_alloc()
111 		extent_node_size_set(node, extent_node_size_get(node) - csize);  in base_alloc()
112 		extent_tree_szad_insert(&base_avail_szad, node);  in base_alloc()
114 		base_node_dalloc(node);  in base_alloc()