* one.
*/
new_end = end + 1;
- //printk("store %lu - %lu| %lu %lu\n", mas->index, mas->last, min, mas->max);
if (min < mas->index)
new_end++;
if (new_end >= max_slots)
return false;
- //printk("move last to %u\n", new_end);
if (new_end < max_slots - 1)
pivots[new_end] = pivots[end];
slots[new_end--] = content;
- //printk("store to %u\n", new_end);
if (new_end < max_slots - 1)
pivots[new_end] = mas->last;
slots[new_end--] = entry;
if (min < mas->index) {
- //printk("fix min in %u\n", new_end);
pivots[new_end] = mas->index - 1;
mas->offset++;
}
#else // __KERNEL__ is defined.
#define MA_PTR "%px"
#endif
+#if defined (CONFIG_MAPLE_SEARCH)
/* mas limits not adjusted */
static void mas_dfs_preorder(struct ma_state *mas)
{
mas->node = MAS_NONE;
}
-#if CONFIG_MAPLE_SEARCH
static void mas_bfs_preorder(struct ma_state *mas)
{