Searched refs:front (Results 1 – 2 of 2) sorted by relevance
27 multiple places), a front layer is created that contains a tree of 'front'33 The front and back nodes are identical in type, but the back nodes41 To start with there is a 1:1 relationship between the front nodes47 There is a "devnode" struct associated with each front note also.49 by their associated backing node, so that multiple front nodes that83 the user from removing a front node from the directory front node.85 nodes keep their own records as to which front nodes are members89 The front nodes may be moved to other directories (including98 into its own back node, the new front node will appear in that front100 gets the front node is found via the links and not by name.[all …]
2744 uint32_t front) in kmem_init_front_head() argument2746 LIST_INIT(&ks->ks_allfree_head[front]); in kmem_init_front_head()2747 LIST_INIT(&ks->ks_partial_head[front]); in kmem_init_front_head()2748 LIST_INIT(&ks->ks_full_head[front]); in kmem_init_front_head()3315 uint32_t front) in kmem_init_free_chunk() argument3345 uint32_t front) in kmem_get_free_chunk_from_list() argument3392 uint32_t front = kmem_get_front(range_id, from_right); in kmem_locate_space() local3408 front)) != NULL) { in kmem_locate_space()3468 uint32_t front = kmem_get_front(range_id, from_right); in kmem_free_chunk() local3500 kmem_init_free_chunk(meta_start, num_chunks, front); in kmem_free_chunk()[all …]