Searched refs:darray_last (Results 1 – 7 of 7) sorted by relevance
76 #define darray_last(_d) ((_d).data[(_d).nr - 1]) macro
452 ret = handle_overwrites(c, &darray_last(f->nodes), &nodes_heap); in bch2_scan_for_btree_nodes()466 for (struct found_btree_node *n = f->nodes.data; n < &darray_last(f->nodes); n++) in bch2_scan_for_btree_nodes()
851 f = darray_last(fs); in __bch2_buffered_write()885 end = min(end, folio_end_pos(darray_last(fs))); in __bch2_buffered_write()
339 return &darray_last(p->objs); in get_object_radix()
241 darray_last(line) = '\0'; in bch2_fsck_ask_yn()
674 (i == &darray_last(*keys) || in bch2_journal_keys_put()
830 struct inode_walker_entry *n = &darray_last(w->inodes); in add_inode()1908 for (struct inode_walker_entry *i = extent_i ?: &darray_last(inode->inodes); in check_extent()1943 for (struct inode_walker_entry *i = extent_i ?: &darray_last(inode->inodes); in check_extent()
Completed in 19 milliseconds