Lines Matching full:gaps

662  * ma_gaps() - Get a pointer to the maple node gaps.
666 * Return: A pointer to the maple node gaps
1556 /* There cannot be two gaps in a row. */ in mas_leaf_max_gap()
1565 * @gaps: The pointer to the gaps
1569 * Uses the metadata data end to scan backwards across set gaps.
1574 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt, in ma_max_gap() argument
1582 if (gaps[i] > max_gap) { in ma_max_gap()
1583 max_gap = gaps[i]; in ma_max_gap()
1600 unsigned long *gaps; in mas_max_gap() local
1612 gaps = ma_gaps(node, mt); in mas_max_gap()
1613 return gaps[offset]; in mas_max_gap()
1617 * mas_parent_gap() - Set the parent gap and any gaps above, as needed
1673 * mas_update_gap() - Update a nodes gaps and propagate up if necessary.
1938 unsigned long *pivots, *gaps; in mas_mab_cp() local
1971 gaps = ma_gaps(node, mt); in mas_mab_cp()
1972 memcpy(b_node->gap + mab_start, gaps + mas_start, in mas_mab_cp()
2020 unsigned long *gaps = NULL; in mab_mas_cp() local
2045 gaps = ma_gaps(node, mt); in mab_mas_cp()
2047 gaps[--j] = b_node->gap[--i]; in mab_mas_cp()
2048 if (gaps[j] > max_gap) { in mab_mas_cp()
2050 max_gap = gaps[j]; in mab_mas_cp()
4726 unsigned long *pivots, *gaps; in mas_rev_awalk() local
4743 gaps = ma_gaps(node, type); in mas_rev_awalk()
4753 if (gaps) in mas_rev_awalk()
4754 gap = gaps[offset]; in mas_rev_awalk()
4762 if (!gaps) { in mas_rev_awalk()
4813 unsigned long *gaps, *pivots; in mas_anode_descend() local
4826 gaps = ma_gaps(node, type); in mas_anode_descend()
4837 if (gaps) in mas_anode_descend()
4838 gap = gaps[offset]; in mas_anode_descend()
6931 unsigned long *gaps = NULL; in mas_validate_gaps() local
6948 gaps = ma_gaps(node, mt); in mas_validate_gaps()
6952 if (!gaps) { in mas_validate_gaps()
6958 gap = gaps[i]; in mas_validate_gaps()
6985 if (gaps[offset] != max_gap) { in mas_validate_gaps()
6991 MT_BUG_ON(mas->tree, !gaps); in mas_validate_gaps()
6993 if (gaps[i] != 0) { in mas_validate_gaps()