Searched refs:barrier_place (Results 1 - 5 of 5) sorted by relevance

/systemd/src/test/
H A Dtest-barrier.c120 assert_se(barrier_place(&b));
127 assert_se(barrier_place(&b)); variable
144 assert_se(barrier_place(&b));
150 assert_se(barrier_place(&b)); variable
176 assert_se(barrier_place(&b)); variable
177 assert_se(barrier_place(&b)); variable
193 assert_se(barrier_place(&b));
194 assert_se(barrier_place(&b));
201 assert_se(barrier_place(&b)); variable
202 assert_se(barrier_place( variable
223 assert_se(barrier_place(&b)); variable
224 assert_se(barrier_place(&b)); variable
246 assert_se(barrier_place(&b)); variable
247 assert_se(barrier_place(&b)); variable
271 assert_se(barrier_place(&b)); variable
272 assert_se(barrier_place(&b)); variable
388 assert_se(barrier_place(&b)); variable
406 assert_se(barrier_place(&b)); variable
434 assert_se(barrier_place(&b)); variable
[all...]
/systemd/src/basic/
H A Dbarrier.h64 bool barrier_place(Barrier *b);
89 (void) barrier_place(b);
H A Dbarrier.c48 * Barrier-API: Both ends can place as many barriers via barrier_place() as
52 * other side calls barrier_place(). No links between the barriers are
55 * to place their next barrier via barrier_place(). However, it only waits for
60 * placed as many barriers via barrier_place() as we did. If they already placed
292 * barrier_place() - Place a new barrier
301 bool barrier_place(Barrier *b) { function
377 * barrier_place(). However, this only waits for linked barriers. That means, if
400 * barrier_place() as often as we did (in total). If they already placed as much
/systemd/src/nspawn/
H A Dnspawn.c2478 (void) barrier_place(barrier); /* #1 */
3463 (void) barrier_place(&barrier); /* #2 */
3536 (void) barrier_place(&barrier); /* #3 */
/systemd/src/core/
H A Dexecute.c931 barrier_place(&barrier);

Completed in 28 milliseconds