Lines Matching refs:nodes
342 * two linked lists for the nodes of the tree, one for the inner nodes and
343 * one for the leave nodes. The linked leave nodes are used for fast linear
356 * struct rtree_node is a wrapper struct to link the nodes
371 struct list_head nodes; /* Radix Tree inner nodes */
410 * This function is used to allocate inner nodes as well as the
411 * leave nodes of the radix tree. It also adds the node to the
437 * The leave nodes need to be allocated in order to keep the leaves
458 node = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->nodes);
482 node = alloc_rtree_node(gfp_mask, safe_needed, ca, &zone->nodes);
523 INIT_LIST_HEAD(&zone->nodes);
550 list_for_each_entry(node, &zone->nodes, list) free_image_page(node->data, clear_nosave_free);
868 /* No more nodes, goto next zone */
927 list_for_each_entry(node, &zone->nodes, list) recycle_safe_page(node->data);
1200 unsigned int rtree, nodes;
1202 rtree = nodes = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK);
1204 while (nodes > 1) {
1205 nodes = DIV_ROUND_UP(nodes, BM_ENTRIES_PER_LEVEL);
1206 rtree += nodes;