Lines Matching full:gaps
668 * ma_gaps() - Get a pointer to the maple node gaps.
672 * Return: A pointer to the maple node gaps
1535 /* There cannot be two gaps in a row. */ in mas_leaf_max_gap()
1544 * @gaps: The pointer to the gaps
1548 * Uses the metadata data end to scan backwards across set gaps.
1553 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt, in ma_max_gap() argument
1561 if (gaps[i] > max_gap) { in ma_max_gap()
1562 max_gap = gaps[i]; in ma_max_gap()
1579 unsigned long *gaps; in mas_max_gap() local
1591 gaps = ma_gaps(node, mt); in mas_max_gap()
1592 return gaps[offset]; in mas_max_gap()
1596 * mas_parent_gap() - Set the parent gap and any gaps above, as needed
1652 * mas_update_gap() - Update a nodes gaps and propagate up if necessary.
1928 unsigned long *pivots, *gaps; in mas_mab_cp() local
1961 gaps = ma_gaps(node, mt); in mas_mab_cp()
1962 memcpy(b_node->gap + mab_start, gaps + mas_start, in mas_mab_cp()
1996 unsigned long *gaps = NULL; in mab_mas_cp() local
2021 gaps = ma_gaps(node, mt); in mab_mas_cp()
2023 gaps[--j] = b_node->gap[--i]; in mab_mas_cp()
2024 if (gaps[j] > max_gap) { in mab_mas_cp()
2026 max_gap = gaps[j]; in mab_mas_cp()
4786 unsigned long *pivots, *gaps; in mas_rev_awalk() local
4803 gaps = ma_gaps(node, type); in mas_rev_awalk()
4813 if (gaps) in mas_rev_awalk()
4814 gap = gaps[offset]; in mas_rev_awalk()
4822 if (!gaps) { in mas_rev_awalk()
4873 unsigned long *gaps, *pivots; in mas_anode_descend() local
4886 gaps = ma_gaps(node, type); in mas_anode_descend()
4897 if (gaps) in mas_anode_descend()
4898 gap = gaps[offset]; in mas_anode_descend()
7309 unsigned long *gaps = NULL; in mas_validate_gaps() local
7326 gaps = ma_gaps(node, mt); in mas_validate_gaps()
7330 if (!gaps) { in mas_validate_gaps()
7336 gap = gaps[i]; in mas_validate_gaps()
7357 MT_BUG_ON(mas->tree, !gaps); in mas_validate_gaps()
7364 if (gaps[offset] != max_gap) { in mas_validate_gaps()
7371 if (gaps[i] != 0) { in mas_validate_gaps()