Lines Matching full:gaps

682  * ma_gaps() - Get a pointer to the maple node gaps.
686 * Return: A pointer to the maple node gaps
1549 /* There cannot be two gaps in a row. */ in mas_leaf_max_gap()
1558 * @gaps: The pointer to the gaps
1562 * Uses the metadata data end to scan backwards across set gaps.
1567 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt, in ma_max_gap() argument
1575 if (gaps[i] > max_gap) { in ma_max_gap()
1576 max_gap = gaps[i]; in ma_max_gap()
1593 unsigned long *gaps; in mas_max_gap() local
1605 gaps = ma_gaps(node, mt); in mas_max_gap()
1606 return gaps[offset]; in mas_max_gap()
1610 * mas_parent_gap() - Set the parent gap and any gaps above, as needed
1666 * mas_update_gap() - Update a nodes gaps and propagate up if necessary.
1942 unsigned long *pivots, *gaps; in mas_mab_cp() local
1974 gaps = ma_gaps(node, mt); in mas_mab_cp()
1975 memcpy(b_node->gap + mab_start, gaps + mas_start, in mas_mab_cp()
2009 unsigned long *gaps = NULL; in mab_mas_cp() local
2034 gaps = ma_gaps(node, mt); in mab_mas_cp()
2036 gaps[--j] = b_node->gap[--i]; in mab_mas_cp()
2037 if (gaps[j] > max_gap) { in mab_mas_cp()
2039 max_gap = gaps[j]; in mab_mas_cp()
4784 unsigned long *pivots, *gaps; in mas_rev_awalk() local
4801 gaps = ma_gaps(node, type); in mas_rev_awalk()
4811 if (gaps) in mas_rev_awalk()
4812 gap = gaps[offset]; in mas_rev_awalk()
4820 if (!gaps) { in mas_rev_awalk()
4871 unsigned long *gaps, *pivots; in mas_anode_descend() local
4884 gaps = ma_gaps(node, type); in mas_anode_descend()
4895 if (gaps) in mas_anode_descend()
4896 gap = gaps[offset]; in mas_anode_descend()
7310 unsigned long *gaps = NULL; in mas_validate_gaps() local
7327 gaps = ma_gaps(node, mt); in mas_validate_gaps()
7331 if (!gaps) { in mas_validate_gaps()
7337 gap = gaps[i]; in mas_validate_gaps()
7358 MT_BUG_ON(mas->tree, !gaps); in mas_validate_gaps()
7365 if (gaps[offset] != max_gap) { in mas_validate_gaps()
7372 if (gaps[i] != 0) { in mas_validate_gaps()