函数源码

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source File:lib\test_xarray.c Create Date:2022-07-27 07:30:58
首页 Copyright©Brick

171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
static noinline void check_xa_mark_1(struct xarray *xa, unsigned long index)
{
    unsigned int order;
    unsigned int max_order = IS_ENABLED(CONFIG_XARRAY_MULTI) ? 8 : 1;
 
    /* NULL elements have no marks set */
    XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
    xa_set_mark(xa, index, XA_MARK_0);
    XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
 
    /* Storing a pointer will not make a mark appear */
    XA_BUG_ON(xa, xa_store_index(xa, index, GFP_KERNEL) != NULL);
    XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
    xa_set_mark(xa, index, XA_MARK_0);
    XA_BUG_ON(xa, !xa_get_mark(xa, index, XA_MARK_0));
 
    /* Setting one mark will not set another mark */
    XA_BUG_ON(xa, xa_get_mark(xa, index + 1, XA_MARK_0));
    XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_1));
 
    /* Storing NULL clears marks, and they can't be set again */
    xa_erase_index(xa, index);
    XA_BUG_ON(xa, !xa_empty(xa));
    XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
    xa_set_mark(xa, index, XA_MARK_0);
    XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
 
    /*
     * Storing a multi-index entry over entries with marks gives the
     * entire entry the union of the marks
     */
    BUG_ON((index % 4) != 0);
    for (order = 2; order < max_order; order++) {
        unsigned long base = round_down(index, 1UL << order);
        unsigned long next = base + (1UL << order);
        unsigned long i;
 
        XA_BUG_ON(xa, xa_store_index(xa, index + 1, GFP_KERNEL));
        xa_set_mark(xa, index + 1, XA_MARK_0);
        XA_BUG_ON(xa, xa_store_index(xa, index + 2, GFP_KERNEL));
        xa_set_mark(xa, index + 2, XA_MARK_2);
        XA_BUG_ON(xa, xa_store_index(xa, next, GFP_KERNEL));
        xa_store_order(xa, index, order, xa_mk_index(index),
                GFP_KERNEL);
        for (i = base; i < next; i++) {
            XA_STATE(xas, xa, i);
            unsigned int seen = 0;
            void *entry;
 
            XA_BUG_ON(xa, !xa_get_mark(xa, i, XA_MARK_0));
            XA_BUG_ON(xa, xa_get_mark(xa, i, XA_MARK_1));
            XA_BUG_ON(xa, !xa_get_mark(xa, i, XA_MARK_2));
 
            /* We should see two elements in the array */
            rcu_read_lock();
            xas_for_each(&xas, entry, ULONG_MAX)
                seen++;
            rcu_read_unlock();
            XA_BUG_ON(xa, seen != 2);
 
            /* One of which is marked */
            xas_set(&xas, 0);
            seen = 0;
            rcu_read_lock();
            xas_for_each_marked(&xas, entry, ULONG_MAX, XA_MARK_0)
                seen++;
            rcu_read_unlock();
            XA_BUG_ON(xa, seen != 1);
        }
        XA_BUG_ON(xa, xa_get_mark(xa, next, XA_MARK_0));
        XA_BUG_ON(xa, xa_get_mark(xa, next, XA_MARK_1));
        XA_BUG_ON(xa, xa_get_mark(xa, next, XA_MARK_2));
        xa_erase_index(xa, index);
        xa_erase_index(xa, next);
        XA_BUG_ON(xa, !xa_empty(xa));
    }
    XA_BUG_ON(xa, !xa_empty(xa));
}