e29acf74fe
* vulkan (DRAFT): split shader generation by GLSL source file, to improve incremental build times * support dep-files so shaders are recompiled if their included files change * rename shader files which are used as "headers" to use .glsl extension * move glslc extension detection shaders to separate folders * the above is to prevent them from getting glob'd with the actual compute shaders that need to be compiled * vulkan : only write embedded shader .hpp/.cpp when they change * avoid recompiling ggml-vulkan.cpp when editing shaders * pass single --source argument instead of --input-dir & --filter to shader gen * check for source file match earlier * fix hang in vulkan-shaders-gen when there are compilation errors * early out did not decrement compile_count * clean up * fix glslc integer dot product test * unconditionally write the embedded shader cpp output * replace output filepath in generated dep-files to match output in CMakeLists --------- Co-authored-by: Jeff Bolz <jbolz@nvidia.com>
89 lines
3.8 KiB
Plaintext
89 lines
3.8 KiB
Plaintext
#version 450
|
|
#extension GL_EXT_shader_explicit_arithmetic_types_int32 : require
|
|
|
|
#include "mul_mat_vec_base.glsl"
|
|
|
|
layout(local_size_x_id = 0, local_size_y = 1, local_size_z = 1) in;
|
|
|
|
FLOAT_TYPE temp[NUM_COLS][NUM_ROWS];
|
|
|
|
void calc_superblock(const uint a_offset, const uint b_offset, const uint itid, const uint i, const uint num_blocks_per_row, const uint first_row, const uint num_rows) {
|
|
const uint y_idx = i * QUANT_K + 16 * itid;
|
|
const uint ib32 = itid / 2; // 0..7
|
|
|
|
uint ibi = a_offset / QUANT_K + first_row * num_blocks_per_row + i;
|
|
[[unroll]] for (uint n = 0; n < num_rows; ++n) {
|
|
const float d = float(data_a[ibi].d);
|
|
const uint signscale = pack32(u16vec2(
|
|
data_a_packed16[ibi].qs[QUANT_K / 8 + 2 * ib32],
|
|
data_a_packed16[ibi].qs[QUANT_K / 8 + 2 * ib32 + 1]));
|
|
const float db = d * 0.5 * (0.5 + (signscale >> 28));
|
|
[[unroll]] for (uint l = 0; l < 2; ++l) {
|
|
const uint qs0 = data_a[ibi].qs[8 * ib32 + 4 * (itid & 1) + 2 * l];
|
|
const uint qs1 = data_a[ibi].qs[8 * ib32 + 4 * (itid & 1) + 2 * l + 1];
|
|
const uint sign = bitfieldExtract(signscale, 7 * int(2 * (itid & 1) + l), 7);
|
|
const uint sign7 = bitCount(sign);
|
|
const vec4 grid0 = vec4(unpack8(iq3xxs_grid[qs0]));
|
|
const vec4 grid1 = vec4(unpack8(iq3xxs_grid[qs1]));
|
|
|
|
[[unroll]] for (uint j = 0; j < NUM_COLS; ++j) {
|
|
const vec4 b0 = vec4(data_b_v4[(j*p.batch_stride_b + b_offset + y_idx) / 4 + 2*l + 0]);
|
|
const vec4 b4 = vec4(data_b_v4[(j*p.batch_stride_b + b_offset + y_idx) / 4 + 2*l + 1]);
|
|
|
|
FLOAT_TYPE sum =
|
|
fma(FLOAT_TYPE(b0.x), FLOAT_TYPE((sign & 1) != 0 ? -grid0.x : grid0.x),
|
|
fma(FLOAT_TYPE(b0.y), FLOAT_TYPE((sign & 2) != 0 ? -grid0.y : grid0.y),
|
|
fma(FLOAT_TYPE(b0.z), FLOAT_TYPE((sign & 4) != 0 ? -grid0.z : grid0.z),
|
|
fma(FLOAT_TYPE(b0.w), FLOAT_TYPE((sign & 8) != 0 ? -grid0.w : grid0.w),
|
|
fma(FLOAT_TYPE(b4.x), FLOAT_TYPE((sign & 16) != 0 ? -grid1.x : grid1.x),
|
|
fma(FLOAT_TYPE(b4.y), FLOAT_TYPE((sign & 32) != 0 ? -grid1.y : grid1.y),
|
|
fma(FLOAT_TYPE(b4.z), FLOAT_TYPE((sign & 64) != 0 ? -grid1.z : grid1.z),
|
|
fma(FLOAT_TYPE(b4.w), FLOAT_TYPE((sign7 & 1) != 0 ? -grid1.w : grid1.w),
|
|
FLOAT_TYPE(0.0)))))))));
|
|
temp[j][n] = fma(db, sum, temp[j][n]);
|
|
}
|
|
}
|
|
ibi += num_blocks_per_row;
|
|
}
|
|
}
|
|
|
|
void compute_outputs(const uint32_t first_row, const uint32_t num_rows) {
|
|
uint a_offset, b_offset, d_offset;
|
|
get_offsets(a_offset, b_offset, d_offset);
|
|
|
|
const uint num_blocks_per_row = p.ncols / QUANT_K;
|
|
|
|
// 16 threads are used to process each block
|
|
const uint blocks_per_wg = gl_WorkGroupSize.x/16;
|
|
const uint tid = gl_LocalInvocationID.x;
|
|
const uint itid = tid % 16; // 0...15
|
|
const uint ix = tid / 16;
|
|
|
|
[[unroll]] for (uint j = 0; j < NUM_COLS; ++j) {
|
|
[[unroll]] for (uint i = 0; i < NUM_ROWS; ++i) {
|
|
temp[j][i] = FLOAT_TYPE(0);
|
|
}
|
|
}
|
|
|
|
[[unroll]] for (uint i = ix; i < num_blocks_per_row; i += blocks_per_wg)
|
|
calc_superblock(a_offset, b_offset, itid, i, num_blocks_per_row, first_row, num_rows);
|
|
|
|
reduce_result(temp, d_offset, first_row, num_rows, tid);
|
|
}
|
|
|
|
void main() {
|
|
const uint first_row = NUM_ROWS * (gl_WorkGroupID.x + gl_NumWorkGroups.x * gl_WorkGroupID.z);
|
|
|
|
init_iq_shmem(gl_WorkGroupSize);
|
|
|
|
// do NUM_ROWS at a time, unless there aren't enough remaining rows
|
|
if (first_row + NUM_ROWS <= p.stride_d) {
|
|
compute_outputs(first_row, NUM_ROWS);
|
|
} else {
|
|
if (first_row >= p.stride_d) {
|
|
return;
|
|
}
|
|
compute_outputs(first_row, p.stride_d - first_row);
|
|
}
|
|
}
|