Documentation

Information about the locks available for accumulators.

Which target are we ultimately generating code for? While most of the kernels code is the same, there are some cases where we generate special code based on the ultimate low-level API we are targeting.

Perform a Replicate with a kernel.

Perform an Iota with a kernel.

For many kernels, we may not have enough physical groups to cover the logical iteration space. Some groups thus have to perform double duty; we put an outer loop to accomplish this. The advantage over just launching a bazillion threads is that the cost of memory expansion should be proportional to the number of *physical* threads (hardware parallelism), not the amount of application parallelism.

Assign iterations of a for-loop to threads in the workgroup. The passed-in function is invoked with the (symbolic) iteration. For multidimensional loops, use groupCoverSpace.

Assign iterations of a for-loop to all threads in the kernel. The passed-in function is invoked with the (symbolic) iteration. threadOperations will be in effect in the body. For multidimensional loops, use groupCoverSpace.

Iterate collectively though a multidimensional space, such that all threads in the group participate. The passed-in function is invoked with a (symbolic) point in the index space.

Do an atomic update corresponding to a binary operator lambda.

Is there an atomic BinOp corresponding to this BinOp?

Locking strategy used for an atomic update.

The mechanism that will be used for performing the atomic update. Approximates how efficient it will be. Ordered from most to least efficient.

A function for generating code for an atomic update. Assumes that the bucket is in-bounds.