ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-06-13 01:21:38 -07:00
Code Issues Packages Projects Releases Wiki Activity

Make Operation: comments unformatted

Browse Source
This commit is contained in:
gingerBill
2025-10-09 11:42:09 +01:00
parent a7b6ab92c1
commit c73bd6f51d
1 changed files with 54 additions and 54 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/simd/simd.odin
+54 -54
View File
@@ -271,7 +271,7 @@ Inputs:
Returns:
- A vector that is the sum of two input vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] + b[i]
@@ -307,7 +307,7 @@ Inputs:
Returns:
- A vector that is the difference of two vectors, `a` - `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] - b[i]
@@ -342,7 +342,7 @@ Inputs:
Returns:
- A vector that is the product of two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] * b[i]
@@ -380,7 +380,7 @@ Inputs:
Returns:
- A vector that is the quotient of two vectors, `a` / `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] / b[i]
@@ -420,7 +420,7 @@ Result:
- A vector, where each lane is the lane from `a` shifted left by the amount
specified in the corresponding lane of the vector `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if b[i] < 8*size_of(a[i]) {
@@ -470,7 +470,7 @@ Result:
- A vector, where each lane is the lane from `a` shifted right by the amount
specified in the corresponding lane of the vector `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if b[i] < 8*size_of(a[i]) {
@@ -515,7 +515,7 @@ Result:
- A vector, where each lane is the lane from `a` shifted left by the amount
specified in the corresponding lane of the vector `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
mask := 8*size_of(a[i]) - 1
@@ -561,7 +561,7 @@ Result:
- A vector, where each lane is the lane from `a` shifted right by the amount
specified in the corresponding lane of the vector `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
mask := 8*size_of(a[i]) - 1
@@ -604,7 +604,7 @@ Inputs:
Returns:
- The saturated sum of the two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
switch {
@@ -653,7 +653,7 @@ Inputs:
Returns:
- The saturated difference of the two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
switch {
@@ -697,7 +697,7 @@ Inputs:
Returns:
- A vector that is the result of the bitwise AND operation between two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] & b[i]
@@ -732,7 +732,7 @@ Inputs:
Returns:
- A vector that is the result of the bitwise OR operation between two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] | b[i]
@@ -767,7 +767,7 @@ Inputs:
Returns:
- A vector that is the result of the bitwise XOR operation between two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] ~ b[i]
@@ -802,7 +802,7 @@ Inputs:
Returns:
- A vector that is the result of the bitwise AND NOT operation between two vectors.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = a[i] &~ b[i]
@@ -836,7 +836,7 @@ Inputs:
Returns:
- The negated version of the vector `a`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = -a[i]
@@ -867,7 +867,7 @@ Inputs:
Returns:
- The absolute value of a vector.
**Operation**:
Operation:
for i in 0 ..< len(res) {
switch {
@@ -903,7 +903,7 @@ Inputs:
Returns:
- A vector containing with minimum values from corresponding lanes of `a` and `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] < b[i] {
@@ -942,7 +942,7 @@ Inputs:
Returns:
- A vector containing with maximum values from corresponding lanes of `a` and `b`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] > b[i] {
@@ -983,7 +983,7 @@ Inputs:
Returns:
- A vector containing clamped values in each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
val := v[i]
@@ -1029,7 +1029,7 @@ Returns:
- A vector of unsigned integers of the same size as the input vector's lanes,
containing the comparison results for each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] == b[i] {
@@ -1071,7 +1071,7 @@ Returns:
- A vector of unsigned integers of the same size as the input vector's lanes,
containing the comparison results for each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] != b[i] {
@@ -1113,7 +1113,7 @@ Returns:
- A vector of unsigned integers of the same size as the input vector's lanes,
containing the comparison results for each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] < b[i] {
@@ -1156,7 +1156,7 @@ Returns:
- A vector of unsigned integers of the same size as the input vector's lanes,
containing the comparison results for each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] <= b[i] {
@@ -1199,7 +1199,7 @@ Returns:
- A vector of unsigned integers of the same size as the input vector's lanes,
containing the comparison results for each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] > b[i] {
@@ -1242,7 +1242,7 @@ Returns:
- A vector of unsigned integers of the same size as the input vector's lanes,
containing the comparison results for each lane.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if a[i] >= b[i] {
@@ -1301,7 +1301,7 @@ Returns:
loaded from the pointer vector `ptr`, and all values from masked indices loaded
from the value vector `val`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if mask[i]&1 == 1 {
@@ -1384,7 +1384,7 @@ Inputs:
set), the corresponding lane is written into memory. Otherwise it's not
written into memory.
**Operation**:
Operation:
for i in 0 ..< len(ptr) {
if mask[i]&1 == 1 {
@@ -1457,7 +1457,7 @@ Returns:
- The loaded vector. The lanes for which the mask was set are loaded from
memory, and the other lanes are loaded from the `val` vector.
**Operation**:
Operation:
for i in 0 ..< len(res) {
if mask[i]&1 == 1 {
@@ -1525,7 +1525,7 @@ Inputs:
- `val`: The vector to store.
- `mask`: The mask, selecting which lanes of the vector to store into memory.
**Operation**:
Operation:
for i in 0 ..< len(val) {
if mask[i]&1 == 1 {
@@ -1594,7 +1594,7 @@ Inputs:
Returns:
- The result vector, holding masked memory values unmasked default values.
**Operation**:
Operation:
mem_idx := 0
for i in 0 ..< len(mask) {
@@ -1667,7 +1667,7 @@ Inputs:
- `val`: The vector to store into memory.
- `mask`: The mask that selects which values to store into memory.
**Operation**:
Operation:
mem_idx := 0
for i in 0 ..< len(mask) {
@@ -1729,7 +1729,7 @@ Inputs:
Returns:
- The value of the lane at the specified index.
**Operation**:
Operation:
return a[idx]
*/
@@ -1749,7 +1749,7 @@ Inputs:
Returns:
- Vector with the specified lane replaced.
**Operation**:
Operation:
a[idx] = elem
*/
@@ -1775,7 +1775,7 @@ Inputs:
Result:
- Sum of all lanes, as a scalar.
**Operation**:
Operation:
for n > 1 {
n = n / 2
@@ -1823,7 +1823,7 @@ Inputs:
Result:
- Product of all lanes, as a scalar.
**Operation**:
Operation:
for n > 1 {
n = n / 2
@@ -1865,7 +1865,7 @@ Inputs:
Result:
- Sum of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -1888,7 +1888,7 @@ Inputs:
Result:
- Product of all lanes, as a scalar.
**Operation**:
Operation:
res := 1
for i in 0 ..< len(a) {
@@ -1916,7 +1916,7 @@ Inputs:
Result:
- Sum of all lanes, as a scalar.
**Operation**:
Operation:
for n > 1 {
n = n / 2
@@ -1964,7 +1964,7 @@ Inputs:
Result:
- Product of all lanes, as a scalar.
**Operation**:
Operation:
for n > 1 {
n = n / 2
@@ -2003,7 +2003,7 @@ Inputs:
Result:
- Minimum value of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2024,7 +2024,7 @@ Inputs:
Result:
- Maximum value of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2045,7 +2045,7 @@ Inputs:
Result:
- Bitwise AND of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2066,7 +2066,7 @@ Inputs:
Result:
- Bitwise OR of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2087,7 +2087,7 @@ Inputs:
Result:
- Bitwise XOR of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2108,7 +2108,7 @@ Inputs:
Result:
- Bitwise OR of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2129,7 +2129,7 @@ Inputs:
Result:
- Bitwise AND of all lanes, as a scalar.
**Operation**:
Operation:
res := 0
for i in 0 ..< len(a) {
@@ -2154,7 +2154,7 @@ Inputs:
Result:
- Swizzled input vector.
**Operation**:
Operation:
res = {}
for i in 0 ..< len(indices) {
@@ -2220,7 +2220,7 @@ Result:
- A bitset of integers, corresponding to the indexes of the lanes, whose MSBs
are set.
**Operation**:
Operation:
bits_per_lane = 8*size_of(a[0])
res = bit_set {}
@@ -2266,7 +2266,7 @@ Result:
- A bitset of integers, corresponding to the indexes of the lanes, whose LSBs
are set.
**Operation**:
Operation:
res = bit_set {}
for i in 0 ..< len(a) {
@@ -2314,7 +2314,7 @@ Inputs:
Result:
- Input vectors, shuffled according to the indices.
**Operation**:
Operation:
res = {}
for i in 0 ..< len(indices) {
@@ -2386,7 +2386,7 @@ Inputs:
Result:
- The result of selecting values from the two input vectors.
**Operation**:
Operation:
res = {}
for i in 0 ..< len(cond) {
@@ -2672,7 +2672,7 @@ Perform binary not operation on a SIMD vector.
This procedure returns a vector where each lane is the result of the binary
NOT operation of the corresponding lane in the vector `a`.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = ~a[i]
@@ -2728,7 +2728,7 @@ Inputs:
Returns:
- Negated vector.
**Operation**:
Operation:
for i in 0 ..< len(res) {
res[i] = 1.0 / a[i]
@@ -2756,7 +2756,7 @@ Inputs:
- `V`: The type of the vector to create.
Result:
- A vector of the given type, where each lane contains the index of that lane.
**Operation**:
Operation:
for i in 0 ..< N {
res[i] = i
}