Lines Matching refs:B

34 processes, let's call them processes A, B, and C, where A is the highest
35 priority process, C is the lowest, and B is in between. A tries to grab a lock
37 meantime, B executes, and since B is of a higher priority than C, it preempts C,
40 to release the lock, because for all we know, B is a CPU hog and will
49         C preempted by B
53 B         +-------->
54                 B now keeps A from running.
65 to understand, let's use the previous example, with processes A, B, and C again.
68 of A.  So now if B becomes runnable, it would not preempt C, since C now has
128    Process:  A, B, C, D, E
132            B blocked on L1
133            B owns L2
142    E->L4->D->L3->C->L2->B->L1->A
145 another mutex L5 where B owns L5 and F is blocked on mutex L5.
149    F->L5->B->L1->A
158                        +->B->L1->A
170   G->L2->B->L1->A
178                  G-+     +->B->L1->A
284 Processes A, B, C, and D which run functions func1, func2, func3 and func4
291               B blocked on L2
292               B owns L1
295 And thus we have the chain A->L1->B->L2->C->L3->D.
334 unsigned long _cmpxchg(unsigned long *A, unsigned long *B, unsigned long *C)
337 	if (*A == *B) {
346 the return value (the old value of A) is equal to B.