i915/selftests/i915_syncmap.c

146 static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno)
148 	if (leaf->height) {
149 		pr_err("%s: not a leaf, height is %d\n",
150 		       __func__, leaf->height);
154 	if (__sync_seqno(leaf)[idx] != seqno) {
156 		       __func__, idx, __sync_seqno(leaf)[idx], seqno);
172 		pr_err("Inserting first context=%llx did not return leaf (height=%d, prefix=%llx\n",
211 	 * Check that inserting a new id, creates a leaf and only that leaf.
247 		pr_err("Inserting context=%llx did not return leaf (height=%d, prefix=%llx\n",
253 		pr_err("First entry into leaf (context=%llx) does not contain a single entry, found %x (count=%d)!\n",
290 	 * is always a leaf.
353 				pr_err("Inserting context=%llx (order=%d, step=%d) did not return leaf (height=%d, prefix=%llx\n",
408 	 * Each leaf holds KSYNCMAP seqno. Check that when we create KSYNCMAP
409 	 * neighbouring ids, they all fit into the same leaf.
426 				pr_err("Inserting context=%llx did not return leaf (height=%d, prefix=%llx\n",
433 				pr_err("Inserting neighbouring context=0x%llx+%d, did not fit into the same leaf bitmap=%x (%d), expected %lx (%d)\n",
460 	 * leaf holding the single id.
476 				pr_err("Inserting context=%llx (order=%d, idx=%d) did not return leaf (height=%d, prefix=%llx\n",
486 			pr_err("Parent (join) of last leaf was not the sync!\n");
506 		/* Each of our children should be a leaf */
508 			struct i915_syncmap *leaf = __sync_child(sync)[idx];
510 			if (leaf->height) {
511 				pr_err("Child %d is a not leaf!\n", idx);
516 			if (leaf->parent != sync) {
523 			if (!is_power_of_2(leaf->bitmap)) {
525 				       idx, leaf->bitmap, hweight32(leaf->bitmap));
530 			if (leaf->bitmap != BIT(idx)) {
532 				       idx, ilog2(leaf->bitmap), idx);