Lines Matching +full:no +full:- +full:fallthrough
19 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
31 #include "weston-test-client-helper.h"
32 #include "weston-test-fixture-compositor.h"
61 wl_list_for_each(g, &client->global_list, link) { in get_subcompositor()
62 if (strcmp(g->interface, "wl_subcompositor")) in get_subcompositor()
71 assert(global_sub && "no wl_subcompositor found"); in get_subcompositor()
73 assert(global_sub->version == 1); in get_subcompositor()
75 sub = wl_registry_bind(client->wl_registry, global_sub->name, in get_subcompositor()
87 com->subco = get_subcompositor(client); in populate_compound_surface()
89 com->parent = wl_compositor_create_surface(client->wl_compositor); in populate_compound_surface()
92 com->child[i] = in populate_compound_surface()
93 wl_compositor_create_surface(client->wl_compositor); in populate_compound_surface()
94 com->sub[i] = in populate_compound_surface()
95 wl_subcompositor_get_subsurface(com->subco, in populate_compound_surface()
96 com->child[i], in populate_compound_surface()
97 com->parent); in populate_compound_surface()
161 parent = wl_compositor_create_surface(client->wl_compositor); in TEST()
196 stranger = wl_compositor_create_surface(client->wl_compositor); in TEST()
215 stranger = wl_compositor_create_surface(client->wl_compositor); in TEST()
218 /* parent is a sub-surface */ in TEST()
233 stranger = wl_compositor_create_surface(client->wl_compositor); in TEST()
252 surface[0] = wl_compositor_create_surface(client->wl_compositor); in TEST()
253 surface[1] = wl_compositor_create_surface(client->wl_compositor); in TEST()
254 surface[2] = wl_compositor_create_surface(client->wl_compositor); in TEST()
279 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
301 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
325 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
348 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
372 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
394 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
418 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
441 grandchild = wl_compositor_create_surface(client->wl_compositor); in TEST()
460 stranger = wl_compositor_create_surface(client->wl_compositor); in TEST()
479 stranger = wl_compositor_create_surface(client->wl_compositor); in TEST()
570 surfs[i] = wl_compositor_create_surface(client->wl_compositor); in create_subsurface_tree()
573 * The tree of sub-surfaces: in create_subsurface_tree()
576 * 1 2 - 10 in create_subsurface_tree()
581 * Surface 0 has no wl_subsurface, others do. in create_subsurface_tree()
594 /* fallthrough */ in create_subsurface_tree()
597 /* fallthrough */ in create_subsurface_tree()
600 /* fallthrough */ in create_subsurface_tree()
603 /* fallthrough */ in create_subsurface_tree()
606 /* fallthrough */ in create_subsurface_tree()
609 /* fallthrough */ in create_subsurface_tree()
612 /* fallthrough */ in create_subsurface_tree()
615 /* fallthrough */ in create_subsurface_tree()
618 /* fallthrough */ in create_subsurface_tree()
632 for (i = n; i-- > 0; ) { in destroy_subsurface_tree()
653 /* Note: number of permutations to test is: set_size! / (set_size - NSTEPS)!
667 s->set_size = set_size; in permu_init()
669 s->cnt[i] = 0; in permu_init()
677 s->cnt[NSTEPS - 1]++; in permu_next()
680 if (s->cnt[0] >= s->set_size) { in permu_next()
681 return -1; in permu_next()
685 if (s->cnt[k] >= s->set_size) { in permu_next()
686 s->cnt[k - 1]++; in permu_next()
687 s->cnt[k] = 0; in permu_next()
691 if (has_dupe(s->cnt, k)) { in permu_next()
692 s->cnt[k]++; in permu_next()
723 * complex tree of sub-surfaces. in TEST()
725 * In the tree of sub-surfaces, go through every possible in TEST()
743 permu_init(&per, test_size * 2 - 1); in TEST()
744 while (permu_next(&per) != -1) { in TEST()