Searched refs:ordering (Results 1 – 4 of 4) sorted by relevance
| /xnu-11215/libkern/c++/ |
| H A D | OSOrderedSet.cpp | 78 ordering = inOrdering; in initWithCapacity()
89 OSOrderFunction ordering, void * orderingRef) in withCapacity() argument
93 if (me && !me->initWithCapacity(capacity, ordering, orderingRef)) { in withCapacity()
105 OSOrderedSet::OSOrderBlock ordering = (typeof(ordering))context; in OSOrderedSetBlockToFunc() local
107 return ordering(obj1, obj2); in OSOrderedSetBlockToFunc()
112 OSOrderedSet::withCapacity(unsigned int capacity, OSOrderBlock ordering) in withCapacity() argument
116 if (me && !me->initWithCapacity(capacity, &OSOrderedSetBlockToFunc, ordering)) { in withCapacity()
265 (ordering ? ((*ordering)( (const OSObject *) obj1, (const OSObject *) obj2, orderingRef)) : 0)
483 newSet = OSOrderedSet::withCapacity(capacity, ordering, orderingRef); in copyCollection()
|
| /xnu-11215/doc/primitives/ |
| H A D | atomics.md | 46 memory ordering.
110 or a compiler barrier ordering `compiler_acquire`, `compiler_release`,
114 correspond to the requested memory ordering (using
137 The *consume* memory ordering should not be used
151 with an optional barrier ordering. It is implemented with C11's
152 `atomic_signal_fence()`. The barrier ordering argument is optional
238 Unlike `atomic_compare_exchange_strong_explicit`, a single ordering is
241 for the failure case ordering, as it is what is used most of the time.
334 implements an entirely new *dependency* memory ordering.
342 the dependencies, the *dependency* memory ordering relies on explicit
[all …]
|
| /xnu-11215/libkern/libkern/c++/ |
| H A D | OSOrderedSet.h | 132 OSOrderFunction ordering; variable
|
| /xnu-11215/doc/scheduler/ |
| H A D | sched_clutch_edge.md | 57 …t bucket even when a higher QoS root bucket is runnable due to deadline ordering, the root bucket …
|