Lines Matching defs:gaps
589 * ma_gaps() - Get a pointer to the maple node gaps.
593 * Return: A pointer to the maple node gaps
1367 /* There cannot be two gaps in a row. */
1397 * @gaps: The pointer to the gaps
1401 * Uses the metadata data end to scan backwards across set gaps.
1406 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt,
1414 if (gaps[i] > max_gap) {
1415 max_gap = gaps[i];
1432 unsigned long *gaps;
1444 gaps = ma_gaps(node, mt);
1445 return gaps[offset];
1449 * mas_parent_gap() - Set the parent gap and any gaps above, as needed
1505 * mas_update_gap() - Update a nodes gaps and propagate up if necessary.
1976 unsigned long *gaps;
1979 gaps = ma_gaps(node, mt);
1984 if (gaps)
1985 memset(gaps + end, 0, size * sizeof(unsigned long));
1992 if (gaps && !ma_is_leaf(mt)) {
1997 if (gaps[i] > max_gap) {
1999 max_gap = gaps[i];
2572 unsigned long *gaps = ma_gaps(mn, mt);
2574 if (gaps) {
2578 cp->gap[d] = gaps[gap_slot];
4208 unsigned long *pivots, *gaps;
4225 gaps = ma_gaps(node, type);
4235 if (gaps)
4236 gap = gaps[offset];
4244 if (!gaps) {
4295 unsigned long *gaps, *pivots;
4308 gaps = ma_gaps(node, type);
4319 if (gaps)
4320 gap = gaps[offset];
6655 unsigned long *gaps = NULL;
6672 gaps = ma_gaps(node, mt);
6676 if (!gaps) {
6682 gap = gaps[i];
6703 MT_BUG_ON(mas->tree, !gaps);
6710 if (gaps[offset] != max_gap) {
6717 if (gaps[i] != 0) {