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 nodes42 and the backing nodes, however once the front plane has been created47 There is a "devnode" struct associated with each front note also.49 by their associated backing node, so that multiple front nodes that62 in the 'backing' node for that object. Once you have erased 'front'83 the user from removing a front node from the directory front node.84 (except permissions of course). This is because the front directory85 nodes keep their own records as to which front nodes are members[all …]
2740 uint32_t front) in kmem_init_front_head() argument2742 LIST_INIT(&ks->ks_allfree_head[front]); in kmem_init_front_head()2743 LIST_INIT(&ks->ks_partial_head[front]); in kmem_init_front_head()2744 LIST_INIT(&ks->ks_full_head[front]); in kmem_init_front_head()3311 uint32_t front) in kmem_init_free_chunk() argument3334 LIST_INSERT_HEAD(&sizeclass->ks_allfree_head[front], meta, km_link); in kmem_init_free_chunk()3341 uint32_t front) in kmem_get_free_chunk_from_list() argument3350 meta = LIST_FIRST(&sizeclass->ks_allfree_head[front]); in kmem_get_free_chunk_from_list()3369 kmem_init_free_chunk(meta + num_chunks, num_chunks_free, front); in kmem_get_free_chunk_from_list()3388 uint32_t front = kmem_get_front(range_id, from_right); in kmem_locate_space() local[all …]