Lines Matching defs: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. */
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,
1582 if (gaps[i] > max_gap) {
1583 max_gap = gaps[i];
1600 unsigned long *gaps;
1612 gaps = ma_gaps(node, mt);
1613 return gaps[offset];
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.
1949 unsigned long *pivots, *gaps;
1982 gaps = ma_gaps(node, mt);
1983 memcpy(b_node->gap + mab_start, gaps + mas_start,
2031 unsigned long *gaps = NULL;
2056 gaps = ma_gaps(node, mt);
2058 gaps[--j] = b_node->gap[--i];
2059 if (gaps[j] > max_gap) {
2061 max_gap = gaps[j];
4726 unsigned long *pivots, *gaps;
4743 gaps = ma_gaps(node, type);
4753 if (gaps)
4754 gap = gaps[offset];
4762 if (!gaps) {
4813 unsigned long *gaps, *pivots;
4826 gaps = ma_gaps(node, type);
4837 if (gaps)
4838 gap = gaps[offset];
6931 unsigned long *gaps = NULL;
6948 gaps = ma_gaps(node, mt);
6952 if (!gaps) {
6958 gap = gaps[i];
6985 if (gaps[offset] != max_gap) {
6991 MT_BUG_ON(mas->tree, !gaps);
6993 if (gaps[i] != 0) {