Home
last modified time | relevance | path

Searched refs:_d (Results 1 – 4 of 4) sorted by relevance

/fs/bcachefs/
A Ddarray.h58 #define darray_room(_d) ((_d).size - (_d).nr) argument
60 #define darray_top(_d) ((_d).data[(_d).nr]) argument
67 (_d)->data[(_d)->nr++] = (_item); \
73 #define darray_pop(_d) ((_d)->data[--(_d)->nr]) argument
75 #define darray_first(_d) ((_d).data[0]) argument
76 #define darray_last(_d) ((_d).data[(_d).nr - 1]) argument
89 array_remove_item((_d)->data, (_d)->nr, (_pos) - (_d)->data)
108 for ((_i) = (_d).data; _i < (_d).data + (_d).nr; _i++)
111 for (typeof(&(_d).data[0]) _i = (_d).data; _i < (_d).data + (_d).nr; _i++)
114 for (typeof(&(_d).data[0]) _i = (_d).data + (_d).nr - 1; _i >= (_d).data && (_d).nr; --_i)
[all …]
A Dsiphash.h77 #define SipHash24_End(_d) SipHash_End((_d), 2, 4) argument
78 #define SipHash24_Final(_d, _c) SipHash_Final((_d), (_c), 2, 4) argument
83 #define SipHash48_End(_d) SipHash_End((_d), 4, 8) argument
84 #define SipHash48_Final(_d, _c) SipHash_Final((_d), (_c), 4, 8) argument
A Dutil.h602 #define move_gap(_d, _new_gap) \ argument
604 BUG_ON(_new_gap > (_d)->nr); \
605 BUG_ON((_d)->gap > (_d)->nr); \
607 __move_gap((_d)->data, sizeof((_d)->data[0]), \
608 (_d)->nr, (_d)->size, (_d)->gap, _new_gap); \
609 (_d)->gap = _new_gap; \
A Dsb-downgrade.c294 #define for_each_downgrade_entry(_d, _i) \ argument
295 for (const struct bch_sb_field_downgrade_entry *_i = (_d)->entries; \
296 (void *) _i < vstruct_end(&(_d)->field) && \
297 (void *) &_i->errors[0] <= vstruct_end(&(_d)->field) && \
298 (void *) downgrade_entry_next_c(_i) <= vstruct_end(&(_d)->field); \

Completed in 11 milliseconds