Lines Matching refs:tnode
53 struct ck_barrier_combining_group *tnode, in ck_barrier_combining_insert() argument
57 *child = tnode; in ck_barrier_combining_insert()
58 tnode->parent = parent; in ck_barrier_combining_insert()
95 struct ck_barrier_combining_group *tnode, in ck_barrier_combining_group_init() argument
103 tnode->k = nthr; in ck_barrier_combining_group_init()
104 tnode->count = 0; in ck_barrier_combining_group_init()
105 tnode->sense = 0; in ck_barrier_combining_group_init()
106 tnode->left = tnode->right = NULL; in ck_barrier_combining_group_init()
120 ck_barrier_combining_insert(node, tnode, &node->left); in ck_barrier_combining_group_init()
126 ck_barrier_combining_insert(node, tnode, &node->right); in ck_barrier_combining_group_init()
159 struct ck_barrier_combining_group *tnode, in ck_barrier_combining_aux() argument
167 if (ck_pr_faa_uint(&tnode->count, 1) == tnode->k - 1) { in ck_barrier_combining_aux()
172 if (tnode->parent != NULL) in ck_barrier_combining_aux()
173 ck_barrier_combining_aux(barrier, tnode->parent, sense); in ck_barrier_combining_aux()
184 ck_pr_store_uint(&tnode->count, 0); in ck_barrier_combining_aux()
186 ck_pr_store_uint(&tnode->sense, ~tnode->sense); in ck_barrier_combining_aux()
188 while (sense != ck_pr_load_uint(&tnode->sense)) in ck_barrier_combining_aux()
198 struct ck_barrier_combining_group *tnode, in ck_barrier_combining() argument
202 ck_barrier_combining_aux(barrier, tnode, state->sense); in ck_barrier_combining()