Lines Matching refs:index
44 unsigned long index[RCU_RANGE_COUNT];
50 unsigned long index;
465 static noinline void __init check_erase(struct maple_tree *mt, unsigned long index,
468 MT_BUG_ON(mt, mtree_test_erase(mt, index) != ptr);
777 if (s_entry && (s_min == mas_start->index))
781 bool ssplit = s_min != mas_start->index;
807 * mas_node_walk() - Walk a maple node to offset of the index.
825 unsigned long index;
828 (*range_max) = (*range_min) = mas->index;
832 mas->offset = mas->index = mas->min;
843 index = mas->index;
844 if (unlikely(index <= max))
854 if (index <= max)
914 * mas_tree_walk() - Walk to @mas->index and set the range values.
919 * Ranges are only valid if there is a valid entry at @mas->index.
936 if (!mas->index)
960 unsigned long index = mas->index;
972 if (mas_dead_node(mas, index))
1037 if (s_min < mas_start.index)
1090 mas.index = 0;
1094 if (addr == mas.index) {
1097 mas.index, mas.last);
1100 addr = mas.index;
1104 pr_err("mas: %lu -> %p\n", mas.index, foo);
33867 * mmap: mas.index 4041162752 align mask 0 offset 0
33969 mas.index = 0;
34022 /* MT_BUG_ON(mt, mas.index != 139953197318144); */
34038 /*MT_BUG_ON(mt, mas.index != 140222966259712); */
34054 mas.index = 140656779083776;
34147 mas.index = (mas.last + 1 - 2097152 - 0) & (~2093056);
34148 MT_BUG_ON(mt, mas.index != 139918401601536);
34205 * mmap: mas.index 140582827569152 align mask 0 offset 0
34341 /* RCU reader in increasing index */
34347 unsigned long index = reader->id;
34360 mas_set(&mas, test->index[index]);
34361 mas_for_each(&mas, entry, test->last[index + 9]) {
34365 r_start = test->index[index + i];
34366 r_end = test->last[index + i];
34371 alt_start = test->index[index + reader->flip];
34373 if (mas.index == alt_start) {
34380 r_start = test->index[index + i];
34381 r_end = test->last[index + i];
34387 alt_start = test->index[index + reader->next];
34388 if (mas.index == r_start) {
34391 } else if (mas.index == alt_start) {
34393 r_start = test->index[index + i];
34394 r_end = test->last[index + i];
34399 RCU_MT_BUG_ON(test, mas.index != r_start);
34403 alt = xa_mk_value(index + i + RCU_RANGE_COUNT);
34416 printk("!!%lu-%lu -> %p not %p or %p\n", mas.index, mas.last, entry, expected, alt);
34422 alt = xa_mk_value(index + i * 2 + 1 +
34439 printk("!!%lu-%lu -> %p not %p\n", mas.index, mas.last, entry, expected);
34452 /* RCU reader in decreasing index */
34457 unsigned long index = reader->id;
34471 mas_set(&mas, test->index[index + i]);
34479 entry = mas_prev(&mas, test->index[index]);
34480 r_start = test->index[index + i];
34481 r_end = test->last[index + i];
34485 alt_start = test->index[index + reader->mod];
34486 if (mas.index == alt_start) {
34495 r_start = test->index[index + i];
34496 r_end = test->last[index + i];
34501 alt_start = test->index[index + reader->flip];
34502 if (mas.index == r_start) {
34506 } else if (mas.index == alt_start) {
34509 r_start = test->index[index + i];
34510 r_end = test->last[index + i];
34520 if (mas.index != r_start) {
34521 alt = xa_mk_value(index + i * 2 + 1 +
34525 mas.index, mas.last, entry,
34529 RCU_MT_BUG_ON(test, mas.index != r_start);
34533 alt = xa_mk_value(index + i * 2 + 1 +
34550 alt = xa_mk_value(index + i +
34565 mas.index, mas.last, entry,
34573 printk("%lu-%lu %p != %p\n", mas.index,
34604 start = test->index[this->id + this->mod];
34614 start = test->index[this->id + this->flip];
34625 start = test->index[this->id + this->del];
34632 start = test->index[this->id + this->add];
34661 start = test->index[this->id + this->mod];
34671 start = test->index[this->id + this->flip];
34682 start = test->index[this->id + this->del];
34689 start = test->index[this->id + this->add];
34739 test.index[i] = seed;
34767 mtree_store_range(mt, test.index[add], test.last[add],
34792 unsigned long index; /* The first index to check */
34813 unsigned long removed; /* The index of the removed entry */
34814 unsigned long added; /* The index of the removed entry */
34815 unsigned long toggle; /* The index of the removed entry */
34869 entry = mtree_load(test->mt, test->index);
34903 expected = xa_mk_value(mas.index ? mas.index / 10 : 0);
34906 if (mas.index < test->index || mas.index > test->last) {
34909 mas.index, mas.last, entry, expected);
34955 mtree_store_range(mt, vals->index, vals->last, vals->entry2,
34967 MA_STATE(mas, test->mt, test->index, test->index);
34975 RCU_MT_BUG_ON(test, (test->index - mas.index) !=
34993 test.index = start;
35035 unsigned int index = vals->index;
35054 while (index <= vals->last) {
35055 mtree_store(mt, index,
35056 (index % 2 ? vals->entry2 : vals->entry3),
35058 index++;
35084 mas_writer.index = i * 10;
35189 mas_writer.index = i * 10;
35246 vals.index = 8650;
35269 vals.index = 4390;
35306 vals.index = 4390;
35432 mas.index = mas.last = count;