2  * Copyright 2011-2015 Samy Al Bahra.
38 	ck_pr_store_uint(&barrier->tid, 0);  in ck_barrier_mcs_init()
46 			barrier[i].havechild[j] = ((i << 2) + j < nthr - 1) ? ~0 : 0;  in ck_barrier_mcs_init()
50 			 * a thread does not wait for a child that does not exist.  in ck_barrier_mcs_init()
58 		    &barrier[(i - 1) >> 2].childnotready[(i - 1) & 3];  in ck_barrier_mcs_init()
76 ck_barrier_mcs_subscribe(struct ck_barrier_mcs *barrier, struct ck_barrier_mcs_state *state)  in ck_barrier_mcs_subscribe()  argument
79 	state->sense = ~0;  in ck_barrier_mcs_subscribe()
80 	state->vpid = ck_pr_faa_uint(&barrier->tid, 1);  in ck_barrier_mcs_subscribe()
104 	ck_pr_store_uint(&node->childnotready[0], node->havechild[0]);  in ck_barrier_mcs_reinitialize_children()
105 	ck_pr_store_uint(&node->childnotready[1], node->havechild[1]);  in ck_barrier_mcs_reinitialize_children()
106 	ck_pr_store_uint(&node->childnotready[2], node->havechild[2]);  in ck_barrier_mcs_reinitialize_children()
107 	ck_pr_store_uint(&node->childnotready[3], node->havechild[3]);  in ck_barrier_mcs_reinitialize_children()
113     struct ck_barrier_mcs_state *state)  in ck_barrier_mcs()  argument
117 	 * Wait until all children have reached the barrier and are done waiting  in ck_barrier_mcs()
120 	while (ck_barrier_mcs_check_children(barrier[state->vpid].childnotready) == false)  in ck_barrier_mcs()
124 	ck_barrier_mcs_reinitialize_children(&barrier[state->vpid]);  in ck_barrier_mcs()
127 	ck_pr_store_uint(barrier[state->vpid].parent, 0);  in ck_barrier_mcs()
129 	/* Wait until parent indicates all threads have arrived at the barrier. */  in ck_barrier_mcs()
130 	if (state->vpid != 0) {  in ck_barrier_mcs()
131 		while (ck_pr_load_uint(&barrier[state->vpid].parentsense) != state->sense)  in ck_barrier_mcs()
136 	ck_pr_store_uint(barrier[state->vpid].children[0], state->sense);  in ck_barrier_mcs()
137 	ck_pr_store_uint(barrier[state->vpid].children[1], state->sense);  in ck_barrier_mcs()
138 	state->sense = ~state->sense;  in ck_barrier_mcs()