summaryrefslogtreecommitdiff
path: root/src/compiler/nir/docs/control_flow.rst
diff options
context:
space:
mode:
Diffstat (limited to 'src/compiler/nir/docs/control_flow.rst')
-rw-r--r--src/compiler/nir/docs/control_flow.rst6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/compiler/nir/docs/control_flow.rst b/src/compiler/nir/docs/control_flow.rst
index e10e30bf57..8dff834dd3 100644
--- a/src/compiler/nir/docs/control_flow.rst
+++ b/src/compiler/nir/docs/control_flow.rst
@@ -107,7 +107,7 @@ guarantee. Therefore, optimizations in any intermediate IR must respect this
invariant, which means that the IR must have a good idea of when control flow
diverges. For example, in the following snippet:
-::
+.. code-block:: c
vec2 color = texture(tex, coordinate * 2.0)
if (foo) {
@@ -142,7 +142,7 @@ Together, the start block, end block, and graph created by the successors and
predecessors form the control flow graph that complements the control flow
tree. For example, this:
-::
+.. code-block:: c
void main(void) {
if (foo)
@@ -273,7 +273,7 @@ be moved. On the basic block level, creating the empty block removes a
*critical edge*, which is an edge from a block with more than one successor to
another with more than one predecessor. Consider this if-then statement:
-::
+.. code-block:: c
if (foo) {
bar = 1;