return false;
}
-static void mas_update_limits(struct ma_state *ms, unsigned char slot);
+static void mas_update_limits(struct ma_state *ms, unsigned char slot)
+{
+ struct maple_range_64 *mr64;
+
+ if (slot >= MAPLE_NODE_SLOTS)
+ return;
+
+ if (mas_is_start(ms))
+ return;
+
+ mr64 = &mt_to_node(ms->node)->mr64;
+ if (slot > 0)
+ ms->min = mr64->pivot[slot - 1] + 1;
+
+ if (slot < MAPLE_RANGE64_SLOTS - 1)
+ ms->max = mr64->pivot[slot];
+}
static inline void ma_encoded_parent(struct ma_state *mas)
{
struct maple_node *parent, *gparent;
rcu_assign_pointer(ms->tree->ma_root, mt_mk_root(ms->node));
}
-static void mas_update_limits(struct ma_state *ms, unsigned char slot)
-{
- struct maple_range_64 *mr64;
-
- if (slot >= MAPLE_NODE_SLOTS)
- return;
-
- if (mas_is_start(ms))
- return;
-
- mr64 = &mt_to_node(ms->node)->mr64;
- if (slot > 0)
- ms->min = mr64->pivot[slot - 1] + 1;
-
- if (slot < MAPLE_RANGE64_SLOTS - 1)
- ms->max = mr64->pivot[slot];
-}
/* Private
* Combine nulls with the same pivot value
* Note: The mas->node will most likely be changed, so keep track of the old