Lines Matching defs:value
469 max = 300; /* A value big enough to include XA_ZERO_ENTRY at 64. */
554 * Find last value.
555 * 1. get the expected value, leveraging the existence of an end entry
557 * 3. find the last value but searching for ULONG_MAX and then using
575 /* Get the previous value from MAS_START */
697 * 5. return value
704 0, /* Return value success. */
710 0, /* Return value success. */
716 0, /* Return value success. */
722 0, /* Return value success. */
865 * 5. return value
872 0, /* Return value success. */
878 0, /* Return value success. */
885 0, /* Return value success. */
892 -EBUSY, /* Return value failed. */
899 0, /* Return value success. */
906 -EBUSY, /* Return value failure. */
1343 void *value;
1352 value = mas_find(&mas, ULONG_MAX);
1353 MT_BUG_ON(mt, value != xa_mk_value(index));
1354 value = mas_prev(&mas, 0);
1355 MT_BUG_ON(mt, value != xa_mk_value(index - 1));
1368 value = mas_walk(&mas);
1369 MT_BUG_ON(mt, value != xa_mk_value(2));
1371 value = mas_prev(&mas, 19);
1372 MT_BUG_ON(mt, value != NULL);
1375 value = mas_walk(&mas);
1376 MT_BUG_ON(mt, value != xa_mk_value(8));
1378 value = mas_prev(&mas, 76);
1379 MT_BUG_ON(mt, value != NULL);
1905 /* Ensure mas_find() gets the next value */
2288 * 4. spanning store failure due to writing incorrect pivot value at
2575 * Fix by checking if there is a value in pivot before incrementing the
2667 /* Check with a value at zero */
2677 /* Check with a value at zero, no gap */
2687 /* Check with a value at zero and unreasonably large */
2906 * │ │ │ └─ The node value after execution
2907 * │ │ └─ The node value before execution
3328 /* next: none -> active, skip value at location */
3374 /* prev:first value -> underflow */
3381 /* find:underflow -> first value */
3430 /* find: start ->active on value */;
3700 * Second set of tests try to load a value that doesn't exist, inserts
3701 * a second value, then loads the value again