-
Notifications
You must be signed in to change notification settings - Fork 108
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
compute example uses push constants for testing
- Loading branch information
Showing
3 changed files
with
106 additions
and
47 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,38 +1,15 @@ | ||
@group(0) | ||
@binding(0) | ||
var<storage, read_write> v_indices: array<u32>; // this is used as both input and output for convenience | ||
var<storage, read_write> buffer: array<u32>; | ||
|
||
// The Collatz Conjecture states that for any integer n: | ||
// If n is even, n = n/2 | ||
// If n is odd, n = 3n+1 | ||
// And repeat this process for each new n, you will always eventually reach 1. | ||
// Though the conjecture has not been proven, no counterexample has ever been found. | ||
// This function returns how many times this recurrence needs to be applied to reach 1. | ||
fn collatz_iterations(n_base: u32) -> u32{ | ||
var n: u32 = n_base; | ||
var i: u32 = 0u; | ||
loop { | ||
if (n <= 1u) { | ||
break; | ||
} | ||
if (n % 2u == 0u) { | ||
n = n / 2u; | ||
} | ||
else { | ||
// Overflow? (i.e. 3*n + 1 > 0xffffffffu?) | ||
if (n >= 1431655765u) { // 0x55555555u | ||
return 4294967295u; // 0xffffffffu | ||
} | ||
|
||
n = 3u * n + 1u; | ||
} | ||
i = i + 1u; | ||
} | ||
return i; | ||
struct PushConstants { | ||
i: u32, | ||
} | ||
var<push_constant> push_constants: PushConstants; | ||
|
||
@compute | ||
@workgroup_size(1) | ||
fn main(@builtin(global_invocation_id) global_id: vec3<u32>) { | ||
v_indices[global_id.x] = collatz_iterations(v_indices[global_id.x]); | ||
let i = push_constants.i; | ||
buffer[i] = i * 2; | ||
} |