HomeSort by: relevance | last modified time | path
    Searched refs:KSYNCMAP (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_syncmap.h 33 #define KSYNCMAP 16 /* radix of the tree, how many slots in each layer */
i915_syncmap.c 37 #define SHIFT ilog2(KSYNCMAP)
38 #define MASK (KSYNCMAP - 1)
86 * u32 seqno[KSYNCMAP];
87 * struct i915_syncmap *child[KSYNCMAP];
98 BUILD_BUG_ON_NOT_POWER_OF_2(KSYNCMAP);
100 BUILD_BUG_ON(KSYNCMAP > BITS_PER_TYPE((*root)->bitmap));
208 p = kmalloc(sizeof(*p) + KSYNCMAP * sizeof(u32), GFP_KERNEL);
266 * Each layer in the tree holds 16 (KSYNCMAP) pointers, either fences
290 next = kzalloc(sizeof(*next) + KSYNCMAP * sizeof(next),
  /src/sys/external/bsd/drm2/dist/drm/i915/selftests/
i915_syncmap.c 67 for_each_set_bit(i, (unsigned long *)&p->bitmap, KSYNCMAP) {
82 for_each_set_bit(i, (unsigned long *)&p->bitmap, KSYNCMAP) {
349 for (step = 0; step < KSYNCMAP; step++) {
366 for (step = 0; step < KSYNCMAP; step++) {
377 for (idx = 1; idx < KSYNCMAP; idx++) {
389 for (step = 0; step < KSYNCMAP; step++) {
413 * Each leaf holds KSYNCMAP seqno. Check that when we create KSYNCMAP
425 for (idx = 0; idx < KSYNCMAP; idx++) {
473 for (idx = 0; idx < KSYNCMAP; idx++)
    [all...]

Completed in 12 milliseconds