Lines Matching refs:ordered
126 <<memory-model-location-ordered,below>>.
140 is program-ordered before the n'th dynamic instance of B.
142 program-ordered before the dynamic instance of the OpLabel instruction
145 is program-ordered before the dynamic instances of the
149 code:OpFunctionCall instruction is program-ordered after the dynamic
152 program-ordered before dynamic instance B of any instruction and B is
153 program-ordered before dynamic instance C of any instruction then A is
154 program-ordered before C.
155 * (Complete definition): No other dynamic instances are program-ordered.
178 * (Program order): If dynamic instance A is program-ordered before B, then
179 A is shader-call-ordered before B.
183 shader-call-ordered before B.
188 shader-call-ordered before B.
189 * (Transitive closure): If A is shader-call-ordered-before B and B is
190 shader-call-ordered-before C, then A is shader-call-ordered-before C.
192 shader-call-ordered.
235 potentially-mutually-ordered and any of the following are true:
245 If two atomic operations are not mutually-ordered, and if their sets of
254 For a given atomic write A, all atomic writes that are mutually-ordered with
408 The atomics in the last bullet must: be mutually-ordered with A by virtue of
431 * A and B are mutually-ordered
443 * A is program-ordered before X
444 * X and B are mutually-ordered
457 * X is program-ordered before B
458 * X and A are mutually-ordered
468 * A is program-ordered before X
470 * Y is program-ordered before B
471 * X and Y are mutually-ordered
479 mutually ordered.
485 * A is program-ordered before (or equals) C
486 * C is program-ordered before (or equals) B
500 F~1~ is ordered before invocation F~2~ if and only if F~1~ and F~2~ overlap
506 if the agent that executes A is ordered before the agent that executes B in
528 * A is shader-call-ordered-before B
581 <<memory-model-location-ordered,Location-Ordered>> between distinct agents
601 of SC in its semantics, and A is program-ordered before B
604 has all of SC in its semantics, and A is program-ordered before B
617 * A is program-ordered before B
766 ordered by release-acquire sequences or memory barriers.
839 The implicit availability operation is program-ordered between the barrier
840 or atomic and all other operations program-ordered before the barrier or
848 The implicit visibility operation is program-ordered between the barrier or
849 atomic and all other operations program-ordered after the barrier or atomic.
883 The implicit availability operation is program-ordered between the write and
884 all other operations program-ordered after the write.
893 The implicit visibility operation is program-ordered between read and all
894 other operations program-ordered before the read.
921 [[memory-model-location-ordered]]
928 program-ordered before.
982 mutually-ordered atomic operations.
983 If there does not exist a location-ordered relation between X and Y for each
1006 * X is location-ordered before Y for each location L in M~2~.
1008 X is location-ordered before Z for location L and Z is location-ordered
1038 * location-ordered
1054 Let A and B be mutually-ordered atomic operations, where A is
1055 location-ordered before B. Then the following rules are a consequence of
1134 read or write to SC that is program-ordered before it (regardless of the
1138 read or write to SC that is program-ordered after it (regardless of the
1141 * Any write to SC program-ordered after a release barrier must not be
1142 reordered against any read or write to SC program-ordered before that
1145 * Any read from SC program-ordered before an acquire barrier must not be
1146 reordered against any read or write to SC program-ordered after the
1176 code:OpMemoryModel, tessellation outputs can be ordered using a control
1185 such that X is program-ordered before C in A~X~ and C is program-ordered
1191 code:Output storage class, and X is tessellation-output-ordered before Y
1192 with a scope of code:Workgroup, then X is location-ordered before Y, and if