whitespace

diff --git a/openpower/sv/bitmanip.mdwn b/openpower/sv/bitmanip.mdwn
index fc1904a86e4cb8b3939b95c0e2c373cb7251513f..5a0ed3290eef0ca020ef819679661dd9c2bf3584 100644 (file)
--- a/openpower/sv/bitmanip.mdwn
+++ b/openpower/sv/bitmanip.mdwn
@@ -73,7 +73,7 @@ ternlog has its own major opcode
 | RT   | RA   | RB   | or    | bmatflip | 
 | RT   | RA   | RB   | xor   | bmatflip | 
 | RT   | RA   | RB   |       | grev  |
-| RT   | RA   | RB   |       | clmul*  |
+| RT   | RA   | RB   |       | clmul\*  |
 | RT   | RA   | RB   |       | gorc |  
 | RT   | RA   | RB   | shuf  | shuffle | 
 | RT   | RA   | RB   | unshuf| shuffle | 
@@ -96,7 +96,7 @@ TODO: convert all instructions to use RT and not RS
 | NN | RT | RA  |itype/| im0-4   | im5-7  00 |0 | xpermi  |
 | NN | RT | RA  | RB   | im0-4   | im5-7  00 |1 | grevlog |
 | NN |    |     |      |         | -----  01 |m3| crternlog |
-| NN | RT | RA  | RB   | RC      | mode  010 |Rc| bitmask* |
+| NN | RT | RA  | RB   | RC      | mode  010 |Rc| bitmask\* |
 | NN |    |     |      |         | 00    011 |  | rsvd |
 | NN |    |     |      |         | 01    011 |0 | svshape |
 | NN |    |     |      |         | 01    011 |1 | svremap |
@@ -300,13 +300,13 @@ bmset(RA=0, RB=0, RC=mask) will produce a run of ones of length "mask" in a sing
 
 | 0.5|6.10|11.15|16.20|21.25| 26..30  |31| name  |
 | -- | -- | --- | --- | --- | ------- |--| ----- |
-| NN | RS | RA  | RB  | RC  | mode 010 |Rc| bm*   |
+| NN | RS | RA  | RB  | RC  | mode 010 |Rc| bm\*   |
 
 Immediate-variant is an overwrite form:
 
 | 0.5|6.10|11.15|16.20| 21 | 22.23 | 24....30 |31| name |
 | -- | -- | --- | --- | -- | ----- | -------- |--| ---- |
-| NN | RS | RB  | sh  | SH | itype | 1000 110 |Rc| bm*i |
+| NN | RS | RB  | sh  | SH | itype | 1000 110 |Rc| bm\*i |
 
 ```
 def MASK(x, y):
@@ -636,13 +636,15 @@ uint64_t bmator(uint64_t RA, uint64_t RB)
 
 * obligatory xkcd <https://xkcd.com/2595/>
 
-There are three completely separate types of Galois-Field-based
-arithmetic that we implement which are not well explained even in introductory literature.  A slightly oversimplified explanation
-is followed by more accurate descriptions:
+There are three completely separate types of Galois-Field-based arithmetic
+that we implement which are not well explained even in introductory
+literature.  A slightly oversimplified explanation is followed by more
+accurate descriptions:
 
 * `GF(2)` carry-less binary arithmetic. this is not actually a Galois Field,
   but is accidentally referred to as GF(2) - see below as to why.
-* `GF(p)` modulo arithmetic with a Prime number, these are "proper" Galois Fields
+* `GF(p)` modulo arithmetic with a Prime number, these are "proper"
+   Galois Fields
 * `GF(2^N)` carry-less binary arithmetic with two limits: modulo a power-of-2
   (2^N) and a second "reducing" polynomial (similar to a prime number), these
   are said to be GF(2^N) arithmetic.