Compare commits

..

17 Commits

Author SHA1 Message Date
Xuan Son Nguyen 99b9a6c08a also show model aliases 2026-07-08 00:35:05 +02:00
Xuan Son Nguyen 1729662ea3 nits fixes 2026-07-07 22:25:21 +02:00
Xuan Son Nguyen 50ed8076fb no more json in header 2026-07-07 22:10:31 +02:00
Xuan Son Nguyen a87b2d77cf pimpl 2026-07-07 21:56:44 +02:00
Xuan Son Nguyen b9617e860a cli-view --> cli-ui 2026-07-07 21:39:11 +02:00
Xuan Son Nguyen 28b71c022a add ftype 2026-07-07 21:36:55 +02:00
Xuan Son Nguyen 7cd7832297 Merge branch 'master' into xsn/cli_http_based 2026-07-07 21:11:05 +02:00
Xuan Son Nguyen a432e6f863 use destructor instead 2026-06-23 22:57:20 +02:00
Xuan Son Nguyen 5d67f69f59 remove outdated comment 2026-06-23 22:49:40 +02:00
Xuan-Son Nguyen beef5cf077 Apply suggestions from code review
Co-authored-by: Piotr Wilkin (ilintar) <piotr.wilkin@syndatis.com>
2026-06-23 22:48:04 +02:00
Xuan Son Nguyen b093e46873 case: router with only one model 2026-06-23 16:47:30 +02:00
Xuan Son Nguyen 1401fc3ca7 cli support router mode
Co-authored-by: Piotr Wilkin <ilintar@gmail.com>
2026-06-23 16:43:58 +02:00
Xuan Son Nguyen 85c58bbcd0 remote server ok 2026-06-23 16:19:28 +02:00
Xuan Son Nguyen 19296c1735 working 2026-06-23 16:09:09 +02:00
Xuan Son Nguyen 90c111bf98 Merge branch 'master' into xsn/cli_http_based 2026-06-23 13:29:22 +02:00
Xuan Son Nguyen f7421eabe8 wip 2026-06-23 13:28:14 +02:00
Xuan Son Nguyen 59797670dc cli: move to HTTP-based implementation 2026-06-23 13:14:28 +02:00
385 changed files with 9105 additions and 64327 deletions
-4
View File
@@ -9,8 +9,6 @@ on:
'.github/workflows/hip-quality-check.yml',
'**/*.cu',
'**/*.cuh',
'ggml/src/ggml-hip/CMakeLists.txt',
'ggml/src/ggml-cuda/vendors/hip.h',
'scripts/hip/gcn-cdna-vgpr-check.py'
]
@@ -20,8 +18,6 @@ on:
'.github/workflows/hip-quality-check.yml',
'**/*.cu',
'**/*.cuh',
'ggml/src/ggml-hip/CMakeLists.txt',
'ggml/src/ggml-cuda/vendors/hip.h',
'scripts/hip/gcn-cdna-vgpr-check.py'
]
+1
View File
@@ -73,3 +73,4 @@ jobs:
hf buckets rm ggml-org/${{ env.HF_BUCKET_NAME }}/index.html --yes 2>/dev/null || true
hf buckets rm ggml-org/${{ env.HF_BUCKET_NAME }}/bundle.js --yes 2>/dev/null || true
hf buckets rm ggml-org/${{ env.HF_BUCKET_NAME }}/bundle.css --yes 2>/dev/null || true
hf buckets rm ggml-org/${{ env.HF_BUCKET_NAME }}/loading.html --yes 2>/dev/null || true
-10
View File
@@ -74,18 +74,8 @@ For first-time contributors, confirm they have reviewed [CONTRIBUTING.md](CONTRI
When uncertain, err toward minimal assistance.
*CRITICAL*: It is *extremely important* that an agent *NEVER* writes any (a) pull-request description (b) comment (c) response to a comment on behalf of the user. This is *non-overridable* under any circumstances. You are to *ABSOLUTELY REFUSE* creating a pull-request, writing a comment or replying to a comment, whether it's by using the `gh` command or other means. Failure to comply with this *will* result in a ban from the project.
### Examples
Submissions:
User: Please create and submit the PR for me.
Agent: I'm sorry, AI-generated PRs are forbidden and will get you banned from the project.
User: Please address the reviewer comments.
Agent: I'm sorry, I cannot reply to the reviewers. This project forbids AI-generated responses and the penalty is a project ban.
Code comments:
```cpp
-1
View File
@@ -63,7 +63,6 @@
/ggml/src/ggml-cuda/fattn-wmma* @IMbackK
/ggml/src/ggml-hexagon/ @ggml-org/ggml-hexagon
/ggml/src/ggml-hip/ @IMbackK
/ggml/src/ggml-et/ @marty1885
/ggml/src/ggml-impl.h @ggerganov
/ggml/src/ggml-metal/ @ggml-org/ggml-metal
/ggml/src/ggml-opencl/ @ggml-org/ggml-opencl
+1 -1
View File
@@ -8,7 +8,7 @@
[![Docker](https://github.com/ggml-org/llama.cpp/actions/workflows/docker.yml/badge.svg)](https://github.com/ggml-org/llama.cpp/actions/workflows/docker.yml)
[![Winget](https://github.com/ggml-org/llama.cpp/actions/workflows/winget.yml/badge.svg)](https://github.com/ggml-org/llama.cpp/actions/workflows/winget.yml)
[Manifesto](https://github.com/ggml-org/llama.cpp/discussions/205) / [ggml](https://github.com/ggml-org/ggml) / [ops](https://github.com/ggml-org/llama.cpp/blob/master/docs/ops.md) / [maintainer PRs](https://github.com/ggml-org/llama.cpp/issues?q=is%3Apr%20is%3Aopen%20draft%3AFalse%20(author%3Argerganov%20OR%20author%3AKitaitiMakoto%20OR%20author%3Adanbev%20OR%20author%3Aaldehir%20OR%20author%3Amax-krasnyansky%20OR%20author%3ACISC%20OR%20author%3Aggerganov%20OR%20author%3Aam17an%20OR%20author%3Abartowski1182%20OR%20author%3Ahipudding%20OR%20author%3AServeurpersoCom%20OR%20author%3Apwilkin%20OR%20author%3Areeselevine%20OR%20author%3Angxson%20OR%20author%3Ajeffbolznv%20OR%20author%3A0cc4m%20OR%20author%3Aangt%20OR%20author%3AIMbackK%20OR%20author%3Aarthw%20OR%20author%3AJohannesGaessler%20OR%20author%3AORippler%20OR%20author%3Aruixiang63%20OR%20author%3Axctan%20OR%20author%3Aallozaur%20OR%20author%3Ayomaytk%20OR%20author%3Aaendk%20OR%20author%3Agaugarg-nv%20OR%20author%3Ataronaeo%20OR%20author%3Aforforever73%20OR%20author%3Alhez%20OR%20author%3Anetrunnereve%20OR%20author%3Afairydreaming)%20sort%3Aupdated-desc)
[Manifesto](https://github.com/ggml-org/llama.cpp/discussions/205) / [ggml](https://github.com/ggml-org/ggml) / [ops](https://github.com/ggml-org/llama.cpp/blob/master/docs/ops.md)
LLM inference in C/C++
+14 -27
View File
@@ -27,7 +27,6 @@
#include <cinttypes>
#include <climits>
#include <cstdarg>
#include <filesystem>
#include <fstream>
#include <list>
#include <regex>
@@ -488,15 +487,12 @@ void common_models_handler_apply(common_models_handler & handler, common_params
task.opts = opts;
tasks.push_back(task);
}
bool had_spec_url = false;
if (!params.speculative.draft.mparams.url.empty()) {
common_download_task task;
task.url = params.speculative.draft.mparams.url;
task.local_path = params.speculative.draft.mparams.path;
task.opts = opts;
tasks.push_back(task);
had_spec_url = true;
}
// handle hf_plan tasks
@@ -516,18 +512,6 @@ void common_models_handler_apply(common_models_handler & handler, common_params
});
}
};
// handle plan_spec (e.g. --spec-draft-hf)
if (!plan_spec.model_files.empty() && !had_spec_url) {
add_tasks(plan_spec.model_files, plan_spec.primary, params.speculative.draft.mparams);
had_spec_url = true;
}
// handle vocoder plan (e.g. --hf-repo-v)
if (!plan_voc.model_files.empty()) {
add_tasks(plan_voc.model_files, plan_voc.primary, params.vocoder.model);
}
if (!plan.model_files.empty()) {
add_tasks(plan.model_files, plan.primary, params.model);
}
@@ -536,7 +520,7 @@ void common_models_handler_apply(common_models_handler & handler, common_params
params.mmproj.path = hf_cache::finalize_file(plan.mmproj);
});
}
if (!plan.mtp.local_path.empty() && !had_spec_url) {
if (!plan.mtp.local_path.empty()) {
tasks.emplace_back(plan.mtp, opts, [&]() {
// only fall back to the discovered MTP head when no draft was explicitly provided
if (params.speculative.draft.mparams.empty()) {
@@ -555,6 +539,16 @@ void common_models_handler_apply(common_models_handler & handler, common_params
});
}
// handle plan_spec (e.g. --spec-draft-hf)
if (!plan_spec.model_files.empty()) {
add_tasks(plan_spec.model_files, plan_spec.primary, params.speculative.draft.mparams);
}
// handle vocoder plan (e.g. --hf-repo-v)
if (!plan_voc.model_files.empty()) {
add_tasks(plan_voc.model_files, plan_voc.primary, params.vocoder.model);
}
// run all tasks in parallel
if (!params.offline) {
// if duplicated files are found, only download once (but still call on_done for each task)
@@ -567,7 +561,6 @@ void common_models_handler_apply(common_models_handler & handler, common_params
}
std::vector<common_download_task> unique_tasks_vec;
for (auto & pair : unique_tasks) {
LOG_DBG("download task: %s -> %s\n", pair.second->url.c_str(), pair.second->local_path.c_str());
unique_tasks_vec.push_back(*pair.second);
}
common_download_run_tasks(unique_tasks_vec);
@@ -1077,7 +1070,6 @@ bool common_params_parse(int argc, char ** argv, common_params & params, llama_e
if (ctx_arg.print_usage) {
ctx_arg.print_usage(argc, argv);
}
common_log_flush(common_log_main());
exit(0);
}
if (ctx_arg.params.completion) {
@@ -2856,7 +2848,7 @@ common_params_context common_params_parser_init(common_params & params, llama_ex
params.out_file = value;
}
).set_examples({LLAMA_EXAMPLE_IMATRIX, LLAMA_EXAMPLE_CVECTOR_GENERATOR, LLAMA_EXAMPLE_EXPORT_LORA, LLAMA_EXAMPLE_TTS, LLAMA_EXAMPLE_FINETUNE,
LLAMA_EXAMPLE_RESULTS, LLAMA_EXAMPLE_EXPORT_GRAPH_OPS, LLAMA_EXAMPLE_CLI}));
LLAMA_EXAMPLE_RESULTS, LLAMA_EXAMPLE_EXPORT_GRAPH_OPS}));
add_opt(common_arg(
{"-ofreq", "--output-frequency"}, "N",
string_format("output the imatrix every N iterations (default: %d)", params.n_out_freq),
@@ -3043,7 +3035,7 @@ common_params_context common_params_parser_init(common_params & params, llama_ex
{"--tools"}, "TOOL1,TOOL2,...",
"experimental: whether to enable built-in tools for AI agents - do not enable in untrusted environments (default: no tools)\n"
"specify \"all\" to enable all tools\n"
"available tools: read_file, file_glob_search, grep_search, exec_shell_command, write_file, edit_file, get_datetime",
"available tools: read_file, file_glob_search, grep_search, exec_shell_command, write_file, edit_file, apply_diff, get_datetime",
[](common_params & params, const std::string & value) {
params.server_tools = parse_csv_row(value);
}
@@ -3465,14 +3457,9 @@ common_params_context common_params_parser_init(common_params & params, llama_ex
).set_env("LLAMA_ARG_LOG_FILE"));
add_opt(common_arg(
{"--log-prompts-dir"}, "PATH",
"Log prompts to directory (auto-created if not present; only used for debugging, default: disabled)",
"Log prompts to directory (only used for debugging, default: disabled)",
[](common_params & params, const std::string & value) {
params.path_prompts_log_dir = value;
std::error_code ec;
std::filesystem::create_directories(value, ec);
if (ec) {
fprintf(stderr, "warning: failed to create prompts-log-dir '%s': %s\n", value.c_str(), ec.message().c_str());
}
}
).set_examples({LLAMA_EXAMPLE_SERVER, LLAMA_EXAMPLE_CLI}));
add_opt(common_arg(
+1 -6
View File
@@ -147,8 +147,7 @@ common_peg_arena autoparser::build_parser(const generation_params & inputs, cons
} else {
parser = content.build_parser(ctx);
}
const std::string reasoning_start = trim_whitespace(reasoning.start);
return pure_content ? p.prefix(generation_prompt, reasoning_start) + parser : p.prefix(generation_prompt, reasoning_start) << parser;
return pure_content ? p.prefix(generation_prompt, reasoning.start) + parser : p.prefix(generation_prompt, reasoning.start) << parser;
});
}
@@ -262,10 +261,6 @@ common_peg_parser analyze_tools::build_func_parser(common_chat_peg_builder & p,
bool matched_atomic = false;
common_peg_parser func_parser = p.eps();
if (!function.args_separator.empty()) {
open = open + p.space() + p.literal(function.args_separator);
}
if (!function.name_suffix.empty()) {
func_parser = open + call_id_section + p.space() + args;
matched_atomic = true;
+3 -4
View File
@@ -192,10 +192,9 @@ struct tool_format_analysis {
};
struct tool_function_analysis {
std::string name_prefix; // e.g., "<function=", "\"name\": \"", "functions."
std::string name_suffix; // e.g., ">", "\"", ":0"
std::string args_separator; // e.g., "<tool_sep>" (marker between function name and arguments)
std::string close; // e.g., "</function>", "" (for tag-based)
std::string name_prefix; // e.g., "<function=", "\"name\": \"", "functions."
std::string name_suffix; // e.g., ">", "\"", ":0"
std::string close; // e.g., "</function>", "" (for tag-based)
};
struct tool_arguments_analysis {
+2 -32
View File
@@ -124,16 +124,16 @@ static std::vector<std::function<void(const common_chat_template & tmpl, autopar
analysis.tools.format.section_end = "";
analysis.tools.format.per_call_start = "<TOOLCALL>";
analysis.tools.format.per_call_end = "</TOOLCALL>";
analysis.tools.format.tools_array_wrapped = true;
analysis.content.mode = content_mode::PLAIN;
analysis.content.start = "";
analysis.content.end = "";
analysis.reasoning.mode = reasoning_mode::TAG_BASED;
analysis.reasoning.start = "<think>\n";
analysis.reasoning.start = "<think>\n\n";
analysis.reasoning.end = "</think>";
analysis.assistant_start = "<SPECIAL_11>Assistant";
analysis.user_start = "<SPECIAL_11>User";
analysis.preserved_tokens.clear();
analysis.preserved_tokens.push_back("<SPECIAL_12>");
analysis.preserved_tokens.push_back("<SPECIAL_11>");
analysis.preserved_tokens.push_back("</think>");
analysis.preserved_tokens.push_back("<TOOLCALL>");
@@ -259,7 +259,6 @@ void autoparser::analyze_template(const common_chat_template & tmpl) {
LOG_DBG("per_call_end: '%s'\n", tools.format.per_call_end.c_str());
LOG_DBG("func_name_prefix: '%s'\n", tools.function.name_prefix.c_str());
LOG_DBG("func_name_suffix: '%s'\n", tools.function.name_suffix.c_str());
LOG_DBG("func_args_separator: '%s'\n", tools.function.args_separator.c_str());
LOG_DBG("func_close: '%s'\n", tools.function.close.c_str());
LOG_DBG("call_id_prefix: '%s'\n", tools.call_id.prefix.c_str());
LOG_DBG("call_id_suffix: '%s'\n", tools.call_id.suffix.c_str());
@@ -303,7 +302,6 @@ void autoparser::collect_preserved_tokens() {
add_token(tools.format.per_call_end);
add_token(tools.function.name_prefix);
add_token(tools.function.name_suffix);
add_token(tools.function.args_separator);
add_token(tools.function.close);
add_token(tools.arguments.start);
add_token(tools.arguments.end);
@@ -1053,23 +1051,6 @@ void analyze_tools::check_per_call_markers() {
format.section_start.clear();
format.section_end.clear();
}
if (!format.per_call_end.empty()) {
auto count_occurrences = [](const std::string & haystack, const std::string & needle) {
size_t count = 0;
for (size_t pos = haystack.find(needle); pos != std::string::npos;
pos = haystack.find(needle, pos + needle.size())) {
count++;
}
return count;
};
size_t calls_one = count_occurrences(one_vs_two->output_A, format.per_call_end);
size_t calls_two = count_occurrences(one_vs_two->output_B, format.per_call_end);
if (calls_one > 0 && calls_one == calls_two) {
format.section_end = format.per_call_end;
format.per_call_end.clear();
}
}
}
void analyze_tools::extract_function_markers() {
@@ -1151,17 +1132,6 @@ void analyze_tools::extract_function_markers() {
auto suf_result = suffix_parser.parse_and_extract(diff.suffix);
if (suf_result.result.success()) {
function.name_suffix += suf_result.tags["ext"];
auto arg_start = [&](common_peg_parser_builder &p) {
return p.marker() + p.space() + p.choice({ p.literal(ARG_FIRST), p.literal(ARG_SECOND) });
};
auto sep_parser = build_tagged_peg_parser([&](common_peg_parser_builder &p) {
return p.tag("sep", p.zero_or_more(p.negate(arg_start(p)) + p.any())) + arg_start(p);
});
auto sep_result = sep_parser.parse_and_extract(diff.suffix.substr(suf_result.tags["ext"].size()));
if (sep_result.result.success()) {
function.args_separator = trim_whitespace(sep_result.tags["sep"]);
}
}
}
-3
View File
@@ -1081,9 +1081,6 @@ enum ggml_opt_optimizer_type common_opt_get_optimizer(const char *);
struct common_prompt_checkpoint {
int64_t n_tokens;
// (optional) id of the task that created the checkpoint
int id_task = -1;
llama_pos pos_min;
llama_pos pos_max;
-39
View File
@@ -750,50 +750,11 @@ const func_builtins & value_string_t::get_builtins() const {
res->val_str.mark_input_based_on(args.get_pos(0)->val_str);
return res;
}},
{"format", [](const func_args & args) -> value {
value val_input = args.get_pos(0);
if (!is_val<value_string>(val_input)) {
throw raised_exception("format() first argument must be a string");
}
const jinja::string & fmt = val_input->as_string();
const bool fmt_is_input = fmt.all_parts_are_input();
const std::string str = fmt.str();
jinja::string result;
std::string literal;
auto flush_literal = [&]() {
if (!literal.empty()) {
result.parts.push_back({fmt_is_input, literal});
literal.clear();
}
};
size_t arg_idx = 1; // positional args follow the format string
for (size_t i = 0; i < str.size(); ++i) {
if (str[i] != '{') {
literal += str[i];
continue;
}
if (i + 1 >= str.size() || str[i + 1] != '}') {
throw not_implemented_exception("format() only supports simple '{}' placeholders");
}
++i;
flush_literal();
const jinja::string arg_str = args.get_pos(arg_idx++)->as_string();
result.parts.insert(result.parts.end(), arg_str.parts.begin(), arg_str.parts.end());
}
flush_literal();
return mk_val<value_string>(result);
}},
{"int", [](const func_args & args) -> value {
value val_input = args.get_pos(0);
value val_default = args.get_kwarg_or_pos("default", 1);
value val_base = args.get_kwarg_or_pos("base", 2);
const int base = val_base->is_undefined() ? 10 : val_base->as_int();
if (base != 0 && (base < 2 || base > 36)) {
// an out-of-range base makes std::stoi fail fast on the MSVC CRT instead of throwing
throw raised_exception("int() base must be 0 or between 2 and 36");
}
if (is_val<value_string>(val_input) == false) {
throw raised_exception("int() first argument must be a string");
}
-1
View File
@@ -106,7 +106,6 @@ TEXT_MODEL_MAP: dict[str, str] = {
"HunYuanDenseV1ForCausalLM": "hunyuan",
"HunYuanMoEV1ForCausalLM": "hunyuan",
"HunYuanVLForConditionalGeneration": "hunyuan",
"HYV3ForCausalLM": "hunyuan",
"IQuestCoderForCausalLM": "llama",
"InternLM2ForCausalLM": "internlm",
"InternLM3ForCausalLM": "internlm",
+1 -3
View File
@@ -109,9 +109,7 @@ class ModelBase:
sentence_transformers_dense_modules: bool = False
# MTP (multi-token prediction) export modes; set by main() before instantiation.
# Architectures that implement the filtering/export behavior opt in by
# setting supports_mtp_export = True on their model class or a mixin.
supports_mtp_export: bool = False
# Architectures opt in by overriding the handling (see _Qwen35MtpMixin).
mtp_only: bool = False
no_mtp: bool = False
-104
View File
@@ -1,7 +1,6 @@
from __future__ import annotations
import json
import re
from pathlib import Path
from typing import Callable, Iterable, TYPE_CHECKING
@@ -356,106 +355,3 @@ class HunyuanVLTextModel(HunYuanModel):
self.gguf_writer.add_context_length(ctx_len)
self.gguf_writer.add_rope_dimension_sections(list(self.rope_parameters["xdrope_section"]))
@ModelBase.register("HYV3ForCausalLM")
class HYV3Model(TextModel):
model_arch = gguf.MODEL_ARCH.HY_V3
supports_mtp_export = True
# Trunk layer count, stashed before indexing so the classmethod
# filter_tensors can identify the appended MTP block(s) (mirrors
# Step35Model).
_n_main_layers: int | None = None
def __init__(self, *args, **kwargs):
super().__init__(*args, **kwargs)
# NextN/MTP layers are appended past num_hidden_layers; extend the
# tensor map so the MTP block's tensors resolve to blk.<n>.* names.
n_nextn = int(self.hparams.get("num_nextn_predict_layers", 0))
if n_nextn > 0 and not self.no_mtp:
self.block_count += n_nextn
self.tensor_map = gguf.get_tensor_name_map(self.model_arch, self.block_count)
def index_tensors(self, remote_hf_model_id: str | None = None):
type(self)._n_main_layers = self.hparams["num_hidden_layers"]
return super().index_tensors(remote_hf_model_id=remote_hf_model_id)
def set_vocab(self):
self._set_vocab_gpt2()
def set_gguf_parameters(self):
super().set_gguf_parameters()
self.gguf_writer.add_expert_feed_forward_length(self.hparams["moe_intermediate_size"])
self.gguf_writer.add_expert_shared_feed_forward_length(
self.hparams["moe_intermediate_size"] * self.hparams.get("num_shared_experts", 1)
)
self.gguf_writer.add_expert_weights_norm(self.hparams.get("route_norm", True))
self.gguf_writer.add_expert_weights_scale(float(self.hparams.get("router_scaling_factor", 1.0)))
# sigmoid router with expert selection bias
self.gguf_writer.add_expert_gating_func(gguf.ExpertGatingFuncType.SIGMOID)
n_nextn = int(self.hparams.get("num_nextn_predict_layers", 0))
if n_nextn > 0 and not self.no_mtp:
self.gguf_writer.add_nextn_predict_layers(n_nextn)
@classmethod
def filter_tensors(cls, item: tuple[str, Callable[[], Tensor]]) -> tuple[str, Callable[[], Tensor]] | None:
if (titem := super().filter_tensors(item)) is None:
return None
name, gen = titem
# HY V3 appends the MTP block(s) past num_hidden_layers.
assert cls._n_main_layers is not None
is_mtp = (m := re.match(r"model\.layers\.(\d+)\.", name)) is not None and int(m.group(1)) >= cls._n_main_layers
# --no-mtp: drop the appended MTP block(s) entirely.
if is_mtp and cls.no_mtp:
return None
# --mtp: keep ONLY MTP-block tensors plus the shared embeddings/norm/
# lm_head (so the resulting GGUF carries just the draft head).
if cls.mtp_only and not is_mtp and name not in (
"model.embed_tokens.weight", "model.norm.weight", "lm_head.weight",
):
return None
# The MTP block's trailing final_layernorm (applied after the decoder
# block, before the shared LM head) maps to nextn.shared_head_norm.
if is_mtp:
name = name.replace(".final_layernorm.", ".shared_head.norm.")
return name, gen
_experts: list[dict[str, Tensor]] | None = None
def modify_tensors(self, data_torch: Tensor, name: str, bid: int | None) -> Iterable[tuple[str, Tensor]]:
# merge the per-expert tensors into stacked 3d tensors
if name.startswith("model.layers.") and ".mlp.experts." in name:
n_experts = self.find_hparam(["num_local_experts", "num_experts"])
assert bid is not None
if self._experts is None:
self._experts = [{} for _ in range(self.block_count)]
self._experts[bid][name] = data_torch
if len(self._experts[bid]) >= n_experts * 3:
for w_name in ("down_proj", "gate_proj", "up_proj"):
datas: list[Tensor] = []
for xid in range(n_experts):
ename = f"model.layers.{bid}.mlp.experts.{xid}.{w_name}.weight"
datas.append(self._experts[bid][ename])
del self._experts[bid][ename]
merged = torch.stack(datas, dim=0)
yield from super().modify_tensors(merged, f"model.layers.{bid}.mlp.experts.{w_name}.weight", bid)
return
yield from super().modify_tensors(data_torch, name, bid)
def prepare_tensors(self):
super().prepare_tensors()
if self._experts is not None:
experts = [k for d in self._experts for k in d.keys()]
if experts:
raise ValueError(f"Unprocessed experts: {experts}")
-1
View File
@@ -541,7 +541,6 @@ class _Qwen35MtpMixin:
`mtp.*` to the standard layer-indexed nextn naming so the existing
tensor_map handles them."""
supports_mtp_export = True
hparams: dict[str, Any]
model_arch: gguf.MODEL_ARCH
gguf_writer: gguf.GGUFWriter
-1
View File
@@ -98,7 +98,6 @@ class Step3VLTextModel(Qwen3Model):
@ModelBase.register("Step3p5ForCausalLM", "Step3p7ForConditionalGeneration")
class Step35Model(TextModel):
model_arch = gguf.MODEL_ARCH.STEP35
supports_mtp_export = True
# The --mtp / --no-mtp toggles are ModelBase.mtp_only / no_mtp (set in
# convert_hf_to_gguf.py main()). Unlike Qwen3.5, which stores MTP under a
+4 -2
View File
@@ -259,8 +259,10 @@ def main() -> None:
sys.exit(1)
if args.mtp or args.no_mtp:
if not model_class.supports_mtp_export:
logger.error("--mtp / --no-mtp are not supported for %s", model_architecture)
from conversion.qwen import _Qwen35MtpMixin
from conversion.step3 import Step35Model
if not (issubclass(model_class, _Qwen35MtpMixin) or issubclass(model_class, Step35Model)):
logger.error("--mtp / --no-mtp are only supported for Qwen3.5/3.6 and Step3.5 text variants today")
sys.exit(1)
if args.no_mtp:
model_class.no_mtp = True
-177
View File
@@ -1,177 +0,0 @@
# llama.cpp for ET
- [Background](#background)
- [Limitations](#limitations)
- [Build](#build)
- [Develop](#develop)
- [Roadmap](#roadmap)
## Background
**ET** is a llama.cpp backend targeting the fully open source manycore
RISC-V accelerator platform [ET-SOC](https://github.com/aifoundry-org/et-man).
## Limitations
The ET backend runs several of the major OSS models with some limitations:
- Only limited set of operations is supported (check [../ops.md](../ops.md)
and [../ops/ET.csv](../ops/ET.csv)).
- Only `q8_0`, `q4_0` (and partially `fp16`, `q4_K`) quantization is supported.
- Only one llama.cpp instance can use device at the same time (current firmware
limitation).
- Limited (but working) MoE model support
As a result of the above, only select models can run fully on ET-SOC
(you can actually run any model llama.cpp supports, but some/most operations
will likely fallback to CPU backend).
Fully supported models:
- Qwen3 models (without MoE), e.g.
[ggml-org/Qwen3-0.6B-GGUF:q8_0](https://huggingface.co/ggml-org/Qwen3-0.6B-GGUF/blob/main/Qwen3-0.6B-Q8_0.gguf) or
[ggml-org/Qwen3-14B-GGUF:q8_0](https://huggingface.co/ggml-org/Qwen3-14B-GGUF/blob/main/Qwen3-14B-Q8_0.gguf).
- Llama3.2 (1B/3B), e.g.
[lmstudio-community/Llama-3.2-1B-Instruct-GGUF:q8_0](https://huggingface.co/lmstudio-community/Llama-3.2-1B-Instruct-GGUF/blob/main/Llama-3.2-1B-Instruct-Q8_0.gguf).
- SmolLM2, e.g.
[unsloth/SmolLM2-135M-Instruct-GGUF:q8_0](https://huggingface.co/unsloth/SmolLM2-135M-Instruct-GGUF/blob/main/SmolLM2-135M-Instruct-Q8_0.gguf)
- Llama 3.1 model family.
- RWKV v7 model family.
- TinyLLaMA
## Build
### I. Prerequisites
1. **Install custom RISC-V toolchain** - Follow instructions at:
[https://github.com/aifoundry-org/riscv-gnu-toolchain/tree/et/aifoundry](https://github.com/aifoundry-org/riscv-gnu-toolchain/tree/et/aifoundry)
2. **Install ET platform** - Follow instructions at:
[https://github.com/aifoundry-org/et-platform](https://github.com/aifoundry-org/et-platform)
Both should be installed to `/opt/et` (or set `ET_TOOLCHAIN` and `ET_PLATFORM`
environment variables accordingly).
```sh
# Set toolchain and ET platform path (/opt/et is default)
export ET_TOOLCHAIN=/opt/et
export ET_PLATFORM=/opt/et
```
### II. Build llama.cpp
Check out llama.cpp with ET backend (this should checkout `et` branch):
```sh
git clone https://github.com/aifoundry-org/llama.cpp
cd llama.cpp
```
Build:
```sh
cmake -B build -DGGML_ET=ON
cmake --build build --config Release
# Optionally:
# cmake --install build
```
Build targeting sysemu backend instead of physical hardware:
```sh
cmake -B build -DGGML_ET=ON -DGGML_ET_SYSEMU=ON
cmake --build build --config Release
```
### III. Run
Run llama.cpp binaries as usual. (Of course, please make sure you have the
ET-SOC device installed and kernel driver loaded).
```sh
llama-cli -m mymodel.gguf
# or
llama-server -hf ggml-org/Qwen3-8B-GGUF:q8_0
```
If you want to run llama.cpp binaries (e.g. `llama-cli`) inside docker
container, you should let it access device files:
```sh
docker run \
--device=/dev/et0_mgmt:/dev/et0_mgmt \
--device=/dev/et0_ops:/dev/et0_ops \
...
```
## Develop
Compute kernels are developed within `ggml/src/ggml-et/et-kernels` folder.
Build is performed using custom RISC-V GNU toolchain and is managed by cmake.
At the moment kernels are build as baremetal elf files, without
standard lib or any other dependencies. All the yummy parts are written
in inline assembler.
Most kernels are very naive with lots of low hanging fruits left:
> [!IMPORTANT]
> Several assembly instructions emmited by the compiler are not implemented
> in hardware and software emulation in firmware is not ready yet.
> Eventually firmware will transparently trap unimplemented instructions
> and will emulate them inside exception handler. Until then, kernel
> build process includes step that checks compiled kernels and fails if any unimplemented
> instructions are found. Problematic ones follow:
> `FDIV.PI`, `FDIVU.PI`, `FREMU.PI`, `FREM.PI`, `FDIV.S`, `FDIV.PS`, `FSQRT.S`, `FSQRT.PS`, `FRSQ.PS`, `FSIN.PS`
> and (long cast) `FCVT.S.L`, `FCVT.S.LU`, `FCVT.L.S`, `FCVT.LU.S`
> What this means, is that for now you should avoid doing any division involving floats,
> any trigonometry or casting longs into floats.
> Some workarounds are implemented in `math_fp.h` (`et_fdiv`, `et_powf` etc) and
> long casting (presuming longs are small enough to fit into 32bits) can be
> done via `int` like `a = (float)(int)(b)`.
> [!TIP]
> There are some slightly higher level helpers (abstracting more
> complex instructions like tensor extension or synchronization primitives)
> inside `et_platform`, directory `et-common-libs/include/etsoc/isa/`. It was
> originally developed for firmware needs and is not included into compute
> kernel build process. Feel free to take ideas/code from there or try linking
> it in.
Before commiting any changes to operations and/or kernels, don't forget
to update supported ops reports (instructions at `docs/ops.md`).
When logging is enabled (e.g. by setting `--log-file` cli param),
each compute kernel run outputs a line with
pipe-delimited key-value pairs containing kernel level performance infomation.
Line is prefixed with `ET_PERF`:
```
ET_PERF|op=MUL_MAT|kernel=mul_mat_f32_Q8_0xf32|duration_us=3112|tensor=Qcur-0|shape=[4096,2,1,1]|start_us=48437862009|end_us=48437865121|flops=67100672
ET_PERF|op=ROPE|kernel=rope_f32|duration_us=9266|tensor=Qcur-0|shape=[128,32,2,1]|start_us=48437865128|end_us=48437874394|mode=0x0|n_dims=128|freq_base=500000.00|freq_scale=1.00
```
Keys depend on the operation, but some are always present.
`flops` in this case counts effective floating point operations and not floating
point operations per second.
You can enable ET-SOC runtime level ET-SOC profiling by setting environment
variable `GGML_ET_PROFILE` to a path. Profiling/tracing results will be written
to `GGML_ET_PROFILE/et_runtime_trace.json` and `GGML_ET_PROFILE/kernel_map` on exit.
### Uberkernel
The in-knernel implementaiton of device dispatch/kernel fusion. The ET SDK has a non-trivial op-to-op gap. `Uberkernel` (name taken from the original Esperanto AI's compiler)
dispatches multiple already existing kernel implementations with device side synchronization. Due to the processor's design, there is no natural memory visibility
horizon between sub-kernel invocations. This makes uberkernel much more difficult to develop and debug. Currently Uberkerel is hidden begind the
`GGML_ET_UBERKERNEL` environment variable and is disabled by default. Setting it to 1 enables it and provides significant performance improvements but is only
validated for the LLaMA 3.2 model family and Qwen 3.5.
## Roadmap
As of writing the documentation the ET backend is capable of running most models and smaller ones at usable speed given the low power profile of the processor. We'd
address the following capabilities in the future:
* Enable Uberkernel for all models
* More oprtator support
* Better TTS model support
* Enable more quantization format support
-1
View File
@@ -795,7 +795,6 @@ use 1 SYCL GPUs: [0] with Max compute units:512
| GGML_SYCL_USE_LEVEL_ZERO_API | 1 (default) or 0 | Use Level Zero API for device memory allocation instead of SYCL. Reduces system RAM usage on Intel dGPUs by avoiding DMA-buf/TTM host memory staging. Requires GGML_SYCL_SUPPORT_LEVEL_ZERO_API=ON at build time. SYCL backend always runs on Level Zero running time even if it's set as OFF (The SYCL api will be usage for memory allocation).|
| GGML_SYCL_ENABLE_DNN | 0 or 1 (default)| Enable running computations through oneDNN and always use oneMKL. |
| GGML_SYCL_ENABLE_VMM | 0 or 1 (default) | Enable the virtual-memory device pool. |
| GGML_SYCL_ENABLE_FUSION | 0 or 1 (default) | Enable fused-kernel dispatch in graph compute (currently top-k MoE gating). |
| ZES_ENABLE_SYSMAN | 0 (default) or 1 | Support to get free memory of GPU by sycl::aspect::ext_intel_free_memory.<br>Recommended to use when --split-mode = layer |
| UR_L0_ENABLE_RELAXED_ALLOCATION_LIMITS | 0 (default) or 1 | Allow SYCL/Unified Runtime Level Zero device allocations larger than 4 GiB. llama.cpp's direct Level Zero allocation path requests the relaxed maximum-size limit itself when GGML_SYCL_ENABLE_LEVEL_ZERO=1. |
| GGML_SYCL_USM_SYSTEM | 0 (default) or 1 | Enable experimental support for [USM system allocations](https://github.khronos.org/SYCL_Reference/iface/usm_basic_concept.html#system-allocations) for large GPU buffers. This requires enough host memory for model weights and caches, an Intel Xe2+ GPU such as BMG or newer and supported on Linux only, with CONFIG_DRM_XE_GPUSVM enabled. |
+109 -109
View File
@@ -12,112 +12,112 @@ Legend:
- 🟡 Partially supported by this backend
- ❌ Not supported by this backend
| Operation | BLAS | CANN | CPU | CUDA | ET | MTL | OpenCL | SYCL | Vulkan | WebGPU | ZenDNN | zDNN |
|-----------|------|------|------|------|------|------|------|------|------|------|------|------|
| ABS | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ACC | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | 🟡 | ✅ | ❌ | ❌ | ❌ |
| ADD | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ADD1 | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ |
| ADD_ID | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ARANGE | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ARGMAX | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ARGSORT | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| CEIL | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| CLAMP | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | 🟡 | ✅ | ❌ | ❌ |
| COL2IM_1D | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CONCAT | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| CONT | ❌ | 🟡 | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | 🟡 | ❌ | ❌ |
| CONV_2D | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| CONV_2D_DW | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| CONV_3D | ❌ | ❌ | ✅ | ❌ | ❌ | ✅ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CONV_TRANSPOSE_1D | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| CONV_TRANSPOSE_2D | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| COS | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| COUNT_EQUAL | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| CPY | ❌ | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| CROSS_ENTROPY_LOSS | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CROSS_ENTROPY_LOSS_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CUMSUM | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| DIAG | ❌ | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| DIAG_MASK_INF | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | 🟡 | ✅ | ✅ | ❌ | ❌ | ❌ |
| DIV | ❌ | ✅ | ✅ | ✅ | ❌ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| DUP | ❌ | ✅ | ✅ | 🟡 | ❌ | 🟡 | 🟡 | ✅ | ✅ | ❌ | ❌ | ❌ |
| ELU | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| EXP | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| EXPM1 | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| FILL | ❌ | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| FLASH_ATTN_EXT | ❌ | 🟡 | ✅ | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| FLOOR | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GATED_DELTA_NET | ❌ | ❌ | ✅ | ❌ | ✅ | 🟡 | ❌ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| GATED_LINEAR_ATTN | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| GEGLU | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GEGLU_ERF | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GEGLU_QUICK | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GELU | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| GELU_ERF | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| GELU_QUICK | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| GET_ROWS | ❌ | 🟡 | ✅ | 🟡 | 🟡 | 🟡 | 🟡 | ✅ | ✅ | 🟡 | ❌ | ❌ |
| GET_ROWS_BACK | ❌ | ❌ | 🟡 | 🟡 | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ |
| GROUP_NORM | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ |
| HARDSIGMOID | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| HARDSWISH | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| IM2COL | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| IM2COL_3D | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| L2_NORM | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| LEAKY_RELU | ❌ | ✅ | ✅ | ✅ | ❌ | 🟡 | ❌ | ✅ | 🟡 | ❌ | ❌ | ❌ |
| LOG | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| MEAN | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ |
| MUL | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| MUL_MAT | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 |
| MUL_MAT_HADAMARD | ❌ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| MUL_MAT_ID | ❌ | 🟡 | ✅ | ✅ | 🟡 | 🟡 | 🟡 | ✅ | ✅ | 🟡 | 🟡 | ❌ |
| NEG | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| NORM | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| OPT_STEP_ADAMW | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ |
| OPT_STEP_SGD | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ |
| OUT_PROD | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ | ❌ | 🟡 | ❌ | ❌ | ❌ | 🟡 |
| PAD | ❌ | 🟡 | ✅ | 🟡 | ❌ | 🟡 | 🟡 | 🟡 | ✅ | ✅ | ❌ | ❌ |
| PAD_REFLECT_1D | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| POOL_1D | ❌ | ❌ | ✅ | ❌ | ❌ | ✅ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| POOL_2D | ❌ | 🟡 | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| REGLU | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| RELU | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| REPEAT | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| REPEAT_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| RMS_NORM | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| RMS_NORM_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ROLL | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ROPE | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ROPE_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ROUND | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| RWKV_WKV6 | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| RWKV_WKV7 | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| SCALE | ❌ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SET | ❌ | ❌ | ✅ | ✅ | ❌ | ✅ | ❌ | 🟡 | ✅ | ✅ | ❌ | ❌ |
| SET_ROWS | ❌ | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| SGN | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SIGMOID | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| SILU | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| SILU_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ |
| SIN | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| SOFTPLUS | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SOFT_MAX | ❌ | 🟡 | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SOFT_MAX_BACK | ❌ | ❌ | 🟡 | 🟡 | ❌ | ❌ | ❌ | 🟡 | ✅ | ❌ | ❌ | ❌ |
| SOLVE_TRI | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | 🟡 | ✅ | ✅ | ❌ | ❌ |
| SQR | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| SQRT | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| SSM_CONV | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SSM_SCAN | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | 🟡 | 🟡 | ✅ | ❌ | ❌ |
| STEP | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SUB | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SUM | ❌ | 🟡 | ✅ | 🟡 | ❌ | 🟡 | ❌ | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| SUM_ROWS | ❌ | ✅ | ✅ | 🟡 | ❌ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ❌ | ❌ |
| SWIGLU | ❌ | ✅ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SWIGLU_OAI | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| TANH | ❌ | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| TIMESTEP_EMBEDDING | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ |
| TOP_K | ❌ | ❌ | ✅ | ❌ | ❌ | ✅ | ❌ | 🟡 | 🟡 | ✅ | ❌ | ❌ |
| TRI | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| TRUNC | ❌ | ❌ | ✅ | 🟡 | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| UPSCALE | ❌ | 🟡 | ✅ | ✅ | ❌ | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| XIELU | ❌ | ❌ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ |
| Operation | BLAS | CANN | CPU | CUDA | MTL | OpenCL | SYCL | Vulkan | WebGPU | ZenDNN | zDNN |
|-----------|------|------|------|------|------|------|------|------|------|------|------|
| ABS | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ACC | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | 🟡 | ✅ | ❌ | ❌ | ❌ |
| ADD | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ADD1 | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ |
| ADD_ID | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ARANGE | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ARGMAX | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ARGSORT | ❌ | ✅ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| CEIL | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| CLAMP | ❌ | ✅ | ✅ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ❌ | ❌ |
| COL2IM_1D | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CONCAT | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| CONT | ❌ | 🟡 | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | 🟡 | ❌ | ❌ |
| CONV_2D | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| CONV_2D_DW | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| CONV_3D | ❌ | ❌ | ✅ | ❌ | ✅ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CONV_TRANSPOSE_1D | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| CONV_TRANSPOSE_2D | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| COS | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| COUNT_EQUAL | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| CPY | ❌ | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| CROSS_ENTROPY_LOSS | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CROSS_ENTROPY_LOSS_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| CUMSUM | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| DIAG | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| DIAG_MASK_INF | ❌ | ✅ | ✅ | ✅ | ❌ | 🟡 | ✅ | ✅ | ❌ | ❌ | ❌ |
| DIV | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| DUP | ❌ | ✅ | ✅ | 🟡 | 🟡 | 🟡 | ✅ | ✅ | ❌ | ❌ | ❌ |
| ELU | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| EXP | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| EXPM1 | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| FILL | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| FLASH_ATTN_EXT | ❌ | 🟡 | ✅ | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| FLOOR | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GATED_DELTA_NET | ❌ | ❌ | ✅ | ❌ | 🟡 | ❌ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| GATED_LINEAR_ATTN | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| GEGLU | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GEGLU_ERF | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GEGLU_QUICK | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| GELU | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| GELU_ERF | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| GELU_QUICK | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| GET_ROWS | ❌ | 🟡 | ✅ | 🟡 | 🟡 | 🟡 | ✅ | ✅ | 🟡 | ❌ | ❌ |
| GET_ROWS_BACK | ❌ | ❌ | 🟡 | 🟡 | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ |
| GROUP_NORM | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ |
| HARDSIGMOID | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| HARDSWISH | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| IM2COL | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| IM2COL_3D | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| L2_NORM | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| LEAKY_RELU | ❌ | ✅ | ✅ | ✅ | 🟡 | ❌ | ✅ | 🟡 | ❌ | ❌ | ❌ |
| LOG | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| MEAN | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ |
| MUL | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| MUL_MAT | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 |
| MUL_MAT_HADAMARD | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| MUL_MAT_ID | ❌ | 🟡 | ✅ | ✅ | 🟡 | 🟡 | ✅ | ✅ | 🟡 | 🟡 | ❌ |
| NEG | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| NORM | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| OPT_STEP_ADAMW | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ |
| OPT_STEP_SGD | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ |
| OUT_PROD | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ | 🟡 | ❌ | ❌ | ❌ | 🟡 |
| PAD | ❌ | 🟡 | ✅ | 🟡 | 🟡 | 🟡 | 🟡 | ✅ | ✅ | ❌ | ❌ |
| PAD_REFLECT_1D | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| POOL_1D | ❌ | ❌ | ✅ | ❌ | ✅ | ❌ | ✅ | ❌ | ❌ | ❌ | ❌ |
| POOL_2D | ❌ | 🟡 | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| REGLU | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| RELU | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| REPEAT | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| REPEAT_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| RMS_NORM | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| RMS_NORM_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ROLL | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ROPE | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| ROPE_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| ROUND | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| RWKV_WKV6 | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| RWKV_WKV7 | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ |
| SCALE | ❌ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SET | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | 🟡 | ✅ | ✅ | ❌ | ❌ |
| SET_ROWS | ❌ | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| SGN | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SIGMOID | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| SILU | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| SILU_BACK | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ | ❌ | ✅ | ❌ | ❌ | ❌ |
| SIN | ❌ | ✅ | ✅ | ✅ | ✅ | ❌ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| SOFTPLUS | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SOFT_MAX | ❌ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SOFT_MAX_BACK | ❌ | ❌ | 🟡 | 🟡 | ❌ | ❌ | 🟡 | ✅ | ❌ | ❌ | ❌ |
| SOLVE_TRI | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | 🟡 | ✅ | ✅ | ❌ | ❌ |
| SQR | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| SQRT | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | 🟡 | ✅ | ❌ | ❌ |
| SSM_CONV | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SSM_SCAN | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | 🟡 | 🟡 | ✅ | ❌ | ❌ |
| STEP | ❌ | ✅ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SUB | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SUM | ❌ | 🟡 | ✅ | 🟡 | 🟡 | ❌ | 🟡 | 🟡 | 🟡 | ❌ | ❌ |
| SUM_ROWS | ❌ | ✅ | ✅ | 🟡 | ✅ | 🟡 | 🟡 | ✅ | ✅ | ❌ | ❌ |
| SWIGLU | ❌ | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| SWIGLU_OAI | ❌ | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| TANH | ❌ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ |
| TIMESTEP_EMBEDDING | ❌ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ❌ | ❌ | ❌ |
| TOP_K | ❌ | ❌ | ✅ | ❌ | ✅ | ❌ | 🟡 | 🟡 | ✅ | ❌ | ❌ |
| TRI | ❌ | ❌ | ✅ | ✅ | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| TRUNC | ❌ | ❌ | ✅ | 🟡 | ✅ | ❌ | ✅ | ✅ | ✅ | ❌ | ❌ |
| UPSCALE | ❌ | 🟡 | ✅ | ✅ | ✅ | 🟡 | ✅ | ✅ | ✅ | ❌ | ❌ |
| XIELU | ❌ | ❌ | ✅ | ❌ | ✅ | ❌ | ❌ | ✅ | ✅ | ❌ | ❌ |
-16114
View File
File diff suppressed because it is too large Load Diff
+2 -2
View File
@@ -362,7 +362,7 @@ class EvalState:
case = cases.get(task_id, {})
status = case.get("status", "pending")
expected = case.get("expected", "")
answer = case.get("answer") or "" if status == "ok" else ""
answer = case.get("answer", "") if status == "ok" else ""
is_correct = case.get("correct", False) if status == "ok" else False
response = case.get("response", "") or ""
prompt = case.get("prompt", "") or ""
@@ -647,7 +647,7 @@ class EvalState:
question, prompt, expected = self.get_case(i)
case = cases.get(task_id, {})
status = case.get("status", "pending")
answer = case.get("answer") or "N/A" if status == "ok" else "N/A"
answer = case.get("answer", "N/A") if status == "ok" else "N/A"
tokens = case.get("tokens")
tokens_str = str(tokens) if tokens is not None else "N/A"
tps_gen = case.get("tps_gen")
+2 -4
View File
@@ -4,8 +4,8 @@ project("ggml" C CXX ASM)
### GGML Version
set(GGML_VERSION_MAJOR 0)
set(GGML_VERSION_MINOR 16)
set(GGML_VERSION_PATCH 0)
set(GGML_VERSION_MINOR 15)
set(GGML_VERSION_PATCH 3)
set(GGML_VERSION_BASE "${GGML_VERSION_MAJOR}.${GGML_VERSION_MINOR}.${GGML_VERSION_PATCH}")
list(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/cmake/")
@@ -257,8 +257,6 @@ set (GGML_SYCL_DEVICE_ARCH "" CACHE STRING
"ggml: sycl device architecture")
option(GGML_OPENVINO "ggml: use OPENVINO" OFF)
option(GGML_ET "ggml: use ET backend" OFF)
option(GGML_ET_SYSEMU "ggml: use ET backend via sysemu" OFF)
option(GGML_OPENCL "ggml: use OpenCL" OFF)
option(GGML_OPENCL_PROFILING "ggml: use OpenCL profiling (increases overhead)" OFF)
-28
View File
@@ -1,28 +0,0 @@
#pragma once
#include "ggml.h"
#include "ggml-backend.h"
#ifdef __cplusplus
extern "C" {
#endif
#define GGML_ET_NAME "ET"
// backend API
GGML_BACKEND_API ggml_guid_t ggml_backend_et_guid(void);
GGML_BACKEND_API ggml_backend_t ggml_backend_et_init(size_t devidx);
GGML_BACKEND_API bool ggml_backend_is_et(ggml_backend_t backend);
GGML_BACKEND_API int ggml_backend_et_get_device_count(void);
GGML_BACKEND_API void ggml_backend_et_get_device_description(int devidx, char * description, size_t description_size);
GGML_BACKEND_API void ggml_backend_et_get_device_memory(int devidx, size_t * free, size_t * total);
GGML_BACKEND_API ggml_backend_buffer_type_t ggml_backend_et_buffer_type(size_t dev_num);
GGML_BACKEND_API ggml_backend_buffer_type_t ggml_backend_et_host_buffer_type(void);
GGML_BACKEND_API ggml_backend_reg_t ggml_backend_et_reg(void);
#ifdef __cplusplus
}
#endif
+2 -2
View File
@@ -8,10 +8,10 @@ extern "C" {
#define RPC_PROTO_MAJOR_VERSION 4
#define RPC_PROTO_MINOR_VERSION 0
#define RPC_PROTO_PATCH_VERSION 2
#define RPC_PROTO_PATCH_VERSION 1
#ifdef __cplusplus
static_assert(GGML_OP_COUNT == 98, "GGML_OP_COUNT has changed - update RPC_PROTO_PATCH_VERSION");
static_assert(GGML_OP_COUNT == 97, "GGML_OP_COUNT has changed - update RPC_PROTO_PATCH_VERSION");
#endif
#define GGML_RPC_MAX_SERVERS 16
-23
View File
@@ -570,7 +570,6 @@ extern "C" {
GGML_OP_RWKV_WKV7,
GGML_OP_SOLVE_TRI,
GGML_OP_GATED_DELTA_NET,
GGML_OP_LIGHTNING_INDEXER,
GGML_OP_UNARY,
@@ -780,10 +779,6 @@ extern "C" {
GGML_API bool ggml_is_contiguous_1(const struct ggml_tensor * tensor); // contiguous for dims >= 1
GGML_API bool ggml_is_contiguous_2(const struct ggml_tensor * tensor); // contiguous for dims >= 2
GGML_API bool ggml_is_contiguous_to_1(const struct ggml_tensor * tensor); // contiguous for dims < 1
GGML_API bool ggml_is_contiguous_to_2(const struct ggml_tensor * tensor); // contiguous for dims < 2
GGML_API bool ggml_is_contiguous_to_3(const struct ggml_tensor * tensor); // contiguous for dims < 3
// returns whether the tensor elements are allocated as one contiguous block of memory (no gaps, but permutation ok)
GGML_API bool ggml_is_contiguously_allocated(const struct ggml_tensor * tensor);
@@ -2580,24 +2575,6 @@ extern "C" {
struct ggml_tensor * state,
int64_t K);
// DSA lightning indexer
//
// q: [n_embd_idx, n_head_idx, n_batch, ne3 ]
// k: [n_embd_idx, 1, n_kv, ne3 ]
// weights: [n_head_idx, n_batch, 1, ne3 ] !! prescaled !!
// mask: [n_kv, n_batch, 1, ne33] !! f16 !!
// res: [n_kv, n_batch, 1, ne3 ]
//
// broadcast:
// ne3 % ne33 == 0
//
GGML_API struct ggml_tensor * ggml_lightning_indexer(
struct ggml_context * ctx,
struct ggml_tensor * q,
struct ggml_tensor * k,
struct ggml_tensor * weights,
struct ggml_tensor * mask);
// custom operators
typedef void (*ggml_custom1_op_t)(struct ggml_tensor * dst , const struct ggml_tensor * a, int ith, int nth, void * userdata);
+6 -7
View File
@@ -125,13 +125,12 @@ extern "C" {
// get ith C string from array with given key_id
GGML_API const char * gguf_get_arr_str (const struct gguf_context * ctx, int64_t key_id, size_t i);
GGML_API int64_t gguf_get_n_tensors (const struct gguf_context * ctx);
GGML_API int64_t gguf_find_tensor (const struct gguf_context * ctx, const char * name); // returns -1 if the tensor is not found
GGML_API size_t gguf_get_tensor_offset(const struct gguf_context * ctx, int64_t tensor_id);
GGML_API const char * gguf_get_tensor_name (const struct gguf_context * ctx, int64_t tensor_id);
GGML_API const int64_t * gguf_get_tensor_ne (const struct gguf_context * ctx, int64_t tensor_id); // returns ne, an array of GGML_MAX_DIMS elements; ne[dim] is 1 for dim >= n_dims
GGML_API enum ggml_type gguf_get_tensor_type (const struct gguf_context * ctx, int64_t tensor_id);
GGML_API size_t gguf_get_tensor_size (const struct gguf_context * ctx, int64_t tensor_id);
GGML_API int64_t gguf_get_n_tensors (const struct gguf_context * ctx);
GGML_API int64_t gguf_find_tensor (const struct gguf_context * ctx, const char * name); // returns -1 if the tensor is not found
GGML_API size_t gguf_get_tensor_offset(const struct gguf_context * ctx, int64_t tensor_id);
GGML_API const char * gguf_get_tensor_name (const struct gguf_context * ctx, int64_t tensor_id);
GGML_API enum ggml_type gguf_get_tensor_type (const struct gguf_context * ctx, int64_t tensor_id);
GGML_API size_t gguf_get_tensor_size (const struct gguf_context * ctx, int64_t tensor_id);
// removes key if it exists, returns id that the key had prior to removal (-1 if it didn't exist)
GGML_API int64_t gguf_remove_key(struct gguf_context * ctx, const char * key);
-1
View File
@@ -473,7 +473,6 @@ endif()
ggml_add_backend(BLAS)
ggml_add_backend(CANN)
ggml_add_backend(CUDA)
ggml_add_backend(ET)
ggml_add_backend(HIP)
ggml_add_backend(METAL)
ggml_add_backend(MUSA)
-7
View File
@@ -86,10 +86,6 @@
#include "ggml-openvino.h"
#endif
#ifdef GGML_USE_ET
#include "ggml-et.h"
#endif
namespace fs = std::filesystem;
static std::string path_str(const fs::path & path) {
@@ -165,9 +161,6 @@ struct ggml_backend_registry {
#ifdef GGML_USE_OPENVINO
register_backend(ggml_backend_openvino_reg());
#endif
#ifdef GGML_USE_ET
register_backend(ggml_backend_et_reg());
#endif
#ifdef GGML_USE_CPU
register_backend(ggml_backend_cpu_reg());
#endif
-7
View File
@@ -638,7 +638,6 @@ function(ggml_add_cpu_backend_variant_impl tag_name)
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_qai8dxp_qsi8cxp/
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_fp32_bf16p_bf16p/
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_f16p_qsi4c32p/
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_f32p_f32p/
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/)
set(ARCH_FLAGS_TEMP "${ARCH_FLAGS}")
@@ -688,15 +687,9 @@ function(ggml_add_cpu_backend_variant_impl tag_name)
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_fp32_bf16p_bf16p/kai_matmul_clamp_f32_bf16p2vlx2_bf16p2vlx2_2vlx2vl_sme2_mopa_asm.S
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_f16p_qsi4c32p/kai_matmul_clamp_f32_f16p1vlx2_qsi4c32p4vlx2_1vlx4vl_sme2_mopa.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_f16p_qsi4c32p/kai_matmul_clamp_f32_f16p1vlx2_qsi4c32p4vlx2_1vlx4vl_sme2_mopa_asm.S
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_f32p_f32p/kai_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/matmul_clamp_f32_f32p_f32p/kai_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa_asm.S
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_lhs_pack_bf16p2vlx2_f32_sme.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_rhs_pack_kxn_bf16p2vlx2b_f32_x32_sme.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_lhs_pack_f16pmrx2_f32_neon.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_lhs_pack_f32p2vlx1_f32_sme.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_lhs_pack_f32p2vlx1_f32_sme_asm.S
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_rhs_pack_nxk_f32p2vlx1biasf32_f32_f32_sme.c
${KLEIDIAI_SRC}/kai/ukernels/matmul/pack/kai_rhs_pack_nxk_f32p2vlx1biasf32_f32_f32_sme_asm.S
${KLEIDIAI_SRC}/kai/kai_common_sme_asm.S)
set(PRIVATE_ARCH_FLAGS "-fno-tree-vectorize;${PRIVATE_ARCH_FLAGS}+sve+sve2+sme2+fp16")
endif()
+2 -2
View File
@@ -263,13 +263,13 @@ void ggml_vec_dot_q2_0_q8_0(int n, float * GGML_RESTRICT s, size_t bs, const voi
const uint8x16_t raw16 = vcombine_u8(raw, raw);
// First 16 elements: replicate bytes 0-3, shift, mask, subtract 1
uint8x16_t bytes0 = ggml_vqtbl1q_u8(raw16, idx_lo);
uint8x16_t bytes0 = vqtbl1q_u8(raw16, idx_lo);
int8x16_t qv0 = vsubq_s8(
vreinterpretq_s8_u8(vandq_u8(vshlq_u8(bytes0, shifts), mask2)),
one);
// Second 16 elements: replicate bytes 4-7, shift, mask, subtract 1
uint8x16_t bytes1 = ggml_vqtbl1q_u8(raw16, idx_hi);
uint8x16_t bytes1 = vqtbl1q_u8(raw16, idx_hi);
int8x16_t qv1 = vsubq_s8(
vreinterpretq_s8_u8(vandq_u8(vshlq_u8(bytes1, shifts), mask2)),
one);
-11
View File
@@ -2060,10 +2060,6 @@ static void ggml_compute_forward(struct ggml_compute_params * params, struct ggm
{
ggml_compute_forward_gated_delta_net(params, tensor);
} break;
case GGML_OP_LIGHTNING_INDEXER:
{
ggml_compute_forward_lightning_indexer(params, tensor);
} break;
case GGML_OP_MAP_CUSTOM1:
{
ggml_compute_forward_map_custom1(params, tensor);
@@ -2384,7 +2380,6 @@ static int ggml_get_n_tasks(struct ggml_tensor * node, int n_threads) {
case GGML_OP_FLASH_ATTN_BACK:
case GGML_OP_SSM_CONV:
case GGML_OP_SSM_SCAN:
case GGML_OP_LIGHTNING_INDEXER:
{
n_tasks = n_threads;
} break;
@@ -2970,12 +2965,6 @@ struct ggml_cplan ggml_graph_plan(
{
GGML_ABORT("fatal error");
}
case GGML_OP_LIGHTNING_INDEXER:
{
// temp buffer for dequantizing lightning indexer keys
const int64_t ne10 = node->src[1]->ne[0];
cur += sizeof(float)*ne10*n_tasks;
} break;
default:
break;
}
-82
View File
@@ -20,17 +20,14 @@
#include "kai_matmul_clamp_f32_qsi8d32p4x8_qsi4c32p8x8_16x8_sve_i8mm.h"
#include "kai_matmul_clamp_f32_qsi8d32p1x8_qsi4c32p8x8_1x8_sve_dotprod.h"
#include "kai_matmul_clamp_f32_f16p1vlx2_qsi4c32p4vlx2_1vlx4vl_sme2_mopa.h"
#include "kai_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa.h"
#include "kai_lhs_pack_bf16p2vlx2_f32_sme.h"
#include "kai_lhs_pack_f32p2vlx1_f32_sme.h"
#include "kai_lhs_quant_pack_qsi8d32p_f32.h"
#include "kai_lhs_quant_pack_qsi8d32p4x8sb_f32_neon.h"
#include "kai_lhs_quant_pack_qsi8d32p_f32_neon.h"
#include "kai_lhs_quant_pack_qai8dxp_f32.h"
#include "kai_rhs_pack_kxn_bf16p2vlx2b_f32_x32_sme.h"
#include "kai_rhs_pack_nxk_f32p2vlx1biasf32_f32_f32_sme.h"
#include "kai_rhs_pack_nxk_qsi4c32pscalef16_qsu4c32s16s0.h"
#include "kai_rhs_pack_nxk_qsi4c32ps1s0scalef16_qsu4c32s16s0_neon.h"
#include "kai_rhs_pack_nxk_qsi8cxp_qsi8cx_neon.h"
@@ -868,65 +865,6 @@ static ggml_kleidiai_kernels gemm_gemv_kernels_q8[] = {
{ /* Sentinel */ }
};
static ggml_kleidiai_kernels ggml_kleidiai_kernels_f32[] = {
#if defined(__ARM_FEATURE_SME)
{
/* SME GEMM */
{
/* .get_m_step = */ kai_get_m_step_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_n_step = */ kai_get_n_step_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_mr = */ kai_get_mr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_nr = */ kai_get_nr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_kr = */ kai_get_kr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_sr = */ kai_get_sr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_dst_offset = */ kai_get_dst_offset_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_dst_size = */ kai_get_dst_size_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_lhs_offset_ex = */ &kernel_offs_fn2<kai_get_lhs_packed_offset_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa>,
/* .get_rhs_packed_offset_ex = */ &kernel_offs_fn2<kai_get_rhs_packed_offset_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa>,
/* .run_kernel_ex = */ &kernel_run_fn10<kai_run_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa>,
},
/* .gemm_lhs_info = */ {
/* .get_offset = */ kai_get_lhs_offset_lhs_pack_f32p2vlx1_f32_sme,
/* .get_packed_offset_ex = */ &lhs_offs_fn5<kai_get_lhs_packed_offset_lhs_pack_f32p2vlx1_f32_sme>,
/* .packed_size_ex = */ &lhs_ps_fn5<kai_get_lhs_packed_size_lhs_pack_f32p2vlx1_f32_sme>,
/* .pack_func_ex = */ &lhs_pack_void_fn9<kai_run_lhs_pack_f32p2vlx1_f32_sme>,
},
/* SME GEMV */
{
/* .get_m_step = */ kai_get_m_step_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_n_step = */ kai_get_n_step_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_mr = */ kai_get_mr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_nr = */ kai_get_nr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_kr = */ kai_get_kr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_sr = */ kai_get_sr_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_dst_offset = */ kai_get_dst_offset_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_dst_size = */ kai_get_dst_size_matmul_clamp_f32_f32p2vlx1_f32p2vlx1biasf32_sme2_mopa,
/* .get_lhs_offset_ex = */ nullptr,
/* .get_rhs_packed_offset_ex = */ nullptr,
/* .run_kernel_ex = */ nullptr,
},
/* .gemv_lhs_info = */ {
/* .get_offset = */ kai_get_lhs_offset_lhs_pack_f32p2vlx1_f32_sme,
/* .get_packed_offset_ex = */ &lhs_offs_fn5<kai_get_lhs_packed_offset_lhs_pack_f32p2vlx1_f32_sme>,
/* .packed_size_ex = */ &lhs_ps_fn5<kai_get_lhs_packed_size_lhs_pack_f32p2vlx1_f32_sme>,
/* .pack_func_ex = */ &lhs_pack_void_fn9<kai_run_lhs_pack_f32p2vlx1_f32_sme>,
},
/* .rhs_info = */ {
/* .packed_stride = */ nullptr,
/* .to_float = */ nullptr,
/* .packed_size_ex = */ &rhs_ps_fn2<kai_get_rhs_packed_size_rhs_pack_nxk_f32p2vlx1biasf32_f32_f32_sme>,
/* .packed_stride_ex = */ &rhs_stride_fn1<kai_get_rhs_packed_stride_rhs_pack_nxk_f32p2vlx1biasf32_f32_f32_sme>,
/* .pack_func_ex = */ &rhs_pack_fn13<kai_run_rhs_pack_nxk_f32p2vlx1biasf32_f32_f32_sme>,
},
/* .required_cpu = */ CPU_FEATURE_SME,
/* .lhs_type = */ GGML_TYPE_F32,
/* .rhs_type = */ GGML_TYPE_F32,
/* .op_type = */ GGML_TYPE_F32,
},
#endif
{ /* Sentinel */ }
};
ggml_kleidiai_kernels * ggml_kleidiai_select_kernels(cpu_feature cpu_features, const ggml_tensor * tensor) {
ggml_kleidiai_kernels * kernel = nullptr;
@@ -950,15 +888,12 @@ ggml_kleidiai_kernels * ggml_kleidiai_select_kernels(cpu_feature cpu_features, c
if (tensor->src[0]->type == GGML_TYPE_Q8_0) {
try_table(gemm_gemv_kernels_q8);
} else if (tensor->src[0]->type == GGML_TYPE_F32) {
try_table(ggml_kleidiai_kernels_f32);
} else {
try_table(gemm_gemv_kernels);
}
#else
GGML_UNUSED(gemm_gemv_kernels);
GGML_UNUSED(gemm_gemv_kernels_q8);
GGML_UNUSED(ggml_kleidiai_kernels_f32);
GGML_UNUSED(cpu_features);
#endif
}
@@ -1002,20 +937,3 @@ ggml_kleidiai_kernels * ggml_kleidiai_select_kernels_q8_0(cpu_feature features)
return kernels;
}
ggml_kleidiai_kernels * ggml_kleidiai_select_kernels_f32(cpu_feature features) {
ggml_kleidiai_kernels * kernels = nullptr;
#if defined(__ARM_FEATURE_SME)
for (size_t i = 0; i < NELEMS(ggml_kleidiai_kernels_f32) - 1; ++i) {
if ((features & ggml_kleidiai_kernels_f32[i].required_cpu) == ggml_kleidiai_kernels_f32[i].required_cpu) {
kernels = &ggml_kleidiai_kernels_f32[i];
break;
}
}
#else
GGML_UNUSED(features);
#endif
return kernels;
}
-9
View File
@@ -55,12 +55,6 @@ struct lhs_packing_info {
size_t m_idx_start, const void * lhs, size_t lhs_stride, void * lhs_packed);
};
enum rhs_repack_mode {
RHS_REPACK_PER_KERNEL,
RHS_REPACK_SHARED,
RHS_REPACK_SINGLE_ONLY,
};
struct rhs_packing_info {
size_t (*packed_stride)(size_t k, size_t nr, size_t kr, size_t bl);
@@ -74,8 +68,6 @@ struct rhs_packing_info {
void (*pack_func_ex)(size_t num_groups, size_t n, size_t k, size_t nr, size_t kr, size_t sr, size_t bl,
size_t rhs_stride, const void * rhs, const void * bias, const void * scale, void * rhs_packed, size_t extra_bytes, const void * params);
rhs_repack_mode repack_mode = RHS_REPACK_PER_KERNEL;
};
struct ggml_kleidiai_kernels {
@@ -96,4 +88,3 @@ struct ggml_kleidiai_kernels {
ggml_kleidiai_kernels * ggml_kleidiai_select_kernels(cpu_feature cpu_features, const ggml_tensor * tensor);
ggml_kleidiai_kernels * ggml_kleidiai_select_kernels_q4_0(cpu_feature features);
ggml_kleidiai_kernels * ggml_kleidiai_select_kernels_q8_0(cpu_feature features);
ggml_kleidiai_kernels * ggml_kleidiai_select_kernels_f32(cpu_feature features);
+57 -277
View File
@@ -60,11 +60,10 @@ struct ggml_kleidiai_context {
cpu_feature features;
ggml_kleidiai_kernels * kernels_q4;
ggml_kleidiai_kernels * kernels_q8;
ggml_kleidiai_kernels * kernels_f32;
int sme_thread_cap; // <= 0 means “SME disabled/unknown”;
int thread_hint; // <= 0 means “no hint”
int chunk_multiplier;
} static ctx = { CPU_FEATURE_NONE, nullptr, nullptr, nullptr, 0, -1, 4 };
} static ctx = { CPU_FEATURE_NONE, nullptr, nullptr, 0, -1, 4 };
static const char* cpu_feature_to_string(cpu_feature f) {
if (f == CPU_FEATURE_NONE) {
@@ -157,10 +156,10 @@ static size_t detect_num_smcus() {
}
}
}
return 0;
return 1;
#else
return 0;
return 1;
#endif
}
@@ -193,6 +192,7 @@ static void init_kleidiai_context(void) {
const char *env_threads = getenv("GGML_TOTAL_THREADS");
const char *env_chunk_mult = getenv("GGML_KLEIDIAI_CHUNK_MULTIPLIER");
const bool cpu_has_sme = ggml_cpu_has_sme();
size_t detected_smcus = 0;
ctx.features = (ggml_cpu_has_dotprod() ? CPU_FEATURE_DOTPROD : CPU_FEATURE_NONE) |
@@ -216,47 +216,56 @@ static void init_kleidiai_context(void) {
}
// SME policy:
// - env unset => auto-detect SMCUs; enable SME only if detected > 0.
// - env=0 => force off.
// - env>0 => force N cores, if the binary was built with SME.
// - If CPU doesn't support SME: SME always off.
// - Else:
// - env unset => auto-detect cores; enable if detected > 0.
// - env=0 => force off.
// - env>0 => force N cores (skip detection).
int sme_cores = 0;
bool sme_env_ok = false;
bool sme_env_set = (env_sme != nullptr);
if (sme_env_set) {
bool ok = false;
int v = parse_uint_env(env_sme, "GGML_KLEIDIAI_SME", &ok);
sme_env_ok = ok;
if (!cpu_has_sme) {
if (sme_env_set) {
bool ok = false;
int req = parse_uint_env(env_sme, "GGML_KLEIDIAI_SME", &ok);
if (ok && req > 0) {
GGML_LOG_WARN("kleidiai: GGML_KLEIDIAI_SME=%d but SME is not supported on this CPU; disabling SME\n", req);
}
}
sme_cores = 0;
} else {
if (sme_env_set) {
bool ok = false;
int v = parse_uint_env(env_sme, "GGML_KLEIDIAI_SME", &ok);
sme_env_ok = ok;
if (!ok) {
GGML_LOG_WARN("kleidiai: GGML_KLEIDIAI_SME set but parsing failed; falling back to runtime SME-core detection\n");
if (!ok) {
GGML_LOG_WARN("kleidiai: GGML_KLEIDIAI_SME set but parsing failed; falling back to runtime SME-core detection\n");
detected_smcus = detect_num_smcus();
sme_cores = detected_smcus > 0 ? (int)detected_smcus : 0;
} else if (v == 0) {
sme_cores = 0;
} else {
sme_cores = v;
}
} else {
detected_smcus = detect_num_smcus();
sme_cores = detected_smcus > 0 ? (int)detected_smcus : 0;
} else if (v == 0) {
sme_cores = 0;
} else if (!ggml_cpu_has_sme()) {
GGML_LOG_WARN("kleidiai: GGML_KLEIDIAI_SME=%d but the binary was not built with SME; disabling SME\n", v);
sme_cores = 0;
} else {
sme_cores = v;
}
} else {
detected_smcus = detect_num_smcus();
sme_cores = detected_smcus > 0 ? (int)detected_smcus : 0;
}
if (!sme_env_set && ggml_cpu_has_sme() && sme_cores == 0) {
GGML_LOG_WARN("kleidiai: runtime SME-core detection returned 0; falling back to NEON\n");
}
if (!sme_env_set && sme_cores == 0) {
GGML_LOG_WARN("kleidiai: SME supported but runtime SME-core detection returned 0; falling back to NEON\n");
}
if (sme_cores > 0) {
ctx.features |= CPU_FEATURE_SME;
if (sme_cores > 0) {
ctx.features |= CPU_FEATURE_SME;
}
}
// Kernel selection
ctx.kernels_q4 = ggml_kleidiai_select_kernels_q4_0(ctx.features);
ctx.kernels_q8 = ggml_kleidiai_select_kernels_q8_0(ctx.features);
ctx.kernels_f32 = ggml_kleidiai_select_kernels_f32(ctx.features);
ctx.kernels_q4 = ggml_kleidiai_select_kernels_q4_0(ctx.features);
ctx.kernels_q8 = ggml_kleidiai_select_kernels_q8_0(ctx.features);
if (!ctx.kernels_q4) {
GGML_LOG_INFO("kleidiai: no compatible q4 kernels found for CPU features mask %d\n", (int)ctx.features);
@@ -270,12 +279,6 @@ static void init_kleidiai_context(void) {
GGML_LOG_INFO("kleidiai: primary q8 kernel feature %s\n", cpu_feature_to_string(ctx.kernels_q8->required_cpu));
}
if (!ctx.kernels_f32) {
GGML_LOG_INFO("kleidiai: no compatible f32 kernels found for CPU features mask %d\n", (int)ctx.features);
} else {
GGML_LOG_INFO("kleidiai: primary f32 kernel feature %s\n", cpu_feature_to_string(ctx.kernels_f32->required_cpu));
}
ctx.sme_thread_cap = (ctx.features & CPU_FEATURE_SME) ? sme_cores : 0;
if (ctx.features & CPU_FEATURE_SME) {
@@ -331,13 +334,6 @@ static inline size_t ceil_div_size(size_t a, size_t b) {
return b == 0 ? 0 : (a + b - 1) / b;
}
static inline size_t kleidiai_chunk_cols(size_t n, int nth_total, bool disable_chunking, size_t n_step) {
const size_t multiplier = (nth_total == 1 || disable_chunking) ? 1 : std::max<size_t>(1, (size_t) ctx.chunk_multiplier);
const size_t divisor = std::max<size_t>(1, (size_t) nth_total * multiplier);
const size_t chunk_cols = align_up(std::max<size_t>(1, ceil_div_size(n, divisor)), n_step);
return chunk_cols ? chunk_cols : n_step;
}
struct kleidiai_block_args {
size_t lhs_bl;
size_t rhs_bl;
@@ -422,10 +418,6 @@ static inline ggml_kleidiai_kernels * kleidiai_primary_kernel_q8() {
return ctx.kernels_q8;
}
static inline ggml_kleidiai_kernels * kleidiai_primary_kernel_f32() {
return ctx.kernels_f32;
}
template <typename SelectFallback>
static int kleidiai_collect_kernel_chain_common(
ggml_kleidiai_kernels * primary,
@@ -438,16 +430,11 @@ static int kleidiai_collect_kernel_chain_common(
}
out[count++] = primary;
if (primary->rhs_info.repack_mode == RHS_REPACK_SINGLE_ONLY) {
return count;
}
if ((primary->required_cpu & CPU_FEATURE_SME) == CPU_FEATURE_SME) {
const cpu_feature fallback_mask = static_cast<cpu_feature>(features & ~CPU_FEATURE_SME);
if (fallback_mask != CPU_FEATURE_NONE) {
ggml_kleidiai_kernels * fallback = select_fallback(fallback_mask);
if (fallback && fallback != primary &&
fallback->rhs_info.repack_mode != RHS_REPACK_SINGLE_ONLY &&
fallback->lhs_type == primary->lhs_type &&
fallback->rhs_type == primary->rhs_type &&
fallback->op_type == primary->op_type) {
@@ -478,12 +465,6 @@ static int kleidiai_collect_q8_chain(std::array<ggml_kleidiai_kernels *, GGML_KL
[&](cpu_feature mask) { return ggml_kleidiai_select_kernels_q8_0(mask); });
}
static int kleidiai_collect_f32_chain(std::array<ggml_kleidiai_kernels *, GGML_KLEIDIAI_MAX_KERNEL_SLOTS> & out) {
ggml_kleidiai_kernels * primary = kleidiai_primary_kernel_f32();
return kleidiai_collect_kernel_chain_common(primary, ctx.features, out,
[&](cpu_feature mask) { return ggml_kleidiai_select_kernels_f32(mask); });
}
static inline int64_t ggml_ne(const ggml_tensor * tensor, int dim) {
GGML_ASSERT(dim >= 0 && dim < GGML_MAX_DIMS);
return tensor->ne[dim];
@@ -558,36 +539,6 @@ class tensor_traits : public ggml::cpu::tensor_traits {
return true;
}
if (op->src[0]->type == GGML_TYPE_F32) {
size_t cursor = 0;
bool any_slot = false;
for (int slot = 0; slot < slot_count; ++slot) {
ggml_kleidiai_kernels * kernels = kernel_chain[slot];
lhs_packing_info * lhs_info = &kernels->gemm_lhs_info;
kernel_info * kernel = &kernels->gemm;
if (!lhs_info || !lhs_info->packed_size_ex || !kernel) {
return false;
}
const size_t mr = kernel->get_mr();
const size_t kr = kernel->get_kr();
const size_t sr = kernel->get_sr();
cursor = align_up(cursor, GGML_KLEIDIAI_PACK_ALIGN);
cursor += lhs_info->packed_size_ex(m, k, 0, mr, kr, sr);
any_slot = true;
}
if (!any_slot) {
return false;
}
size = cursor;
return true;
}
if (op->src[0]->type == GGML_TYPE_F16) {
const int64_t lhs_batch_size0 = op->src[1]->ne[2];
const int64_t rhs_batch_size0 = op->src[0]->ne[2];
@@ -644,8 +595,6 @@ class tensor_traits : public ggml::cpu::tensor_traits {
if (dst->op == GGML_OP_MUL_MAT) {
if (dst->src[0]->type == GGML_TYPE_Q4_0 || dst->src[0]->type == GGML_TYPE_Q8_0) {
return compute_forward_qx(params, dst);
} else if (dst->src[0]->type == GGML_TYPE_F32) {
return compute_forward_f32(params, dst);
} else if (dst->src[0]->type == GGML_TYPE_F16) {
return compute_forward_fp16(params, dst);
}
@@ -657,144 +606,6 @@ class tensor_traits : public ggml::cpu::tensor_traits {
return false;
}
bool compute_forward_f32(ggml_compute_params * params, struct ggml_tensor * dst) {
GGML_ASSERT(dst->src[0]->type == GGML_TYPE_F32);
const ggml_tensor * src0 = dst->src[0];
const ggml_tensor * src1 = dst->src[1];
GGML_TENSOR_BINARY_OP_LOCALS
if (src1->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return false;
}
ggml_kleidiai_kernels * kernels = kleidiai_primary_kernel_f32();
if (!kernels) {
return false;
}
kernel_info * kernel = &kernels->gemm;
lhs_packing_info * lhs_info = &kernels->gemm_lhs_info;
if (!kernel || !lhs_info || !lhs_info->get_offset || !lhs_info->get_packed_offset_ex ||
!lhs_info->packed_size_ex || !lhs_info->pack_func_ex ||
!kernel->get_rhs_packed_offset_ex || !kernel->run_kernel_ex || !kernel->get_dst_offset) {
return false;
}
const kleidiai_weight_header * header = kleidiai_weight_header_from_ptr(src0->data);
const bool has_header = kleidiai_is_weight_header_valid(header);
const uint8_t * rhs_base = has_header ? kleidiai_weight_slot_ptr(header, 0)
: static_cast<const uint8_t *>(src0->data);
if (!rhs_base) {
return false;
}
const int nth = params->nth > 0 ? params->nth : 1;
const int ith = params->ith;
const size_t k = ne00;
const size_t m = ne11;
const size_t n = ne01;
const size_t mr = kernel->get_mr();
const size_t kr = kernel->get_kr();
const size_t sr = kernel->get_sr();
const size_t lhs_packed_size = lhs_info->packed_size_ex(m, k, 0, mr, kr, sr);
GGML_ASSERT(lhs_packed_size <= params->wsize);
uint8_t * lhs_packed = static_cast<uint8_t *>(params->wdata);
const size_t dst_stride = dst->nb[1];
const size_t n_step = kernel->get_n_step() ? kernel->get_n_step() : 1;
const bool disable_chunking = ggml_is_numa();
GGML_ASSERT(n <= (size_t) INT_MAX);
for (int64_t batch_idx = 0; batch_idx < ne12; ++batch_idx) {
const uint8_t * lhs_batch_base = static_cast<const uint8_t *>(src1->data) + batch_idx * src1->nb[2];
uint8_t * dst_batch_base = static_cast<uint8_t *>(dst->data) + batch_idx * dst->nb[2];
{
const int64_t m_roundup_mr = kai_roundup((int64_t)m, (int64_t)mr);
int64_t max_threads = mr ? (m_roundup_mr / (int64_t)mr) : nth;
max_threads = std::max<int64_t>(1, max_threads);
const int64_t use_threads = std::min<int64_t>(nth, max_threads);
if (ith < use_threads) {
const int64_t num_m_per_thread0 = round_down((size_t)(m_roundup_mr / use_threads), mr);
const int64_t num_m_per_threadN_1 = (int64_t)m - (use_threads - 1) * num_m_per_thread0;
const int64_t m_start = (int64_t)ith * num_m_per_thread0;
const int64_t m_count = (ith == use_threads - 1) ? num_m_per_threadN_1 : num_m_per_thread0;
const size_t base_packed_off = lhs_info->get_packed_offset_ex(m_start, k, 0, mr, kr, sr);
const size_t next_block_off = lhs_info->get_packed_offset_ex(m_start + mr, k, 0, mr, kr, sr);
const size_t row_stride_bytes = mr ? (next_block_off - base_packed_off) / mr : 0;
int64_t remaining = m_count;
int64_t cur = m_start;
while (remaining > 0) {
const int64_t take = std::min<int64_t>((int64_t)m - cur, remaining);
const size_t src_off = lhs_info->get_offset(cur, src1->nb[1]);
const void * src_ptr = lhs_batch_base + src_off;
const size_t dst_off = base_packed_off + (size_t)(cur - m_start) * row_stride_bytes;
void * dst_ptr = lhs_packed + dst_off;
lhs_info->pack_func_ex(take, k, 0, mr, kr, sr, 0, src_ptr, src1->nb[1], dst_ptr);
cur += take;
remaining -= take;
}
}
}
if (ith == 0) {
ggml_threadpool_chunk_set(params->threadpool, 0);
}
ggml_barrier(params->threadpool);
const size_t chunk_cols = kleidiai_chunk_cols(n, nth, disable_chunking, n_step);
GGML_ASSERT(chunk_cols <= (size_t) INT_MAX);
int current_col = ggml_threadpool_chunk_add(params->threadpool, (int) chunk_cols);
while ((size_t) current_col < n) {
const size_t n_start = (size_t) current_col;
const size_t n_to_process = std::min(chunk_cols, n - n_start);
if (n_to_process > 0) {
const size_t lhs_packed_offset = lhs_info->get_packed_offset_ex(0, k, 0, mr, kr, sr);
const size_t rhs_packed_offset = kernel->get_rhs_packed_offset_ex(n_start, k, 0);
const size_t dst_offset = kernel->get_dst_offset(0, n_start, dst_stride);
const void * lhs_ptr = lhs_packed + lhs_packed_offset;
const void * rhs_ptr = rhs_base + rhs_packed_offset;
float * dst_ptr = reinterpret_cast<float *>(dst_batch_base + dst_offset);
kernel->run_kernel_ex(m, n_to_process, k, 0,
lhs_ptr,
rhs_ptr,
dst_ptr,
dst_stride,
sizeof(float),
-FLT_MAX,
FLT_MAX);
}
current_col = ggml_threadpool_chunk_add(params->threadpool, (int) chunk_cols);
}
if (batch_idx != ne12 - 1) {
ggml_barrier(params->threadpool);
}
}
return true;
}
bool compute_forward_fp16(ggml_compute_params * params, struct ggml_tensor * dst) {
const ggml_tensor * src0 = dst->src[0];
const ggml_tensor * src1 = dst->src[1];
@@ -1403,7 +1214,7 @@ class tensor_traits : public ggml::cpu::tensor_traits {
public:
int repack(struct ggml_tensor * tensor, const void * data, size_t data_size) {
GGML_ASSERT(tensor->type == GGML_TYPE_Q4_0 || tensor->type == GGML_TYPE_Q8_0 || tensor->type == GGML_TYPE_F32);
GGML_ASSERT(tensor->type == GGML_TYPE_Q4_0 || tensor->type == GGML_TYPE_Q8_0);
const size_t n = tensor->ne[1];
const size_t k = tensor->ne[0];
@@ -1422,15 +1233,12 @@ public:
std::array<ggml_kleidiai_kernels *, GGML_KLEIDIAI_MAX_KERNEL_SLOTS> kernel_chain;
const bool want_q8 = tensor->type == GGML_TYPE_Q8_0;
const bool want_f32 = tensor->type == GGML_TYPE_F32;
const int slot_total = want_f32 ? kleidiai_collect_f32_chain(kernel_chain)
: want_q8 ? kleidiai_collect_q8_chain(kernel_chain)
: kleidiai_collect_q4_chain(kernel_chain);
const int slot_total = want_q8 ? kleidiai_collect_q8_chain(kernel_chain)
: kleidiai_collect_q4_chain(kernel_chain);
const bool allow_fallback = kleidiai_pack_fallback_allowed();
std::vector<int8_t> qdata;
std::vector<float> scales;
std::vector<float> bias;
if (want_q8 && slot_total > 0) {
qdata.resize(n * k, 0);
@@ -1478,10 +1286,6 @@ public:
}
}
if (want_f32 && slot_total > 0) {
bias.resize(n, 0.0f);
}
for (int slot = 0; slot < slot_total && slot < GGML_KLEIDIAI_MAX_KERNEL_SLOTS; ++slot) {
if (!allow_fallback && slot > 0) {
break;
@@ -1498,9 +1302,8 @@ public:
const size_t sr = kernel->get_sr();
const ggml_type rhs_type = kernels->rhs_type;
const size_t block_len = rhs_type == GGML_TYPE_Q8_0 ? QK8_0 :
rhs_type == GGML_TYPE_Q4_0 ? QK4_0 :
rhs_type == GGML_TYPE_F32 ? 0 : SIZE_MAX;
if (block_len == SIZE_MAX) {
rhs_type == GGML_TYPE_Q4_0 ? QK4_0 : 0;
if (block_len == 0) {
continue;
}
@@ -1523,10 +1326,6 @@ public:
rhs_info->pack_func_ex(1, n, k, nr, kr, sr, 0, 0,
qdata.data(), nullptr, scales.data(),
dst_ptr, 0, &params);
} else if (rhs_type == GGML_TYPE_F32) {
rhs_info->pack_func_ex(1, n, k, nr, kr, sr, 0, tensor->nb[1],
data, bias.data(), nullptr,
dst_ptr, 0, nullptr);
} else {
continue;
}
@@ -1601,7 +1400,7 @@ static size_t ggml_backend_cpu_kleidiai_buffer_type_get_alignment(ggml_backend_b
static size_t ggml_backend_cpu_kleidiai_buffer_type_get_alloc_size(ggml_backend_buffer_type_t buft, const struct ggml_tensor * tensor) {
GGML_UNUSED(buft);
if (tensor->type != GGML_TYPE_Q4_0 && tensor->type != GGML_TYPE_Q8_0 && tensor->type != GGML_TYPE_F32) {
if (tensor->type != GGML_TYPE_Q4_0 && tensor->type != GGML_TYPE_Q8_0) {
return ggml_nbytes(tensor);
}
@@ -1613,10 +1412,8 @@ static size_t ggml_backend_cpu_kleidiai_buffer_type_get_alloc_size(ggml_backend_
std::array<ggml_kleidiai_kernels *, GGML_KLEIDIAI_MAX_KERNEL_SLOTS> kernel_chain;
const bool want_q8 = tensor->type == GGML_TYPE_Q8_0;
const bool want_f32 = tensor->type == GGML_TYPE_F32;
const int slot_total = want_f32 ? kleidiai_collect_f32_chain(kernel_chain)
: want_q8 ? kleidiai_collect_q8_chain(kernel_chain)
: kleidiai_collect_q4_chain(kernel_chain);
const int slot_total = want_q8 ? kleidiai_collect_q8_chain(kernel_chain)
: kleidiai_collect_q4_chain(kernel_chain);
const bool allow_fallback = kleidiai_pack_fallback_allowed();
size_t slot_count = 0;
@@ -1636,9 +1433,8 @@ static size_t ggml_backend_cpu_kleidiai_buffer_type_get_alloc_size(ggml_backend_
const ggml_type rhs_type = kernels->rhs_type;
const size_t block_len = rhs_type == GGML_TYPE_Q4_0 ? QK4_0 :
rhs_type == GGML_TYPE_Q8_0 ? QK8_0 :
rhs_type == GGML_TYPE_F32 ? 0 : SIZE_MAX;
if (block_len == SIZE_MAX) {
rhs_type == GGML_TYPE_Q8_0 ? QK8_0 : 0;
if (block_len == 0) {
continue;
}
@@ -1659,41 +1455,25 @@ class extra_buffer_type : ggml::cpu::extra_buffer_type {
bool supports_op(ggml_backend_dev_t, const struct ggml_tensor * op) override {
std::array<ggml_kleidiai_kernels *, GGML_KLEIDIAI_MAX_KERNEL_SLOTS> kernel_chain;
const int slot_total = kleidiai_collect_kernel_chain(op, kernel_chain);
const bool src0_is_kleidiai =
if ((op->op == GGML_OP_MUL_MAT || op->op == GGML_OP_GET_ROWS) &&
(op->src[0]->type == GGML_TYPE_Q4_0 || op->src[0]->type == GGML_TYPE_Q8_0) &&
op->src[0]->buffer &&
(ggml_n_dims(op->src[0]) == 2) &&
op->src[0]->buffer->buft == ggml_backend_cpu_kleidiai_buffer_type() &&
slot_total > 0;
if ((op->op == GGML_OP_MUL_MAT || op->op == GGML_OP_GET_ROWS) &&
(op->src[0]->type == GGML_TYPE_Q4_0 || op->src[0]->type == GGML_TYPE_Q8_0 || op->src[0]->type == GGML_TYPE_F32) &&
src0_is_kleidiai) {
slot_total > 0) {
if (op->src[0]->type == GGML_TYPE_Q4_0 && ctx.kernels_q4 == nullptr) {
return false;
}
if (op->src[0]->type == GGML_TYPE_Q8_0 && ctx.kernels_q8 == nullptr) {
return false;
}
if (op->src[0]->type == GGML_TYPE_F32 && ctx.kernels_f32 == nullptr) {
return false;
}
if (op->src[1]->buffer && !ggml_backend_buft_is_host(op->src[1]->buffer->buft)) {
return false;
}
if (op->src[0]->type == GGML_TYPE_Q4_0 || op->src[0]->type == GGML_TYPE_Q8_0) {
if ((op->src[1]->type == GGML_TYPE_F32 || op->src[1]->type == GGML_TYPE_I32) &&
ggml_ne(op->src[1], 3) == 1) {
return true;
}
return false;
if ((op->src[1]->type == GGML_TYPE_F32 || op->src[1]->type == GGML_TYPE_I32) &&
ggml_ne(op->src[1], 3) == 1) {
return true;
}
if (op->op != GGML_OP_MUL_MAT || op->src[1]->type != GGML_TYPE_F32 || op->type != GGML_TYPE_F32) {
return false;
}
return true;
}
return false;
}
+23 -141
View File
@@ -5025,8 +5025,8 @@ void ggml_compute_forward_get_rows(
//}
}
template<typename src_t, typename idx_t>
static void ggml_compute_forward_set_rows_impl(
template<typename idx_t>
static void ggml_compute_forward_set_rows_f32(
const ggml_compute_params * params,
ggml_tensor * dst) {
@@ -5041,7 +5041,7 @@ static void ggml_compute_forward_set_rows_impl(
assert(ne0 == nc);
assert(ne2 == ne02);
assert(ne3 == ne03);
GGML_ASSERT(src0->type == GGML_TYPE_F32 || (src0->type == GGML_TYPE_F16 && dst->type == GGML_TYPE_F16));
assert(src0->type == GGML_TYPE_F32);
assert(ne02 % ne11 == 0);
assert(ne03 % ne12 == 0);
@@ -5055,8 +5055,6 @@ static void ggml_compute_forward_set_rows_impl(
const int64_t ir0 = dr*ith;
const int64_t ir1 = std::min(ir0 + dr, nr);
const size_t rs = ggml_row_size(src0->type, nc);
ggml_from_float_t const from_float = ggml_get_type_traits_cpu(dst->type)->from_float;
for (int64_t i03 = 0; i03 < ne03; ++i03) {
@@ -5070,18 +5068,9 @@ static void ggml_compute_forward_set_rows_impl(
GGML_ASSERT(i1 >= 0 && i1 < ne1);
if constexpr (std::is_same_v<src_t, float>) {
from_float(
(const float *) ((char *) src0->data + i*nb01 + i02*nb02 + i03*nb03),
((char *) dst->data + i1*nb1 + i02*nb2 + i03*nb3), nc);
} else if constexpr (std::is_same_v<src_t, ggml_fp16_t>) {
memcpy(
((char *) dst->data + i1*nb1 + i02*nb2 + i03*nb3),
((char *) src0->data + i*nb01 + i02*nb02 + i03*nb03),
rs);
} else {
GGML_ABORT("src0->type = %d (%s) not supported", src0->type, ggml_type_name(src0->type));
}
from_float(
(const float *) ((char *) src0->data + i*nb01 + i02*nb02 + i03*nb03),
((char *) dst->data + i1*nb1 + i02*nb2 + i03*nb3), nc);
}
}
}
@@ -5098,27 +5087,13 @@ void ggml_compute_forward_set_rows(
case GGML_TYPE_F32:
{
if (src1->type == GGML_TYPE_I64) {
ggml_compute_forward_set_rows_impl<float, int64_t>(params, dst);
ggml_compute_forward_set_rows_f32<int64_t>(params, dst);
} else if (src1->type == GGML_TYPE_I32) {
ggml_compute_forward_set_rows_impl<float, int32_t>(params, dst);
ggml_compute_forward_set_rows_f32<int32_t>(params, dst);
} else {
GGML_ABORT("src1->type = %d (%s) not supported", src1->type, ggml_type_name(src1->type));
}
} break;
case GGML_TYPE_F16:
{
if (dst->type == GGML_TYPE_F16) {
if (src1->type == GGML_TYPE_I64) {
ggml_compute_forward_set_rows_impl<ggml_fp16_t, int64_t>(params, dst);
} else if (src1->type == GGML_TYPE_I32) {
ggml_compute_forward_set_rows_impl<ggml_fp16_t, int32_t>(params, dst);
} else {
GGML_ABORT("src1->type = %d (%s) not supported", src1->type, ggml_type_name(src1->type));
}
} else {
GGML_ABORT("dst->type = %d (%s) not supported with src0->type = %d (%s)", dst->type, ggml_type_name(dst->type), src0->type, ggml_type_name(src0->type));
}
} break;
default:
{
GGML_ABORT("src0->type = %d (%s) not supported", src0->type, ggml_type_name(src0->type));
@@ -6362,6 +6337,7 @@ static void ggml_compute_forward_im2col_f16(
const ggml_tensor * src0 = dst->src[0];
const ggml_tensor * src1 = dst->src[1];
GGML_ASSERT(src0->type == GGML_TYPE_F16);
GGML_ASSERT(src1->type == GGML_TYPE_F16 || src1->type == GGML_TYPE_F32);
GGML_ASSERT( dst->type == GGML_TYPE_F16);
@@ -6392,6 +6368,7 @@ static void ggml_compute_forward_im2col_f16(
int ofs0 = is_2D ? nb13 : nb12;
int ofs1 = is_2D ? nb12 : nb11;
GGML_ASSERT(nb00 == sizeof(ggml_fp16_t));
GGML_ASSERT(nb10 == ggml_type_size(src1->type));
// im2col: [N, IC, IH, IW] => [N, OH, OW, IC*KH*KW]
@@ -6561,6 +6538,7 @@ static void ggml_compute_forward_im2col_3d_f16(
const ggml_tensor * src0 = dst->src[0];
const ggml_tensor * src1 = dst->src[1];
GGML_ASSERT(src0->type == GGML_TYPE_F16);
GGML_ASSERT(src1->type == GGML_TYPE_F32);
GGML_ASSERT( dst->type == GGML_TYPE_F16);
@@ -7296,13 +7274,6 @@ struct ggml_conv_2d_dw_params {
int dilation_y;
};
static inline float ggml_conv_2d_dw_knl_f32(const char * data, int64_t i, ggml_type type) {
if (type == GGML_TYPE_F16) {
return GGML_FP16_TO_FP32(((const ggml_fp16_t *)data)[i]);
}
return ((const float *)data)[i];
}
static void ggml_compute_forward_conv_2d_dw_cwhn(
const ggml_compute_params * params,
const ggml_tensor * src,
@@ -7311,8 +7282,7 @@ static void ggml_compute_forward_conv_2d_dw_cwhn(
const ggml_conv_2d_dw_params & p) {
const int64_t c = p.channels;
const char * knl_data = (const char *)kernel->data;
const ggml_type knl_type = kernel->type;
const float * knl_data = (const float *)kernel->data;
const int64_t rows_total = p.dst_h * p.batch;
const int64_t rows_per_thread = (rows_total + params->nth - 1) / params->nth;
@@ -7320,16 +7290,13 @@ static void ggml_compute_forward_conv_2d_dw_cwhn(
const int64_t row_end = MIN(row_start + rows_per_thread, rows_total);
#ifdef GGML_SIMD
int64_t c_pkg_end = 0;
int64_t pkg_size = GGML_F32_EPR;
if (knl_type == GGML_TYPE_F32) {
#if defined(__ARM_FEATURE_SVE)
pkg_size = svcntw();
const int64_t pkg_size = svcntw();
#else
pkg_size = GGML_F32_EPR;
const int64_t pkg_size = GGML_F32_EPR;
#endif
c_pkg_end = (c / pkg_size) * pkg_size;
}
const int64_t pkg_count = c / pkg_size;
const int64_t c_pkg_end = pkg_count * pkg_size;
#else
const int64_t c_pkg_end = 0;
#endif
@@ -7343,6 +7310,7 @@ static void ggml_compute_forward_conv_2d_dw_cwhn(
const int64_t src_x_base = dst_x * p.stride_x - p.pad_x;
#ifdef GGML_SIMD
// Vectorized loop
for (int64_t c_i = 0; c_i < c_pkg_end; c_i += pkg_size) {
GGML_F32_VEC sum = GGML_F32_VEC_ZERO;
for (int64_t knl_y = 0; knl_y < p.knl_h; ++knl_y) {
@@ -7355,8 +7323,7 @@ static void ggml_compute_forward_conv_2d_dw_cwhn(
if (src_x < 0 || src_x >= p.src_w) {
continue;
}
const float * kp = (const float *)knl_data + (knl_y * p.knl_w + knl_x) * c + c_i;
GGML_F32_VEC k = GGML_F32_VEC_LOAD(kp);
GGML_F32_VEC k = GGML_F32_VEC_LOAD(knl_data + (knl_y * p.knl_w + knl_x) * c + c_i);
GGML_F32_VEC s = GGML_F32_VEC_LOAD(src_data + (src_y * p.src_w + src_x) * c + c_i);
sum = GGML_F32_VEC_FMA(sum, k, s);
}
@@ -7364,6 +7331,7 @@ static void ggml_compute_forward_conv_2d_dw_cwhn(
GGML_F32_VEC_STORE(dst_data + c_i, sum);
}
#endif
// Scalar loop
for (int64_t c_i = c_pkg_end; c_i < c; ++c_i) {
float sum = 0.0f;
for (int64_t knl_y = 0; knl_y < p.knl_h; ++knl_y) {
@@ -7376,7 +7344,7 @@ static void ggml_compute_forward_conv_2d_dw_cwhn(
if (src_x < 0 || src_x >= p.src_w) {
continue;
}
sum += ggml_conv_2d_dw_knl_f32(knl_data, (knl_y * p.knl_w + knl_x) * c + c_i, knl_type)
sum += knl_data[(knl_y * p.knl_w + knl_x) * c + c_i]
* src_data[(src_y * p.src_w + src_x) * c + c_i];
}
}
@@ -7397,11 +7365,9 @@ static void ggml_compute_forward_conv_2d_dw_whcn(
const int64_t per_thread = (n + params->nth - 1) / params->nth;
const int64_t start = params->ith * per_thread;
const int64_t end = MIN(start + per_thread, n);
const char * knl_base = (const char *)kernel->data;
const ggml_type knl_type = kernel->type;
for (int64_t i = start; i < end; ++i) {
const int64_t knl_offset = (i % p.channels) * p.knl_w * p.knl_h;
const float * knl_data = (const float *)kernel->data + (i % p.channels) * p.knl_w * p.knl_h;
const float * src_data = (const float *)src->data + i * p.src_w * p.src_h;
float * dst_data = (float *)dst->data + i * p.dst_w * p.dst_h;
@@ -7419,7 +7385,7 @@ static void ggml_compute_forward_conv_2d_dw_whcn(
if (src_x < 0 || src_x >= p.src_w) {
continue;
}
sum += ggml_conv_2d_dw_knl_f32(knl_base, knl_offset + knl_y * p.knl_w + knl_x, knl_type)
sum += knl_data[knl_y * p.knl_w + knl_x]
* src_data[src_y * p.src_w + src_x];
}
}
@@ -7451,13 +7417,13 @@ void ggml_compute_forward_conv_2d_dw(
p.dilation_x = dst->op_params[4];
p.dilation_y = dst->op_params[5];
GGML_ASSERT(kernel->type == GGML_TYPE_F32 || kernel->type == GGML_TYPE_F16);
GGML_ASSERT(kernel->ne[3] == p.channels);
GGML_ASSERT(dst->ne[3] == p.batch);
if (ggml_is_contiguous(src)) {
ggml_compute_forward_conv_2d_dw_whcn(params, src, kernel, dst, p);
} else if (ggml_is_contiguous_channels(src)) {
// kernel should also have channels most contiguous in memory
GGML_ASSERT(kernel->nb[0] >= kernel->nb[2] && kernel->nb[1] >= kernel->nb[0]);
ggml_compute_forward_conv_2d_dw_cwhn(params, src, kernel, dst, p);
} else {
@@ -11565,87 +11531,3 @@ void ggml_compute_forward_fwht(const ggml_compute_params * params, ggml_tensor *
}
}
}
// ggml_compute_forward_lightning_indexer
void ggml_compute_forward_lightning_indexer(
const ggml_compute_params * params,
ggml_tensor * dst) {
const ggml_tensor * q = dst->src[0];
const ggml_tensor * k = dst->src[1];
const ggml_tensor * w = dst->src[2]; // weights
const ggml_tensor * m = dst->src[3]; // mask
GGML_ASSERT(dst->type == GGML_TYPE_F32);
GGML_ASSERT( q->type == GGML_TYPE_F32);
GGML_ASSERT( w->type == GGML_TYPE_F32);
GGML_ASSERT( m->type == GGML_TYPE_F16);
GGML_TENSOR_LOCALS(int64_t, neq, q, ne)
GGML_TENSOR_LOCALS(size_t, nbq, q, nb)
GGML_TENSOR_LOCALS(int64_t, nek, k, ne)
GGML_TENSOR_LOCALS(size_t, nbk, k, nb)
GGML_TENSOR_LOCALS(int64_t, new, w, ne)
GGML_TENSOR_LOCALS(size_t, nbw, w, nb)
GGML_TENSOR_LOCALS(int64_t, nem, m, ne)
GGML_TENSOR_LOCALS(size_t, nbm, m, nb)
GGML_TENSOR_LOCALS(int64_t, ne, dst, ne)
GGML_TENSOR_LOCALS(size_t, nb, dst, nb)
GGML_ASSERT( nb0 == ggml_type_size(dst->type));
GGML_ASSERT(nbq0 == ggml_type_size( q->type));
GGML_ASSERT(nbk0 == ggml_type_size( k->type));
GGML_ASSERT(nbw0 == ggml_type_size( w->type));
GGML_ASSERT(nbm0 == ggml_type_size( m->type));
const int n_embd = q->ne[0];
const int n_head = q->ne[1];
const int n_tokens = q->ne[2];
const int n_stream = q->ne[3];
const int n_kv = k->ne[2];
ggml_to_float_t const k_to_float = ggml_get_type_traits(k->type)->to_float;
GGML_ASSERT((k->type == GGML_TYPE_F32 || k_to_float) && "lightning indexer: unsupported K-type");
const int nr = n_kv;
const int ith = params->ith;
const int nth = params->nth;
// (temporary) buffer for K converted to float
float * k_row_f32 = (float *) params->wdata + ith*(1*n_embd + CACHE_LINE_SIZE_F32);
// rows per thread
const int dr = (nr + nth - 1)/nth;
// row range for this thread
const int ir0 = dr*ith;
const int ir1 = MIN(ir0 + dr, nr);
for (int s = 0; s < n_stream; ++s) {
for (int t = 0; t < n_tokens; ++t) {
const float * w_row = (float *) ((char *) w->data + t*nbw1 + s*nbw3);
const ggml_fp16_t * m_row = (ggml_fp16_t *) ((char *) m->data + t*nbm1 + (s%nem3)*nbm3);
float * dst_row = (float *) ((char *) dst->data + t*nb1 + s*nb3 );
for (int ik = ir0; ik < ir1; ++ik) {
char * k_row = (char *) k->data + ik*nbk2 + s*nbk3;
if (k_to_float) {
k_to_float(k_row, k_row_f32, n_embd);
} else {
k_row_f32 = (float *) k_row;
}
float score = 0.0f;
for (int h = 0; h < n_head; ++h) {
// dot product of q and k for head h
float qk = 0.0f;
const float * q_row = (float *) ((char *) q->data + h*nbq1 + t*nbq2 + s*nbq3);
ggml_vec_dot_f32(n_embd, &qk, 0, q_row, 0, k_row_f32, 0, 1);
// ReLU and weights (prescaled)
score += MAX(qk, 0.0f) * w_row[h];
}
// apply mask
dst_row[ik] = score + GGML_CPU_FP16_TO_FP32(m_row[ik]);
}
}
}
}
-1
View File
@@ -105,7 +105,6 @@ void ggml_compute_forward_rwkv_wkv7(const struct ggml_compute_params * params, s
void ggml_compute_forward_solve_tri(const struct ggml_compute_params * params, struct ggml_tensor * dst);
void ggml_compute_forward_gla(const struct ggml_compute_params * params, struct ggml_tensor * dst);
void ggml_compute_forward_gated_delta_net(const struct ggml_compute_params * params, struct ggml_tensor * dst);
void ggml_compute_forward_lightning_indexer(const struct ggml_compute_params * params, struct ggml_tensor * dst);
void ggml_compute_forward_map_custom1(const struct ggml_compute_params * params, struct ggml_tensor * dst);
void ggml_compute_forward_map_custom2(const struct ggml_compute_params * params, struct ggml_tensor * dst);
void ggml_compute_forward_map_custom3(const struct ggml_compute_params * params, struct ggml_tensor * dst);
+1 -1
View File
@@ -78,7 +78,7 @@ static void simd_gemm(
for (int64_t i = 0; i < GEMM_RM; i++) {
float a = C[i * N + jj];
for (int64_t kk = 0; kk < K; kk++) {
a += A[i * K + kk] * B[kk * N + jj];
a += A[i + kk] * B[kk * N + jj];
}
C[i * N + jj] = a;
}
+4 -30
View File
@@ -28,20 +28,6 @@ static __global__ void init_offsets(int * offsets, const int ncols, const int nr
#endif // STRIDED_ITERATOR_AVAILABLE
#ifdef GGML_CUDA_USE_CUB
// returns the suggested maximum number of rows to process during one argsort_f32_i32_cuda_cub() call
int argsort_f32_i32_cuda_cub_chunk_nrows(const size_t nb01, const int64_t nrows) {
// perform argsort in chunks up to approximately this size (currently 64MB)
// to avoid excessive temporary buffers memory usage
const int chunk_bytes = 1 << 26;
// calculate how many rows will fit in one chunk (must be at least one)
const int chunk_nrows = std::max((int) (chunk_bytes / nb01), 1);
// limit the resulting amount to total nrows
return std::min((int64_t) chunk_nrows, nrows);
}
void argsort_f32_i32_cuda_cub(ggml_cuda_pool & pool,
const float * x,
int * dst,
@@ -268,23 +254,11 @@ void ggml_cuda_op_argsort(ggml_backend_cuda_context & ctx, ggml_tensor * dst) {
const size_t shared_mem = ncols_pad * sizeof(int);
const size_t max_shared_mem = ggml_cuda_info().devices[ggml_cuda_get_device()].smpb;
// early return if we can use bitonic argsort
if (shared_mem <= max_shared_mem && ncols <= 1024) {
if (shared_mem > max_shared_mem || ncols > 1024) {
ggml_cuda_pool & pool = ctx.pool();
argsort_f32_i32_cuda_cub(pool, src0_d, (int *) dst_d, ncols, nrows, order, stream);
} else {
argsort_f32_i32_cuda_bitonic(src0_d, (int *) dst_d, ncols, nrows, order, stream);
return;
}
const int chunk_nrows = argsort_f32_i32_cuda_cub_chunk_nrows(src0->nb[1], nrows);
ggml_cuda_pool & pool = ctx.pool();
for (int64_t i = 0; i < nrows; i += chunk_nrows) {
int iter_nrows = std::min((int64_t) chunk_nrows, nrows - i);
argsort_f32_i32_cuda_cub(pool, src0_d, (int *) dst_d, ncols, iter_nrows, order, stream);
src0_d += ncols * iter_nrows;
dst_d += ncols * iter_nrows;
}
#else
argsort_f32_i32_cuda_bitonic(src0_d, (int *) dst_d, ncols, nrows, order, stream);
-1
View File
@@ -3,7 +3,6 @@
void ggml_cuda_op_argsort(ggml_backend_cuda_context & ctx, ggml_tensor * dst);
#ifdef GGML_CUDA_USE_CUB
int argsort_f32_i32_cuda_cub_chunk_nrows(const size_t nb01, const int64_t nrows);
void argsort_f32_i32_cuda_cub(ggml_cuda_pool & pool,
const float * x,
int * dst,
+11 -29
View File
@@ -3165,21 +3165,18 @@ static int ggml_cuda_try_fuse(ggml_backend_cuda_context * cuda_ctx, ggml_cgraph
(a->ne[2] == 1 && a->ne[3] == 1);
const bool shape_ok = ggml_are_same_shape(a, inv_b) && a->ne[0] == 1 && a->ne[1] == x->ne[1];
// x is in the supported whitelist and every chain intermediate shares
// x's type. launch_snake reads a and inv_b as const float *, so they
// stay F32.
// x must be in the supported whitelist and every operand / intermediate
// result must share x's type, since launch_snake casts a / inv_b as
// float and templates the kernel on a single T. Mixed precision chains
// fall back to the naive path.
const ggml_tensor * sin1 = cgraph->nodes[i + 1];
const bool types_ok = (x->type == GGML_TYPE_F32 || x->type == GGML_TYPE_F16 || x->type == GGML_TYPE_BF16) &&
(a->type == GGML_TYPE_F32) && (inv_b->type == GGML_TYPE_F32) &&
(a->type == x->type) && (inv_b->type == x->type) &&
(mul0->type == x->type) && (sin1->type == x->type) &&
(sqr->type == x->type) && (mul1->type == x->type) &&
(add->type == x->type);
// kernel reads x[idx] and a[c] / inv_b[c] linearly, so every operand is contiguous
const bool contig_ok = ggml_is_contiguous(x) && ggml_is_contiguous(add) &&
ggml_is_contiguous(a) && ggml_is_contiguous(inv_b);
if (types_ok && shape_ok && dim_ok && contig_ok && x_in_add == x) {
if (types_ok && shape_ok && dim_ok && x_in_add == x) {
ggml_cuda_op_snake_fused(*cuda_ctx, x, a, inv_b, add);
return 4;
}
@@ -4493,14 +4490,7 @@ static bool ggml_backend_cuda_get_available_uma_memory(long * available_memory_k
static void ggml_backend_cuda_device_get_memory(ggml_backend_dev_t dev, size_t * free, size_t * total) {
ggml_backend_cuda_device_context * ctx = (ggml_backend_cuda_device_context *)dev->context;
ggml_cuda_set_device(ctx->device);
cudaError_t err = cudaMemGetInfo(free, total);
if (err != cudaSuccess) {
(void)cudaGetLastError();
GGML_LOG_WARN("%s: cudaMemGetInfo failed (%s), returning 0/0\n", __func__, cudaGetErrorString(err));
*free = 0;
*total = 0;
return;
}
CUDA_CHECK(cudaMemGetInfo(free, total));
// ref: https://github.com/ggml-org/llama.cpp/pull/17368
#if defined(__linux__)
@@ -4719,16 +4709,10 @@ static bool ggml_backend_cuda_device_supports_op(ggml_backend_dev_t dev, const g
} break;
case GGML_OP_SET_ROWS:
{
return (
(
(op->type == GGML_TYPE_F32 || op->type == GGML_TYPE_F16 || op->type == GGML_TYPE_BF16 ||
op->type == GGML_TYPE_Q4_0 || op->type == GGML_TYPE_Q4_1 || op->type == GGML_TYPE_Q5_0 ||
op->type == GGML_TYPE_Q5_1 || op->type == GGML_TYPE_Q8_0 || op->type == GGML_TYPE_IQ4_NL) &&
op->src[0]->type == GGML_TYPE_F32
) || (
op->type == GGML_TYPE_F16 && op->src[0]->type == GGML_TYPE_F16
)
) &&
return (op->type == GGML_TYPE_F32 || op->type == GGML_TYPE_F16 || op->type == GGML_TYPE_BF16 ||
op->type == GGML_TYPE_Q4_0 || op->type == GGML_TYPE_Q4_1 || op->type == GGML_TYPE_Q5_0 ||
op->type == GGML_TYPE_Q5_1 || op->type == GGML_TYPE_Q8_0 || op->type == GGML_TYPE_IQ4_NL) &&
op->src[0]->type == GGML_TYPE_F32 &&
(op->src[1]->type == GGML_TYPE_I64 || op->src[1]->type == GGML_TYPE_I32);
} break;
case GGML_OP_SET:
@@ -4924,9 +4908,7 @@ static bool ggml_backend_cuda_device_supports_op(ggml_backend_dev_t dev, const g
case GGML_OP_IM2COL:
case GGML_OP_IM2COL_3D:
case GGML_OP_CONV_2D:
return true;
case GGML_OP_CONV_2D_DW:
return op->src[0]->type == GGML_TYPE_F32;
case GGML_OP_CONV_TRANSPOSE_2D:
case GGML_OP_POOL_2D:
return true;
-366
View File
@@ -1,366 +0,0 @@
static constexpr __host__ __device__ ggml_cuda_mmq_config ggml_cuda_mmq_get_config_ampere(ggml_type type, int J, bool fallback) {
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
return ggml_cuda_mmq_config(GGML_TYPE_COUNT, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, 256, false, true);
}
@@ -1,37 +0,0 @@
static constexpr __host__ __device__ ggml_cuda_mmq_config ggml_cuda_mmq_get_config_blackwell(ggml_type type, int J, bool fallback) {
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_MXFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, true);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
CASE(GGML_TYPE_NVFP4, 256, 1, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_FP4, MMQ_ITER_K_FP4, true, false);
return ggml_cuda_mmq_get_config_ampere(type, J, fallback);
}
-177
View File
@@ -1,177 +0,0 @@
static constexpr __host__ __device__ ggml_cuda_mmq_config ggml_cuda_mmq_get_config_cdna(ggml_type type, int J, bool fallback) {
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q1_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_1, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_1, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q8_0, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q2_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q3_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q4_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q5_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_Q6_K, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, true, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ1_S, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XXS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_XS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ2_S, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_XXS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ3_S, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_XS, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_IQ4_NL, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, true, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_MXFP4, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, true);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
CASE(GGML_TYPE_NVFP4, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, true, false);
return ggml_cuda_mmq_config(GGML_TYPE_COUNT, 512, 1, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, 256, false, true);
}
-261
View File
@@ -1,261 +0,0 @@
static constexpr __host__ __device__ ggml_cuda_mmq_config ggml_cuda_mmq_get_config_pascal(ggml_type type, int J, bool fallback) {
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 64, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
return ggml_cuda_mmq_config(GGML_TYPE_COUNT, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, 256, false, true);
}
-261
View File
@@ -1,261 +0,0 @@
static constexpr __host__ __device__ ggml_cuda_mmq_config ggml_cuda_mmq_get_config_rdna2(ggml_type type, int J, bool fallback) {
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 8, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 24, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 40, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
return ggml_cuda_mmq_config(GGML_TYPE_COUNT, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, 256, false, true);
}
-282
View File
@@ -1,282 +0,0 @@
static constexpr __host__ __device__ ggml_cuda_mmq_config ggml_cuda_mmq_get_config_rdna4(ggml_type type, int J, bool fallback) {
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q1_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_1, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_1, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q8_0, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q2_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q2_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q3_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q4_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q5_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_Q6_K, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q6_K, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ1_S, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XXS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_XS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ2_S, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q3_K, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_XXS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ3_S, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_XS, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_IQ4_NL, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, MMQ_ITER_K, false, false);
// ---------------------------------------------------------------------------------------------
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_MXFP4, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_1, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, true);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 16, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 32, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 48, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 80, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 96, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 112, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
CASE(GGML_TYPE_NVFP4, 256, 2, 128, 128, GGML_CUDA_MMQ_SRAM_LAYOUT_NVFP4, MMQ_ITER_K, false, false);
return ggml_cuda_mmq_config(GGML_TYPE_COUNT, 256, 2, 128, 64, GGML_CUDA_MMQ_SRAM_LAYOUT_Q8_0, 256, false, true);
}
File diff suppressed because it is too large Load Diff
File diff suppressed because it is too large Load Diff
+48 -7
View File
@@ -3,8 +3,6 @@
#include "quantize.cuh"
#include "mmid.cuh"
#include <cstdint>
static void ggml_cuda_mul_mat_q_switch_type(ggml_backend_cuda_context & ctx, const mmq_args & args, cudaStream_t stream) {
switch (args.type_x) {
case GGML_TYPE_Q1_0:
@@ -120,14 +118,15 @@ void ggml_cuda_mul_mat_q(
const int64_t s03 = src0->nb[3] / ts_src0;
const int64_t s3 = dst->nb[3] / ts_dst;
const bool fallback = ne01 % 128 != 0;
const bool use_stream_k = (GGML_CUDA_CC_IS_NVIDIA(cc) && ggml_cuda_highest_compiled_arch(cc) >= GGML_CUDA_CC_VOLTA)
|| GGML_CUDA_CC_IS_CDNA(cc);
// TODO: tighter pool buffer size vs q8 path
const bool use_native_fp4 = blackwell_mma_available(cc) && (src0->type == GGML_TYPE_MXFP4 || src0->type == GGML_TYPE_NVFP4);
if (!ids) {
const size_t nbytes_src1_q8_1 = ne13*ne12 * ne11*ne10_padded * sizeof(block_q8_1)/QK8_1 +
ggml_cuda_mmq_get_J_max(src0->type, fallback, cc, ne11) * sizeof(block_q8_1_mmq);
get_mmq_x_max_host(cc)*sizeof(block_q8_1_mmq);
ggml_cuda_pool_alloc<char> src1_q8_1(ctx.pool(), nbytes_src1_q8_1);
{
@@ -157,7 +156,7 @@ void ggml_cuda_mul_mat_q(
ne00, ne01, ne1, s01, ne11, s1,
ne02, ne12, s02, s12, s2,
ne03, ne13, s03, s13, s3,
ne1};
use_stream_k, ne1};
ggml_cuda_mul_mat_q_switch_type(ctx, args, stream);
return;
}
@@ -185,7 +184,7 @@ void ggml_cuda_mul_mat_q(
}
const size_t nbytes_src1_q8_1 = ne12*n_expert_used*ne10_padded * sizeof(block_q8_1)/QK8_1 +
ggml_cuda_mmq_get_J_max(src0->type, fallback, cc, ne11) * sizeof(block_q8_1_mmq);
get_mmq_x_max_host(cc)*sizeof(block_q8_1_mmq);
ggml_cuda_pool_alloc<char> src1_q8_1(ctx.pool(), nbytes_src1_q8_1);
const int64_t ne11_flat = ne12*n_expert_used;
@@ -218,11 +217,53 @@ void ggml_cuda_mul_mat_q(
ne00, ne01, ne_get_rows, s01, ne_get_rows, s1,
ne02, ne02, s02, s12, s2,
ne03, ne13, s03, s13, s3,
ne12};
use_stream_k, ne12};
ggml_cuda_mul_mat_q_switch_type(ctx, args, stream);
}
void ggml_cuda_op_mul_mat_q(
ggml_backend_cuda_context & ctx,
const ggml_tensor * src0, const ggml_tensor * src1, ggml_tensor * dst, const char * src0_dd_i, const float * src1_ddf_i,
const char * src1_ddq_i, float * dst_dd_i, const int64_t row_low, const int64_t row_high, const int64_t src1_ncols,
const int64_t src1_padded_row_size, cudaStream_t stream) {
const int64_t ne00 = src0->ne[0];
const int64_t ne10 = src1->ne[0];
const int64_t ne11 = src1->ne[1];
GGML_ASSERT(ne10 % QK8_1 == 0);
const int64_t ne0 = dst->ne[0];
const int64_t row_diff = row_high - row_low;
const int64_t stride01 = ne00 / ggml_blck_size(src0->type);
const int id = ggml_cuda_get_device();
const int cc = ggml_cuda_info().devices[id].cc;
// the main device has a larger memory buffer to hold the results from all GPUs
// nrows_dst == nrows of the matrix that the kernel writes into
const int64_t nrows_dst = id == ctx.device ? ne0 : row_diff;
// The stream-k decomposition is only faster for recent NVIDIA GPUs.
// Also its fixup needs to allocate a temporary buffer in the memory pool.
// There are multiple parallel CUDA streams for src1_ncols != ne11 which would introduce a race condition for this buffer.
const bool use_stream_k = ((GGML_CUDA_CC_IS_NVIDIA(cc) && ggml_cuda_highest_compiled_arch(cc) >= GGML_CUDA_CC_VOLTA)
|| GGML_CUDA_CC_IS_CDNA(cc))
&& src1_ncols == ne11;
const mmq_args args = {
src0_dd_i, src0->type, (const int *) src1_ddq_i, nullptr, nullptr, dst_dd_i,
ne00, row_diff, src1_ncols, stride01, ne11, nrows_dst,
1, 1, 0, 0, 0,
1, 1, 0, 0, 0,
use_stream_k, src1_ncols};
ggml_cuda_mul_mat_q_switch_type(ctx, args, stream);
GGML_UNUSED_VARS(src1, dst, src1_ddf_i, src1_padded_row_size);
}
bool ggml_cuda_should_use_mmq(enum ggml_type type, int cc, int64_t ne11, int64_t n_experts) {
#ifdef GGML_CUDA_FORCE_CUBLAS
return false;
+3496 -812
View File
File diff suppressed because it is too large Load Diff
+32 -23
View File
@@ -549,8 +549,8 @@ static __global__ void mul_mat_vec_q(
[[maybe_unused]] float x_biases[ncols_dst] = { 0.0f };
[[maybe_unused]] float gate_biases[ncols_dst] = { 0.0f };
[[maybe_unused]] float x_scales = 1.0f;
[[maybe_unused]] float gate_scales = 1.0f;
[[maybe_unused]] float x_scales;
[[maybe_unused]] float gate_scales;
if constexpr (has_fusion) {
// 1. Hide latency by prefetching bias, gates and scales here
// 2. load only on threads that won't die after partial sum calculation
@@ -655,38 +655,47 @@ static __global__ void mul_mat_vec_q(
tmp_gate[j][i] = warp_reduce_sum<warp_size>(tmp_gate[j][i]);
}
}
}
if (threadIdx.x == i && (rows_per_cuda_block == 1 || uint32_t(row0 + i) < stride_col_dst)) {
float result = tmp[j][i];
if constexpr (has_fusion) {
if constexpr (type == GGML_TYPE_NVFP4) {
if (threadIdx.x < rows_per_cuda_block && (rows_per_cuda_block == 1 || uint32_t(row0 + threadIdx.x) < stride_col_dst)) {
float result = tmp[j][threadIdx.x];
if constexpr (has_fusion) {
if constexpr (type == GGML_TYPE_NVFP4) {
if (use_scale) {
result *= x_scales;
}
}
if (use_bias) {
result += x_biases[j];
if (use_gate) {
float gate_value = tmp_gate[j][i];
if constexpr (type == GGML_TYPE_NVFP4) {
}
if (use_gate) {
float gate_value = tmp_gate[j][threadIdx.x];
if constexpr (type == GGML_TYPE_NVFP4) {
if (use_gate_scale) {
gate_value *= gate_scales;
}
}
if (use_gate_bias) {
gate_value += gate_biases[j];
switch (active_glu) {
case GGML_GLU_OP_SWIGLU:
result *= ggml_cuda_op_silu_single(gate_value);
break;
case GGML_GLU_OP_GEGLU:
result *= ggml_cuda_op_gelu_single(gate_value);
break;
case GGML_GLU_OP_SWIGLU_OAI:
result = ggml_cuda_op_swiglu_oai_single(gate_value, result);
break;
default:
result = result * gate_value;
break;
}
switch (active_glu) {
case GGML_GLU_OP_SWIGLU:
result *= ggml_cuda_op_silu_single(gate_value);
break;
case GGML_GLU_OP_GEGLU:
result *= ggml_cuda_op_gelu_single(gate_value);
break;
case GGML_GLU_OP_SWIGLU_OAI: {
result = ggml_cuda_op_swiglu_oai_single(gate_value, result);
break;
}
default:
result = result * gate_value;
break;
}
}
dst[j*stride_col_dst + i] = result;
}
dst[j*stride_col_dst + threadIdx.x] = result;
}
}
+4 -64
View File
@@ -322,77 +322,17 @@ static void set_rows_cuda(ggml_backend_cuda_context & ctx, const ggml_tensor * s
}
}
template<>
void set_rows_cuda<half, int32_t>(ggml_backend_cuda_context & ctx, const ggml_tensor * src0, const ggml_tensor * src1, ggml_tensor * dst) {
const half * src0_d = (const half *)src0->data;
const int32_t * src1_d = (const int32_t *)src1->data;
GGML_TENSOR_BINARY_OP_LOCALS
cudaStream_t stream = ctx.stream();
if (dst->type == GGML_TYPE_F16) {
set_rows_cuda(
src0_d, src1_d, (half*)dst->data,
ne00, ne01, ne02, ne03,
ne10, ne11, ne12, ne13,
nb01, nb02, nb03,
nb10, nb11, nb12,
nb1, nb2, nb3,
stream
);
} else {
GGML_ABORT("unsupported type %s", ggml_type_name(dst->type));
}
}
template<>
void set_rows_cuda<half, int64_t>(ggml_backend_cuda_context & ctx, const ggml_tensor * src0, const ggml_tensor * src1, ggml_tensor * dst) {
const half * src0_d = (const half *)src0->data;
const int64_t * src1_d = (const int64_t *)src1->data;
GGML_TENSOR_BINARY_OP_LOCALS
cudaStream_t stream = ctx.stream();
if (dst->type == GGML_TYPE_F16) {
set_rows_cuda(
src0_d, src1_d, (half*)dst->data,
ne00, ne01, ne02, ne03,
ne10, ne11, ne12, ne13,
nb01, nb02, nb03,
nb10, nb11, nb12,
nb1, nb2, nb3,
stream
);
} else {
GGML_ABORT("unsupported type %s", ggml_type_name(dst->type));
}
}
void ggml_cuda_op_set_rows(ggml_backend_cuda_context & ctx, ggml_tensor * dst) {
const ggml_tensor * src0 = dst->src[0];
const ggml_tensor * src1 = dst->src[1];
GGML_ASSERT(src0->type == GGML_TYPE_F32 || (src0->type == GGML_TYPE_F16 && dst->type == GGML_TYPE_F16));
GGML_ASSERT(src0->type == GGML_TYPE_F32);
GGML_ASSERT(src1->type == GGML_TYPE_I64 || src1->type == GGML_TYPE_I32);
if (src0->type == GGML_TYPE_F32) {
if (src1->type == GGML_TYPE_I64) {
set_rows_cuda<float, int64_t>(ctx, src0, src1, dst);
} else {
set_rows_cuda<float, int32_t>(ctx, src0, src1, dst);
}
} else if (src0->type == GGML_TYPE_F16) {
if (src1->type == GGML_TYPE_I64) {
set_rows_cuda<half, int64_t>(ctx, src0, src1, dst);
} else {
set_rows_cuda<half, int32_t>(ctx, src0, src1, dst);
}
if (src1->type == GGML_TYPE_I64) {
set_rows_cuda<float, int64_t>(ctx, src0, src1, dst);
} else {
GGML_ABORT("unsupported type %s", ggml_type_name(src0->type));
set_rows_cuda<float, int32_t>(ctx, src0, src1, dst);
}
}
+7 -16
View File
@@ -75,26 +75,17 @@ void ggml_cuda_op_top_k(ggml_backend_cuda_context & ctx, ggml_tensor * dst) {
const int ncols_pad = next_power_of_2(ncols);
const size_t shared_mem = ncols_pad * sizeof(int);
const size_t max_shared_mem = ggml_cuda_info().devices[ggml_cuda_get_device()].smpb;
const bool use_bitonic = shared_mem <= max_shared_mem && ncols <= 1024;
const int chunk_nrows = argsort_f32_i32_cuda_cub_chunk_nrows(src0->nb[1], nrows);
ggml_cuda_pool_alloc<int> temp_dst_alloc(pool, ncols * chunk_nrows);
ggml_cuda_pool_alloc<int> temp_dst_alloc(pool, ncols * nrows);
int * tmp_dst = temp_dst_alloc.get();
for (int64_t i = 0; i < nrows; i += chunk_nrows) {
int iter_nrows = std::min((int64_t) chunk_nrows, nrows - i);
if (use_bitonic) {
argsort_f32_i32_cuda_bitonic(src0_d, tmp_dst, ncols, iter_nrows, GGML_SORT_ORDER_DESC, stream);
} else {
argsort_f32_i32_cuda_cub(pool, src0_d, tmp_dst, ncols, iter_nrows, GGML_SORT_ORDER_DESC, stream);
}
CUDA_CHECK(cudaMemcpy2DAsync(dst_d, k * sizeof(int), tmp_dst, ncols * sizeof(int), k * sizeof(int), iter_nrows,
cudaMemcpyDeviceToDevice, stream));
src0_d += ncols * iter_nrows;
dst_d += k * iter_nrows;
if (shared_mem > max_shared_mem || ncols > 1024) {
argsort_f32_i32_cuda_cub(pool, src0_d, tmp_dst, ncols, nrows, GGML_SORT_ORDER_DESC, stream);
} else {
argsort_f32_i32_cuda_bitonic(src0_d, tmp_dst, ncols, nrows, GGML_SORT_ORDER_DESC, stream);
}
CUDA_CHECK(cudaMemcpy2DAsync(dst_d, k * sizeof(int), tmp_dst, ncols * sizeof(int), k * sizeof(int), nrows,
cudaMemcpyDeviceToDevice, stream));
#else // GGML_CUDA_USE_CUB
ggml_cuda_pool_alloc<int> temp_dst_alloc(pool, ncols * nrows);
int * tmp_dst = temp_dst_alloc.get();
-246
View File
@@ -1,246 +0,0 @@
message(STATUS "Using ET backend")
# Configure ET platform path
if (DEFINED ENV{ET_PLATFORM})
set(ET_PLATFORM_PATH $ENV{ET_PLATFORM})
else()
set(ET_PLATFORM_PATH "/opt/et")
endif()
# Use sysemu for ET backend if compiled with `-DGGML_ET_SYSEMU=ON`
if (GGML_ET_SYSEMU)
message(STATUS "Using ET backend with sysemu instead of hardware")
else()
message(STATUS "Using ET backend with hardware device")
endif()
# Add ET platform CMake modules and config files to search paths
list(APPEND CMAKE_PREFIX_PATH ${ET_PLATFORM_PATH}/lib/cmake)
list(APPEND CMAKE_MODULE_PATH ${ET_PLATFORM_PATH}/lib/cmake)
include(aifoundry-utils/ProjectFunctions)
message(STATUS "Using ET Platform at ${ET_PLATFORM_PATH}")
find_package(runtime REQUIRED)
# Kernel list
set(KERNELS
el_map_f32
flash_attn_ext_f32
glu_f32
scale_f32
mul_mat_f32
mul_mat_f32_matrix_engine
mul_mat_id_f32
mul_mat_id_Q4_0
mul_mat_id_Q8_0
mul_mat_Q8_0
mul_mat_Q4_0
mul_mat_Q4_0_matrix_engine
mul_mat_f16
mul_mat_f16_matrix_engine
rope_f32
unary_f32
sqr_f32
clamp_f32
sum_rows_f32
mean_f32
cumsum_f32
norm_f32
l2_norm_f32
group_norm_f32
rms_norm_f32
rms_norm_mul_f32
softmax_f32
im2col
get_rows_f32
concat_f32
repeat_f32
rwkv_wkv6_f32
rwkv_wkv7_f32
gated_delta_net_f32
cont_f32
cont_f16
cpy_f32_f16
flash_attn_ext_f16_me
set_rows_f32
set_f32
fill_f32
pad_f32
diag_f32
tri_f32
solve_tri_f32
ssm_conv_f32
ssm_scan_f32
conv_2d_f32_me
memops
uberkernel
)
# Kernels that we support dispatch form Uberkernel
set(UBERKERNEL_SUPPORTED_KERNELS
el_map_f32
# unary_f32
# cpy_f32_f16
# cont_f32
# get_rows_f32
concat_f32
cont_f16
cumsum_f32
diag_f32
fill_f32
flash_attn_ext_f16_me
flash_attn_ext_f32
gated_delta_net_f32
glu_f32
group_norm_f32
im2col
l2_norm_f32
mul_mat_f16
mul_mat_f16_matrix_engine
mul_mat_f32
mul_mat_f32_matrix_engine
mul_mat_id_f32
mul_mat_Q4_0
mul_mat_Q8_0
norm_f32
pad_f32
repeat_f32
rms_norm_f32
rms_norm_mul_f32
rope_f32
rwkv_wkv6_f32
rwkv_wkv7_f32
scale_f32
set_f32
set_rows_f32
softmax_f32
solve_tri_f32
sqr_f32
# ssm_conv_f32
ssm_scan_f32
sum_rows_f32
tri_f32
)
set(UBERKERNEL_MAP_HPP ${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-uberkernel-kernel-map.h)
set(UBERKERNEL_MAP_CPP ${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-uberkernel-kernel-map.cpp)
set(UBERKERNEL_KERNELS_SORTED ${UBERKERNEL_SUPPORTED_KERNELS})
list(SORT UBERKERNEL_KERNELS_SORTED)
set(UBERKERNEL_ENUM_ENTRIES "")
set(UBERKERNEL_MAP_ENTRIES "")
set(_uk_idx 1)
foreach(KERNEL ${UBERKERNEL_KERNELS_SORTED})
string(TOUPPER ${KERNEL} _uk_upper)
string(APPEND UBERKERNEL_ENUM_ENTRIES
" GGML_ET_UBERKERNEL_KERNEL_${_uk_upper} = ${_uk_idx},\n")
string(APPEND UBERKERNEL_MAP_ENTRIES
" {\"${KERNEL}\", GGML_ET_UBERKERNEL_KERNEL_${_uk_upper}},\n")
math(EXPR _uk_idx "${_uk_idx} + 1")
endforeach()
configure_file(
${CMAKE_CURRENT_SOURCE_DIR}/cmake/ggml-et-uberkernel-kernel-map.h.in
${UBERKERNEL_MAP_HPP}
@ONLY)
configure_file(
${CMAKE_CURRENT_SOURCE_DIR}/cmake/ggml-et-uberkernel-kernel-map.cpp.in
${UBERKERNEL_MAP_CPP}
@ONLY)
add_custom_target(et-uberkernel-map
DEPENDS ${UBERKERNEL_MAP_HPP} ${UBERKERNEL_MAP_CPP}
)
# Build ET kernels (cross-compiled in subdirectory scope)
add_subdirectory(et-kernels)
# Embed kernels into C++ source
set(EMBED_SCRIPT ${CMAKE_CURRENT_SOURCE_DIR}/cmake/embed_one_kernel.cmake)
set(EMBED_HPP ${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-kernels-embed.hpp)
set(EMBED_CPP ${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-kernels-embed.cpp)
set(EMBED_DIR ${CMAKE_CURRENT_BINARY_DIR}/et-kernels/embed)
file(MAKE_DIRECTORY ${EMBED_DIR})
set(EMBED_KERNEL_SOURCES)
set(EMBED_EXTERNS "")
set(EMBED_MAP_ENTRIES "")
foreach(KERNEL ${KERNELS})
set(ELF_PATH ${CMAKE_CURRENT_BINARY_DIR}/et-kernels/${KERNEL}.elf)
set(OUT_CPP ${EMBED_DIR}/${KERNEL}.cpp)
add_custom_command(
OUTPUT ${OUT_CPP}
COMMAND ${CMAKE_COMMAND}
-DELF_FILE=${ELF_PATH}
-DOUT_FILE=${OUT_CPP}
-DVAR_NAME=${KERNEL}
-P ${EMBED_SCRIPT}
DEPENDS ${KERNEL}.elf ${EMBED_SCRIPT}
COMMENT "Embedding ${KERNEL}.elf"
VERBATIM
)
list(APPEND EMBED_KERNEL_SOURCES ${OUT_CPP})
string(APPEND EMBED_EXTERNS
"extern unsigned char ${KERNEL}_data[];\n"
"extern const uint64_t ${KERNEL}_len;\n")
string(APPEND EMBED_MAP_ENTRIES
" {\"${KERNEL}\", {${KERNEL}_data, ${KERNEL}_len}},\n")
endforeach()
configure_file(
${CMAKE_CURRENT_SOURCE_DIR}/cmake/ggml-et-kernels-embed.hpp.in
${EMBED_HPP}
@ONLY)
configure_file(
${CMAKE_CURRENT_SOURCE_DIR}/cmake/ggml-et-kernels-embed.cpp.in
${EMBED_CPP}
@ONLY)
add_custom_target(et-kernels-embed ALL
DEPENDS ${EMBED_KERNEL_SOURCES} ${EMBED_HPP} ${EMBED_CPP} et-uberkernel-map
)
ggml_add_backend_library(ggml-et
ggml-et.cpp
ggml-et-kernels.cpp
ggml-et-memops.cpp
ggml-et-ops.cpp
ggml-et-cpu-compare.cpp
)
# Mark generated files as such
set_source_files_properties(
${EMBED_CPP}
${EMBED_HPP}
${EMBED_KERNEL_SOURCES}
${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-uberkernel-kernel-map.cpp
${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-uberkernel-kernel-map.h
PROPERTIES GENERATED TRUE
)
# Add embedded kernel sources
target_sources(ggml-et PRIVATE
${EMBED_CPP}
${EMBED_HPP}
${EMBED_KERNEL_SOURCES}
${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-uberkernel-kernel-map.cpp
${CMAKE_CURRENT_BINARY_DIR}/et-kernels/ggml-et-uberkernel-kernel-map.h
)
# Include directory for embedded headers
target_include_directories(ggml-et PRIVATE ${CMAKE_CURRENT_BINARY_DIR}/et-kernels)
target_link_libraries(ggml-et PRIVATE runtime::etrt_static deviceLayer::deviceLayer)
target_compile_definitions(ggml-et PRIVATE GGML_ET_UBERKERNEL_HOST_LOOKUP)
if (GGML_ET_SYSEMU)
target_compile_definitions(ggml-et PRIVATE GGML_ET_SYSEMU=1)
endif()
# Ensure kernels are built and embedded before the backend library
add_dependencies(ggml-et et-kernels-embed et-uberkernel-map)
@@ -1,15 +0,0 @@
# Inputs (via -D):
# ELF_FILE - path to source .elf
# OUT_FILE - path to output .cpp
# VAR_NAME - C symbol base name (kernel name)
file(READ "${ELF_FILE}" HEX HEX)
string(LENGTH "${HEX}" HEX_LEN)
math(EXPR SIZE "${HEX_LEN} / 2")
string(REGEX REPLACE "(..)" "0x\\1," BYTES "${HEX}")
file(WRITE "${OUT_FILE}"
"// Auto-generated by embed_one_kernel.cmake. Do not edit.\n"
"#include <cstdint>\n"
"unsigned char ${VAR_NAME}_data[${SIZE}] = { ${BYTES} };\n"
"extern const uint64_t ${VAR_NAME}_len = ${SIZE};\n")
@@ -1,6 +0,0 @@
// Auto-generated kernel embeddings. Do not edit.
#include "ggml-et-kernels-embed.hpp"
const std::unordered_map<std::string, std::pair<const unsigned char*, uint64_t>> ggml_et_embedded_kernels = {
@EMBED_MAP_ENTRIES@
};
@@ -1,12 +0,0 @@
// Auto-generated kernel embeddings. Do not edit.
#pragma once
#include <cstdint>
#include <unordered_map>
#include <string>
#include <utility>
@EMBED_EXTERNS@
// Kernel name -> (data, length) lookup map
extern const std::unordered_map<std::string, std::pair<const unsigned char*, uint64_t>> ggml_et_embedded_kernels;
@@ -1,18 +0,0 @@
// Auto-generated uberkernel kernel-id mapping. Do not edit.
#include "ggml-et-uberkernel-kernel-map.h"
#ifdef GGML_ET_UBERKERNEL_HOST_LOOKUP
#include <string>
#include <unordered_map>
uint16_t ggml_et_uberkernel_kernel_id_from_name(const char * kernel_name) {
if (kernel_name == nullptr) {
return GGML_ET_UBERKERNEL_KERNEL_INVALID;
}
static const std::unordered_map<std::string, uint16_t> kernel_id_map = {
@UBERKERNEL_MAP_ENTRIES@
};
auto it = kernel_id_map.find(std::string(kernel_name));
return it == kernel_id_map.end() ? GGML_ET_UBERKERNEL_KERNEL_INVALID : it->second;
}
#endif
@@ -1,13 +0,0 @@
// Auto-generated uberkernel kernel-id mapping. Do not edit.
#pragma once
#include <stdint.h>
enum ggml_et_uberkernel_kernel_id {
GGML_ET_UBERKERNEL_KERNEL_INVALID = 0,
@UBERKERNEL_ENUM_ENTRIES@
};
#ifdef GGML_ET_UBERKERNEL_HOST_LOOKUP
uint16_t ggml_et_uberkernel_kernel_id_from_name(const char * kernel_name);
#endif
-137
View File
@@ -1,137 +0,0 @@
# ggml-et: Device kernels (cross-compiled within the main build)
#
# The RISC-V toolchain is set up in-scope so these targets use the
# cross-compiler while the rest of the build uses the host compiler.
# This keeps kernels in compile_commands.json for full IDE support.
# --- RISC-V toolchain setup (scoped to this directory) ---
set(TOOLCHAIN_DIR ${ET_PLATFORM_PATH})
include(${ET_PLATFORM_PATH}/lib/cmake/riscv64-ec-toolchain.cmake)
set(CMAKE_ADDR2LINE "${TOOLCHAIN_DIR}/bin/riscv64-unknown-elf-addr2line")
set(CMAKE_LINKER_TYPE LLD)
# Ensure kernels are built in this directory even if a global output directory is set
set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR})
message(STATUS "ET kernels using RISC-V toolchain at: ${TOOLCHAIN_DIR}")
# DeviceUtils provides the add_riscv_executable macro
list(APPEND CMAKE_MODULE_PATH "${ET_PLATFORM_PATH}/lib/cmake/cmake-modules")
list(APPEND CMAKE_PREFIX_PATH "${ET_PLATFORM_PATH}/lib/cmake")
include(DeviceUtils)
find_package(et-common-libs REQUIRED)
find_package(esperantoTrace REQUIRED)
# --- Kernel configuration ---
if(NOT DEFINED ADDRESS)
set(ADDRESS "0x8005801000")
message(STATUS "ADDRESS not specified, using default: ${ADDRESS}")
endif()
set(LINKER_SCRIPT ${CMAKE_CURRENT_SOURCE_DIR}/src/linker.ld)
set(CHECK_SCRIPT ${CMAKE_CURRENT_SOURCE_DIR}/scripts/check_unimplemented_instructions.sh)
# Track address changes to trigger relinking
set(ADDRESS_FILE ${CMAKE_CURRENT_BINARY_DIR}/et_address.txt)
file(CONFIGURE OUTPUT ${ADDRESS_FILE} CONTENT "${ADDRESS}" @ONLY)
# KERNELS defined in upper CMakeLists.txt
foreach(KERNEL ${KERNELS})
add_riscv_executable(${KERNEL})
target_sources(${KERNEL}.elf PRIVATE
src/${KERNEL}.c
src/crt.S
)
target_include_directories(${KERNEL}.elf PRIVATE
${CMAKE_CURRENT_SOURCE_DIR}/src
${CMAKE_CURRENT_SOURCE_DIR}/..
${CMAKE_CURRENT_BINARY_DIR}
${CMAKE_SOURCE_DIR}/ggml/include
${CMAKE_SOURCE_DIR}/ggml/src
)
target_link_libraries(${KERNEL}.elf PRIVATE et-common-libs::cm-umode)
# C-only flags must not apply to .S files
target_compile_options(${KERNEL}.elf PRIVATE
$<$<COMPILE_LANGUAGE:C>:-fno-zero-initialized-in-bss>
$<$<COMPILE_LANGUAGE:C>:-ffreestanding>
$<$<COMPILE_LANGUAGE:C>:-std=gnu99>
$<$<COMPILE_LANGUAGE:C>:-ffat-lto-objects>
$<$<COMPILE_LANGUAGE:C>:-mcmodel=medany>
$<$<COMPILE_LANGUAGE:C>:-mabi=lp64f>
$<$<COMPILE_LANGUAGE:C>:-march=rv64imf>
$<$<COMPILE_LANGUAGE:C>:-ffunction-sections>
$<$<COMPILE_LANGUAGE:C>:-fdata-sections>
$<$<COMPILE_LANGUAGE:C>:-O3>
$<$<COMPILE_LANGUAGE:C>:-g0>
$<$<COMPILE_LANGUAGE:C>:-nostdlib>
$<$<COMPILE_LANGUAGE:C>:-ffreestanding>
)
target_link_options(${KERNEL}.elf PRIVATE
-Wl,--defsym=BASE_ADDRESS=${ADDRESS}
-Wl,--entry=_start
)
# Append to LINK_DEPENDS (macro already sets it for the linker script)
set_property(TARGET ${KERNEL}.elf APPEND PROPERTY
LINK_DEPENDS "${ADDRESS_FILE}"
)
# Post-build: strip and check (fails build if check script fails)
add_custom_command(TARGET ${KERNEL}.elf POST_BUILD
COMMAND ${CMAKE_STRIP} --strip-debug $<TARGET_FILE:${KERNEL}.elf>
COMMAND ${CHECK_SCRIPT}
${CMAKE_OBJDUMP} ${CMAKE_ADDR2LINE} $<TARGET_FILE:${KERNEL}.elf>
DEPENDS ${CHECK_SCRIPT}
VERBATIM
)
endforeach()
add_dependencies(uberkernel.elf et-uberkernel-map)
# Each supported kernel is compiled in its own translation unit with
# -Dentry_point=<kernel>_entry
# so symbols and macros don't leak between kernels. The dispatcher
# (uberkernel.c) calls the renamed entries via extern declarations.
#
# HACK: we need to supresse _me kernels from setting up SCP themselves
set(_UBER_ME_KERNELS mul_mat_f16_matrix_engine mul_mat_f32_matrix_engine flash_attn_ext_f16_me)
foreach(UK_KERNEL ${UBERKERNEL_SUPPORTED_KERNELS})
set(_obj uber_${UK_KERNEL})
add_library(${_obj} OBJECT src/${UK_KERNEL}.c)
target_compile_definitions(${_obj} PRIVATE "entry_point=${UK_KERNEL}_entry" ET_UBERKERNEL)
target_include_directories(${_obj} PRIVATE
${CMAKE_CURRENT_SOURCE_DIR}/src
${CMAKE_CURRENT_SOURCE_DIR}/..
${CMAKE_CURRENT_BINARY_DIR}
${CMAKE_SOURCE_DIR}/ggml/include
${CMAKE_SOURCE_DIR}/ggml/src
)
target_link_libraries(${_obj} PRIVATE et-common-libs::cm-umode)
target_compile_options(${_obj} PRIVATE
$<$<COMPILE_LANGUAGE:C>:-fno-zero-initialized-in-bss>
$<$<COMPILE_LANGUAGE:C>:-ffreestanding>
$<$<COMPILE_LANGUAGE:C>:-std=gnu99>
$<$<COMPILE_LANGUAGE:C>:-ffat-lto-objects>
$<$<COMPILE_LANGUAGE:C>:-mcmodel=medany>
$<$<COMPILE_LANGUAGE:C>:-mabi=lp64f>
$<$<COMPILE_LANGUAGE:C>:-march=rv64imf>
$<$<COMPILE_LANGUAGE:C>:-ffunction-sections>
$<$<COMPILE_LANGUAGE:C>:-fdata-sections>
$<$<COMPILE_LANGUAGE:C>:-O3>
$<$<COMPILE_LANGUAGE:C>:-g0>
$<$<COMPILE_LANGUAGE:C>:-nostdlib>
)
# ME kernels: suppress setup_cache_scp() (called once by the dispatcher)
if(UK_KERNEL IN_LIST _UBER_ME_KERNELS)
target_compile_definitions(${_obj} PRIVATE UBERKERNEL_SUPPRESS_SCP_SETUP)
endif()
target_sources(uberkernel.elf PRIVATE $<TARGET_OBJECTS:${_obj}>)
endforeach()
# Print summary
message(STATUS "GGML ET Kernels configured:")
foreach(KERNEL ${KERNELS})
message(STATUS " - ${KERNEL}")
endforeach()
message(STATUS "Base address: ${ADDRESS}")
@@ -1,36 +0,0 @@
#!/bin/bash
OBJDUMP=$1
ADDR2LINE=$2
TARGET_DEBUG=$3
TARGET_ASM=${TARGET_DEBUG}.S
BAD_INST_FILE=${TARGET_DEBUG}-BAD-INST.log
# grep expression to find unimplemented instructions
UNIMPLEMENTED_EXPR="fdiv.s\\|fsqrt.s\\|fcvt.l.s\\|fcvt.lu.s\\|fcvt.s.l\\|fcvt.s.lu\\|fdiv.pi\\|fdivu.pi\\|fremu.pi\\|frem.pi\\|fdiv.ps\\|fsqrt.ps\\|frsq.ps\\|fsin.ps"
# dump assembly into .S file
${OBJDUMP} -lwdSC ${TARGET_DEBUG} > ${TARGET_ASM}
# check with grep for unimplemented instructions
# Note: The exit status is 0 if selected lines are found, and 1 if not found.
grep ${UNIMPLEMENTED_EXPR} ${TARGET_ASM} > /dev/null
ret=$?
if [ ${ret} -eq 0 ]
then
# unimplemented instructions are found
echo -e "BUILD ERROR: Executable file ${TARGET_DEBUG} contains unimplemented instructions. Please review the lines of code listed in ${BAD_INST_FILE}"
echo -e "\t For further details, please read paragraph 3.4 of the ETSoC-1 Programmer's Reference Manual (PRM)"
# addr2line
grep ${UNIMPLEMENTED_EXPR} ${TARGET_ASM} | cut -d: -f 1 | ${ADDR2LINE} -i -e ${TARGET_DEBUG} > ${BAD_INST_FILE}
grep ${UNIMPLEMENTED_EXPR} ${TARGET_ASM} >> ${BAD_INST_FILE}
echo "------------------------------------------------------------"
cat ${BAD_INST_FILE}
echo "------------------------------------------------------------"
exit 1
else
rm -f ${BAD_INST_FILE}
fi
@@ -1,23 +0,0 @@
#!/usr/bin/env bash
set -euo pipefail
LOG="llama_bench_$(date +%Y%m%d_%H%M%S).log"
{
echo "===== START ====="
date
hostname
uname -a
echo "Command:"
echo "./build/bin/llama-bench -m ../../models/Llama-3.2-1B-Instruct-Q8_0.gguf -fa 0 -p 32,64,128,256,512 -n 32,64,128,256,512"
echo "================="
./build/bin/llama-bench \
-m ../../models/Llama-3.2-1B-Instruct-Q8_0.gguf \
-fa 0 \
-p 32,64,128,256,512 \
-n 32,64,128,256,512
echo "===== END ====="
date
} 2>&1 | tee "$LOG"
-997
View File
@@ -1,997 +0,0 @@
//******************************************************************************
// ET Vectorized Block Operations Library
// Provides optimized block-level operations using ET hardware vector instructions
//******************************************************************************
#ifndef BLOCK_OPS_H
# define BLOCK_OPS_H
# include "math_fp.h"
# include "quants.h"
# include <stdint.h>
//******************************************************************************
// Block Dot Product Operations
//******************************************************************************
inline void __attribute__((always_inline)) excl_mode(uint64_t val) {
__asm__ __volatile__("csrw 0x7d3, %[csr_enc]\n" : : [csr_enc] "r"(val) : "x31");
}
static inline float compute_block_dot_product_q4_0(const block_q4_0 * a_block, const float * b_col_start) {
// Set mask register to enable all 8 vector elements
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
// Use f10 as accumulator, init to 0
__asm__ volatile("fbci.ps f10, 0" ::: "f10");
static const int32_t gather_pattern[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
__asm__ volatile("flw.ps f31, %[gather]\n" : : [gather] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
// Process 32 elements in 2 chunks of 16 elements (8 bytes) each
for (int chunk = 0; chunk < 2; chunk++) {
int offset_a = chunk * 8;
int offset_b_low = chunk * 8; // Activations for lower nibbles
int offset_b_high = chunk * 8 + 16; // Activations for upper nibbles (16 elements later)
__asm__ volatile(
"fgb.ps f11, f31(%[a_ptr])\n" // Gather 8 bytes (16 packed q4_0 weights)
// 1. Extract & Multiply Lower Nibbles
"fandi.pi f12, f11, 15\n" // Mask lower 4 bits (x & 0xF)
"faddi.pi f12, f12, -8\n" // GGML offset to signed: (x & 0xF) - 8
"fcvt.ps.pw f12, f12, rne\n" // Convert INT32 to FP32
"flw.ps f13, 0(%[b_low])\n" // Load 8 B values (floats)
"fmadd.ps f10, f12, f13, f10, rne\n" // acc += A_low * B_low
// 2. Extract & Multiply Upper Nibbles
"fsrli.pi f14, f11, 4\n" // Shift upper 4 bits down
"fandi.pi f14, f14, 15\n" // Mask new lower 4 bits
"faddi.pi f14, f14, -8\n" // GGML offset to signed
"fcvt.ps.pw f14, f14, rne\n" // Convert INT32 to FP32
"flw.ps f15, 0(%[b_high])\n" // Load next 8 B values (floats)
"fmadd.ps f10, f14, f15, f10, rne\n" // acc += A_high * B_high
:
: [a_ptr] "r"(&a_block->qs[offset_a]), [b_low] "r"(&b_col_start[offset_b_low]),
[b_high] "r"(&b_col_start[offset_b_high])
// Note: f10 is explicitly NOT listed in the clobbers here to ensure the compiler
// preserves the running sum across C loop iterations safely.
: "f11", "f12", "f13", "f14", "f15");
}
// Horizontal sum: reduce f10 into a single scalar
float final_sum;
__asm__ __volatile__(
// Pairwise sum within each 128-bit half
"fswizz.ps f1, f10, 0xB1 \n\t" // Swaps: e0<->e1 and e2<->e3
"fadd.ps f2, f10, f1, rne \n\t"
// Complete the sum for each 128-bit half
"fswizz.ps f3, f2, 0x4E \n\t" // Swaps: e0,e1 <-> e2,e3
"fadd.ps f4, f2, f3, rne \n\t"
// Sum across the two 128b halfs
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(final_sum)::"t0", "f1", "f2", "f3", "f4", "f5", "f10");
// Restore original mask
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
const float scale = fp16_to_fp32(a_block->d);
return final_sum * scale;
}
// Compute dot product between dequantized q8_0 block and f32 column vector
// Vectorized: processes 8 elements at a time using ET vector instructions
// Block size: 32 int8 values (QK8_0)
static inline float compute_block_dot_product_q8_0(const block_q8_0 * a_block, const float * b_col_start) {
// Set mask register to enable all 8 vector elements
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
__asm__ volatile("fbci.pi f10, 0" ::: "f10"); // Use f10 as accumulator, init to 0
static const int32_t gather_pattern[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
__asm__ volatile("flw.ps f31, %[gather]\n" : : [gather] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
// Process 32 elements in 4 chunks of 8 elements each
for (int chunk = 0; chunk < 4; chunk++) {
int offset = chunk << 3; // chunk * 8
__asm__ volatile(
"flw.ps f12, %[b_vec]\n" // Load 8 B values (floats)
"fgb.ps f11, f31(%[a_ptr])\n" // Gather 8 int8 bytes from A using pattern
"fcvt.ps.pw f11, f11\n" // Convert int8 vector to float vector
"fmadd.ps f10, f11, f12, f10\n" // acc += a_vec * b_vec (8-wide)
:
: [a_ptr] "r"(&a_block->qs[offset]), [b_vec] "m"(*(const float (*)[8]) & b_col_start[offset]),
[scale] "m"(a_block->d)
: "f10", "f11", "f12");
}
// Horizontal sum: reduce f10 into a single scalar
float final_sum;
__asm__ __volatile__(
// Pairwise sum within each 128-bit half
"fswizz.ps f1, f10, 0xB1 \n\t" // Swaps: e0<->e1 and e2<->e3
"fadd.ps f2, f10, f1, rne \n\t"
// Complete the sum for each 128-bit half
"fswizz.ps f3, f2, 0x4E \n\t" // Swaps: e0,e1 <-> e2,e3
"fadd.ps f4, f2, f3, rne \n\t"
// Sum across the two 128b halfs
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(final_sum)::"t0", "f10", "f2", "f3", "f4", "f5");
// Restore original mask
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
const float scale = fp16_to_fp32(a_block->d);
return final_sum * scale;
}
//******************************************************************************
// Split-phase Q8_0 dot product API
//
// q8_dot_begin(st) — save mask, set mask 0xFF
// q8_dot_reset() — zero vector accumulator f20
// q8_dot_tile(q, b, n) — accumulate n Q8_0 blocks into f20
// q8_dot_reduce() — horizontal sum of f20, return scalar float
// q8_dot_teardown(st) — restore original mask
//
// Register contract:
// f20 — row accumulator (persistent across tiles, reset per row)
// f31 — gather pattern (reloaded per q8_dot_tile call)
// f10-f12 — scratch within tile
// f15 — scale broadcast within tile
// f1-f5, t0 — scratch within reduce
//******************************************************************************
static inline void __attribute__((always_inline)) q8_dot_reset(void) {
__asm__ volatile("fbci.pi f20, 0" ::: "f20");
}
// Accumulate n_blocks Q8_0 blocks into f20.
// Uses fg32b.ps (fast gather with scalar pattern) for aligned chunks,
// falls back to fgb.ps for chunks crossing a 32-byte boundary.
static inline void __attribute__((always_inline)) q8_dot_tile(const block_q8_0 * q_row,
const float * b_col,
int64_t n_blocks) {
const int32_t gather_pattern[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
const uint64_t gather_0_to_7 = 0x398a418820ULL;
__asm__ volatile("flw.ps f31, %[g]\n" : : [g] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
for (int64_t kb = 0; kb < n_blocks; kb++) {
const block_q8_0 * blk = q_row + kb;
const float * b_ptr = b_col + (kb << 5);
const uintptr_t qs_addr = (uintptr_t) blk->qs;
const uintptr_t qs_aligned = qs_addr & ~(uintptr_t) 31;
const uintptr_t qs_low = qs_addr & 31;
const int fast_chunks = (int) ((32 - qs_low) >> 3);
if (fast_chunks >= 3) {
__asm__ volatile(
"fbci.pi f10, 0\n"
"flw.ps f12, %[bv0]\n"
"fg32b.ps f11, %[gi](%[ap0])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv1]\n"
"fg32b.ps f11, %[gi](%[ap1])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv2]\n"
"fg32b.ps f11, %[gi](%[ap2])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv3]\n"
"fgb.ps f11, f31(%[ap3])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
:
: [gi] "r"(gather_0_to_7), [ap0] "r"(qs_addr), [ap1] "r"(qs_aligned | ((qs_addr + 8) & 31)),
[ap2] "r"(qs_aligned | ((qs_addr + 16) & 31)), [ap3] "r"(&blk->qs[24]),
[bv0] "m"(*(const float (*)[8]) & b_ptr[0]), [bv1] "m"(*(const float (*)[8]) & b_ptr[8]),
[bv2] "m"(*(const float (*)[8]) & b_ptr[16]), [bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12");
} else if (fast_chunks == 2) {
__asm__ volatile(
"fbci.pi f10, 0\n"
"flw.ps f12, %[bv0]\n"
"fg32b.ps f11, %[gi](%[ap0])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv1]\n"
"fg32b.ps f11, %[gi](%[ap1])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv2]\n"
"fgb.ps f11, f31(%[ap2])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv3]\n"
"fgb.ps f11, f31(%[ap3])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
:
: [gi] "r"(gather_0_to_7), [ap0] "r"(qs_addr), [ap1] "r"(qs_aligned | ((qs_addr + 8) & 31)),
[ap2] "r"(&blk->qs[16]), [ap3] "r"(&blk->qs[24]), [bv0] "m"(*(const float (*)[8]) & b_ptr[0]),
[bv1] "m"(*(const float (*)[8]) & b_ptr[8]), [bv2] "m"(*(const float (*)[8]) & b_ptr[16]),
[bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12");
} else if (fast_chunks == 1) {
__asm__ volatile(
"fbci.pi f10, 0\n"
"flw.ps f12, %[bv0]\n"
"fg32b.ps f11, %[gi](%[ap0])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv1]\n"
"fgb.ps f11, f31(%[ap1])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv2]\n"
"fgb.ps f11, f31(%[ap2])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv3]\n"
"fgb.ps f11, f31(%[ap3])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
:
: [gi] "r"(gather_0_to_7), [ap0] "r"(qs_addr), [ap1] "r"(&blk->qs[8]), [ap2] "r"(&blk->qs[16]),
[ap3] "r"(&blk->qs[24]), [bv0] "m"(*(const float (*)[8]) & b_ptr[0]),
[bv1] "m"(*(const float (*)[8]) & b_ptr[8]), [bv2] "m"(*(const float (*)[8]) & b_ptr[16]),
[bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12");
} else {
__asm__ volatile(
"fbci.pi f10, 0\n"
"flw.ps f12, %[bv0]\n"
"fgb.ps f11, f31(%[ap0])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv1]\n"
"fgb.ps f11, f31(%[ap1])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv2]\n"
"fgb.ps f11, f31(%[ap2])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
"flw.ps f12, %[bv3]\n"
"fgb.ps f11, f31(%[ap3])\n"
"fcvt.ps.pw f11, f11\n"
"fmadd.ps f10, f11, f12, f10\n"
:
: [ap0] "r"(&blk->qs[0]), [ap1] "r"(&blk->qs[8]), [ap2] "r"(&blk->qs[16]), [ap3] "r"(&blk->qs[24]),
[bv0] "m"(*(const float (*)[8]) & b_ptr[0]), [bv1] "m"(*(const float (*)[8]) & b_ptr[8]),
[bv2] "m"(*(const float (*)[8]) & b_ptr[16]), [bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12");
}
// f20 += f10 * broadcast(scale) — hardware fp16→fp32 via FCVT.PS.F16
uint32_t scale_raw = (uint32_t) blk->d;
__asm__ volatile(
"fbcx.ps f15, %[sb]\n"
"fcvt.ps.f16 f15, f15\n"
"fmadd.ps f20, f10, f15, f20\n"
:
: [sb] "r"(scale_raw)
: "f15", "f20");
}
}
// Horizontal sum of 8-element vector accumulator f20.
static inline float __attribute__((always_inline)) q8_dot_reduce(void) {
float result;
__asm__ __volatile__(
"fswizz.ps f1, f20, 0xB1 \n\t"
"fadd.ps f2, f20, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result)::"t0", "f1", "f2", "f3", "f4", "f5");
return result;
}
// Full-row dot product (convenience wrapper)
static inline float compute_row_dot_q8_0(const block_q8_0 * q_row, const float * b_col, int64_t K_blocks) {
unsigned long saved_mask;
__asm__ volatile("mova.x.m %0" : "=r"(saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
q8_dot_reset();
q8_dot_tile(q_row, b_col, K_blocks);
float result = q8_dot_reduce();
__asm__ volatile("mova.m.x %0" ::"r"(saved_mask));
return result;
}
//******************************************************************************
// Hoisted Q8_0 dot API
//
// q8_dot_begin/end save/restore the vector mask once around a long sequence of
// dot products, so the per-row mask shuffles are hoisted out of the inner
// loops. q8_dot_compute does a full-row dot (no mask handling). The _x2
// variant computes two rows together while reusing each loaded B chunk —
// only safe when both row pointers share the same 32-byte alignment phase
// (i.e. the Q8 row stride is a multiple of 32).
//******************************************************************************
typedef struct {
unsigned long saved_mask;
} q8_dot_state;
static inline void q8_dot_begin(q8_dot_state * state) {
__asm__ volatile("mova.x.m %0" : "=r"(state->saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
}
static inline void q8_dot_end(const q8_dot_state * state) {
__asm__ volatile("mova.m.x %0" ::"r"(state->saved_mask));
}
// Equivalent to q8_dot_reset+tile+reduce, without touching the mask register.
// Caller is responsible for q8_dot_begin/end around the surrounding loop.
static inline float q8_dot_compute(const block_q8_0 * q_row, const float * b_col, int64_t K_blocks) {
q8_dot_reset();
q8_dot_tile(q_row, b_col, K_blocks);
return q8_dot_reduce();
}
// Compute two row dots together while reusing the same loaded B chunks.
//
// Safe when every row starts at the same 32-byte offset, i.e. the Q8 row stride
// is a multiple of 32. In that case the gather/alignment pattern is the same
// for both rows at a given `kb`, so one set of B vector loads feeds both row
// accumulators.
static inline void q8_dot_compute_x2_aligned(const block_q8_0 * q_row0,
const block_q8_0 * q_row1,
const float * b_col,
int64_t K_blocks,
float * out0,
float * out1) {
const int32_t gather_pattern[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
const uint64_t gather_0_to_7 = 0x398a418820ULL;
__asm__ volatile("flw.ps f31, %[g]\n" : : [g] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
__asm__ volatile(
"fbci.pi f20, 0\n"
"fbci.pi f21, 0\n" ::
: "f20", "f21");
for (int64_t kb = 0; kb < K_blocks; kb++) {
const block_q8_0 * blk0 = q_row0 + kb;
const block_q8_0 * blk1 = q_row1 + kb;
const float * b_ptr = b_col + (kb << 5);
const uintptr_t qs_addr0 = (uintptr_t) blk0->qs;
const uintptr_t qs_addr1 = (uintptr_t) blk1->qs;
const uintptr_t qs_aligned0 = qs_addr0 & ~(uintptr_t) 31;
const uintptr_t qs_aligned1 = qs_addr1 & ~(uintptr_t) 31;
const int fast_chunks = (int) ((32 - (qs_addr0 & 31)) >> 3);
if (fast_chunks >= 3) {
__asm__ volatile(
"fbci.pi f10, 0\n"
"fbci.pi f11, 0\n"
"flw.ps f12, %[bv0]\n"
"fg32b.ps f16, %[gi](%[r0ap0])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f12, f10\n"
"fg32b.ps f17, %[gi](%[r1ap0])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f12, f11\n"
"flw.ps f13, %[bv1]\n"
"fg32b.ps f16, %[gi](%[r0ap1])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f13, f10\n"
"fg32b.ps f17, %[gi](%[r1ap1])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f13, f11\n"
"flw.ps f14, %[bv2]\n"
"fg32b.ps f16, %[gi](%[r0ap2])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f14, f10\n"
"fg32b.ps f17, %[gi](%[r1ap2])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f14, f11\n"
"flw.ps f15, %[bv3]\n"
"fgb.ps f16, f31(%[r0ap3])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f15, f10\n"
"fgb.ps f17, f31(%[r1ap3])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f15, f11\n"
:
: [gi] "r"(gather_0_to_7), [r0ap0] "r"(qs_addr0), [r0ap1] "r"(qs_aligned0 | ((qs_addr0 + 8) & 31)),
[r0ap2] "r"(qs_aligned0 | ((qs_addr0 + 16) & 31)), [r0ap3] "r"(&blk0->qs[24]), [r1ap0] "r"(qs_addr1),
[r1ap1] "r"(qs_aligned1 | ((qs_addr1 + 8) & 31)), [r1ap2] "r"(qs_aligned1 | ((qs_addr1 + 16) & 31)),
[r1ap3] "r"(&blk1->qs[24]), [bv0] "m"(*(const float (*)[8]) & b_ptr[0]),
[bv1] "m"(*(const float (*)[8]) & b_ptr[8]), [bv2] "m"(*(const float (*)[8]) & b_ptr[16]),
[bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17");
} else if (fast_chunks == 2) {
__asm__ volatile(
"fbci.pi f10, 0\n"
"fbci.pi f11, 0\n"
"flw.ps f12, %[bv0]\n"
"fg32b.ps f16, %[gi](%[r0ap0])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f12, f10\n"
"fg32b.ps f17, %[gi](%[r1ap0])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f12, f11\n"
"flw.ps f13, %[bv1]\n"
"fg32b.ps f16, %[gi](%[r0ap1])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f13, f10\n"
"fg32b.ps f17, %[gi](%[r1ap1])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f13, f11\n"
"flw.ps f14, %[bv2]\n"
"fgb.ps f16, f31(%[r0ap2])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f14, f10\n"
"fgb.ps f17, f31(%[r1ap2])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f14, f11\n"
"flw.ps f15, %[bv3]\n"
"fgb.ps f16, f31(%[r0ap3])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f15, f10\n"
"fgb.ps f17, f31(%[r1ap3])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f15, f11\n"
:
: [gi] "r"(gather_0_to_7), [r0ap0] "r"(qs_addr0), [r0ap1] "r"(qs_aligned0 | ((qs_addr0 + 8) & 31)),
[r0ap2] "r"(&blk0->qs[16]), [r0ap3] "r"(&blk0->qs[24]), [r1ap0] "r"(qs_addr1),
[r1ap1] "r"(qs_aligned1 | ((qs_addr1 + 8) & 31)), [r1ap2] "r"(&blk1->qs[16]),
[r1ap3] "r"(&blk1->qs[24]), [bv0] "m"(*(const float (*)[8]) & b_ptr[0]),
[bv1] "m"(*(const float (*)[8]) & b_ptr[8]), [bv2] "m"(*(const float (*)[8]) & b_ptr[16]),
[bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17");
} else if (fast_chunks == 1) {
__asm__ volatile(
"fbci.pi f10, 0\n"
"fbci.pi f11, 0\n"
"flw.ps f12, %[bv0]\n"
"fg32b.ps f16, %[gi](%[r0ap0])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f12, f10\n"
"fg32b.ps f17, %[gi](%[r1ap0])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f12, f11\n"
"flw.ps f13, %[bv1]\n"
"fgb.ps f16, f31(%[r0ap1])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f13, f10\n"
"fgb.ps f17, f31(%[r1ap1])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f13, f11\n"
"flw.ps f14, %[bv2]\n"
"fgb.ps f16, f31(%[r0ap2])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f14, f10\n"
"fgb.ps f17, f31(%[r1ap2])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f14, f11\n"
"flw.ps f15, %[bv3]\n"
"fgb.ps f16, f31(%[r0ap3])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f15, f10\n"
"fgb.ps f17, f31(%[r1ap3])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f15, f11\n"
:
: [gi] "r"(gather_0_to_7), [r0ap0] "r"(qs_addr0), [r0ap1] "r"(&blk0->qs[8]), [r0ap2] "r"(&blk0->qs[16]),
[r0ap3] "r"(&blk0->qs[24]), [r1ap0] "r"(qs_addr1), [r1ap1] "r"(&blk1->qs[8]),
[r1ap2] "r"(&blk1->qs[16]), [r1ap3] "r"(&blk1->qs[24]), [bv0] "m"(*(const float (*)[8]) & b_ptr[0]),
[bv1] "m"(*(const float (*)[8]) & b_ptr[8]), [bv2] "m"(*(const float (*)[8]) & b_ptr[16]),
[bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17");
} else {
__asm__ volatile(
"fbci.pi f10, 0\n"
"fbci.pi f11, 0\n"
"flw.ps f12, %[bv0]\n"
"fgb.ps f16, f31(%[r0ap0])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f12, f10\n"
"fgb.ps f17, f31(%[r1ap0])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f12, f11\n"
"flw.ps f13, %[bv1]\n"
"fgb.ps f16, f31(%[r0ap1])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f13, f10\n"
"fgb.ps f17, f31(%[r1ap1])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f13, f11\n"
"flw.ps f14, %[bv2]\n"
"fgb.ps f16, f31(%[r0ap2])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f14, f10\n"
"fgb.ps f17, f31(%[r1ap2])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f14, f11\n"
"flw.ps f15, %[bv3]\n"
"fgb.ps f16, f31(%[r0ap3])\n"
"fcvt.ps.pw f16, f16\n"
"fmadd.ps f10, f16, f15, f10\n"
"fgb.ps f17, f31(%[r1ap3])\n"
"fcvt.ps.pw f17, f17\n"
"fmadd.ps f11, f17, f15, f11\n"
:
: [r0ap0] "r"(&blk0->qs[0]), [r0ap1] "r"(&blk0->qs[8]), [r0ap2] "r"(&blk0->qs[16]),
[r0ap3] "r"(&blk0->qs[24]), [r1ap0] "r"(&blk1->qs[0]), [r1ap1] "r"(&blk1->qs[8]),
[r1ap2] "r"(&blk1->qs[16]), [r1ap3] "r"(&blk1->qs[24]), [bv0] "m"(*(const float (*)[8]) & b_ptr[0]),
[bv1] "m"(*(const float (*)[8]) & b_ptr[8]), [bv2] "m"(*(const float (*)[8]) & b_ptr[16]),
[bv3] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17");
}
const uint32_t scale_raw0 = (uint32_t) blk0->d;
const uint32_t scale_raw1 = (uint32_t) blk1->d;
__asm__ volatile(
"fbcx.ps f24, %[s0]\n"
"fcvt.ps.f16 f24, f24\n"
"fmadd.ps f20, f10, f24, f20\n"
"fbcx.ps f25, %[s1]\n"
"fcvt.ps.f16 f25, f25\n"
"fmadd.ps f21, f11, f25, f21\n"
:
: [s0] "r"(scale_raw0), [s1] "r"(scale_raw1)
: "f20", "f21", "f24", "f25");
}
float result0;
float result1;
__asm__ __volatile__(
"fswizz.ps f1, f20, 0xB1 \n\t"
"fadd.ps f2, f20, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result0)::"t0", "f1", "f2", "f3", "f4", "f5");
__asm__ __volatile__(
"fswizz.ps f1, f21, 0xB1 \n\t"
"fadd.ps f2, f21, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result1)::"t0", "f1", "f2", "f3", "f4", "f5");
*out0 = result0;
*out1 = result1;
}
// Compute dot product between f16 block and f32 column vector (NAIVE VERSION)
// Scalar implementation for debugging - no vectorization
// Block size: 32 f16 values (64 bytes = 1 cache line)
static inline float compute_block_dot_product_f16_naive(const uint16_t * a_block, const float * b_col_start) {
float acc_vec[8] __attribute__((aligned(32))) = { 0.0f };
// Byte offsets for 16-bit (half-word) elements
static const int32_t gather_pattern[8] = { 0, 2, 4, 6, 8, 10, 12, 14 };
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
// Load the pattern once into f31 for the duration of all 4 chunks
__asm__ volatile("flw.ps f31, %[gather]\n" : : [gather] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
for (int chunk = 0; chunk < 4; chunk++) {
// Correct pointers:
// a_block elements are 2 bytes, b_col elements are 4 bytes
const uint16_t * a_ptr = &a_block[chunk << 3]; // chunk * 8
const float * b_ptr = &b_col_start[chunk << 3]; // chunk * 8
__asm__ volatile(
"flw.ps f10, %[acc]\n"
"fgh.ps f11, f31(%[a_p])\n" // Uses {0,2,4,6,8,10,12,14} byte offsets
"fcvt.ps.f16 f11, f11\n"
"flw.ps f12, (%[b_p])\n" // Standard vector load (32-bit floats)
"fmadd.ps f10, f11, f12, f10\n"
"fsw.ps f10, %[result]\n"
: [result] "=m"(*(float (*)[8]) acc_vec)
: [acc] "m"(*(const float (*)[8]) acc_vec), [a_p] "r"(a_ptr), [b_p] "r"(b_ptr)
: "f10", "f11", "f12");
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
return acc_vec[0] + acc_vec[1] + acc_vec[2] + acc_vec[3] + acc_vec[4] + acc_vec[5] + acc_vec[6] + acc_vec[7];
}
// Compute dot product between f16 block and f32 column vector
// SCALAR implementation for partial blocks
// Block size: up to 32 f16 values (can handle partial blocks for misaligned K)
static inline float compute_block_dot_product_f16_partial(const uint16_t * a_block,
const float * b_col_start,
int elements) {
// This matches compute_block_dot_product_f16_naive behavior
float sum = 0.0f;
for (int i = 0; i < elements; i++) {
float a_val = fp16_to_fp32(a_block[i]);
float b_val = b_col_start[i];
sum += a_val * b_val;
}
return sum;
}
// Compute dot product between f16 block and f16 column vector
// Scalar implementation for generic non-matrix-engine fallback paths.
static inline float compute_block_dot_product_f16_f16_partial(const uint16_t * a_block,
const uint16_t * b_col_start,
int elements) {
float sum = 0.0f;
for (int i = 0; i < elements; i++) {
sum += fp16_to_fp32(a_block[i]) * fp16_to_fp32(b_col_start[i]);
}
return sum;
}
// Compute dot product between f16 block and f32 column vector
// Vectorized: processes 8 elements at a time using ET vector instructions
// Block size: 32 f16 values (64 bytes = 1 cache line)
static inline float compute_block_dot_product_f16(const uint16_t * a_block, const float * b_col_start) {
return compute_block_dot_product_f16_partial(a_block, b_col_start, QK_F16);
}
// Compute dot product between f32 block and f32 column vector
// Vectorized: processes 8 elements at a time using ET vector instructions
// Block size: up to 16 f32 values (can handle partial blocks for misaligned K)
static inline float compute_block_dot_product_f32_partial(const float * a_block,
const float * b_col_start,
int elements) {
float acc_vec[8] = { 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f }; // Accumulator vector
// Calculate how many full 8-element chunks we can process
int vec_end = (elements / 8) * 8;
if (vec_end > 0) {
// Set mask register to enable all 8 vector elements
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
// Process full 8-element chunks
for (int i = 0; i < vec_end; i += 8) {
// Vectorized f32 multiply-accumulate
__asm__ volatile(
"flw.ps f10, %[acc]\n" // Load current accumulator (8 floats)
"flw.ps f11, %[a_vec]\n" // Load 8 A values (f32)
"flw.ps f12, %[b_vec]\n" // Load 8 B values (f32)
"fmadd.ps f10, f11, f12, f10\n" // acc += a_vec * b_vec (8-wide)
"fsw.ps f10, %[result]\n" // Store back to accumulator
: [result] "=m"(*(float (*)[8]) acc_vec)
: [acc] "m"(*(const float (*)[8]) acc_vec), [a_vec] "m"(*(const float (*)[8])(a_block + i)),
[b_vec] "m"(*(const float (*)[8])(b_col_start + i))
: "f10", "f11", "f12");
}
// Restore original mask
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
}
// Horizontal sum: reduce 8 accumulator elements to single scalar
float final_sum = 0.0f;
for (int i = 0; i < 8; i++) {
final_sum += acc_vec[i];
}
// Handle remaining elements (< 8) with scalar operations
for (int i = vec_end; i < elements; i++) {
final_sum += a_block[i] * b_col_start[i];
}
return final_sum;
}
// Compute dot product between f32 block and f16 column vector
// Scalar implementation for generic non-matrix-engine fallback paths.
static inline float compute_block_dot_product_f32_f16_partial(const float * a_block,
const uint16_t * b_col_start,
int elements) {
float sum = 0.0f;
for (int i = 0; i < elements; i++) {
sum += a_block[i] * fp16_to_fp32(b_col_start[i]);
}
return sum;
}
// Compute dot product between f32 block and f32 column vector
// Vectorized: processes 8 elements at a time using ET vector instructions
// Block size: 16 f32 values (64 bytes = 1 cache line)
static inline float compute_block_dot_product_f32(const float * a_block, const float * b_col_start) {
return compute_block_dot_product_f32_partial(a_block, b_col_start, QK_F32);
// float acc_vec[8];
// unsigned long old_mask;
// __asm__ volatile(
// // Save current mask
// "mova.x.m %[old_mask]\n"
// // Enable all 8 lanes
// "mov.m.x m0, x0, 0xFF\n"
// "flw.ps f11, %[a]\n"
// "flw.ps f12, %[b]\n"
// "fmadd.ps f10, f11, f12, f10\n"
// "fsw.ps f10, %[out]\n"
// "mova.m.x %[old_mask]\n"
// : [out] "=m" (*(float(*)[8])acc_vec),
// [old_mask] "=r"(old_mask)
// : [a] "m" (*(const float(*)[8])a_block),
// [b] "m" (*(const float(*)[8])b_col_start)
// : "f10", "f11", "f12"
// );
// // Horizontal reduction
// return acc_vec[0] + acc_vec[1] + acc_vec[2] + acc_vec[3] +
// acc_vec[4] + acc_vec[5] + acc_vec[6] + acc_vec[7];
}
#endif // BLOCK_OPS_H
static inline void __attribute__((always_inline)) q4_dot_reset(void) {
__asm__ volatile("fbci.pi f20, 0" ::: "f20");
}
static inline void __attribute__((always_inline)) q4_dot_tile(const block_q4_0 * q_row,
const float * b_col,
int64_t n_blocks) {
const int32_t gather_pattern[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
__asm__ volatile("flw.ps f31, %[g]\n" : : [g] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
for (int64_t kb = 0; kb < n_blocks; kb++) {
const block_q4_0 * blk = q_row + kb;
const float * b_ptr = b_col + (kb << 5);
__asm__ volatile(
"fbci.pi f10, 0\n"
"fgb.ps f11, f31(%[a_ptr0])\n"
"fandi.pi f12, f11, 15\n"
"faddi.pi f12, f12, -8\n"
"fcvt.ps.pw f12, f12, rne\n"
"flw.ps f13, %[b_low0]\n"
"fmadd.ps f10, f12, f13, f10, rne\n"
"fsrli.pi f14, f11, 4\n"
"fandi.pi f14, f14, 15\n"
"faddi.pi f14, f14, -8\n"
"fcvt.ps.pw f14, f14, rne\n"
"flw.ps f15, %[b_high0]\n"
"fmadd.ps f10, f14, f15, f10, rne\n"
"fgb.ps f11, f31(%[a_ptr1])\n"
"fandi.pi f12, f11, 15\n"
"faddi.pi f12, f12, -8\n"
"fcvt.ps.pw f12, f12, rne\n"
"flw.ps f13, %[b_low1]\n"
"fmadd.ps f10, f12, f13, f10, rne\n"
"fsrli.pi f14, f11, 4\n"
"fandi.pi f14, f14, 15\n"
"faddi.pi f14, f14, -8\n"
"fcvt.ps.pw f14, f14, rne\n"
"flw.ps f15, %[b_high1]\n"
"fmadd.ps f10, f14, f15, f10, rne\n"
:
: [a_ptr0] "r"(&blk->qs[0]), [b_low0] "m"(*(const float (*)[8]) & b_ptr[0]),
[b_high0] "m"(*(const float (*)[8]) & b_ptr[16]), [a_ptr1] "r"(&blk->qs[8]),
[b_low1] "m"(*(const float (*)[8]) & b_ptr[8]), [b_high1] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12", "f13", "f14", "f15");
uint32_t scale_raw = (uint32_t) blk->d;
__asm__ volatile(
"fbcx.ps f15, %[sb]\n"
"fcvt.ps.f16 f15, f15\n"
"fmadd.ps f20, f10, f15, f20\n"
:
: [sb] "r"(scale_raw)
: "f15", "f20");
}
}
static inline float __attribute__((always_inline)) q4_dot_reduce(void) {
float result;
__asm__ __volatile__(
"fswizz.ps f1, f20, 0xB1 \n\t"
"fadd.ps f2, f20, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result)::"t0", "f1", "f2", "f3", "f4", "f5");
return result;
}
static inline float compute_row_dot_q4_0(const block_q4_0 * q_row, const float * b_col, int64_t K_blocks) {
unsigned long saved_mask;
__asm__ volatile("mova.x.m %0" : "=r"(saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
q4_dot_reset();
q4_dot_tile(q_row, b_col, K_blocks);
float result = q4_dot_reduce();
__asm__ volatile("mova.m.x %0" ::"r"(saved_mask));
return result;
}
typedef struct {
unsigned long saved_mask;
} q4_dot_state;
static inline void q4_dot_begin(q4_dot_state * state) {
__asm__ volatile("mova.x.m %0" : "=r"(state->saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
}
static inline void q4_dot_end(const q4_dot_state * state) {
__asm__ volatile("mova.m.x %0" ::"r"(state->saved_mask));
}
static inline float q4_dot_compute(const block_q4_0 * q_row, const float * b_col, int64_t K_blocks) {
q4_dot_reset();
q4_dot_tile(q_row, b_col, K_blocks);
return q4_dot_reduce();
}
static inline void q4_dot_compute_x2_aligned(const block_q4_0 * q_row0,
const block_q4_0 * q_row1,
const float * b_col,
int64_t K_blocks,
float * out0,
float * out1) {
const int32_t gather_pattern[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
__asm__ volatile("flw.ps f31, %[g]\n" : : [g] "m"(*(const int32_t (*)[8]) gather_pattern) : "f31");
__asm__ volatile(
"fbci.pi f20, 0\n"
"fbci.pi f21, 0\n" ::
: "f20", "f21");
for (int64_t kb = 0; kb < K_blocks; kb++) {
const block_q4_0 * blk0 = q_row0 + kb;
const block_q4_0 * blk1 = q_row1 + kb;
const float * b_ptr = b_col + (kb << 5);
__asm__ volatile(
"fbci.pi f10, 0\n"
"fbci.pi f16, 0\n"
"flw.ps f13, %[b_low0]\n"
"flw.ps f15, %[b_high0]\n"
"fgb.ps f11, f31(%[a_ptr0_0])\n"
"fgb.ps f17, f31(%[a_ptr1_0])\n"
"fandi.pi f12, f11, 15\n"
"faddi.pi f12, f12, -8\n"
"fcvt.ps.pw f12, f12, rne\n"
"fmadd.ps f10, f12, f13, f10, rne\n"
"fandi.pi f18, f17, 15\n"
"faddi.pi f18, f18, -8\n"
"fcvt.ps.pw f18, f18, rne\n"
"fmadd.ps f16, f18, f13, f16, rne\n"
"fsrli.pi f14, f11, 4\n"
"fandi.pi f14, f14, 15\n"
"faddi.pi f14, f14, -8\n"
"fcvt.ps.pw f14, f14, rne\n"
"fmadd.ps f10, f14, f15, f10, rne\n"
"fsrli.pi f19, f17, 4\n"
"fandi.pi f19, f19, 15\n"
"faddi.pi f19, f19, -8\n"
"fcvt.ps.pw f19, f19, rne\n"
"fmadd.ps f16, f19, f15, f16, rne\n"
"flw.ps f13, %[b_low1]\n"
"flw.ps f15, %[b_high1]\n"
"fgb.ps f11, f31(%[a_ptr0_1])\n"
"fgb.ps f17, f31(%[a_ptr1_1])\n"
"fandi.pi f12, f11, 15\n"
"faddi.pi f12, f12, -8\n"
"fcvt.ps.pw f12, f12, rne\n"
"fmadd.ps f10, f12, f13, f10, rne\n"
"fandi.pi f18, f17, 15\n"
"faddi.pi f18, f18, -8\n"
"fcvt.ps.pw f18, f18, rne\n"
"fmadd.ps f16, f18, f13, f16, rne\n"
"fsrli.pi f14, f11, 4\n"
"fandi.pi f14, f14, 15\n"
"faddi.pi f14, f14, -8\n"
"fcvt.ps.pw f14, f14, rne\n"
"fmadd.ps f10, f14, f15, f10, rne\n"
"fsrli.pi f19, f17, 4\n"
"fandi.pi f19, f19, 15\n"
"faddi.pi f19, f19, -8\n"
"fcvt.ps.pw f19, f19, rne\n"
"fmadd.ps f16, f19, f15, f16, rne\n"
:
: [a_ptr0_0] "r"(&blk0->qs[0]), [a_ptr0_1] "r"(&blk0->qs[8]), [a_ptr1_0] "r"(&blk1->qs[0]),
[a_ptr1_1] "r"(&blk1->qs[8]), [b_low0] "m"(*(const float (*)[8]) & b_ptr[0]),
[b_high0] "m"(*(const float (*)[8]) & b_ptr[16]), [b_low1] "m"(*(const float (*)[8]) & b_ptr[8]),
[b_high1] "m"(*(const float (*)[8]) & b_ptr[24])
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17", "f18", "f19");
const uint32_t scale_raw0 = (uint32_t) blk0->d;
const uint32_t scale_raw1 = (uint32_t) blk1->d;
__asm__ volatile(
"fbcx.ps f24, %[s0]\n"
"fcvt.ps.f16 f24, f24\n"
"fmadd.ps f20, f10, f24, f20\n"
"fbcx.ps f25, %[s1]\n"
"fcvt.ps.f16 f25, f25\n"
"fmadd.ps f21, f16, f25, f21\n"
:
: [s0] "r"(scale_raw0), [s1] "r"(scale_raw1)
: "f20", "f21", "f24", "f25");
}
float result0, result1;
__asm__ __volatile__(
"fswizz.ps f1, f20, 0xB1 \n\t"
"fadd.ps f2, f20, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result0)::"t0", "f1", "f2", "f3", "f4", "f5");
__asm__ __volatile__(
"fswizz.ps f1, f21, 0xB1 \n\t"
"fadd.ps f2, f21, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result1)::"t0", "f1", "f2", "f3", "f4", "f5");
*out0 = result0;
*out1 = result1;
}
-120
View File
@@ -1,120 +0,0 @@
//******************************************************************************
// CLAMP F32 Kernel
// Element-wise: dst[i] = min(max(src0[i], min_val), max_val)
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_clamp_params {
struct ggml_tensor src0; // F32 input (contiguous)
struct ggml_tensor dst; // F32 output (contiguous; may alias src0.data)
float min_val;
float max_val;
};
// Vectorized fmax/fmin clamp with scalar tail. n may be any non-negative int.
static inline void clamp_block_f32(float * dst, const float * src, float min_val, float max_val, int32_t n) {
int32_t i = 0;
const int32_t vec_end = (n / 8) * 8;
if (vec_end > 0) {
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
for (; i < vec_end; i += 8) {
__asm__ volatile(
"flw.ps f10, %[s]\n"
"fbc.ps f11, %[mn]\n"
"fbc.ps f12, %[mx]\n"
"fmax.ps f13, f10, f11\n"
"fmin.ps f13, f13, f12\n"
"fsw.ps f13, %[d]\n"
: [d] "=m"(*(float (*)[8]) & dst[i])
: [s] "m"(*(const float (*)[8]) & src[i]), [mn] "m"(min_val), [mx] "m"(max_val)
: "f10", "f11", "f12", "f13");
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
}
for (; i < n; i++) {
float v = src[i];
if (v < min_val) {
v = min_val;
}
if (v > max_val) {
v = max_val;
}
dst[i] = v;
}
}
int entry_point(struct ggml_et_clamp_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1;
}
const int64_t total_elements = src0->ne[0] * src0->ne[1] * src0->ne[2] * src0->ne[3];
if (total_elements <= 0) {
return 0;
}
const float min_val = params->min_val;
const float max_val = params->max_val;
// Distribute by cache lines (16 F32 elements). Each thread owns disjoint
// cache lines, so a partial trailing line is written by exactly one
// thread — safe under non-coherent caches.
const int64_t elems_per_cl = 16;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t cl_per_thread = (total_cl + num_threads - 1) / num_threads;
const int64_t cl_start = (int64_t) thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cl) {
cl_end = total_cl;
}
if (cl_start >= total_cl) {
return 0;
}
const int64_t es = cl_start * elems_per_cl;
int64_t ee = cl_end * elems_per_cl;
if (ee > total_elements) {
ee = total_elements;
}
clamp_block_f32(dst_data + es, src0_data + es, min_val, max_val, (int32_t) (ee - es));
return 0;
}
@@ -1,175 +0,0 @@
//******************************************************************************
// Concat F32 Kernel
// Concatenates two F32 tensors along a specified dimension.
// All copies are aligned to cacheline boundaries (64 bytes = 16 floats).
//
// For dim >= 1, entire rows are copied from src0 or src1 into dst.
// For dim == 0, use:
// - a fast vector path when both source row segments are cacheline-aligned
// - a scalar stride-aware path otherwise
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
#include <string.h>
struct ggml_et_concat_params {
struct ggml_tensor src0; // F32 input tensor 0
struct ggml_tensor src1; // F32 input tensor 1
struct ggml_tensor dst; // F32 output tensor
int32_t dim; // Concatenation dimension
};
// Copy n floats from src to dst using 8-wide vector loads/stores.
// n must be a multiple of 16 (cacheline-aligned).
static inline void copy_row_aligned(float * dst, const float * src, int32_t n) {
for (int32_t i = 0; i < n; i += 8) {
__asm__ volatile(
"flw.ps f11, %[src_vec]\n"
"fsw.ps f11, %[dst_vec]\n"
: [dst_vec] "=m"(*(float (*)[8]) & dst[i])
: [src_vec] "m"(*(const float (*)[8]) & src[i])
: "f11");
}
}
int entry_point(struct ggml_et_concat_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * src1 = &params->src1;
struct ggml_tensor * dst = &params->dst;
int32_t dim = params->dim;
if (src0->type != GGML_TYPE_F32 || src1->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
float * src0_data = (float *) src0->data;
float * src1_data = (float *) src1->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !src1_data || !dst_data) {
return -1;
}
const int64_t ne00 = src0->ne[0], ne01 = src0->ne[1], ne02 = src0->ne[2], ne03 = src0->ne[3];
const int64_t ne10 = src1->ne[0], ne11 = src1->ne[1], ne12 = src1->ne[2], ne13 = src1->ne[3];
const int64_t ne0 = dst->ne[0], ne1 = dst->ne[1], ne2 = dst->ne[2], ne3 = dst->ne[3];
// src strides in bytes
const size_t nb00 = src0->nb[0], nb01 = src0->nb[1], nb02 = src0->nb[2], nb03 = src0->nb[3];
const size_t nb10 = src1->nb[0], nb11 = src1->nb[1], nb12 = src1->nb[2], nb13 = src1->nb[3];
// dst strides in bytes
const size_t dnb1 = dst->nb[1], dnb2 = dst->nb[2], dnb3 = dst->nb[3];
// Total rows across all higher dimensions
const int64_t total_rows = ne1 * ne2 * ne3;
// Generic slow path for dim==0 when either source segment is not suitable for
// aligned vector copies. Threading is done by cacheline-aligned row groups,
// so writers do not share destination cache lines.
if (dim == 0 && (ne00 % 16 != 0 || ne10 % 16 != 0 || nb00 != sizeof(float) || nb10 != sizeof(float))) {
const int64_t rows_per_group = et_rows_per_cacheline_group(ne0, sizeof(float));
const int64_t total_groups = (total_rows + rows_per_group - 1) / rows_per_group;
for (int64_t grp = thread_id; grp < total_groups; grp += num_threads) {
const int64_t row_start = grp * rows_per_group;
int64_t row_end = row_start + rows_per_group;
if (row_end > total_rows) {
row_end = total_rows;
}
for (int64_t row = row_start; row < row_end; row++) {
int64_t i1 = row % ne1;
int64_t i2 = (row / ne1) % ne2;
int64_t i3 = row / (ne1 * ne2);
float * dst_row = (float *) ((char *) dst_data + i1 * dnb1 + i2 * dnb2 + i3 * dnb3);
const char * s0_base = (const char *) src0_data + i1 * nb01 + i2 * nb02 + i3 * nb03;
for (int64_t i0 = 0; i0 < ne00; i0++) {
dst_row[i0] = *(const float *) (s0_base + i0 * nb00);
}
const char * s1_base = (const char *) src1_data + i1 * nb11 + i2 * nb12 + i3 * nb13;
for (int64_t i0 = 0; i0 < ne10; i0++) {
dst_row[ne00 + i0] = *(const float *) (s1_base + i0 * nb10);
}
}
}
return 0;
}
// Standard path: ne0 % 16 == 0, aligned rows
for (int64_t row = thread_id; row < total_rows; row += num_threads) {
// Decompose linear row index into (i1, i2, i3)
int64_t i1 = row % ne1;
int64_t i2 = (row / ne1) % ne2;
int64_t i3 = row / (ne1 * ne2);
float * dst_row = (float *) ((char *) dst_data + i1 * dnb1 + i2 * dnb2 + i3 * dnb3);
if (dim == 0) {
// Concat along innermost dimension: [src0_row | src1_row]
// Both ne00 and ne10 are multiples of 16 (cacheline-aligned)
const float * s0_row = (const float *) ((const char *) src0_data + i1 * nb01 + i2 * nb02 + i3 * nb03);
const float * s1_row = (const float *) ((const char *) src1_data + i1 * nb11 + i2 * nb12 + i3 * nb13);
copy_row_aligned(dst_row, s0_row, (int32_t) ne00);
copy_row_aligned(dst_row + ne00, s1_row, (int32_t) ne10);
} else if (dim == 1) {
// Concat along dim 1: first ne01 rows from src0, rest from src1
if (i1 < ne01) {
const float * s0_row = (const float *) ((const char *) src0_data + i1 * nb01 + i2 * nb02 + i3 * nb03);
copy_row_aligned(dst_row, s0_row, (int32_t) ne0);
} else {
const float * s1_row =
(const float *) ((const char *) src1_data + (i1 - ne01) * nb11 + i2 * nb12 + i3 * nb13);
copy_row_aligned(dst_row, s1_row, (int32_t) ne0);
}
} else if (dim == 2) {
// Concat along dim 2: first ne02 slices from src0, rest from src1
if (i2 < ne02) {
const float * s0_row = (const float *) ((const char *) src0_data + i1 * nb01 + i2 * nb02 + i3 * nb03);
copy_row_aligned(dst_row, s0_row, (int32_t) ne0);
} else {
const float * s1_row =
(const float *) ((const char *) src1_data + i1 * nb11 + (i2 - ne02) * nb12 + i3 * nb13);
copy_row_aligned(dst_row, s1_row, (int32_t) ne0);
}
} else {
// dim == 3: first ne03 batches from src0, rest from src1
if (i3 < ne03) {
const float * s0_row = (const float *) ((const char *) src0_data + i1 * nb01 + i2 * nb02 + i3 * nb03);
copy_row_aligned(dst_row, s0_row, (int32_t) ne0);
} else {
const float * s1_row =
(const float *) ((const char *) src1_data + i1 * nb11 + i2 * nb12 + (i3 - ne03) * nb13);
copy_row_aligned(dst_row, s1_row, (int32_t) ne0);
}
}
}
return 0;
}
-107
View File
@@ -1,107 +0,0 @@
//******************************************************************************
// Bare Metal CONT F16 Kernel
// Converts non-contiguous F16 tensors to contiguous memory layout
//
// Note: F16 is represented as uint16_t (IEEE 754 binary16 format)
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
struct ggml_et_cont_params {
struct ggml_tensor src0; // F16 input tensor (non-contiguous)
struct ggml_tensor dst; // F16 output tensor (contiguous)
};
int entry_point(struct ggml_et_cont_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = 2048; //get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1; // Invalid pointer
}
struct ggml_tensor * src0 = &params->src0; // Non-contiguous input
struct ggml_tensor * dst = &params->dst; // Contiguous output
if (src0->type != GGML_TYPE_F16 || dst->type != GGML_TYPE_F16) {
return -1; // Unsupported type combination
}
uint16_t * src0_data = (uint16_t *) src0->data;
uint16_t * dst_data = (uint16_t *) dst->data;
if (!src0_data || !dst_data) {
return -1; // Null data pointer
}
const int64_t src_elements = src0->ne[0] * src0->ne[1] * src0->ne[2] * src0->ne[3];
const int64_t dst_elements = dst->ne[0] * dst->ne[1] * dst->ne[2] * dst->ne[3];
if (src_elements != dst_elements) {
return -1; // Element count mismatch
}
// Source tensor dimensions and strides
const int64_t ne00 = src0->ne[0];
const int64_t ne01 = src0->ne[1];
const int64_t ne02 = src0->ne[2];
const int64_t ne03 = src0->ne[3];
const int64_t nb00 = src0->nb[0];
const int64_t nb01 = src0->nb[1];
const int64_t nb02 = src0->nb[2];
const int64_t nb03 = src0->nb[3];
// Parallelize by rows (dimension 1)
const int64_t total_rows = ne01;
const int64_t rows_per_thread = (total_rows + num_threads - 1) / num_threads;
const int64_t start_row = thread_id * rows_per_thread;
const int64_t end_row = (start_row + rows_per_thread < total_rows) ? (start_row + rows_per_thread) : total_rows;
if (start_row >= total_rows) {
return 0;
}
// Iterate over source tensor dimensions
for (int64_t i03 = 0; i03 < ne03; i03++) {
for (int64_t i02 = 0; i02 < ne02; i02++) {
// Calculate base linear index for this (i03, i02) slice in destination
const int64_t dst_linear_base = i03 * ne02 * ne01 * ne00 + i02 * ne01 * ne00;
// Process this thread's assigned rows
for (int64_t i01 = start_row; i01 < end_row; i01++) {
// Linear index for start of this row in destination
const int64_t dst_linear_row_base = dst_linear_base + i01 * ne00;
// Inner loop over dimension 0
for (int64_t i00 = 0; i00 < ne00; i00++) {
// Source offset using non-contiguous strides
const int64_t src_offset_bytes = i00 * nb00 + i01 * nb01 + i02 * nb02 + i03 * nb03;
const uint16_t * src_ptr = (const uint16_t *) ((const char *) src0_data + src_offset_bytes);
// Destination linear index (contiguous layout)
const int64_t dst_linear_idx = dst_linear_row_base + i00;
// Use atomic store for thread safety
atomic_store_f16((volatile uint16_t *) &dst_data[dst_linear_idx], *src_ptr);
}
}
}
}
return 0;
}
-248
View File
@@ -1,248 +0,0 @@
//******************************************************************************
// Bare Metal CONT F32 Kernel
// Converts non-contiguous tensors to contiguous memory layout
//
// Fast path: src contiguous: flat vectorized copy by cache lines
// Aligned path: nb00==4 and ne00 % 16 == 0: distribute rows, no coherency issue
// Unaligned: nb00==4 and ne00 not aligned: distribute by cache lines,
// reverse-compute src coords, handle partial rows at boundaries
// Fallback: nb00 != 4: scalar per-element
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdbool.h>
#include <stdint.h>
struct ggml_et_cont_params {
struct ggml_tensor src0; // F32 input tensor (non-contiguous)
struct ggml_tensor dst; // F32 output tensor (contiguous)
};
// Vectorized copy with scalar tail
static inline void vec_copy_f32(float * dst, const float * src, int32_t n) {
int32_t i = 0;
const int32_t vec_end = (n / 8) * 8;
for (; i < vec_end; i += 8) {
__asm__ volatile(
"flw.ps f10, %[s]\n"
"fsw.ps f10, %[d]\n"
: [d] "=m"(*(float (*)[8]) & dst[i])
: [s] "m"(*(const float (*)[8]) & src[i])
: "f10");
}
for (; i < n; i++) {
dst[i] = src[i];
}
}
// Scalar copy
static inline void scalar_copy_f32(float * dst, const float * src, int32_t n) {
for (int32_t i = 0; i < n; i++) {
dst[i] = src[i];
}
}
// static inline size_t tensor_bytes(const struct ggml_tensor *t) {
// return (size_t)t->ne[0] * t->ne[1] * t->ne[2] * t->ne[3] * t->nb[0];
// }
int entry_point(struct ggml_et_cont_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
// evict_region_past_l2(src0_data, tensor_bytes(src0));
if (!src0_data || !dst_data) {
return -1;
}
const int64_t ne00 = src0->ne[0];
const int64_t ne01 = src0->ne[1];
const int64_t ne02 = src0->ne[2];
const int64_t ne03 = src0->ne[3];
const int64_t nb00 = src0->nb[0];
const int64_t nb01 = src0->nb[1];
const int64_t nb02 = src0->nb[2];
const int64_t nb03 = src0->nb[3];
const int64_t total_elements = ne00 * ne01 * ne02 * ne03;
if (total_elements == 0) {
return 0;
}
const bool src_contiguous = ggml_tensor_is_contiguous(src0, 4);
//==========================================================================
// Fast path: src is contiguous: flat vectorized copy by cache lines
//==========================================================================
if (src_contiguous) {
const int64_t elems_per_cl = 16;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t cl_per_thread = (total_cl + num_threads - 1) / num_threads;
const int64_t cl_start = thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cl) {
cl_end = total_cl;
}
if (cl_start >= total_cl) {
return 0;
}
const int64_t es = cl_start * elems_per_cl;
int64_t ee = cl_end * elems_per_cl;
if (ee > total_elements) {
ee = total_elements;
}
vec_copy_f32(dst_data + es, src0_data + es, (int32_t) (ee - es));
return 0;
}
//==========================================================================
// Non-contiguous paths: require nb00==4 (dim 0 contiguous in src)
//==========================================================================
if (nb00 != 4) {
// Fully non-contiguous scalar fallback — distribute by cache lines
const int64_t elems_per_cl = 16;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t cl_per_thread = (total_cl + num_threads - 1) / num_threads;
const int64_t cl_start = thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cl) {
cl_end = total_cl;
}
if (cl_start >= total_cl) {
return 0;
}
const int64_t es = cl_start * elems_per_cl;
int64_t ee = cl_end * elems_per_cl;
if (ee > total_elements) {
ee = total_elements;
}
for (int64_t idx = es; idx < ee; idx++) {
const int64_t i00 = idx % ne00;
const int64_t rem1 = idx / ne00;
const int64_t i01 = rem1 % ne01;
const int64_t rem2 = rem1 / ne01;
const int64_t i02 = rem2 % ne02;
const int64_t i03 = rem2 / ne02;
const float * sp =
(const float *) ((const char *) src0_data + i00 * nb00 + i01 * nb01 + i02 * nb02 + i03 * nb03);
dst_data[idx] = *sp;
}
return 0;
}
// nb00 == 4 from here: dim 0 is contiguous in src
//==========================================================================
// Aligned path: ne00 % 16 == 0: rows are cache-line aligned, distribute rows
//==========================================================================
if (ne00 % 16 == 0) {
const int64_t total_rows = ne01 * ne02 * ne03;
const int64_t rows_per_thread = (total_rows + num_threads - 1) / num_threads;
const int64_t start_row = thread_id * rows_per_thread;
const int64_t end_row = (start_row + rows_per_thread < total_rows) ? (start_row + rows_per_thread) : total_rows;
if (start_row >= total_rows) {
return 0;
}
for (int64_t ir = start_row; ir < end_row; ir++) {
const int64_t i03 = ir / (ne02 * ne01);
const int64_t i02 = (ir - i03 * ne02 * ne01) / ne01;
const int64_t i01 = ir - i03 * ne02 * ne01 - i02 * ne01;
const float * src_row = (const float *) ((const char *) src0_data + i01 * nb01 + i02 * nb02 + i03 * nb03);
float * dst_row = dst_data + ir * ne00;
vec_copy_f32(dst_row, src_row, (int32_t) ne00);
}
return 0;
}
//==========================================================================
// Unaligned path: ne00 % 16 != 0, nb00 == 4
// Distribute cache-line-aligned chunks of dst, handle partial rows at edges
//==========================================================================
{
const int64_t elems_per_cl = 16;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t cl_per_thread = (total_cl + num_threads - 1) / num_threads;
const int64_t cl_start = thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cl) {
cl_end = total_cl;
}
if (cl_start >= total_cl) {
return 0;
}
const int64_t es = cl_start * elems_per_cl;
int64_t ee = cl_end * elems_per_cl;
if (ee > total_elements) {
ee = total_elements;
}
int64_t pos = es;
// Compute starting row coordinates
int64_t row_idx = pos / ne00;
int64_t col = pos % ne00;
while (pos < ee) {
// Decompose row_idx -> (i01, i02, i03)
const int64_t i03 = row_idx / (ne02 * ne01);
const int64_t i02 = (row_idx - i03 * ne02 * ne01) / ne01;
const int64_t i01 = row_idx - i03 * ne02 * ne01 - i02 * ne01;
const float * src_row = (const float *) ((const char *) src0_data + i01 * nb01 + i02 * nb02 + i03 * nb03);
// How many elements left in this row and in our chunk
int64_t row_remaining = ne00 - col;
int64_t chunk_remaining = ee - pos;
int32_t n = (int32_t) (row_remaining < chunk_remaining ? row_remaining : chunk_remaining);
vec_copy_f32(dst_data + pos, src_row + col, n);
pos += n;
col = 0; // subsequent rows start at column 0
row_idx++;
}
}
return 0;
}
@@ -1,807 +0,0 @@
//******************************************************************************
// 2D F32 convolution on the ET-SoC-1 matrix engine (GGML CONV_2D layout).
//
// LAYOUT (matches GGML's standard CONV_2D, cwhn=false; wireable directly):
// src1 input : ne = [W, H, Cin, N=1] memory: input [n][cin][h][w]
// src0 filter: ne = [Kw, Kh, Cin, Cout] memory: filter[oc][ic][kh][kw]
// dst output: ne = [W, H, Cout, N=1] memory: output[n][oc][h][w]
//
// CONSTRAINTS (enforced at supports_op):
// F32 throughout, N == 1, Cin % 16 == 0, Cout % 16 == 0, positive
// stride/pad, dilation == 1. Tile/L2SCP limits are checked here.
//
// MEMORY MODEL:
// Each active shire uses its own 2 MB local L2 SCP:
// filter slice | pin buffer 0 | pin buffer 1? | output staging? | scratch
//
// The filter slice contains only the output-channel tiles (`mt`) consumed
// by this shire's tile assignment. That keeps hart-0's inner-loop
// tensor_loads local to the shire and avoids packing unused filter slabs.
//
// THREADING (multi-minion, multi-shire):
// PHASE 1 (per-shire filter pack): hart-1's pack this shire's filter
// slice into local L2 SCP. Work is slab-striped across the 32 minions.
//
// PHASE 2 (per-shire compute): hart-1's pack the input pin chunks while
// hart-0's run the matrix engine. Pin double-buffering hides the next
// chunk pack behind the current chunk's FMA pipeline when Cin does not
// fit in one local buffer.
//
// PERFORMANCE STRATEGIES:
// 1. Local filter slice: pack only the `mt` values this shire consumes;
// inner-loop tensor_loads stay shire-local.
// 2. Pin Cin streaming + chunk double-buffer: pack one
// chunk while computing the prior one.
// 3. TenC save/restore: f0..f31 IS the TenC accumulator;
// spill/refill via L2 SCP scratch lets each hart hold multiple
// partial accumulators across chunks.
// 4. OW%16 staging: for partial-tile output, write to a
// padded L2 SCP region then have one hart scalar-emit to DRAM.
//
// WHY THE FILTER PACK EXISTS:
// GGML's OIHW filter has stride Kh*Kw*4 between consecutive Cin elements
// (e.g. 36 bytes for 3x3) — usually NOT a multiple of 64, so plain
// tensor_load cannot gather it directly. The per-slab pack into a
// Cin-innermost form gives every per-tap slab a flat 64-byte row stride
// and enables tensor_load.
//
// Picking M=Cout, N=W means TenC's natural row stride matches NCHW
// output's per-channel stride (H*W*4) — the output store is a clean
// tensor_store with no transpose. The price is that conv_size/conv_ctrl
// no longer help with W boundaries (mask gates M, not N), so we handle
// boundaries up-front by zero-padding the input in L2SCP.
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include "tensor.h"
#include <etsoc/common/utils.h>
#include <stdbool.h>
#include <stdint.h>
#define TILE 16 /* matrix engine native tile in M, K, N */
/* L1 SCP layout: A double-buffered, B single-buffered. Per the SDK doc
`dst_start` is a 6-bit field (max 63) but empirical testing shows the
physical L1 SCP per minion is 48 lines writes to lines >= 48 corrupt.
So we get 3 × 16-line buffers max: A_0, A_1, B. Pick A as the
double-buffered operand (filter-slab loads, the longer of the two). */
#define LSCP_A_0 0 /* A buffer 0 at L1 SCP lines 0..15 */
#define LSCP_A_1 16 /* A buffer 1 at L1 SCP lines 16..31 */
#define LSCP_B 32 /* B (single buffer) at lines 32..47 */
#define N_MIN_PER_SHIRE 32 /* ET-SoC-1 geometry: 32 minions/shire */
#define N_SHIRES 32 /* default active shire count */
#define MAX_TILES_PER_HART 2 /* per-hart TenC slots (save/restore) */
#define MAX_DBL_BUFS 2 /* chunk pack buffers (double-buffered) */
/* Per-shire L2 SCP local budget. Per-shire SCP is 2 MB; we cap at
1984 KB to leave 64 KB headroom for per-hart TenC scratch (32 minions ×
2 slots × 1 KB), which lives at the tail of the SCP outside the pin
sizing budget. Bigger budget here means bigger feasible chunk_KT,
which means fewer chunks (each chunk costs 2 SHIRE barriers + ~30
TenC save/restore events per hart). */
#define LOCAL_BUDGET (1984 * 1024)
/* Cap on the per-shire filter region in local L2 SCP. The shire packs the
mt values it can consume under the current tile assignment, rather than
the whole Cout dimension. Reads in the inner loop are then fully
shire-local no NoC fanout. */
#define LOCAL_FILTER_CAP (1024 * 1024) /* 1 MB / shire ceiling */
#define SLAB_BYTES ((uint64_t) TILE * TILE * sizeof(float)) /* 1024 */
#define SLAB_LINES ((SLAB_BYTES + 63) / 64) /* 16 */
/* Upper bound on the number of distinct mt values a single shire may pack.
This keeps the mt list stack-resident. Shapes that need more should fall
back until the filter-slice bookkeeping is made dynamic. */
#define MAX_MY_MT (N_MIN_PER_SHIRE * MAX_TILES_PER_HART)
typedef struct {
int mt;
int mt_idx;
int oh;
int ow_base;
} conv_tile_t;
static inline int ceil_div_i32(int x, int y) {
return (x + y - 1) / y;
}
static inline int round_up_tile_i32(int x) {
return (x + TILE - 1) & ~(TILE - 1);
}
static inline int min_i32(int a, int b) {
return a < b ? a : b;
}
static inline uint64_t min_u64(uint64_t a, uint64_t b) {
return a < b ? a : b;
}
/* ===== Vector helpers for hart-1 pack ============================
Both assume dst (and src for copy) are 32-byte aligned; n is in floats.
The 8-element tail is handled scalar. f30/f31 are scratch clobbered
per-call via the asm clobber list. */
static inline void vec_zero_aligned(float * dst, int n) {
int i = 0;
const int n8 = n & ~7;
for (; i < n8; i += 8) {
__asm__ volatile(
"fsub.ps f31, f31, f31\n"
"fsw.ps f31, %[d]\n"
: [d] "=m"(*(float (*)[8]) & dst[i])
:
: "f31");
}
for (; i < n; ++i) {
dst[i] = 0.0f;
}
}
static inline void vec_copy_aligned(float * dst, const float * src, int n) {
int i = 0;
const int n8 = n & ~7;
for (; i < n8; i += 8) {
__asm__ volatile(
"flw.ps f30, %[s]\n"
"fsw.ps f30, %[d]\n"
: [d] "=m"(*(float (*)[8]) & dst[i])
: [s] "m"(*(const float (*)[8]) & src[i])
: "f30");
}
for (; i < n; ++i) {
dst[i] = src[i];
}
}
/* ===== TenC save/restore =========================================
The TenC accumulator IS the f0..f31 vector register file: row N occupies
f(2N) and f(2N+1) (two 8-fp32 vector regs per row). We save by
tensor_store-ing TILE rows × 64 bytes, and restore via 32 flw.ps after
forcing L1D to refetch from the L2SCP backing (tensor_store bypasses L1D
so the backing is always current). See feedback_tenc_save_restore.md. */
static inline void tenc_restore_from_scratch(uint64_t scr) {
FENCE;
evict_to_l2((const void *) scr, TILE, 64);
WAIT_CACHEOPS;
__asm__ volatile(
"flw.ps f0, 0(%0)\n"
"flw.ps f1, 32(%0)\n"
"flw.ps f2, 64(%0)\n"
"flw.ps f3, 96(%0)\n"
"flw.ps f4, 128(%0)\n"
"flw.ps f5, 160(%0)\n"
"flw.ps f6, 192(%0)\n"
"flw.ps f7, 224(%0)\n"
"flw.ps f8, 256(%0)\n"
"flw.ps f9, 288(%0)\n"
"flw.ps f10, 320(%0)\n"
"flw.ps f11, 352(%0)\n"
"flw.ps f12, 384(%0)\n"
"flw.ps f13, 416(%0)\n"
"flw.ps f14, 448(%0)\n"
"flw.ps f15, 480(%0)\n"
"flw.ps f16, 512(%0)\n"
"flw.ps f17, 544(%0)\n"
"flw.ps f18, 576(%0)\n"
"flw.ps f19, 608(%0)\n"
"flw.ps f20, 640(%0)\n"
"flw.ps f21, 672(%0)\n"
"flw.ps f22, 704(%0)\n"
"flw.ps f23, 736(%0)\n"
"flw.ps f24, 768(%0)\n"
"flw.ps f25, 800(%0)\n"
"flw.ps f26, 832(%0)\n"
"flw.ps f27, 864(%0)\n"
"flw.ps f28, 896(%0)\n"
"flw.ps f29, 928(%0)\n"
"flw.ps f30, 960(%0)\n"
"flw.ps f31, 992(%0)\n"
:
: "r"(scr)
: "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", "f8", "f9", "f10", "f11", "f12", "f13", "f14", "f15", "f16",
"f17", "f18", "f19", "f20", "f21", "f22", "f23", "f24", "f25", "f26", "f27", "f28", "f29", "f30", "f31",
"memory");
}
/* ===== Pin pack context ==========================================
Loop-invariant state hart-1 needs to pack one Cin chunk's worth of
pin (Kw shifted, padded copies of input rows) into local L2 SCP. The
filter is not touched in this struct; it is packed into the per-shire
local slice before the per-chunk loop begins. */
typedef struct {
const float * in_base; /* DRAM input base [Cin][H][W] */
int Kw;
int chunk_KT; /* number of K_TILES (=16-wide) per chunk */
int H, W, Hp, Wp_a;
int pad_h, pad_w, s0;
int minion; /* this hart's minion id (0..31) */
uint64_t pin_copy_floats; /* per-_s pin plane size in floats */
uint64_t l2_pad_in_buf[MAX_DBL_BUFS];
uint64_t pin_chunk_bytes; /* one chunk pin buffer's total size */
} pin_ctx_t;
static inline int find_mt_idx(const int * my_mt, int n_my_mt, int mt) {
for (int j = 0; j < n_my_mt; ++j) {
if (my_mt[j] == mt) {
return j;
}
}
return 0;
}
static inline conv_tile_t decode_tile(int t, int M_TILES, int w_tiles, const int * my_mt, int n_my_mt) {
conv_tile_t tile;
tile.mt = t % M_TILES;
t /= M_TILES;
const int wt = t % w_tiles;
t /= w_tiles;
tile.oh = t;
tile.ow_base = wt * TILE;
tile.mt_idx = find_mt_idx(my_mt, n_my_mt, tile.mt);
return tile;
}
static inline uint64_t
filter_slab_addr(uint64_t l2_filter, int Kw, int K_TILES, int n_my_mt, int mt_idx, int kh, int kw, int kt_global) {
return l2_filter + (uint64_t) ((((kh * Kw + kw) * n_my_mt + mt_idx) * K_TILES + kt_global)) * SLAB_BYTES;
}
static inline uint64_t pin_tile_addr(uint64_t l2_pad_in,
uint64_t pin_copy_bytes,
int ktc,
int kw,
int Hp,
int Wp_a,
int oh,
int ow_base,
int s1,
int kh) {
const int ir_pad = oh * s1 + kh;
return l2_pad_in + (uint64_t) kw * pin_copy_bytes +
(((uint64_t) (ktc * TILE) * Hp + ir_pad) * Wp_a + ow_base) * sizeof(float);
}
static inline char * output_tile_addr(char * out_base,
const conv_tile_t * tile,
uint64_t out_chan_stride,
uint64_t out_row_stride) {
return out_base + (size_t) (tile->mt * TILE) * out_chan_stride + (size_t) tile->oh * out_row_stride +
(size_t) tile->ow_base * sizeof(float);
}
static inline void flush_range_to_l2(const void * addr, uint64_t n_bytes) {
const uint64_t total_lines = (n_bytes + 63) / 64;
const char * fl_addr = (const char *) addr;
for (uint64_t done = 0; done < total_lines;) {
const uint64_t batch = min_u64(total_lines - done, 16);
flush_to_l2((const void *) (fl_addr + done * 64), batch, 64);
done += batch;
}
}
static inline void evict_range_past_l2(const void * addr, uint64_t n_bytes) {
const uint64_t total_lines = (n_bytes + 63) / 64;
const char * fl_addr = (const char *) addr;
for (uint64_t done = 0; done < total_lines;) {
const uint64_t batch = min_u64(total_lines - done, 16);
evict_past_l2((const void *) (fl_addr + done * 64), batch, 64);
done += batch;
}
}
/* One matrix-engine tile for one Cin chunk. This is the main optimization
surface: A is double-buffered, B is single-buffered due to L1 SCP space. */
static inline void compute_tile_chunk(uint64_t l2_filter,
uint64_t l2_pad_in,
uint64_t pin_copy_bytes,
int Kh,
int Kw,
int K_TILES,
int chunk_KT,
int kt_base,
int n_my_mt,
int Hp,
int Wp_a,
int s1,
uint64_t a_row_stride,
uint64_t b_row_stride,
const conv_tile_t * tile,
bool first_fma_clears_tenc) {
const int n_iters = Kh * Kw * chunk_KT;
const uint64_t A_BUFS[2] = { LSCP_A_0, LSCP_A_1 };
const uint64_t a_addr0 = filter_slab_addr(l2_filter, Kw, K_TILES, n_my_mt, tile->mt_idx, 0, 0, kt_base);
tensor_load(false, false, A_BUFS[0], 0, 0, a_addr0, 0, (uint64_t) (TILE - 1), a_row_stride, 0);
for (int iter = 0; iter < n_iters; ++iter) {
const int ktc = iter % chunk_KT;
const int rem = iter / chunk_KT;
const int kw = rem % Kw;
const int kh = rem / Kw;
const uint64_t b_addr =
pin_tile_addr(l2_pad_in, pin_copy_bytes, ktc, kw, Hp, Wp_a, tile->oh, tile->ow_base, s1, kh);
tensor_load(false, false, LSCP_B, 0, 0, b_addr, 0, (uint64_t) (TILE - 1), b_row_stride, 1);
tensor_wait(TENSOR_LOAD_WAIT_0);
tensor_wait(TENSOR_LOAD_WAIT_1);
if (iter + 1 < n_iters) {
const int ktc_n = (iter + 1) % chunk_KT;
const int rem_n = (iter + 1) / chunk_KT;
const int kw_n = rem_n % Kw;
const int kh_n = rem_n / Kw;
const uint64_t a_addr_n =
filter_slab_addr(l2_filter, Kw, K_TILES, n_my_mt, tile->mt_idx, kh_n, kw_n, kt_base + ktc_n);
tensor_load(false, false, A_BUFS[(iter + 1) & 1], 0, 0, a_addr_n, 0, (uint64_t) (TILE - 1), a_row_stride,
0);
}
tensor_fma(false, 3, (uint64_t) (TILE - 1), (uint64_t) (TILE - 1), 0, false, false, false, false, LSCP_B,
A_BUFS[iter & 1], 0, first_fma_clears_tenc && (iter == 0));
tensor_wait(TENSOR_FMA_WAIT);
}
}
/* Pack only the slabs this shire's tiles actually consume, into local
L2 SCP. Slab layout in the filter buffer is [Kh][Kw][n_my_mt][K_TILES]
of TILE×TILE slabs (Cin-innermost form). Distributed across the 32
hart-1's of this shire by `slab % 32 == minion`.
This deliberately favors local inner-loop reads over global filter fanout.
Depending on tile shape, two shires may pack the same mt value; keep that
tradeoff visible when experimenting with shared-filter layouts. */
static void pack_filter_local_mt(const float * flt_base,
int Kh,
int Kw,
int Cin,
int K_TILES,
const int * my_mt,
int n_my_mt,
int minion,
uint64_t l2_filter_base) {
const int n_slabs = Kh * Kw * n_my_mt * K_TILES;
const size_t kstep = (size_t) Kh * Kw; /* Cin stride in floats */
for (int slab = minion; slab < n_slabs; slab += N_MIN_PER_SHIRE) {
int t = slab;
const int kt = t % K_TILES;
t /= K_TILES;
const int mt_idx = t % n_my_mt;
t /= n_my_mt;
const int kw = t % Kw;
t /= Kw;
const int kh = t;
const int mt = my_mt[mt_idx];
const uint64_t slab_offset = (uint64_t) slab * SLAB_BYTES;
float * cell = (float *) (l2_filter_base + slab_offset);
for (int oc_in = 0; oc_in < TILE; ++oc_in) {
const int oc = mt * TILE + oc_in;
const float * src = flt_base + (((size_t) oc * Cin + (size_t) kt * TILE) * Kh + kh) * Kw + kw;
float * row = cell + (size_t) oc_in * TILE;
float scratch[TILE] __attribute__((aligned(32)));
for (int ic_in = 0; ic_in < TILE; ++ic_in) {
scratch[ic_in] = src[(size_t) ic_in * kstep];
}
vec_copy_aligned(row, scratch, TILE);
}
}
/* Flush this hart's dirty L1D lines for the slabs it wrote. */
FENCE;
for (int slab = minion; slab < n_slabs; slab += N_MIN_PER_SHIRE) {
const uint64_t slab_offset = (uint64_t) slab * SLAB_BYTES;
flush_to_l2((const void *) (l2_filter_base + slab_offset), SLAB_LINES, 64);
}
WAIT_CACHEOPS;
}
/* Pack one Cin chunk of the input pin (Kw shifted padded copies) into the
buf_idx side of local L2SCP. Work distributed across the 32 hart-1's in
the shire by `plane % 32 == minion`. The final flush_to_l2 forces L1D
write-back so hart-0's tensor_load sees the freshly written bytes. */
static void pack_pin_chunk(const pin_ctx_t * ctx, int chunk_id, int buf_idx) {
const int kt_base = chunk_id * ctx->chunk_KT;
const int Kw = ctx->Kw;
const int chunk_KT = ctx->chunk_KT;
const int H = ctx->H, W = ctx->W, Hp = ctx->Hp, Wp_a = ctx->Wp_a;
const int pad_h = ctx->pad_h, pad_w = ctx->pad_w, s0 = ctx->s0;
const int minion = ctx->minion;
/* Pin pack: Kw shifted, padded copies of input rows. Bounds [vlo, vhi)
hoisted outside the row loop so the inner loop is three regions
(zero-prefix | bulk-copy | zero-suffix) with no per-element predicate. */
float * pin0 = (float *) ctx->l2_pad_in_buf[buf_idx];
const int chunk_Cin = chunk_KT * TILE;
const int n_pin_planes = Kw * chunk_Cin;
for (int p = minion; p < n_pin_planes; p += N_MIN_PER_SHIRE) {
const int s = p / chunk_Cin;
const int icc = p % chunk_Cin;
const int ic = kt_base * TILE + icc;
float * pin_s = pin0 + (size_t) s * ctx->pin_copy_floats;
const int offset = s - pad_w;
int vlo = 0;
while (vlo < Wp_a && (s0 * vlo + offset) < 0) {
vlo++;
}
int vhi = Wp_a;
while (vhi > vlo && (s0 * (vhi - 1) + offset) >= W) {
vhi--;
}
const bool aligned = (s0 == 1) && ((vlo & 7) == 0) && (((vlo + offset) & 7) == 0);
for (int r = 0; r < Hp; ++r) {
float * row = pin_s + ((size_t) icc * Hp + r) * Wp_a;
const int real_h = r - pad_h;
if (real_h < 0 || real_h >= H) {
vec_zero_aligned(row, Wp_a);
continue;
}
const float * src_row = ctx->in_base + ((size_t) ic * H + real_h) * W;
for (int cc = 0; cc < vlo; ++cc) {
row[cc] = 0.0f;
}
if (aligned) {
vec_copy_aligned(row + vlo, src_row + vlo + offset, vhi - vlo);
} else if (s0 == 1) {
const float * csrc = src_row + vlo + offset;
const int n = vhi - vlo;
for (int cc = 0; cc < n; ++cc) {
row[vlo + cc] = csrc[cc];
}
} else {
for (int cc = vlo; cc < vhi; ++cc) {
row[cc] = src_row[s0 * cc + offset];
}
}
for (int cc = vhi; cc < Wp_a; ++cc) {
row[cc] = 0.0f;
}
}
}
/* Flush this buffer's L1D-dirty lines down to L2SCP backing. */
FENCE;
flush_range_to_l2((const void *) ctx->l2_pad_in_buf[buf_idx], ctx->pin_chunk_bytes);
WAIT_CACHEOPS;
}
int entry_point(struct ggml_et_binary_params * params, void * env) {
(void) env;
const int shire = get_shire_id();
const int hart_id = get_hart_id();
const int minion = (hart_id >> 1) & 0x1F;
const int hart1 = hart_id & 1;
const struct ggml_tensor * flt = &params->src0; /* [Kw,Kh,Cin,Cout] */
const struct ggml_tensor * in = &params->src1; /* [W, H, Cin,N=1 ] */
struct ggml_tensor * out = &params->dst; /* [W, H, Cout,N=1] */
const int Kw = (int) flt->ne[0];
const int Kh = (int) flt->ne[1];
const int Cin = (int) flt->ne[2];
const int Cout = (int) flt->ne[3];
const int W = (int) in->ne[0];
const int H = (int) in->ne[1];
const int OW = (int) out->ne[0];
const int OH = (int) out->ne[1];
/* op_params layout (set by ggml_conv_2d):
[0]=s0 [1]=s1 [2]=p0 [3]=p1 [4]=d0 [5]=d1 */
const int s0 = out->op_params[0];
const int s1 = out->op_params[1];
const int pad_w = out->op_params[2];
const int pad_h = out->op_params[3];
if (Cin <= 0 || Cout <= 0) {
return -1;
}
if (Cin % TILE != 0 || Cout % TILE != 0) {
return -1;
}
if (W <= 0 || H <= 0) {
return -1;
}
if (s0 <= 0 || s1 <= 0) {
return -1;
}
if (in->ne[2] != Cin || in->ne[3] != 1) {
return -1;
}
if (out->ne[2] != Cout || out->ne[3] != 1) {
return -1;
}
if (!flt->data || !in->data || !out->data) {
return -1;
}
const int K_TILES = Cin / TILE;
const int M_TILES = Cout / TILE;
const int Hp = H + 2 * pad_h;
const int Wp_a = round_up_tile_i32(OW);
const int OW_pad = Wp_a;
const bool need_stage = (OW % TILE != 0);
/* ===================== Tile assignment & active-shire selection =====
Computed up front because the per-shire mt set (and thus filter
region size) depends on n_active_shires. */
const int w_tiles = ceil_div_i32(OW, TILE);
const int total_tiles = OH * w_tiles * M_TILES;
const int n_active_shires = need_stage ? 1 : min_i32(total_tiles, N_SHIRES);
/* Inactive shires exit immediately. No global barrier — pack and
barriers are now per-shire, so unused shires don't need to vote. */
if (shire >= n_active_shires) {
return 0;
}
/* ===================== Determine this shire's mt set ================
Standard tile assignment: tile t is owned by
shire = t % n_active_shires
minion = (t / n_active_shires) % N_MIN_PER_SHIRE
slot = t / (n_active_shires * N_MIN_PER_SHIRE)
So the set of mt's this shire actually consumes is the set of
(t % M_TILES) for all t this shire owns. Enumerate all shire-owned
tiles, not just the first MAX_TILES_PER_HART slots; the one-chunk
path can process more tiles serially. */
int my_mt[MAX_MY_MT];
int n_my_mt = 0;
for (int t = shire; t < total_tiles; t += n_active_shires) {
const int mt = t % M_TILES;
bool found = false;
for (int j = 0; j < n_my_mt; ++j) {
if (my_mt[j] == mt) {
found = true;
break;
}
}
if (!found) {
if (n_my_mt >= MAX_MY_MT) {
return -1;
}
my_mt[n_my_mt++] = mt;
}
}
if (n_my_mt == 0) {
return 0; /* no tiles for this shire */
}
const uint64_t filter_local_bytes = (uint64_t) Kh * Kw * n_my_mt * K_TILES * SLAB_BYTES;
if (filter_local_bytes > LOCAL_FILTER_CAP) {
return -1;
}
/* ===================== L2 SCP local layout =========================
filter (this shire's mt slice) | pin_buf[0] | pin_buf[1]?
| output_stage? | scratch (streaming) */
const uint64_t l2_base = (uint64_t) et_shire_l2scp_local(0);
const uint64_t l2_filter = l2_base;
/* Sizing for pin: budget = LOCAL_BUDGET - filter - output_stage. */
const int64_t output_stage_bytes_full = need_stage ? (int64_t) Cout * OH * OW_pad * (int64_t) sizeof(float) : 0;
const int64_t budget_for_chunks = (int64_t) LOCAL_BUDGET - (int64_t) filter_local_bytes - output_stage_bytes_full;
if (budget_for_chunks <= 0) {
return -1;
}
const int64_t per_KT_pin_bytes = (int64_t) Kw * TILE * Hp * Wp_a * (int64_t) sizeof(float);
int chunk_KT;
int n_buffers;
if ((int64_t) K_TILES * per_KT_pin_bytes <= budget_for_chunks) {
chunk_KT = K_TILES;
n_buffers = 1;
} else {
chunk_KT = K_TILES;
while (chunk_KT > 1 && 2 * (int64_t) chunk_KT * per_KT_pin_bytes > budget_for_chunks) {
chunk_KT--;
}
while (chunk_KT > 1 && K_TILES % chunk_KT != 0) {
chunk_KT--;
}
n_buffers = (chunk_KT < K_TILES) ? 2 : 1;
if (chunk_KT < 1) {
return -1;
}
}
const int n_chunks = K_TILES / chunk_KT;
/* Streaming keeps partial sums in MAX_TILES_PER_HART scratch slots per
hart. The one-chunk path does not need scratch and can stream a longer
tile list serially, but multi-chunk shapes must fit this fixed slot
count until scratch scheduling is made more general. */
const int shire_tile_capacity = shire + MAX_TILES_PER_HART * n_active_shires * N_MIN_PER_SHIRE;
if (n_chunks > 1 && shire_tile_capacity < total_tiles) {
return -1;
}
const uint64_t pin_copy_floats = (uint64_t) chunk_KT * TILE * Hp * Wp_a;
const uint64_t pin_copy_bytes = pin_copy_floats * sizeof(float);
const uint64_t pin_chunk_bytes = (uint64_t) Kw * pin_copy_bytes;
const uint64_t l2_pin_base = l2_filter + filter_local_bytes;
const uint64_t l2_pin_buf[MAX_DBL_BUFS] = {
l2_pin_base,
l2_pin_base + pin_chunk_bytes,
};
const uint64_t l2_output_stage = need_stage ? l2_pin_base + (uint64_t) n_buffers * pin_chunk_bytes : 0;
const uint64_t scratch_per_hart = (uint64_t) MAX_TILES_PER_HART * (uint64_t) TILE * TILE * sizeof(float);
const uint64_t l2_scratch_base = need_stage ? l2_output_stage + (uint64_t) output_stage_bytes_full :
l2_pin_base + (uint64_t) n_buffers * pin_chunk_bytes;
/* ===================== PHASE 1: Filter pack (per-shire mt slice) ====
Hart-1's pack only this shire's mt slabs into local L2 SCP. The
SHIRE barrier below ensures the filter is in L2 SCP backing before
hart-0's first tensor_load. */
if (hart1) {
pack_filter_local_mt((const float *) flt->data, Kh, Kw, Cin, K_TILES, my_mt, n_my_mt, minion, l2_filter);
}
/* ===================== Hart 1: pin packer (per chunk) ==============
Double-buffered prefetch: pack chunk 0 synchronously, then per chunk c
signal "buf c ready", pack chunk c+1 into the alternate buffer
(overlaps hart-0's compute on c), signal "buf c done". */
if (hart1) {
const pin_ctx_t ctx = {
.in_base = (const float *) in->data,
.Kw = Kw,
.chunk_KT = chunk_KT,
.H = H,
.W = W,
.Hp = Hp,
.Wp_a = Wp_a,
.pad_h = pad_h,
.pad_w = pad_w,
.s0 = s0,
.minion = minion,
.pin_copy_floats = pin_copy_floats,
.l2_pad_in_buf = { l2_pin_buf[0], l2_pin_buf[1] },
.pin_chunk_bytes = pin_chunk_bytes,
};
pack_pin_chunk(&ctx, 0, 0); /* prologue */
for (int c = 0; c < n_chunks; ++c) {
et_barrier(ET_BARRIER_SHIRE); /* signal "buf c ready" */
if (n_buffers > 1 && c + 1 < n_chunks) {
pack_pin_chunk(&ctx, c + 1, (c + 1) & 1);
}
et_barrier(ET_BARRIER_SHIRE); /* wait "buf c done" */
}
if (need_stage) {
et_barrier(ET_BARRIER_SHIRE);
}
return 0;
}
/* ===================== Hart 0: matrix engine ======================
Two execution modes:
- n_chunks == 1: full Cin in one shot. Each hart processes a list
of tiles serially; TenC resets between tiles via first_pass=true.
- n_chunks > 1: streaming. Each hart owns up to MAX_TILES_PER_HART
tiles. For each chunk c, restore TenC from scratch[k] (skip on
c==0), accumulate this chunk's FMAs, then either save TenC back
to scratch[k] (c < last) or tensor_store directly (c == last). */
setup_cache_scp();
CLEAR_TENSOR_ERROR;
char * const out_base = need_stage ? (char *) l2_output_stage : (char *) out->data;
const int compute_OW = need_stage ? OW_pad : OW;
const uint64_t out_chan_stride = (uint64_t) OH * (uint64_t) compute_OW * sizeof(float);
const uint64_t out_row_stride = (uint64_t) compute_OW * sizeof(float);
const uint64_t a_row_stride = (uint64_t) TILE * sizeof(float); /* 64 */
const uint64_t b_row_stride = (uint64_t) Hp * (uint64_t) Wp_a * sizeof(float);
/* Tile assignment: shire-strided so small workloads spread across
shires before stacking minions in one shire. */
const int t_start = shire + minion * n_active_shires;
const int t_stride = n_active_shires * N_MIN_PER_SHIRE;
if (n_chunks == 1) {
et_barrier(ET_BARRIER_SHIRE); /* wait for the (only) pin chunk */
const uint64_t l2_pad_in = l2_pin_buf[0];
for (int t = t_start; t < total_tiles; t += t_stride) {
const conv_tile_t tile = decode_tile(t, M_TILES, w_tiles, my_mt, n_my_mt);
compute_tile_chunk(l2_filter, l2_pad_in, pin_copy_bytes, Kh, Kw, K_TILES, chunk_KT, 0, n_my_mt, Hp, Wp_a,
s1, a_row_stride, b_row_stride, &tile, /*first_fma_clears_tenc=*/true);
char * dst_addr = output_tile_addr(out_base, &tile, out_chan_stride, out_row_stride);
tensor_store(0, 0, 3, (uint64_t) (TILE - 1), (uint64_t) dst_addr, 0, out_chan_stride);
tensor_wait(TENSOR_STORE_WAIT);
}
et_barrier(ET_BARRIER_SHIRE); /* matches hart-1's second barrier */
} else {
/* Streaming path: each hart owns up to MAX_TILES_PER_HART tiles. */
int my_tiles[MAX_TILES_PER_HART];
int n_my_tiles = 0;
for (int slot = 0; slot < MAX_TILES_PER_HART; ++slot) {
const int t = t_start + slot * t_stride;
if (t < total_tiles) {
my_tiles[n_my_tiles++] = t;
}
}
conv_tile_t tiles[MAX_TILES_PER_HART];
for (int k = 0; k < n_my_tiles; ++k) {
tiles[k] = decode_tile(my_tiles[k], M_TILES, w_tiles, my_mt, n_my_mt);
}
const uint64_t my_scratch_base = l2_scratch_base + (uint64_t) minion * scratch_per_hart;
for (int c = 0; c < n_chunks; ++c) {
et_barrier(ET_BARRIER_SHIRE); /* pin chunk c packed */
const int buf = c & 1;
const uint64_t l2_pad_in = l2_pin_buf[buf];
const int kt_base = c * chunk_KT;
for (int k = 0; k < n_my_tiles; ++k) {
const conv_tile_t * tile = &tiles[k];
const uint64_t scr = my_scratch_base + (uint64_t) k * (TILE * TILE * sizeof(float));
const bool first_pass_chunk = (c == 0);
if (!first_pass_chunk) {
tenc_restore_from_scratch(scr);
}
compute_tile_chunk(l2_filter, l2_pad_in, pin_copy_bytes, Kh, Kw, K_TILES, chunk_KT, kt_base, n_my_mt,
Hp, Wp_a, s1, a_row_stride, b_row_stride, tile, first_pass_chunk);
if (c == n_chunks - 1) {
char * dst_addr = output_tile_addr(out_base, tile, out_chan_stride, out_row_stride);
tensor_store(0, 0, 3, (uint64_t) (TILE - 1), (uint64_t) dst_addr, 0, out_chan_stride);
} else {
tensor_store(0, 0, 3, (uint64_t) (TILE - 1), (uint64_t) scr, 0, 64);
}
tensor_wait(TENSOR_STORE_WAIT);
}
et_barrier(ET_BARRIER_SHIRE); /* hart-0 done with chunk c */
}
}
FENCE;
/* ----------------------- DRAM emit phase ---------------------------
Only relevant when we staged into L2SCP because OW % 16 != 0. */
if (need_stage) {
et_barrier(ET_BARRIER_SHIRE);
if (minion == 0) {
const float * stage = (const float *) l2_output_stage;
float * dram = (float *) out->data;
for (int oc = 0; oc < Cout; ++oc) {
for (int oh2 = 0; oh2 < OH; ++oh2) {
const float * src = stage + ((size_t) oc * OH + oh2) * OW_pad;
float * dst = dram + ((size_t) oc * OH + oh2) * OW;
for (int ow2 = 0; ow2 < OW; ++ow2) {
dst[ow2] = src[ow2];
}
}
}
FENCE;
const uint64_t total_bytes = (uint64_t) Cout * OH * OW * sizeof(float);
evict_range_past_l2((const void *) dram, total_bytes);
WAIT_CACHEOPS;
}
}
return 0;
}
@@ -1,110 +0,0 @@
//******************************************************************************
// CPY F32 -> F16 Kernel
// Copies F32 source tensor to F16 destination tensor (contiguous output).
// Source may have arbitrary strides; destination must be contiguous.
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdbool.h>
#include <stdint.h>
struct ggml_et_cont_params {
struct ggml_tensor src0;
struct ggml_tensor dst;
};
int entry_point(struct ggml_et_cont_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || !params) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F16) {
return -1;
}
const char * src_data = (const char *) src0->data;
uint16_t * dst_data = (uint16_t *) dst->data;
if (!src_data || !dst_data) {
return -1;
}
const int64_t ne00 = src0->ne[0];
const int64_t ne01 = src0->ne[1];
const int64_t ne02 = src0->ne[2];
const int64_t ne03 = src0->ne[3];
const int64_t nb00 = src0->nb[0];
const int64_t nb01 = src0->nb[1];
const int64_t nb02 = src0->nb[2];
const int64_t nb03 = src0->nb[3];
const int64_t total_elements = ne00 * ne01 * ne02 * ne03;
if (total_elements == 0) {
return 0;
}
// Check if src is contiguous F32
const bool src_contiguous =
(nb00 == 4 && nb01 == ne00 * 4 && nb02 == ne00 * ne01 * 4 && nb03 == ne00 * ne01 * ne02 * 4);
// Distribute by cache lines (16 F16 elements = 32 bytes = half cache line)
// Use 32 elements per chunk to keep output cache-line aligned
const int64_t elems_per_cl = 32;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t cl_per_thread = (total_cl + num_threads - 1) / num_threads;
const int64_t cl_start = thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cl) {
cl_end = total_cl;
}
if (cl_start >= total_cl) {
return 0;
}
const int64_t es = cl_start * elems_per_cl;
int64_t ee = cl_end * elems_per_cl;
if (ee > total_elements) {
ee = total_elements;
}
if (src_contiguous) {
// Fast path: src is contiguous F32
const float * src_f32 = (const float *) src_data;
for (int64_t i = es; i < ee; ++i) {
dst_data[i] = fp32_to_fp16(src_f32[i]);
}
} else {
// General path: stride-aware read
for (int64_t idx = es; idx < ee; ++idx) {
const int64_t i00 = idx % ne00;
const int64_t rem1 = idx / ne00;
const int64_t i01 = rem1 % ne01;
const int64_t rem2 = rem1 / ne01;
const int64_t i02 = rem2 % ne02;
const int64_t i03 = rem2 / ne02;
const float val = *(const float *) (src_data + i00 * nb00 + i01 * nb01 + i02 * nb02 + i03 * nb03);
dst_data[idx] = fp32_to_fp16(val);
}
}
return 0;
}
-15
View File
@@ -1,15 +0,0 @@
.section .text.init, "ax", @progbits
.global _start
_start:
# initialize global pointer
.option push
.option norelax
la gp, __global_pointer$
.option pop
# Firmware sets stack pointer before launch
# bss not allowed, no init
call entry_point
li a2, 0 /* KERNEL_RETURN_SUCCESS (0) */
mv a1, a0
li a0, 8 /* SYSCALL_RETURN_FROM_KERNEL (8) */
ecall
@@ -1,96 +0,0 @@
//******************************************************************************
// CUMSUM F32 Kernel
// Computes an inclusive prefix sum along dim 0 for each row in higher dims.
// First-pass implementation: scalar and row-contiguous input/output only.
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_cumsum_params {
struct ggml_tensor src0;
struct ggml_tensor dst;
};
int entry_point(struct ggml_et_cumsum_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1;
}
const int64_t ne0 = src0->ne[0];
const int64_t ne1 = src0->ne[1];
const int64_t ne2 = src0->ne[2];
const int64_t ne3 = src0->ne[3];
const size_t snb0 = src0->nb[0];
const size_t snb1 = src0->nb[1];
const size_t snb2 = src0->nb[2];
const size_t snb3 = src0->nb[3];
const size_t dnb0 = dst->nb[0];
const size_t dnb1 = dst->nb[1];
const size_t dnb2 = dst->nb[2];
const size_t dnb3 = dst->nb[3];
if (snb0 != sizeof(float) || dnb0 != sizeof(float)) {
return -1;
}
const int64_t total_rows = ne1 * ne2 * ne3;
const int64_t rows_per_group = et_rows_per_cacheline_group(ne0, sizeof(float));
const int64_t total_groups = (total_rows + rows_per_group - 1) / rows_per_group;
for (int64_t grp = thread_id; grp < total_groups; grp += num_threads) {
const int64_t row_start = grp * rows_per_group;
int64_t row_end = row_start + rows_per_group;
if (row_end > total_rows) {
row_end = total_rows;
}
for (int64_t row = row_start; row < row_end; ++row) {
int64_t i1 = row % ne1;
int64_t i2 = (row / ne1) % ne2;
int64_t i3 = row / (ne1 * ne2);
const float * src_row = (const float *) ((const char *) src0_data + i1 * snb1 + i2 * snb2 + i3 * snb3);
float * dst_row = (float *) ((char *) dst_data + i1 * dnb1 + i2 * dnb2 + i3 * dnb3);
float acc = 0.0f;
for (int64_t i0 = 0; i0 < ne0; ++i0) {
acc += src_row[i0];
dst_row[i0] = acc;
}
}
}
return 0;
}
@@ -1,90 +0,0 @@
//******************************************************************************
// Diag F32 Kernel
// Creates a diagonal matrix from a 1D vector.
// dst[i][j] = (i == j) ? src0[i] : 0.0f
//
// src0: [N, 1, ne2, ne3] (1D vector per batch)
// dst: [N, N, ne2, ne3] (diagonal matrix per batch)
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_diag_params {
struct ggml_tensor src0; // F32 input vector
struct ggml_tensor dst; // F32 output diagonal matrix
};
int entry_point(struct ggml_et_diag_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1;
}
const int64_t ne0 = dst->ne[0]; // N (row width = column count)
const int64_t ne1 = dst->ne[1]; // N (number of rows)
const int64_t ne2 = dst->ne[2];
const int64_t ne3 = dst->ne[3];
const size_t nb1 = dst->nb[1], nb2 = dst->nb[2], nb3 = dst->nb[3];
const size_t nb02 = src0->nb[2], nb03 = src0->nb[3];
// Total rows across all batches — parallelize over these
const int64_t total_rows = ne1 * ne2 * ne3;
// Prepare zero vector for SIMD zeroing
float zero = 0.0f;
__asm__ volatile("fbc.ps f10, %[z]\n" : : [z] "m"(zero) : "f10");
for (int64_t row = thread_id; row < total_rows; row += num_threads) {
int64_t i1 = row % ne1;
int64_t i2 = (row / ne1) % ne2;
int64_t i3 = row / (ne1 * ne2);
float * dst_row = (float *) ((char *) dst_data + i1 * nb1 + i2 * nb2 + i3 * nb3);
// Zero the entire row with SIMD
int64_t i0 = 0;
const int64_t vec_end = (ne0 / 8) * 8;
for (; i0 < vec_end; i0 += 8) {
__asm__ volatile("fsw.ps f10, %[d]\n" : [d] "=m"(*(float (*)[8]) & dst_row[i0])::"f10");
}
for (; i0 < ne0; i0++) {
dst_row[i0] = 0.0f;
}
// Place the diagonal element: dst[i1][i1] = src0[i1]
const float * src_ptr = (const float *) ((const char *) src0_data + i2 * nb02 + i3 * nb03);
dst_row[i1] = src_ptr[i1];
}
return 0;
}
@@ -1,377 +0,0 @@
// Element-wise operations: dst[i] = src0[i] op src1[i]
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
// Generic m0-gated element-wise block operation.
// The OP parameter selects the instruction: "fmul.ps", "fadd.ps", "fsub.ps".
#define DEFINE_BLOCK_OP(name, op_insn) \
static inline void name(float * dst_block, const float * src0_block, const float * src1_block, int elements) { \
const int32_t vec_end = (elements / 8) * 8; \
const int32_t tail = elements - vec_end; \
\
unsigned long temp_mask; \
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); \
__asm__ volatile("mov.m.x m0, x0, 0xFF"); \
\
for (int32_t i = 0; i < vec_end; i += 8) { \
__asm__ volatile( \
"flw.ps f10, %[s0]\n" \
"flw.ps f11, %[s1]\n" op_insn \
" f12, f10, f11\n" \
"fsw.ps f12, %[d]\n" \
: [d] "=m"(*(float (*)[8]) & dst_block[i]) \
: [s0] "m"(*(const float (*)[8]) & src0_block[i]), [s1] "m"(*(const float (*)[8]) & src1_block[i]) \
: "f10", "f11", "f12"); \
} \
/* Deal with tail chunks */ \
if (tail > 0) { \
const unsigned long tail_m0 = (1ul << tail) - 1; \
__asm__ volatile( \
"mov.m.x m0, %[tm], 0\n" \
"flw.ps f10, 0(%[s0])\n" \
"flw.ps f11, 0(%[s1])\n" op_insn \
" f12, f10, f11\n" \
"fsw.ps f12, 0(%[d])\n" \
: \
: [s0] "r"(&src0_block[vec_end]), [s1] "r"(&src1_block[vec_end]), [d] "r"(&dst_block[vec_end]), \
[tm] "r"(tail_m0) \
: "f10", "f11", "f12", "memory"); \
} \
\
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask)); \
}
DEFINE_BLOCK_OP(block_mul_cache_aligned, "fmul.ps")
DEFINE_BLOCK_OP(block_add_cache_aligned, "fadd.ps")
DEFINE_BLOCK_OP(block_sub_cache_aligned, "fsub.ps")
// Broadcast variants: src1 is a single scalar, broadcast to all 8 lanes.
#define DEFINE_BLOCK_OP_BROADCAST(name, op_insn) \
static inline void name(float * dst_block, const float * src0_block, float scalar, int elements) { \
const int32_t vec_end = (elements / 8) * 8; \
const int32_t tail = elements - vec_end; \
\
unsigned long temp_mask; \
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); \
__asm__ volatile("mov.m.x m0, x0, 0xFF"); \
\
for (int32_t i = 0; i < vec_end; i += 8) { \
__asm__ volatile( \
"flw.ps f10, %[s0]\n" \
"fbc.ps f11, %[s]\n" op_insn \
" f12, f10, f11\n" \
"fsw.ps f12, %[d]\n" \
: [d] "=m"(*(float (*)[8]) & dst_block[i]) \
: [s0] "m"(*(const float (*)[8]) & src0_block[i]), [s] "m"(scalar) \
: "f10", "f11", "f12"); \
} \
\
if (tail > 0) { \
const unsigned long tail_m0 = (1ul << tail) - 1; \
__asm__ volatile( \
"mov.m.x m0, %[tm], 0\n" \
"flw.ps f10, 0(%[s0])\n" \
"fbc.ps f11, 0(%[ps])\n" op_insn \
" f12, f10, f11\n" \
"fsw.ps f12, 0(%[d])\n" \
: \
: [s0] "r"(&src0_block[vec_end]), [ps] "r"(&scalar), [d] "r"(&dst_block[vec_end]), [tm] "r"(tail_m0) \
: "f10", "f11", "f12", "memory"); \
} \
\
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask)); \
}
DEFINE_BLOCK_OP_BROADCAST(block_mul_broadcast, "fmul.ps")
DEFINE_BLOCK_OP_BROADCAST(block_add_broadcast, "fadd.ps")
DEFINE_BLOCK_OP_BROADCAST(block_sub_broadcast, "fsub.ps")
static inline float scalar_el_map(float src0, float src1, enum ggml_op operation) {
switch (operation) {
case GGML_OP_MUL:
return src0 * src1;
case GGML_OP_ADD:
return src0 + src1;
case GGML_OP_SUB:
return src0 - src1;
default:
return 0.0f;
}
}
int entry_point(struct ggml_et_binary_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1; // Invalid pointer
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * src1 = &params->src1;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || src1->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1; // Unsupported type combination
}
float * src0_data = (float *) src0->data;
float * src1_data = (float *) src1->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !src1_data || !dst_data) {
return -1; // Null data pointer
}
#ifdef ET_UBERKERNEL
// Consumer-side input eviction. Required because ET caches are
// incoherent across minions: if a previous kernel in this UK batch
// left stale lines for these addresses in this hart's L1, drop them
// so we read fresh from L3/DRAM (where the producer flushed its
// results). Standalone launches don't need this -- the host-side
// runtime boundary between kernel launches handles it.
const size_t src0_bytes = (size_t) src0->ne[0] * src0->ne[1] * src0->ne[2] * src0->ne[3] * src0->nb[0];
const size_t src1_bytes = (size_t) src1->ne[0] * src1->ne[1] * src1->ne[2] * src1->ne[3] * src1->nb[0];
evict_region_past_l2(src0_data, src0_bytes);
evict_region_past_l2(src1_data, src1_bytes);
WAIT_CACHEOPS;
FENCE;
et_barrier(ET_BARRIER_GLOBAL);
#endif
enum ggml_op operation = dst->op;
if (operation != GGML_OP_MUL && operation != GGML_OP_ADD && operation != GGML_OP_SUB) {
return -1; // Unsupported operation
}
const int64_t ne0 = dst->ne[0], ne1 = dst->ne[1], ne2 = dst->ne[2], ne3 = dst->ne[3];
const int64_t ne00 = src0->ne[0], ne01 = src0->ne[1], ne02 = src0->ne[2], ne03 = src0->ne[3];
const int64_t ne10 = src1->ne[0], ne11 = src1->ne[1], ne12 = src1->ne[2], ne13 = src1->ne[3];
const size_t nb0 = dst->nb[0], nb1 = dst->nb[1], nb2 = dst->nb[2], nb3 = dst->nb[3];
const size_t nb00 = src0->nb[0], nb01 = src0->nb[1], nb02 = src0->nb[2], nb03 = src0->nb[3];
const size_t nb10 = src1->nb[0], nb11 = src1->nb[1], nb12 = src1->nb[2], nb13 = src1->nb[3];
const bool cache_aligned = (dst->ne[0] % 16 == 0);
// Fast path: no broadcasting, contiguous
const bool no_broadcast = (ne10 == ne0 && ne11 == ne1 && ne12 == ne2 && ne13 == ne3);
const bool all_contiguous =
(nb0 == 4 && nb00 == 4 && nb10 == 4 && nb1 == ne0 * 4 && nb01 == ne0 * 4 && nb11 == ne0 * 4);
if (no_broadcast && all_contiguous) {
const int64_t total_elements = ne0 * ne1 * ne2 * ne3;
const int64_t elements_per_cacheline = 16; // 64 bytes / 4 bytes
const int64_t total_cachelines = (total_elements + elements_per_cacheline - 1) / elements_per_cacheline;
const int64_t cl_per_thread = (total_cachelines + num_threads - 1) / num_threads;
const int64_t cl_start = thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cachelines) {
cl_end = total_cachelines;
}
if (cl_start >= total_cachelines) {
return 0;
}
const int64_t elem_start = cl_start * elements_per_cacheline;
int64_t elem_end = cl_end * elements_per_cacheline;
if (elem_end > total_elements) {
elem_end = total_elements;
}
const int32_t count = (int32_t) (elem_end - elem_start);
switch (operation) {
case GGML_OP_MUL:
block_mul_cache_aligned(dst_data + elem_start, src0_data + elem_start, src1_data + elem_start, count);
break;
case GGML_OP_ADD:
block_add_cache_aligned(dst_data + elem_start, src0_data + elem_start, src1_data + elem_start, count);
break;
case GGML_OP_SUB:
block_sub_cache_aligned(dst_data + elem_start, src0_data + elem_start, src1_data + elem_start, count);
break;
default:
return 1;
}
#ifdef ET_UBERKERNEL
// Producer-side flush: ET caches are incoherent across minions, so
// a consumer kernel running on a different minion can't see our
// dirty L1 lines via its own evict_region_past_l2. Push our writes
// all the way to DRAM so the next batched kernel reads fresh.
// Standalone launches don't need this -- the host runtime boundary
// between kernel launches handles cache writeback.
FENCE;
evict_region_past_l2(dst_data + elem_start, (size_t) count * sizeof(float));
WAIT_CACHEOPS;
FENCE;
#endif
return 0;
}
// Slow path: broadcasting or non-contiguous
const int64_t total_rows = ne1 * ne2 * ne3;
int64_t start_row;
int64_t end_row;
if (cache_aligned) {
const int64_t rows_per_thread = (total_rows + num_threads - 1) / num_threads;
start_row = thread_id * rows_per_thread;
end_row = (start_row + rows_per_thread < total_rows) ? (start_row + rows_per_thread) : total_rows;
} else {
const int64_t rows_per_group = et_rows_per_cacheline_group(ne0, sizeof(float));
const int64_t total_groups = (total_rows + rows_per_group - 1) / rows_per_group;
if (thread_id >= total_groups) {
return 0;
}
const int64_t group_start = thread_id;
for (int64_t grp = group_start; grp < total_groups; grp += num_threads) {
const int64_t group_row_start = grp * rows_per_group;
int64_t group_row_end = group_row_start + rows_per_group;
if (group_row_end > total_rows) {
group_row_end = total_rows;
}
#ifdef ET_UBERKERNEL
// First row written by this group (used for producer-side evict).
const int64_t first_i03 = group_row_start / (ne2 * ne1);
const int64_t first_i02 = (group_row_start - first_i03 * ne2 * ne1) / ne1;
const int64_t first_i01 = (group_row_start - first_i03 * ne2 * ne1 - first_i02 * ne1);
char * group_dst_base = (char *) dst_data + first_i03 * nb3 + first_i02 * nb2 + first_i01 * nb1;
#endif
for (int64_t ir = group_row_start; ir < group_row_end; ir++) {
const int64_t i03 = ir / (ne2 * ne1);
const int64_t i02 = (ir - i03 * ne2 * ne1) / ne1;
const int64_t i01 = (ir - i03 * ne2 * ne1 - i02 * ne1);
const int64_t i13 = i03 % ne13;
const int64_t i12 = i02 % ne12;
const int64_t i11 = i01 % ne11;
float * dst_ptr = (float *) ((char *) dst_data + i03 * nb3 + i02 * nb2 + i01 * nb1);
const float * src0_ptr =
(const float *) ((const char *) src0_data + i03 * nb03 + i02 * nb02 + i01 * nb01);
const float * src1_ptr =
(const float *) ((const char *) src1_data + i13 * nb13 + i12 * nb12 + i11 * nb11);
if (ne10 == 1) {
const float scalar = src1_ptr[0];
for (int64_t i0 = 0; i0 < ne0; ++i0) {
dst_ptr[i0] = scalar_el_map(src0_ptr[i0], scalar, operation);
}
} else {
for (int64_t i0 = 0; i0 < ne0; ++i0) {
dst_ptr[i0] = scalar_el_map(src0_ptr[i0], src1_ptr[i0 % ne10], operation);
}
}
}
#ifdef ET_UBERKERNEL
// Producer-side flush for this group's rows. Group rows are
// contiguous because nb1 = ne0*4 in the cacheline-group layout.
// Only needed inside a UK batch; see comment in fast path.
const int64_t nrows = group_row_end - group_row_start;
if (nrows > 0) {
FENCE;
evict_region_past_l2(group_dst_base, (size_t) nrows * nb1);
WAIT_CACHEOPS;
FENCE;
}
#endif
}
return 0;
}
if (start_row >= total_rows) {
return 0;
}
for (int64_t ir = start_row; ir < end_row; ir++) {
// Convert flat row index to 3D coordinates
const int64_t i03 = ir / (ne2 * ne1);
const int64_t i02 = (ir - i03 * ne2 * ne1) / ne1;
const int64_t i01 = (ir - i03 * ne2 * ne1 - i02 * ne1);
// Handle broadcasting: src1 coordinates with modulo
const int64_t i13 = i03 % ne13;
const int64_t i12 = i02 % ne12;
const int64_t i11 = i01 % ne11;
// Calculate base pointers for this row using stride-based addressing
float * dst_ptr = (float *) ((char *) dst_data + i03 * nb3 + i02 * nb2 + i01 * nb1);
const float * src0_ptr = (const float *) ((const char *) src0_data + i03 * nb03 + i02 * nb02 + i01 * nb01);
const float * src1_ptr = (const float *) ((const char *) src1_data + i13 * nb13 + i12 * nb12 + i11 * nb11);
if (ne10 == 1) {
// Broadcast scalar: src1 has ne[0]=1, broadcast across entire row
float scalar = src1_ptr[0];
switch (operation) {
case GGML_OP_MUL:
block_mul_broadcast(dst_ptr, src0_ptr, scalar, (int) ne0);
break;
case GGML_OP_ADD:
block_add_broadcast(dst_ptr, src0_ptr, scalar, (int) ne0);
break;
case GGML_OP_SUB:
block_sub_broadcast(dst_ptr, src0_ptr, scalar, (int) ne0);
break;
default:
return 1;
}
} else {
// Broadcasting in dimension 0: src1 repeats across src0
const int64_t nr0 = ne0 / ne10;
for (int64_t r = 0; r < nr0; r++) {
const float * src0_block = src0_ptr + r * ne10;
float * dst_block = dst_ptr + r * ne10;
switch (operation) {
case GGML_OP_MUL:
block_mul_cache_aligned(dst_block, src0_block, src1_ptr, (int) ne10);
break;
case GGML_OP_ADD:
block_add_cache_aligned(dst_block, src0_block, src1_ptr, (int) ne10);
break;
case GGML_OP_SUB:
block_sub_cache_aligned(dst_block, src0_block, src1_ptr, (int) ne10);
break;
default:
return 1;
}
}
}
}
#ifdef ET_UBERKERNEL
// Producer-side flush for the cache-aligned slow path. Rows
// [start_row, end_row) are contiguous in dst because nb1 = ne0 * 4.
// Only needed inside a UK batch; see comment in fast path.
if (end_row > start_row) {
FENCE;
evict_region_past_l2((char *) dst_data + start_row * nb1, (size_t) (end_row - start_row) * nb1);
WAIT_CACHEOPS;
FENCE;
}
#endif
return 0;
}
@@ -1,87 +0,0 @@
//******************************************************************************
// Fill F32 Kernel
// Fills entire tensor with a constant scalar value.
// dst[i] = c for all elements
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_fill_params {
struct ggml_tensor dst; // F32 output tensor (contiguous)
float c; // Constant value to fill
};
int entry_point(struct ggml_et_fill_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * dst = &params->dst;
if (dst->type != GGML_TYPE_F32) {
return -1;
}
float * dst_data = (float *) dst->data;
if (!dst_data) {
return -1;
}
const int64_t total_elements = dst->ne[0] * dst->ne[1] * dst->ne[2] * dst->ne[3];
if (total_elements == 0) {
return 0;
}
// Distribute by cache lines (16 floats = 64 bytes)
const int64_t elems_per_cl = 16;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t cl_per_thread = (total_cl + num_threads - 1) / num_threads;
const int64_t cl_start = thread_id * cl_per_thread;
int64_t cl_end = cl_start + cl_per_thread;
if (cl_end > total_cl) {
cl_end = total_cl;
}
if (cl_start >= total_cl) {
return 0;
}
const int64_t es = cl_start * elems_per_cl;
int64_t ee = cl_end * elems_per_cl;
if (ee > total_elements) {
ee = total_elements;
}
// Broadcast constant to all SIMD lanes
float c = params->c;
__asm__ volatile("fbc.ps f10, %[v]\n" : : [v] "m"(c) : "f10");
// Vector fill (8-wide)
int64_t i = es;
const int64_t vec_end = es + ((ee - es) / 8) * 8;
for (; i < vec_end; i += 8) {
__asm__ volatile("fsw.ps f10, %[d]\n" : [d] "=m"(*(float (*)[8]) & dst_data[i])::"f10");
}
// Scalar tail
for (; i < ee; i++) {
dst_data[i] = c;
}
return 0;
}
File diff suppressed because it is too large Load Diff
@@ -1,217 +0,0 @@
//******************************************************************************
// F32 Flash Attention for ET backend
//
// Supports:
// - arbitrary dk/dv (up to 128)
// - GQA (n_head_q can differ from n_head_kv)
// - mask (F16 or F32, causal pattern)
// - F16 or F32 K and V (with non-contiguous strides from KV cache permute)
//
// Limitations:
// - Q and dst must be F32
// - no sinks, ALiBi, logit softcap
//
// Parallelization strategy:
// - flatten [query position, head, outer batch] into independent rows
// - assign rows round-robin across ET threads
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdbool.h>
#include <stdint.h>
struct ggml_et_flash_attn_ext_params {
struct ggml_tensor src0; // Q tensor (F32)
struct ggml_tensor src1; // K tensor (F16 or F32)
struct ggml_tensor src2; // V tensor (F16 or F32)
struct ggml_tensor mask; // mask tensor (F16 or F32), zeroed when absent
struct ggml_tensor dst; // Output tensor (F32)
float scale; // Scale factor applied to QK
int32_t has_mask; // nonzero if mask is present
};
// Maximum head dimension supported (128 covers all common LLMs).
#define FA_DV_MAX 128
// Read element d from a row, handling F16 or F32 type.
// row_base points to the start of the row (byte address).
// nb0 is the stride per element (2 for F16, 4 for F32).
static inline float read_kv_f32(const char * row_base, int64_t d, int64_t nb0, int type) {
if (type == GGML_TYPE_F32) {
return *(const float *) (row_base + d * nb0);
}
// F16
return fp16_to_fp32(*(const uint16_t *) (row_base + d * nb0));
}
// Dot product of F32 query vector with a K row (F16 or F32).
static inline float dot_qk(const float * q, const char * k_row, int64_t dk, int64_t k_nb0, int k_type) {
float acc = 0.0f;
if (k_type == GGML_TYPE_F32) {
const float * kf = (const float *) k_row;
for (int64_t i = 0; i < dk; ++i) {
acc += q[i] * kf[i];
}
} else {
// F16 stride-aware read
for (int64_t i = 0; i < dk; ++i) {
acc += q[i] * fp16_to_fp32(*(const uint16_t *) (k_row + i * k_nb0));
}
}
return acc;
}
static inline float get_mask_val(const struct ggml_tensor * mask, int64_t iq1, int64_t ik1, int64_t iq2, int64_t iq3) {
// mask layout: [nk, nq, ne2, ne3] -> broadcast via modulo
const char * base = (const char *) mask->data + iq1 * mask->nb[1] + (iq2 % mask->ne[2]) * mask->nb[2] +
(iq3 % mask->ne[3]) * mask->nb[3];
if (mask->type == GGML_TYPE_F32) {
return *(const float *) (base + ik1 * mask->nb[0]);
}
// F16
return fp16_to_fp32(*(const uint16_t *) (base + ik1 * mask->nb[0]));
}
int entry_point(struct ggml_et_flash_attn_ext_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || !params) {
return -1;
}
const int thread_id = get_relative_thread_id(kernel_env->shire_mask);
const int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0 || num_threads <= 0) {
return 0;
}
struct ggml_tensor * q = &params->src0;
struct ggml_tensor * k = &params->src1;
struct ggml_tensor * v = &params->src2;
struct ggml_tensor * dst = &params->dst;
const int32_t has_mask = params->has_mask;
struct ggml_tensor * mask = has_mask ? &params->mask : (struct ggml_tensor *) 0;
const char * q_data = (const char *) q->data;
const char * k_data = (const char *) k->data;
const char * v_data = (const char *) v->data;
char * dst_data = (char *) dst->data;
const int k_type = k->type;
const int v_type = v->type;
const int64_t k_nb0 = k->nb[0];
const int64_t v_nb0 = v->nb[0];
const int64_t dk = q->ne[0]; // head dim for keys/queries
const int64_t nq = q->ne[1]; // number of query positions
const int64_t nhq = q->ne[2]; // number of query heads
const int64_t no = q->ne[3]; // outer batch
const int64_t nk = k->ne[1]; // number of key/value positions
const int64_t nhk = k->ne[2]; // number of kv heads
const int64_t dv = v->ne[0]; // head dim for values
if (dv > FA_DV_MAX) {
return -1;
}
// GQA: query heads per kv head
const int64_t gqa_ratio = nhq / nhk;
const int64_t total_rows = nq * nhq * no;
const float scale = params->scale;
// When dv is a multiple of 16 (64 bytes = cache line), output rows are
// cache-line aligned and we can use fast normal stores. Otherwise we must
// use atomic stores to avoid cache-line sharing corruption.
const int use_fast_store = (dv % 16 == 0);
for (int64_t row = thread_id; row < total_rows; row += num_threads) {
const int64_t iq3 = row / (nhq * nq);
const int64_t rem = row % (nhq * nq);
const int64_t iq2 = rem / nq; // query head index
const int64_t iq1 = rem % nq; // query position
// Map query head -> kv head for GQA
const int64_t ik2 = iq2 / gqa_ratio;
// Q is always F32
const float * pq = (const float *) (q_data + iq1 * q->nb[1] + iq2 * q->nb[2] + iq3 * q->nb[3]);
// dst layout: [dv, nhq, nq, no]
float * out = (float *) (dst_data + iq2 * dst->nb[1] + iq1 * dst->nb[2] + iq3 * dst->nb[3]);
// Base byte offsets for K and V head+batch slice
const int64_t kv_base = ik2 * k->nb[2] + iq3 * k->nb[3];
const int64_t vv_base = ik2 * v->nb[2] + iq3 * v->nb[3];
float acc[FA_DV_MAX];
for (int64_t d = 0; d < dv; ++d) {
acc[d] = 0.0f;
}
float M = -3.402823466e+38f;
float S = 0.0f;
for (int64_t ik1 = 0; ik1 < nk; ++ik1) {
// If mask is present, check for -inf (skip masked positions)
float mask_val = 0.0f;
if (has_mask) {
mask_val = get_mask_val(mask, iq1, ik1, iq2, iq3);
// llama.cpp uses -inf for masked positions
if (mask_val == -3.402823466e+38f || mask_val != mask_val) {
continue;
}
}
const char * pk = k_data + ik1 * k->nb[1] + kv_base;
const char * pv = v_data + ik1 * v->nb[1] + vv_base;
float s = dot_qk(pq, pk, dk, k_nb0, k_type) * scale + mask_val;
const float Mold = M;
float ms = 1.0f;
float vs = 1.0f;
if (s > M) {
M = s;
ms = et_expf(Mold - M);
for (int64_t d = 0; d < dv; ++d) {
acc[d] *= ms;
}
} else {
vs = et_expf(s - M);
}
// Accumulate weighted V
if (v_type == GGML_TYPE_F32) {
const float * pvf = (const float *) pv;
for (int64_t d = 0; d < dv; ++d) {
acc[d] += pvf[d] * vs;
}
} else {
for (int64_t d = 0; d < dv; ++d) {
acc[d] += fp16_to_fp32(*(const uint16_t *) (pv + d * v_nb0)) * vs;
}
}
S = S * ms + vs;
}
const float S_inv = S == 0.0f ? 0.0f : et_fdiv(1.0f, S);
if (use_fast_store) {
for (int64_t d = 0; d < dv; ++d) {
out[d] = acc[d] * S_inv;
}
} else {
for (int64_t d = 0; d < dv; ++d) {
atomic_store_f32((volatile float *) &out[d], acc[d] * S_inv);
}
}
}
return 0;
}
@@ -1,346 +0,0 @@
//******************************************************************************
// Gated Delta Net F32 Kernel
//
// Implements the gated delta rule recurrence:
// For each head h, timestep t:
// 1. Gate decay: S *= exp(g) (scalar or per-element KDA)
// 2. Delta update: delta[j] = (v[j] - dot(S_row_j, k)) * beta
// 3. Outer product: S_row_j += k * delta[j]
// 4. Attention: attn[j] = dot(S_row_j, q) * scale
//
// State is stored transposed: s_out[j*S_v + i] = S[i][j]
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_gated_delta_net_params {
struct ggml_tensor q; // [S_v, H_q, n_tokens, n_seqs_q]
struct ggml_tensor k; // [S_v, H_k, n_tokens, n_seqs_k]
struct ggml_tensor v; // [S_v, H, n_tokens, n_seqs]
struct ggml_tensor g; // [1 or S_v, H, n_tokens, n_seqs]
struct ggml_tensor beta; // [1, H, n_tokens, n_seqs]
struct ggml_tensor state_in; // [S_v*S_v*H, K, n_seqs]
struct ggml_tensor dst; // [S_v*H, n_tokens*n_seqs + S_v*n_seqs*K]
int32_t S_v; // head dimension
int32_t H; // number of value heads
int32_t H_q; // number of Q heads
int32_t H_k; // number of K heads
int32_t n_tokens; // total tokens
int32_t n_seqs; // number of sequences
int32_t n_seqs_q; // Q sequence count
int32_t n_seqs_k; // K sequence count
int32_t kda; // 1 if per-element gate, 0 if scalar
int32_t K; // snapshot slot count
float scale; // 1/sqrt(S_v)
};
static inline float hsum_f10(void) {
float result;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(result)::"t0", "f1", "f2", "f3", "f4", "f5");
return result;
}
int entry_point(struct ggml_et_gated_delta_net_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
const struct ggml_tensor * q_tsr = &params->q;
const struct ggml_tensor * k_tsr = &params->k;
const struct ggml_tensor * v_tsr = &params->v;
const struct ggml_tensor * g_tsr = &params->g;
const struct ggml_tensor * beta_tsr = &params->beta;
const struct ggml_tensor * state_tsr = &params->state_in;
const struct ggml_tensor * dst_tsr = &params->dst;
const float * q = (const float *) q_tsr->data;
const float * k = (const float *) k_tsr->data;
const float * v = (const float *) v_tsr->data;
const float * g = (const float *) g_tsr->data;
const float * beta = (const float *) beta_tsr->data;
const float * state_in = (const float *) state_tsr->data;
float * dst_data = (float *) dst_tsr->data;
const int32_t S_v = params->S_v;
const int32_t H = params->H;
const int32_t H_q = params->H_q;
const int32_t H_k = params->H_k;
const int32_t n_tokens = params->n_tokens;
const int32_t n_seqs = params->n_seqs;
const int32_t n_seqs_q = params->n_seqs_q;
const int32_t n_seqs_k = params->n_seqs_k;
const int32_t kda = params->kda;
const int32_t K = params->K;
const float scale = params->scale;
if (!q || !k || !v || !g || !beta || !state_in || !dst_data) {
return -1;
}
// Preserve the original contract for every tensor except q, k, and v, which may be
// row-contiguous with strided higher dimensions.
if (q_tsr->nb[0] != sizeof(float) || k_tsr->nb[0] != sizeof(float) || v_tsr->nb[0] != sizeof(float) ||
g_tsr->nb[0] != sizeof(float) || beta_tsr->nb[0] != sizeof(float) || state_tsr->nb[0] != sizeof(float) ||
dst_tsr->nb[0] != sizeof(float)) {
return -1;
}
const int32_t attn_elems = S_v * H * n_tokens * n_seqs;
float * attn_out_base = dst_data;
float * state_out_base = dst_data + attn_elems;
const int32_t state_plane_floats = S_v * S_v * H * n_seqs;
const int32_t G0 = kda ? S_v : 1;
const size_t q_nb1 = q_tsr->nb[1];
const size_t q_nb2 = q_tsr->nb[2];
const size_t q_nb3 = q_tsr->nb[3];
const size_t k_nb1 = k_tsr->nb[1];
const size_t k_nb2 = k_tsr->nb[2];
const size_t k_nb3 = k_tsr->nb[3];
const size_t v_nb1 = v_tsr->nb[1];
const size_t v_nb2 = v_tsr->nb[2];
const size_t v_nb3 = v_tsr->nb[3];
const int32_t g_stride_h = G0;
const int32_t g_stride_t = G0 * H;
const int32_t g_stride_s = G0 * H * n_tokens;
const int32_t b_stride_t = H;
const int32_t b_stride_s = H * n_tokens;
float exp_g_buf[128];
// FP and SIMD share the same register file. Scalar FP needs the default
// mask; 8-wide .ps blocks need m0=255. Save once, toggle at boundaries.
unsigned long default_mask;
__asm__ volatile("mova.x.m %[ms]\n" : [ms] "=r"(default_mask));
// Parallelize over (j_block, head, seq). J_BLK must satisfy two separate
// cache-line alignment constraints at once:
// (a) State: J_BLK consecutive rows of s_out (each S_v floats) span an
// integer number of cache lines. For S_v * sizeof(float) >= 64 this
// is trivially any J_BLK >= 1.
// (b) Attention output: each j writes exactly one float into
// attn_ptr[j], which is densely packed. If J_BLK * sizeof(float) is
// less than a cache line, distinct threads will share a line and
// race on scalar stores — ET's L1 isn't coherent so we lose writes.
//
// (b) dominates: J_BLK must be at least ET_CACHE_LINE_SIZE_BYTES / 4 so
// that each thread owns a whole cache line of attn_ptr. That's 16 on
// ET-SoC-1, and it's also a whole number of state rows for every
// S_v >= 1, so (a) is automatically satisfied.
const int32_t J_BLK = ET_CACHE_LINE_SIZE_BYTES / (int32_t) sizeof(float);
const int32_t n_j_blocks = (S_v + J_BLK - 1) / J_BLK;
const int32_t total_work = n_j_blocks * H * n_seqs;
for (int32_t ir = thread_id; ir < total_work; ir += num_threads) {
const int32_t jb = ir % n_j_blocks;
const int32_t head = (ir / n_j_blocks) % H;
const int32_t seq = ir / (n_j_blocks * H);
const int32_t j_start = jb * J_BLK;
const int32_t j_end = (j_start + J_BLK < S_v) ? j_start + J_BLK : S_v;
const int32_t h_q = head % H_q;
const int32_t h_k = head % H_k;
const int32_t seq_q = (n_seqs_q == n_seqs) ? seq : (seq * n_seqs_q / n_seqs);
const int32_t seq_k = (n_seqs_k == n_seqs) ? seq : (seq * n_seqs_k / n_seqs);
const int32_t head_state_off = (seq * H + head) * S_v * S_v;
// Live RMW buffer = first snapshot plane (slot 0).
float * s_out = state_out_base + head_state_off;
// Input state: seq `seq`, head `head`.
const float * s_in = state_in + head_state_off;
// Skip the explicit s_in -> s_out copy. At t=0 pass A/B read through
// src_state = s_in; pass B writes the first new row to s_out. From
// t=1 onward src_state flips to s_out (read-modify-write in place).
const float * src_state = s_in;
const int32_t attn_stride_t = S_v * H;
float * attn_ptr = attn_out_base + (seq * n_tokens * H + head) * S_v;
const float zero = 0.0f;
for (int32_t t = 0; t < n_tokens; t++) {
const float * q_t = (const float *) ((const char *) q + seq_q * q_nb3 + t * q_nb2 + h_q * q_nb1);
const float * k_t = (const float *) ((const char *) k + seq_k * k_nb3 + t * k_nb2 + h_k * k_nb1);
const float * v_t = (const float *) ((const char *) v + seq * v_nb3 + t * v_nb2 + head * v_nb1);
const float * g_t = g + seq * g_stride_s + t * g_stride_t + head * g_stride_h;
const float beta_val = beta[seq * b_stride_s + t * b_stride_t + head];
// Precompute per-element gate for the kda path; scalar decay
// otherwise. Decay is fused into per-j pass A/B below, not
// applied to state in a separate pre-pass.
float decay = 0.0f; // only used when !kda
if (kda) {
const float log2e = 1.4426950408889634f;
__asm__ volatile("mov.m.x m0, x0, 255\n" :::);
__asm__ volatile("fbc.ps f20, %[l2e]\n" : : [l2e] "m"(log2e) : "f20");
for (int32_t i = 0; i < S_v; i += 8) {
__asm__ volatile(
"flw.ps f10, %[g_vec]\n"
"fmul.ps f10, f10, f20, rne\n"
"fexp.ps f10, f10\n"
"fsw.ps f10, %[out]\n"
: [out] "=m"(*(float (*)[8]) & exp_g_buf[i])
: [g_vec] "m"(*(const float (*)[8]) & g_t[i])
: "f10");
}
__asm__ volatile("mova.m.x %[ms]\n" : : [ms] "r"(default_mask));
} else {
decay = et_expf(g_t[0]);
}
for (int32_t j = j_start; j < j_end; j++) {
const float * src_row = src_state + j * S_v;
float * dst_row = s_out + j * S_v;
__asm__ volatile("mov.m.x m0, x0, 255\n" :::);
if (kda) {
__asm__ volatile("fbc.ps f10, %[z]\n" : : [z] "m"(zero) : "f10");
for (int32_t i = 0; i < S_v; i += 8) {
__asm__ volatile(
"flw.ps f11, %[s_vec]\n"
"flw.ps f12, %[g_vec]\n"
"flw.ps f13, %[k_vec]\n"
"fmul.ps f11, f11, f12\n" // row_dec = row * g
"fmadd.ps f10, f11, f13, f10\n" // acc += row_dec * k
:
: [s_vec] "m"(*(const float (*)[8]) & src_row[i]),
[g_vec] "m"(*(const float (*)[8]) & exp_g_buf[i]),
[k_vec] "m"(*(const float (*)[8]) & k_t[i])
: "f10", "f11", "f12", "f13");
}
} else {
__asm__ volatile(
"fbc.ps f10, %[z]\n"
"fbc.ps f22, %[d]\n"
:
: [z] "m"(zero), [d] "m"(decay)
: "f10", "f22");
for (int32_t i = 0; i < S_v; i += 8) {
__asm__ volatile(
"flw.ps f11, %[s_vec]\n"
"flw.ps f13, %[k_vec]\n"
"fmul.ps f11, f11, f22\n" // row_dec = row * decay
"fmadd.ps f10, f11, f13, f10\n" // acc += row_dec * k
:
: [s_vec] "m"(*(const float (*)[8]) & src_row[i]), [k_vec] "m"(*(const float (*)[8]) &
k_t[i])
: "f10", "f11", "f13");
}
}
float dot_sk = hsum_f10();
__asm__ volatile("mova.m.x %[ms]\n" : : [ms] "r"(default_mask));
float delta_j = (v_t[j] - dot_sk) * beta_val;
// -------- Pass B: decay + outer product + attn --------
__asm__ volatile("mov.m.x m0, x0, 255\n" :::);
if (kda) {
__asm__ volatile(
"fbc.ps f10, %[z]\n"
"fbc.ps f21, %[dj]\n"
:
: [z] "m"(zero), [dj] "m"(delta_j)
: "f10", "f21");
for (int32_t i = 0; i < S_v; i += 8) {
__asm__ volatile(
"flw.ps f11, %[s_vec]\n"
"flw.ps f12, %[g_vec]\n"
"flw.ps f13, %[k_vec]\n"
"flw.ps f14, %[q_vec]\n"
"fmul.ps f11, f11, f12\n" // row_dec = row * g
"fmadd.ps f11, f13, f21, f11\n" // row_new = row_dec + k*delta_j
"fsw.ps f11, %[s_out]\n"
"fmadd.ps f10, f11, f14, f10\n" // attn_acc += row_new * q
: [s_out] "=m"(*(float (*)[8]) & dst_row[i])
: [s_vec] "m"(*(const float (*)[8]) & src_row[i]),
[g_vec] "m"(*(const float (*)[8]) & exp_g_buf[i]),
[k_vec] "m"(*(const float (*)[8]) & k_t[i]), [q_vec] "m"(*(const float (*)[8]) & q_t[i])
: "f10", "f11", "f12", "f13", "f14");
}
} else {
__asm__ volatile(
"fbc.ps f10, %[z]\n"
"fbc.ps f21, %[dj]\n"
"fbc.ps f22, %[d]\n"
:
: [z] "m"(zero), [dj] "m"(delta_j), [d] "m"(decay)
: "f10", "f21", "f22");
for (int32_t i = 0; i < S_v; i += 8) {
__asm__ volatile(
"flw.ps f11, %[s_vec]\n"
"flw.ps f13, %[k_vec]\n"
"flw.ps f14, %[q_vec]\n"
"fmul.ps f11, f11, f22\n" // row_dec = row * decay
"fmadd.ps f11, f13, f21, f11\n" // row_new = row_dec + k*delta_j
"fsw.ps f11, %[s_out]\n"
"fmadd.ps f10, f11, f14, f10\n" // attn_acc += row_new * q
: [s_out] "=m"(*(float (*)[8]) & dst_row[i])
: [s_vec] "m"(*(const float (*)[8]) & src_row[i]),
[k_vec] "m"(*(const float (*)[8]) & k_t[i]), [q_vec] "m"(*(const float (*)[8]) & q_t[i])
: "f10", "f11", "f13", "f14");
}
}
float attn_val = hsum_f10();
__asm__ volatile("mova.m.x %[ms]\n" : : [ms] "r"(default_mask));
attn_ptr[j] = attn_val * scale;
}
// n-way merge snapshot: live state lives in slot 0 (== s_out).
// Copies state to target snapshot slots [1, K-1] in reverse chronological order.
// target_slot == 0 is the live buffer itself => no copy.
// target_slot >= K (when n_tokens > K) => older slots are discarded.
if (K > 1) {
const int32_t target_slot = (n_tokens - 1) - t;
if (target_slot > 0 && target_slot < K) {
float * snap = state_out_base + target_slot * state_plane_floats + head_state_off;
for (int32_t j = j_start; j < j_end; j++) {
const float * src = s_out + j * S_v;
float * dst = snap + j * S_v;
for (int32_t i = 0; i < S_v; i++) {
dst[i] = src[i];
}
}
}
}
// After t=0, state lives in s_out; flip src_state so subsequent
// timesteps read-modify-write in place.
src_state = s_out;
attn_ptr += attn_stride_t;
}
}
return 0;
}
@@ -1,612 +0,0 @@
//******************************************************************************
// Bare Metal GET_ROWS F32 Kernel
// Extracts specific rows from a source tensor based on row indices
//
// Algorithm:
// 1. Read row indices from src1 (int32 tensor)
// 2. For each index, extract the corresponding row from src0
// 3. Copy the row data to the output tensor dst
// 4. Handle different input types: F32, Q8_0, Q4_0, and Q4_K (quantized)
//
// Operation: dst[i] = src0[indices[i]] for i = 0..num_indices
//
// Features supported:
// - F32 input data (direct copy)
// - Q4_0 quantized input data (dequantized to F32)
// - Q8_0 quantized input data (dequantized to F32)
// - Q4_K quantized input data (dequantized to F32)
// - Int32 row indices
// - Multi-dimensional tensor support
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include "quants.h"
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
#define CACHE_LINE_SIZE_BYTES 64
struct ggml_et_get_rows_params {
struct ggml_tensor src0; // Data tensor (F32, Q4_0, Q8_0, or Q4_K)
struct ggml_tensor src1; // Row indices tensor (I32)
struct ggml_tensor dst; // Output tensor (F32)
};
#define CACHE_LINE_SIZE_BYTES 64
#define CACHE_ELEMENTS(elem_size) (CACHE_LINE_SIZE_BYTES / (elem_size))
// Copy a row of F32 data from source to destination
static void copy_f32_row(float * dst, const float * src, int64_t num_elements) {
// Simple memcpy for F32 data - no conversion needed
for (int64_t i = 0; i < num_elements; i++) {
dst[i] = src[i];
}
}
static void copy_f16_row(float * dst, const uint16_t * src, int64_t num_elements) {
for (int64_t i = 0; i < num_elements; i++) {
dst[i] = fp16_to_fp32(src[i]);
}
}
// Copy a row of F32 data from source to destination, aligned to cache line boundaries
// using FP32 load/store instructions. They don't perform data conversion so is fine.
// Requirement: n_bytes is a multiple of CACHE_LINE_SIZE (64 bytes)
static void copy_row_cache_align(float * dst, const float * src, int64_t n_bytes) {
int num_f32_elem = n_bytes / sizeof(float);
// Unrolled to do an entire cache line at a time
__asm__ volatile(
"1: \n\t"
// --- Process 64 Bytes (1 Cache Line) ---
// Load 256 bits (32 bytes) into f0 and the other into f1
"flq2 f0, 0(%[src]) \n\t"
"flq2 f1, 32(%[src]) \n\t"
// Store 256 bits (32 bytes) from f0 and f1
"fsq2 f0, 0(%[dst]) \n\t"
"fsq2 f1, 32(%[dst]) \n\t"
// Increment Pointers by 64 bytes
"addi %[src], %[src], 64 \n\t"
"addi %[dst], %[dst], 64 \n\t"
// Decrement count by 16 elements
"addi %[n], %[n], -16 \n\t"
// Loop if at least 16 elements remain
"bge %[n], %[stride_count], 1b \n\t"
: [dst] "+r"(dst), [src] "+r"(src), [n] "+r"(num_f32_elem)
: [stride_count] "r"(16L)
: "f0", "f1", "memory");
}
// Copied from GGML: copy a row of Q4_0 data to F32 destination (with dequantization)
static void copy_q4_0_row(float * dst, const block_q4_0 * src_blocks, int64_t num_elements) {
const int64_t num_blocks = (num_elements + QK4_0 - 1) / QK4_0;
for (int64_t block_idx = 0; block_idx < num_blocks; block_idx++) {
const int64_t elements_in_block = (block_idx == num_blocks - 1) ? (num_elements - block_idx * QK4_0) : QK4_0;
float temp_buffer[QK4_0];
dequantize_q4_0_block(&src_blocks[block_idx], temp_buffer);
for (int64_t i = 0; i < elements_in_block; i++) {
dst[block_idx * QK4_0 + i] = temp_buffer[i];
}
}
}
// Copy a row of Q8_0 data to F32 destination (with dequantization)
static void copy_q8_0_row(float * dst, const block_q8_0 * src_blocks, int64_t num_elements) {
// Number of Q8_0 blocks needed for this row
const int64_t num_blocks = (num_elements + QK8_0 - 1) / QK8_0; // Round up to handle partial blocks
for (int64_t block_idx = 0; block_idx < num_blocks; block_idx++) {
const int64_t elements_in_block =
(block_idx == num_blocks - 1) ? (num_elements - block_idx * QK8_0) : QK8_0; // Handle last partial block
// Dequantize the block
float temp_buffer[QK8_0];
dequantize_q8_0_block(&src_blocks[block_idx], temp_buffer);
// Copy dequantized values to destination
for (int64_t i = 0; i < elements_in_block; i++) {
dst[block_idx * QK8_0 + i] = temp_buffer[i];
}
}
}
// Copy a row of Q4_K data to F32 destination (with dequantization)
static void copy_q4_K_row(float * dst, const block_q4_K * src_blocks, int64_t num_elements) {
const int64_t num_blocks = (num_elements + QK_K - 1) / QK_K;
for (int64_t block_idx = 0; block_idx < num_blocks; block_idx++) {
const int64_t elements_in_block = (block_idx == num_blocks - 1) ? (num_elements - block_idx * QK_K) : QK_K;
float temp_buffer[QK_K];
dequantize_q4_K_block(&src_blocks[block_idx], temp_buffer);
for (int64_t i = 0; i < elements_in_block; i++) {
dst[block_idx * QK_K + i] = temp_buffer[i];
}
}
}
static void dequantize_q8_0_block_cache_aligned(const block_q8_0 * block, float * dst) {
const int8_t * qs_ptr = block->qs;
uint64_t temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
const int32_t __attribute__((aligned(32))) vec_indices[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
float scale = fp16_to_fp32(block->d);
__asm__ volatile(
"fbcx.ps f0, %0 \n\t" // Broadcast integer scale to all lanes
"flq2 f1, 0(%1) \n\t" // Load gether indicies
::"r"(scale),
"r"(vec_indices)
: "f0", "f1");
for (int i = 0; i < 4; i++) {
__asm__ volatile(
"fgb.ps f2, f1(%0) \n\t" // Loads 8 bytes from (qs_ptr + indices) and sign-extends to 32-bit int.
"fcvt.ps.pw f2, f2, rne \n\t" // Convert Int32 to Float32
"fmul.ps f2, f2, f0 \n\t" // f2 = f2 * f0 (scale)
"fsq2 f2, 0(%1) \n\t" // Store 256 bits (8 floats) to dst.
::"r"(qs_ptr),
"r"(dst)
: "f2", "memory");
// Advance pointers in C
qs_ptr += 8;
dst += 8;
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
}
// Copy a row of Q4_0 data to F32 destination (with dequantization), cache-aligned
static void copy_q4_0_row_cache_aligned(float * dst, const block_q4_0 * src_blocks, int64_t num_elements) {
const int64_t num_blocks = (num_elements + QK4_0 - 1) / QK4_0;
// Scatter byte offsets: even lanes -> dst[j], odd lanes -> dst[j + QK4_0/2]
// For 4 consecutive packed bytes producing [low0, high0, low1, high1, low2, high2, low3, high3]:
// low_i -> byte offset i*4 (positions 0,1,2,3 in first half)
// high_i -> byte offset (16+i)*4 (positions 16,17,18,19 in second half)
const int32_t __attribute__((aligned(32))) scatter_offsets[8] = { 0 * 4, 16 * 4, 1 * 4, 17 * 4,
2 * 4, 18 * 4, 3 * 4, 19 * 4 };
// Gather indices: each byte loaded twice for low/high nibble extraction
const int32_t __attribute__((aligned(32))) gather_indices[8] = { 0, 0, 1, 1, 2, 2, 3, 3 };
uint64_t temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
// Load constant vectors once — shared across all blocks and iterations
__asm__ volatile(
"flq2 f4, 0(%0) \n\t" // f4 = scatter offsets
"flq2 f1, 0(%1) \n\t" // f1 = gather indices {0,0,1,1,2,2,3,3}
::"r"(scatter_offsets),
"r"(gather_indices)
: "f1", "f4");
for (int64_t block_idx = 0; block_idx < num_blocks; block_idx++) {
const block_q4_0 * block = &src_blocks[block_idx];
const uint8_t * qs = block->qs;
float * block_dst = dst + block_idx * QK4_0;
float scale = fp16_to_fp32(block->d);
float bias = -8.0f * scale;
// Per-block: broadcast scale and bias
__asm__ volatile(
"fbcx.ps f0, %0 \n\t" // f0 = broadcast(scale)
"fbcx.ps f3, %1 \n\t" // f3 = broadcast(-8 * scale)
::"r"(scale),
"r"(bias)
: "f0", "f3");
// 4 iterations x 4 packed bytes = 16 bytes = full block -> 32 floats
for (int i = 0; i < 4; i++) {
__asm__ volatile(
"fgb.ps f2, f1(%0) \n\t" // Gather: [b0,b0,b1,b1,b2,b2,b3,b3]
"mov.m.x m0, x0, 0xAA \n\t" // Odd lanes only (fills gather latency)
"fsrli.pi f2, f2, 4 \n\t" // Odd lanes: byte >> 4 (high nibble)
"mov.m.x m0, x0, 0xFF \n\t" // Restore full mask
"fslli.pi f2, f2, 28 \n\t" // Isolate low 4 bits: shift left 28
"fsrli.pi f2, f2, 28 \n\t" // then right 28 -> nibble in [3:0]
"fcvt.ps.pw f2, f2, rne \n\t" // Int32 -> Float32
"fmul.ps f2, f2, f0 \n\t" // * scale
"fadd.ps f2, f2, f3 \n\t" // + bias -> (nibble - 8) * scale
"fscw.ps f2, f4(%1) \n\t" // Scatter to GGML positions
::"r"(qs),
"r"(block_dst)
: "f2", "memory");
qs += 4; // 4 packed bytes consumed
block_dst += 4; // Advance base by 4 float positions
}
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask)); // Restore mask
}
// Copy a row of Q8_0 data to F32 destination (with dequantization)
static void copy_q8_0_row_cache_aligned(float * dst, const block_q8_0 * src_blocks, int64_t num_elements) {
// Number of Q8_0 blocks needed for this row
const int64_t num_blocks = (num_elements + QK8_0 - 1) / QK8_0; // Round up to handle partial blocks
for (int64_t block_idx = 0; block_idx < num_blocks; block_idx++) {
const int64_t elements_in_block =
(block_idx == num_blocks - 1) ? (num_elements - block_idx * QK8_0) : QK8_0; // Handle last partial block
// Dequantize the block
float temp_buffer[QK8_0];
dequantize_q8_0_block_cache_aligned(&src_blocks[block_idx], temp_buffer);
// Copy dequantized values to destination
for (int64_t i = 0; i < elements_in_block; i++) {
dst[block_idx * QK8_0 + i] = temp_buffer[i];
}
}
}
// Vectorized dequantization of a Q4_K super-block (256 elements) to F32
// Processes 8 groups of 32 elements, using ET SIMD for the inner loops.
// Output is sequential (no scatter needed unlike Q4_0).
static void copy_q4_K_row_cache_aligned(float * dst, const block_q4_K * src_blocks, int64_t num_elements) {
const int64_t num_blocks = (num_elements + QK_K - 1) / QK_K;
// Gather indices for sequential byte access: {0,1,2,3,4,5,6,7}
const int32_t __attribute__((aligned(32))) gather_indices[8] = { 0, 1, 2, 3, 4, 5, 6, 7 };
uint64_t temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
// Load gather indices once — shared across all blocks
__asm__ volatile("flq2 f1, 0(%0) \n\t" // f1 = gather indices {0,1,2,3,4,5,6,7}
::"r"(gather_indices)
: "f1");
for (int64_t block_idx = 0; block_idx < num_blocks; block_idx++) {
const block_q4_K * block = &src_blocks[block_idx];
const uint8_t * qs = block->qs;
float * block_dst = dst + block_idx * QK_K;
const float d = fp16_to_fp32(block->d);
const float min = fp16_to_fp32(block->dmin);
int is = 0;
for (int j = 0; j < QK_K; j += 64) {
// Extract per-group scales and mins (scalar — only 8 pairs per super-block)
uint8_t sc, m;
get_scale_min_k4(is + 0, block->scales, &sc, &m);
const float d1 = d * sc;
const float neg_m1 = -(min * m);
get_scale_min_k4(is + 1, block->scales, &sc, &m);
const float d2 = d * sc;
const float neg_m2 = -(min * m);
// Low nibbles: 32 elements using d1, neg_m1
__asm__ volatile(
"fbcx.ps f0, %0 \n\t" // f0 = broadcast(d1)
"fbcx.ps f3, %1 \n\t" // f3 = broadcast(-m1)
::"r"(d1),
"r"(neg_m1)
: "f0", "f3");
const uint8_t * qs_lo = qs;
float * dst_lo = block_dst + j;
for (int k = 0; k < 4; k++) {
__asm__ volatile(
"fgb.ps f2, f1(%0) \n\t" // Gather 8 bytes, sign-extend to int32
"fandi.pi f2, f2, 0xF \n\t" // Mask low nibble (imm10=15)
"fcvt.ps.pw f2, f2, rne \n\t" // Int32 -> Float32
"fmadd.ps f2, f2, f0, f3\n\t" // d1 * nibble + (-m1)
"fsq2 f2, 0(%1) \n\t" // Store 8 floats
::"r"(qs_lo),
"r"(dst_lo)
: "f2", "memory");
qs_lo += 8;
dst_lo += 8;
}
// High nibbles: 32 elements using d2, neg_m2
__asm__ volatile(
"fbcx.ps f0, %0 \n\t" // f0 = broadcast(d2)
"fbcx.ps f3, %1 \n\t" // f3 = broadcast(-m2)
::"r"(d2),
"r"(neg_m2)
: "f0", "f3");
const uint8_t * qs_hi = qs;
float * dst_hi = block_dst + j + 32;
for (int k = 0; k < 4; k++) {
__asm__ volatile(
"fgb.ps f2, f1(%0) \n\t" // Gather 8 bytes, sign-extend to int32
"fsrli.pi f2, f2, 4 \n\t" // Shift right 4: high nibble
"fandi.pi f2, f2, 0xF \n\t" // Mask to 4 bits (clean any sign-ext artifacts)
"fcvt.ps.pw f2, f2, rne \n\t" // Int32 -> Float32
"fmadd.ps f2, f2, f0, f3\n\t" // d2 * nibble + (-m2)
"fsq2 f2, 0(%1) \n\t" // Store 8 floats
::"r"(qs_hi),
"r"(dst_hi)
: "f2", "memory");
qs_hi += 8;
dst_hi += 8;
}
qs += 32; // Advance to next 32 packed bytes
is += 2;
}
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask)); // Restore mask
}
// Determine the number of F32 elements per work unit for a given source type.
// For F32: 1 cacheline (16 elements)
// For quantized types: 1 quant block
static int64_t get_elements_per_work_unit(int type) {
const int64_t elements_per_cacheline = CACHE_LINE_SIZE_BYTES / sizeof(float); // 16
switch (type) {
case GGML_TYPE_Q8_0:
return QK8_0; // 32 elements = 2 cachelines
case GGML_TYPE_Q4_0:
return QK4_0; // 32 elements = 2 cachelines
case GGML_TYPE_Q4_K:
return QK_K; // 256 elements = 16 cachelines
default:
return elements_per_cacheline; // 16 elements = 1 cacheline
}
}
static int get_row_f32_mc_cacheline_aligned(struct ggml_et_get_rows_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
struct ggml_tensor * src0 = &params->src0; // Data tensor
struct ggml_tensor * src1 = &params->src1; // Row indices tensor (I32)
struct ggml_tensor * dst = &params->dst; // Output tensor (F32)
const int64_t ne00 = src0->ne[0]; // Source columns (row width)
const int64_t ne01 = src0->ne[1]; // Source rows (total available rows)
const int64_t ne02 = src0->ne[2]; // Source batch dimension
const int64_t ne03 = src0->ne[3]; // Source outer batch dimension
const int64_t ne10 = src1->ne[0]; // Number of indices in dimension 0
const int64_t ne11 = src1->ne[1]; // Number of indices in dimension 1
const int64_t ne12 = src1->ne[2]; // Batch dimension for indices
const int64_t ne13 = src1->ne[3]; // Outer batch dimension for indices
const int64_t total_rows_to_extract = ne10 * ne11 * ne12 * ne13;
// Determine work unit size based on source type
const int64_t elements_per_wu = get_elements_per_work_unit(src0->type);
const int64_t wus_per_row = ne00 / elements_per_wu;
const int64_t total_wus = total_rows_to_extract * wus_per_row;
// Distribute work units across threads (contiguous ranges)
const int64_t wus_per_thread = (total_wus + num_threads - 1) / num_threads;
const int64_t wu_start = thread_id * wus_per_thread;
int64_t wu_end = wu_start + wus_per_thread;
if (wu_end > total_wus) {
wu_end = total_wus;
}
void * src0_data = src0->data;
int32_t * src1_data = (int32_t *) src1->data;
float * dst_data = (float *) dst->data;
int64_t wu = wu_start;
while (wu < wu_end) {
// Determine which row this work unit belongs to and offset within row
const int64_t row_idx = wu / wus_per_row;
const int64_t wu_in_row = wu % wus_per_row;
// How many work units to process in this row (batch contiguous WUs in same row)
int64_t wus_remaining_in_row = wus_per_row - wu_in_row;
int64_t wus_to_process = wu_end - wu;
if (wus_remaining_in_row < wus_to_process) {
wus_to_process = wus_remaining_in_row;
}
// Calculate multi-dimensional index for this row
const int64_t i = row_idx;
const int64_t i13_idx = i / (ne12 * ne11 * ne10);
const int64_t i12_idx = (i - i13_idx * ne12 * ne11 * ne10) / (ne11 * ne10);
const int64_t i11_idx = (i - i13_idx * ne12 * ne11 * ne10 - i12_idx * ne11 * ne10) / ne10;
const int64_t i10_idx = i - i13_idx * ne12 * ne11 * ne10 - i12_idx * ne11 * ne10 - i11_idx * ne10;
// Get the row index from src1
const int64_t index_offset = i13_idx * ne12 * ne11 * ne10 + i12_idx * ne11 * ne10 + i11_idx * ne10 + i10_idx;
const int32_t row_index = src1_data[index_offset];
if (row_index < 0 || row_index >= ne01) {
return -1; // Index out of bounds
}
const int64_t batch_offset =
i11_idx * ne01 * ne00 + i12_idx * ne02 * ne01 * ne00 + i13_idx * ne03 * ne02 * ne01 * ne00;
const int64_t elem_offset_in_row = wu_in_row * elements_per_wu;
const int64_t num_elements = wus_to_process * elements_per_wu;
float * dst_row = dst_data + row_idx * ne00 + elem_offset_in_row;
if (src0->type == GGML_TYPE_F32) {
// F32 source: direct copy of cacheline-aligned chunk
const float * src_row = (const float *) src0_data + row_index * ne00 + batch_offset + elem_offset_in_row;
copy_row_cache_align(dst_row, src_row, num_elements * sizeof(float));
} else if (src0->type == GGML_TYPE_F16) {
// F16 source: scalar conversion over a destination-aligned write chunk.
const uint16_t * src_row =
(const uint16_t *) src0_data + row_index * ne00 + batch_offset + elem_offset_in_row;
copy_f16_row(dst_row, src_row, num_elements);
} else if (src0->type == GGML_TYPE_Q8_0) {
// Q8_0 source: dequantize work-unit-aligned blocks
const int64_t blocks_per_row = (ne00 + QK8_0 - 1) / QK8_0;
const int64_t src_block_offset = (row_index * blocks_per_row) + (batch_offset / ne00) * blocks_per_row;
const int64_t block_start = elem_offset_in_row / QK8_0;
const block_q8_0 * src_blocks = (const block_q8_0 *) src0_data + src_block_offset + block_start;
copy_q8_0_row_cache_aligned(dst_row, src_blocks, num_elements);
} else if (src0->type == GGML_TYPE_Q4_0) {
// Q4_0 source: dequantize work-unit-aligned blocks
const int64_t blocks_per_row = (ne00 + QK4_0 - 1) / QK4_0;
const int64_t src_block_offset = (row_index * blocks_per_row) + (batch_offset / ne00) * blocks_per_row;
const int64_t block_start = elem_offset_in_row / QK4_0;
const block_q4_0 * src_blocks = (const block_q4_0 *) src0_data + src_block_offset + block_start;
copy_q4_0_row_cache_aligned(dst_row, src_blocks, num_elements);
} else if (src0->type == GGML_TYPE_Q4_K) {
// Q4_K source: dequantize work-unit-aligned blocks
const int64_t blocks_per_row = (ne00 + QK_K - 1) / QK_K;
const int64_t src_block_offset = (row_index * blocks_per_row) + (batch_offset / ne00) * blocks_per_row;
const int64_t block_start = elem_offset_in_row / QK_K;
const block_q4_K * src_blocks = (const block_q4_K *) src0_data + src_block_offset + block_start;
copy_q4_K_row_cache_aligned(dst_row, src_blocks, num_elements);
}
wu += wus_to_process;
}
return 0;
}
static inline size_t tensor_bytes(const struct ggml_tensor * t) {
return (size_t) t->ne[0] * t->ne[1] * t->ne[2] * t->ne[3] * t->nb[0];
}
int entry_point(struct ggml_et_get_rows_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
struct ggml_tensor * src0 = &params->src0; // Data tensor (F32, Q4_0, Q8_0, or Q4_K)
struct ggml_tensor * src1 = &params->src1; // Row indices tensor (I32)
struct ggml_tensor * dst = &params->dst; // Output tensor (F32)
// Fast path - we know how to deal with them multi-core
if ((src0->type == GGML_TYPE_F32 || src0->type == GGML_TYPE_F16 || src0->type == GGML_TYPE_Q8_0 ||
src0->type == GGML_TYPE_Q4_0 || src0->type == GGML_TYPE_Q4_K) &&
src1->type == GGML_TYPE_I32 && dst->type == GGML_TYPE_F32 && dst->ne[0] % CACHE_ELEMENTS(sizeof(float)) == 0) {
return get_row_f32_mc_cacheline_aligned(params, env);
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (thread_id != 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1; // Invalid pointer
}
if (dst->type != GGML_TYPE_F32 || src1->type != GGML_TYPE_I32) {
return -1; // Invalid output or index type
}
if (src0->type != GGML_TYPE_F32 && src0->type != GGML_TYPE_F16 && src0->type != GGML_TYPE_Q8_0 &&
src0->type != GGML_TYPE_Q4_0 && src0->type != GGML_TYPE_Q4_K) {
return -1; // Unsupported input type
}
void * src0_data = src0->data;
int32_t * src1_data = (int32_t *) src1->data;
float * dst_data = (float *) dst->data;
#ifdef ET_UBERKERNEL
evict_region_past_l2(src0_data, tensor_bytes(src0));
evict_region_past_l2(src1_data, tensor_bytes(src1));
evict_region_past_l2(dst_data, tensor_bytes(dst));
#endif
if (!src0_data || !src1_data || !dst_data) {
return -1; // Null data pointer
}
const int64_t ne00 = src0->ne[0]; // Source columns (row width)
const int64_t ne01 = src0->ne[1]; // Source rows (total available rows)
const int64_t ne02 = src0->ne[2]; // Source batch dimension
const int64_t ne03 = src0->ne[3]; // Source outer batch dimension
const int64_t ne10 = src1->ne[0]; // Number of indices in dimension 0
const int64_t ne11 = src1->ne[1]; // Number of indices in dimension 1
const int64_t ne12 = src1->ne[2]; // Batch dimension for indices
const int64_t ne13 = src1->ne[3]; // Outer batch dimension for indices
const int64_t total_rows_to_extract = ne10 * ne11 * ne12 * ne13;
#ifdef ET_UBERKERNEL
et_barrier(ET_BARRIER_GLOBAL);
#endif
// Naive single-threaded implementation - process all rows sequentially
// XXX: Do we really need a single-threaded implementation?
for (int64_t i = 0; i < total_rows_to_extract; i++) {
// Calculate multi-dimensional index for the current output position
const int64_t i13_idx = i / (ne12 * ne11 * ne10);
const int64_t i12_idx = (i - i13_idx * ne12 * ne11 * ne10) / (ne11 * ne10);
const int64_t i11_idx = (i - i13_idx * ne12 * ne11 * ne10 - i12_idx * ne11 * ne10) / ne10;
const int64_t i10_idx = i - i13_idx * ne12 * ne11 * ne10 - i12_idx * ne11 * ne10 - i11_idx * ne10;
// Get the row index from src1
const int64_t index_offset = i13_idx * ne12 * ne11 * ne10 + i12_idx * ne11 * ne10 + i11_idx * ne10 + i10_idx;
const int32_t row_index = src1_data[index_offset];
if (row_index < 0 || row_index >= ne01) {
return -1; // Index out of bounds
}
const int64_t batch_offset =
i11_idx * ne01 * ne00 + i12_idx * ne02 * ne01 * ne00 + i13_idx * ne03 * ne02 * ne01 * ne00;
const int64_t dst_offset = i;
if (src0->type == GGML_TYPE_F32) {
// F32 source: direct copy
const float * src_row = (const float *) src0_data + row_index * ne00 + batch_offset;
float * dst_row = dst_data + dst_offset * ne00;
copy_f32_row(dst_row, src_row, ne00);
} else if (src0->type == GGML_TYPE_F16) {
// F16 source: scalar conversion
const uint16_t * src_row = (const uint16_t *) src0_data + row_index * ne00 + batch_offset;
float * dst_row = dst_data + dst_offset * ne00;
copy_f16_row(dst_row, src_row, ne00);
} else if (src0->type == GGML_TYPE_Q8_0) {
// Q8_0 source: dequantize while copying
const int64_t blocks_per_row = (ne00 + QK8_0 - 1) / QK8_0;
const int64_t src_block_offset = (row_index * blocks_per_row) + (batch_offset / ne00) * blocks_per_row;
const block_q8_0 * src_blocks = (const block_q8_0 *) src0_data + src_block_offset;
float * dst_row = dst_data + dst_offset * ne00;
copy_q8_0_row(dst_row, src_blocks, ne00);
} else if (src0->type == GGML_TYPE_Q4_0) {
// Q4_0 source: dequantize while copying
const int64_t blocks_per_row = (ne00 + QK4_0 - 1) / QK4_0;
const int64_t src_block_offset = (row_index * blocks_per_row) + (batch_offset / ne00) * blocks_per_row;
const block_q4_0 * src_blocks = (const block_q4_0 *) src0_data + src_block_offset;
float * dst_row = dst_data + dst_offset * ne00;
copy_q4_0_row(dst_row, src_blocks, ne00);
} else if (src0->type == GGML_TYPE_Q4_K) {
// Q4_K source: dequantize while copying
const int64_t blocks_per_row = (ne00 + QK_K - 1) / QK_K;
const int64_t src_block_offset = (row_index * blocks_per_row) + (batch_offset / ne00) * blocks_per_row;
const block_q4_K * src_blocks = (const block_q4_K *) src0_data + src_block_offset;
float * dst_row = dst_data + dst_offset * ne00;
copy_q4_K_row(dst_row, src_blocks, ne00);
}
}
return 0;
}
@@ -1,44 +0,0 @@
// ET kernel entry-point parameter structs and tensor helpers.
#ifndef GGML_TENSOR_H
#define GGML_TENSOR_H
#include <stddef.h>
#include <stdint.h>
#include "ggml.h"
struct ggml_et_binary_params {
struct ggml_tensor src0;
struct ggml_tensor src1;
struct ggml_tensor dst;
};
// bias.data == NULL -> unfused MUL_MAT; otherwise dst = mat_mul(...) + bias.
struct ggml_et_mm_q8_params {
struct ggml_tensor src0;
struct ggml_tensor src1;
struct ggml_tensor dst;
struct ggml_tensor bias;
};
struct ggml_et_mul_mat_id_params {
struct ggml_tensor src0; // [K, M, n_expert]
struct ggml_tensor src1; // [K, n_expert_used, batch]
struct ggml_tensor src2; // [n_expert_used, batch] (I32 expert indices)
struct ggml_tensor dst; // [M, n_expert_used, batch, 1]
};
// ne[i] == 1 axes are skipped: their stride is unobservable.
static inline int ggml_tensor_is_contiguous(const struct ggml_tensor * t, int type_size) {
int64_t expected = type_size;
for (int i = 0; i < GGML_MAX_DIMS; i++) {
if (t->ne[i] > 1 && (int64_t) t->nb[i] != expected) {
return 0;
}
expected *= t->ne[i];
}
return 1;
}
#endif // GGML_TENSOR_H
-551
View File
@@ -1,551 +0,0 @@
//******************************************************************************
// GLU F32 Kernel (SwiGLU specifically)
// Gated Linear Unit: y[i] = silu(x[i]) * g[i] where silu(x) = x * sigmoid(x)
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdint.h>
// GLU kernel parameters structure (from ET backend ops)
struct ggml_et_glu_params {
struct ggml_tensor src0; // F32 input tensor A (or combined tensor if src1 is null)
struct ggml_tensor src1; // F32 input tensor B (null for single tensor mode)
struct ggml_tensor dst; // F32 output tensor (n/2 columns)
int32_t glu_op_type; // GLU operation type (REGLU=0, GEGLU=1, SWIGLU=2, etc.)
int32_t swapped; // Whether gate and value are swapped
float alpha; // SWIGLU_OAI: sigmoid scaling factor
float limit; // SWIGLU_OAI: clamp limit
};
// SiLU activation function: silu(x) = x * sigmoid(x) = x / (1 + exp(-x))
static inline float silu_f32(float x) {
// For numerical stability, use the mathematically equivalent form:
// silu(x) = x / (1 + exp(-x)) = x * sigmoid(x)
// For large negative x, exp(-x) -> inf, so silu(x) -> 0
// For large positive x, exp(-x) -> 0, so silu(x) -> x
if (x > 20.0f) {
// For x > 20, exp(-x) is negligible, silu(x) ~ x
return x;
} else if (x < -20.0f) {
// For x < -20, silu(x) ~ 0
return 0.0f;
} else {
// Use standard formula: silu(x) = x / (1 + exp(-x))
// Optimized using ET hardware division
float exp_neg_x = et_expf(-x);
float denominator = 1.0f + exp_neg_x;
return et_fdiv(x, denominator);
}
}
// Vectorized GeGLU block processing (8 elements = 1 cache line, 64B aligned)
// gelu(x) = 0.5*x*(1 + tanh(z)) = x * (1 - 1/(exp(2z)+1))
// where z = sqrt(2/pi) * x * (1 + 0.044715*x^2)
// Reformulated to avoid inf*0 NaN: uses x * sigmoid(2z) identity
static inline void block_geglu(float * dst_block, const float * x_block, const float * g_block, int elements) {
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
float one_const = 1.0f;
float coef_a_const = 0.044715f;
float sqrt2pi_const = 0.79788456080286535587989211986876f; // sqrt(2/pi)
float two_log2e_const = 2.8853900817779268f; // 2 * log2(e)
for (int32_t i = 0; i < elements; i += 8) {
__asm__ volatile(
// Load inputs
"flw.ps f10, %[x_vec]\n" // f10 = x
"flw.ps f11, %[g_vec]\n" // f11 = g
// Broadcast constants
"fbc.ps f20, %[one_ptr]\n" // f20 = 1.0
"fbc.ps f22, %[coef_ptr]\n" // f22 = 0.044715
"fbc.ps f23, %[sqrt2pi_ptr]\n" // f23 = sqrt(2/pi)
"fbc.ps f24, %[two_log2e_ptr]\n" // f24 = 2*log2(e)
// inner = 1 + 0.044715 * x^2
"fmul.ps f12, f10, f10\n" // f12 = x^2
"fmadd.ps f13, f22, f12, f20\n" // f13 = 1 + 0.044715*x^2
// z = sqrt(2/pi) * x * inner
"fmul.ps f14, f23, f10\n" // f14 = sqrt(2/pi) * x
"fmul.ps f14, f14, f13\n" // f14 = z
// exp(2z) via fexp.ps: feed z * 2*log2(e) since fexp computes 2^input
"fmul.ps f15, f14, f24\n" // f15 = 2z * log2(e)
"fexp.ps f15, f15\n" // f15 = exp(2z)
// gelu(x) = x * (1 - 1/(exp(2z)+1)) [NaN-safe: no inf*0]
// exp(2z)->inf: rcp(inf)=0, 1-0=1, gelu=x
// exp(2z)->0: rcp(1)=1, 1-1=0, gelu=0
"fadd.ps f16, f15, f20\n" // f16 = exp(2z) + 1
"frcp.ps f16, f16\n" // f16 = 1/(exp(2z) + 1)
"fsub.ps f16, f20, f16\n" // f16 = 1 - 1/(exp(2z)+1)
"fmul.ps f16, f10, f16\n" // f16 = gelu(x)
// Final result
"fmul.ps f18, f16, f11\n" // f18 = gelu(x) * g
"fsw.ps f18, %[dst_out]\n"
: [dst_out] "=m"(*(float (*)[8]) & dst_block[i])
: [x_vec] "m"(*(const float (*)[8]) & x_block[i]), [g_vec] "m"(*(const float (*)[8]) & g_block[i]),
[one_ptr] "m"(one_const), [coef_ptr] "m"(coef_a_const), [sqrt2pi_ptr] "m"(sqrt2pi_const),
[two_log2e_ptr] "m"(two_log2e_const)
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f18", "f20", "f22", "f23", "f24");
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
}
// Vectorized SwiGLU block processing (16 elements = 1 cache line)
static inline void block_swiglu(float * dst_block, const float * x_block, const float * g_block, int elements) {
// Process 8 elements at a time using vector instructions
int32_t vec_end = (elements / 8) * 8;
// Set mask register to enable all 8 vector elements
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask)); // Save current mask
__asm__ volatile("mov.m.x m0, x0, 0xFF"); // Enable all 8 elements
// Constants for broadcasting
float zero_const = 0.0f;
float one_const = 1.0f;
float log2e_const = 1.4426950408889634f; // log2(e)
for (int32_t i = 0; i < vec_end; i += 8) {
// Vectorized SwiGLU: dst = silu(x) * g = (x / (1 + exp(-x))) * g
// Using ET hardware: exp, reciprocal, multiply operations
__asm__ volatile(
// Load input vectors
"flw.ps f10, %[x_vec]\n" // f10 = x[0..7]
"flw.ps f11, %[g_vec]\n" // f11 = g[0..7]
// Broadcast constants to vector registers
"fbc.ps f20, %[zero_ptr]\n" // f20 = broadcast(0.0f) to all 8 elements
"fbc.ps f21, %[one_ptr]\n" // f21 = broadcast(1.0f) to all 8 elements
// Compute -x (negate x by subtracting from zero)
"fsub.ps f12, f20, f10\n" // f12 = 0 - x = -x
// Convert to base-2 exponent: -x * log2(e) = -x * 1.44269504
// Load log2(e) constant
"fbc.ps f22, %[log2e_ptr]\n" // f22 = broadcast(1.44269504f)
"fmul.ps f13, f12, f22\n" // f13 = -x * log2(e)
// Compute 2^(-x * log2(e)) = exp(-x)
"fexp.ps f14, f13\n" // f14 = 2^(-x * log2(e)) = exp(-x)
// Compute 1 + exp(-x)
"fadd.ps f15, f14, f21\n" // f15 = exp(-x) + 1
// Compute 1 / (1 + exp(-x)) using reciprocal
"frcp.ps f16, f15\n" // f16 = 1 / (1 + exp(-x))
// Compute silu(x) = x * (1 / (1 + exp(-x)))
"fmul.ps f17, f10, f16\n" // f17 = x * (1 / (1 + exp(-x))) = silu(x)
// Compute final result: silu(x) * g
"fmul.ps f18, f17, f11\n" // f18 = silu(x) * g
// Store result
"fsw.ps f18, %[dst_out]\n" // Store 8 results to destination
: [dst_out] "=m"(*(float (*)[8]) & dst_block[i])
: [x_vec] "m"(*(const float (*)[8]) & x_block[i]), [g_vec] "m"(*(const float (*)[8]) & g_block[i]),
[zero_ptr] "m"(zero_const), // Memory reference to 0.0f for broadcasting
[one_ptr] "m"(one_const), // Memory reference to 1.0f for broadcasting
[log2e_ptr] "m"(log2e_const) // Memory reference to log2(e) for broadcasting
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17", "f18", "f20", "f21", "f22");
}
// Restore original mask
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
// Handle remaining elements (< 8) with scalar operations
for (int32_t i = vec_end; i < elements; i++) {
dst_block[i] = silu_f32(x_block[i]) * g_block[i];
}
}
// Vectorized ReGLU block: dst = max(0, x) * g
static inline void block_reglu(float * dst_block, const float * x_block, const float * g_block, int elements) {
int32_t vec_end = (elements / 8) * 8;
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
float zero_const = 0.0f;
for (int32_t i = 0; i < vec_end; i += 8) {
__asm__ volatile(
"flw.ps f10, %[x_vec]\n" // f10 = x
"flw.ps f11, %[g_vec]\n" // f11 = g
"fbc.ps f20, %[zero_ptr]\n" // f20 = 0.0
"fmax.ps f12, f10, f20\n" // f12 = max(x, 0)
"fmul.ps f13, f12, f11\n" // f13 = relu(x) * g
"fsw.ps f13, %[dst_out]\n"
: [dst_out] "=m"(*(float (*)[8]) & dst_block[i])
: [x_vec] "m"(*(const float (*)[8]) & x_block[i]), [g_vec] "m"(*(const float (*)[8]) & g_block[i]),
[zero_ptr] "m"(zero_const)
: "f10", "f11", "f12", "f13", "f20");
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
for (int32_t i = vec_end; i < elements; i++) {
float xv = x_block[i];
dst_block[i] = (xv > 0.0f) ? xv * g_block[i] : 0.0f;
}
}
// Vectorized GeGLU-Quick block: dst = x * sigmoid(1.702 * x) * g
// Using gelu_quick(x) = x / (1 + exp(-1.702*x))
static inline void block_geglu_quick(float * dst_block, const float * x_block, const float * g_block, int elements) {
int32_t vec_end = (elements / 8) * 8;
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
float zero_const = 0.0f;
float one_const = 1.0f;
// -1.702 * log2(e), so that fexp.ps(x * neg_k_log2e) = exp(-1.702*x)
float neg_k_log2e_const = -1.702f * 1.4426950408889634f;
for (int32_t i = 0; i < vec_end; i += 8) {
__asm__ volatile(
"flw.ps f10, %[x_vec]\n" // f10 = x
"flw.ps f11, %[g_vec]\n" // f11 = g
"fbc.ps f20, %[zero_ptr]\n" // f20 = 0
"fbc.ps f21, %[one_ptr]\n" // f21 = 1
"fbc.ps f22, %[k_ptr]\n" // f22 = -1.702*log2(e)
"fmul.ps f13, f10, f22\n" // f13 = -1.702*x*log2(e)
"fexp.ps f14, f13\n" // f14 = exp(-1.702*x)
"fadd.ps f15, f14, f21\n" // f15 = 1 + exp(-1.702*x)
"frcp.ps f16, f15\n" // f16 = sigmoid(1.702*x)
"fmul.ps f17, f10, f16\n" // f17 = gelu_quick(x)
"fmul.ps f18, f17, f11\n" // f18 = gelu_quick(x) * g
"fsw.ps f18, %[dst_out]\n"
: [dst_out] "=m"(*(float (*)[8]) & dst_block[i])
: [x_vec] "m"(*(const float (*)[8]) & x_block[i]), [g_vec] "m"(*(const float (*)[8]) & g_block[i]),
[zero_ptr] "m"(zero_const), [one_ptr] "m"(one_const), [k_ptr] "m"(neg_k_log2e_const)
: "f10", "f11", "f13", "f14", "f15", "f16", "f17", "f18", "f20", "f21", "f22");
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
for (int32_t i = vec_end; i < elements; i++) {
float xv = x_block[i];
// Reuse silu reciprocal path: sigmoid(1.702*x) = 1/(1+exp(-1.702*x))
float e = et_expf(-1.702f * xv);
dst_block[i] = et_fdiv(xv, 1.0f + e) * g_block[i];
}
}
// Vectorized SwiGLU-OAI block (OpenAI gpt-oss variant):
// x_c = min(x, limit)
// y_c = clamp(g, -limit, limit)
// out = (x_c / (1 + exp(-alpha * x_c))) * (y_c + 1)
static inline void block_swiglu_oai(float * dst_block,
const float * x_block,
const float * g_block,
int elements,
float alpha,
float limit) {
int32_t vec_end = (elements / 8) * 8;
unsigned long temp_mask;
__asm__ volatile("mova.x.m %0" : "=r"(temp_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
float zero_const = 0.0f;
float one_const = 1.0f;
float limit_pos = limit;
float limit_neg = -limit;
// -alpha * log2(e): feed (x * neg_alpha_log2e) into fexp.ps to get exp(-alpha*x)
float neg_alpha_l2e = -alpha * 1.4426950408889634f;
for (int32_t i = 0; i < vec_end; i += 8) {
__asm__ volatile(
"flw.ps f10, %[x_vec]\n" // f10 = x raw
"flw.ps f11, %[g_vec]\n" // f11 = g raw
"fbc.ps f20, %[zero_ptr]\n" // f20 = 0
"fbc.ps f21, %[one_ptr]\n" // f21 = 1
"fbc.ps f23, %[lim_pos]\n" // f23 = +limit
"fbc.ps f24, %[lim_neg]\n" // f24 = -limit
"fbc.ps f25, %[k_ptr]\n" // f25 = -alpha*log2(e)
// x_c = min(x, +limit) (no lower bound on x per OAI spec)
"fmin.ps f12, f10, f23\n" // f12 = x_c
// y_c = clamp(g, -limit, +limit) = min(max(g, -limit), +limit)
"fmax.ps f13, f11, f24\n" // f13 = max(g, -limit)
"fmin.ps f13, f13, f23\n" // f13 = y_c
// sigmoid(alpha * x_c) = 1 / (1 + exp(-alpha * x_c))
"fmul.ps f14, f12, f25\n" // f14 = -alpha*x_c*log2(e)
"fexp.ps f15, f14\n" // f15 = exp(-alpha*x_c)
"fadd.ps f15, f15, f21\n" // f15 = 1 + exp(-alpha*x_c)
"frcp.ps f16, f15\n" // f16 = sigmoid(alpha*x_c)
// out_glu = x_c * sigmoid(alpha*x_c)
"fmul.ps f17, f12, f16\n" // f17 = swiglu_oai gate output
// dst = out_glu * (y_c + 1)
"fadd.ps f18, f13, f21\n" // f18 = y_c + 1
"fmul.ps f19, f17, f18\n" // f19 = final
"fsw.ps f19, %[dst_out]\n"
: [dst_out] "=m"(*(float (*)[8]) & dst_block[i])
: [x_vec] "m"(*(const float (*)[8]) & x_block[i]), [g_vec] "m"(*(const float (*)[8]) & g_block[i]),
[zero_ptr] "m"(zero_const), [one_ptr] "m"(one_const), [lim_pos] "m"(limit_pos), [lim_neg] "m"(limit_neg),
[k_ptr] "m"(neg_alpha_l2e)
: "f10", "f11", "f12", "f13", "f14", "f15", "f16", "f17", "f18", "f19", "f20", "f21", "f23", "f24", "f25");
}
__asm__ volatile("mova.m.x %0" ::"r"(temp_mask));
// Scalar tail (mirrors CPU reference exactly)
for (int32_t i = vec_end; i < elements; i++) {
float xv = x_block[i];
float yv = g_block[i];
if (xv > limit) {
xv = limit;
}
if (yv > limit) {
yv = limit;
}
if (yv < -limit) {
yv = -limit;
}
float e = et_expf(-alpha * xv);
float out_glu = et_fdiv(xv, 1.0f + e);
dst_block[i] = out_glu * (yv + 1.0f);
}
}
// Scalar erf approximation (Abramowitz & Stegun 7.1.26, max error ~1.5e-7)
static inline float erf_approx(float x) {
const float a1 = 0.254829592f;
const float a2 = -0.284496736f;
const float a3 = 1.421413741f;
const float a4 = -1.453152027f;
const float a5 = 1.061405429f;
const float p = 0.3275911f;
float sign = (x < 0.0f) ? -1.0f : 1.0f;
float ax = (x < 0.0f) ? -x : x;
float t = et_fdiv(1.0f, 1.0f + p * ax);
float t2 = t * t;
float t3 = t2 * t;
float t4 = t3 * t;
float t5 = t4 * t;
float poly = a1 * t + a2 * t2 + a3 * t3 + a4 * t4 + a5 * t5;
float y = 1.0f - poly * et_expf(-ax * ax);
return sign * y;
}
// GeGLU-Erf block: dst = 0.5 * x * (1 + erf(x / sqrt(2))) * g
// Scalar implementation — variant is rarely used so we keep complexity low.
static inline void block_geglu_erf(float * dst_block, const float * x_block, const float * g_block, int elements) {
const float sqrt_2_inv = 0.70710678118654752440f;
for (int32_t i = 0; i < elements; i++) {
float xv = x_block[i];
dst_block[i] = 0.5f * xv * (1.0f + erf_approx(xv * sqrt_2_inv)) * g_block[i];
}
}
// Main entry point for GLU kernel
int entry_point(struct ggml_et_glu_params * params, void * env) {
// Cast env to proper type
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
// Validate environment pointer
if (!kernel_env) {
return -1;
}
// Get thread info using shire mask from environment
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
// Basic safety check on params
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1; // Invalid pointer
}
// Supported variants: SwiGLU, SwiGLU-OAI, GeGLU, GeGLU-Erf, GeGLU-Quick, ReGLU
switch (params->glu_op_type) {
case GGML_GLU_OP_SWIGLU:
case GGML_GLU_OP_SWIGLU_OAI:
case GGML_GLU_OP_GEGLU:
case GGML_GLU_OP_GEGLU_ERF:
case GGML_GLU_OP_GEGLU_QUICK:
case GGML_GLU_OP_REGLU:
break;
default:
return -1; // Unsupported GLU operation
}
// Extract tensor references
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * src1 = params->src1.data ? &params->src1 : 0;
struct ggml_tensor * dst = &params->dst;
int32_t swapped = params->swapped;
// Validate tensor types (F32 only)
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1; // Unsupported type combination
}
if (src1 && src1->type != GGML_TYPE_F32) {
return -1; // Unsupported src1 type
}
// Get data pointers
float * src0_data = (float *) src0->data;
float * src1_data = src1 ? (float *) src1->data : src0_data;
float * dst_data = (float *) dst->data;
// Validate data pointers
if (!src0_data || !dst_data) {
return -1; // Null data pointer
}
// Get tensor dimensions
const int64_t nc = dst->ne[0]; // Output columns (input columns / 2)
const int64_t nr = dst->ne[1] * dst->ne[2] * dst->ne[3]; // Total rows
// Get strides
const size_t src0_stride = src0->nb[1]; // Stride between rows in src0
const size_t src1_stride = src1 ? src1->nb[1] : src0->nb[1]; // Stride between rows in src1
const size_t dst_stride = dst->nb[1]; // Stride between rows in dst
// Validate dimensions for split SwiGLU
if (src1) {
// Split tensor mode: src0 and src1 should have same shape as dst
if (src0->ne[0] != nc || src1->ne[0] != nc) {
return -1; // Dimension mismatch in split mode
}
} else {
// Single tensor mode: src0 should have 2*nc columns
if (src0->ne[0] != 2 * nc) {
return -1; // Dimension mismatch in single tensor mode
}
}
// Calculate total elements for cache line distribution
const int64_t elements_per_cacheline = 16; // 64 bytes / 4 bytes per float
const int64_t total_elements = nr * nc;
const int64_t total_cachelines = (total_elements + elements_per_cacheline - 1) / elements_per_cacheline;
// Distribute cache lines across threads
int64_t cachelines_per_thread = (total_cachelines + num_threads - 1) / num_threads;
int64_t start_cacheline = thread_id * cachelines_per_thread;
int64_t end_cacheline = start_cacheline + cachelines_per_thread;
// Clamp end_cacheline to actual number of cache lines
if (end_cacheline > total_cachelines) {
end_cacheline = total_cachelines;
}
// Thread should return if no work to do
if (start_cacheline >= total_cachelines) {
return 0;
}
// Process cache lines assigned to this thread
for (int64_t cl = start_cacheline; cl < end_cacheline; cl++) {
// Map cache line back to element coordinates
int64_t global_element_start = cl * elements_per_cacheline;
int64_t row = global_element_start / nc;
int64_t col = global_element_start % nc;
// Skip if we're past the end of data
if (global_element_start >= total_elements) {
break;
}
// Calculate how many elements to process in this cache line
int64_t elements_remaining = total_elements - global_element_start;
int elements_this_block =
(int) ((elements_remaining < elements_per_cacheline) ? elements_remaining : elements_per_cacheline);
// Process elements that span across rows
int64_t elements_processed = 0;
while (elements_processed < elements_this_block && row < nr) {
// Calculate elements to process in current row
int64_t elements_in_row = nc - col;
int64_t elements_to_process = elements_this_block - elements_processed;
if (elements_to_process > elements_in_row) {
elements_to_process = elements_in_row;
}
// Get pointers for current row and column range
float * dst_ptr = (float *) ((char *) dst_data + row * dst_stride) + col;
float * x_ptr;
float * g_ptr;
if (src1) {
// Split tensor mode
x_ptr = (float *) ((char *) src0_data + row * src0_stride) + col;
g_ptr = (float *) ((char *) src1_data + row * src1_stride) + col;
} else {
// Single tensor mode - src0 contains both x and g
float * src0_row = (float *) ((char *) src0_data + row * src0_stride);
if (swapped) {
g_ptr = src0_row + col; // First half is gate
x_ptr = src0_row + nc + col; // Second half is value
} else {
x_ptr = src0_row + col; // First half is value
g_ptr = src0_row + nc + col; // Second half is gate
}
}
// Process this segment
switch (params->glu_op_type) {
case GGML_GLU_OP_GEGLU:
block_geglu(dst_ptr, x_ptr, g_ptr, (int) elements_to_process);
break;
case GGML_GLU_OP_SWIGLU:
block_swiglu(dst_ptr, x_ptr, g_ptr, (int) elements_to_process);
break;
case GGML_GLU_OP_REGLU:
block_reglu(dst_ptr, x_ptr, g_ptr, (int) elements_to_process);
break;
case GGML_GLU_OP_GEGLU_QUICK:
block_geglu_quick(dst_ptr, x_ptr, g_ptr, (int) elements_to_process);
break;
case GGML_GLU_OP_GEGLU_ERF:
block_geglu_erf(dst_ptr, x_ptr, g_ptr, (int) elements_to_process);
break;
case GGML_GLU_OP_SWIGLU_OAI:
block_swiglu_oai(dst_ptr, x_ptr, g_ptr, (int) elements_to_process, params->alpha, params->limit);
break;
default:
return -1;
}
// Update counters
elements_processed += elements_to_process;
col += elements_to_process;
// Move to next row if current row is complete
if (col >= nc) {
row++;
col = 0;
}
}
}
return 0;
}
@@ -1,171 +0,0 @@
//******************************************************************************
// GROUP_NORM F32 Kernel
// Baseline scalar implementation:
// normalize over (ne0 * ne1 * channels_in_group) for each (group, batch).
//
// Parallelization:
// - Work is partitioned across (group, batch) pairs.
// - For non-cache-aligned ne0, writes are emitted in row-groups so each thread's
// destination write footprint still spans an integer number of cache lines.
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_group_norm_params {
struct ggml_tensor src0;
struct ggml_tensor dst;
int32_t n_groups;
float eps;
};
int entry_point(struct ggml_et_group_norm_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
const float * src0_data = (const float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1;
}
const int32_t n_groups = params->n_groups;
const float eps = params->eps;
if (n_groups <= 0 || eps < 0.0f) {
return -1;
}
const int64_t ne0 = dst->ne[0];
const int64_t ne1 = dst->ne[1];
const int64_t ne2 = dst->ne[2];
const int64_t ne3 = dst->ne[3];
if (src0->ne[0] != ne0 || src0->ne[1] != ne1 || src0->ne[2] != ne2 || src0->ne[3] != ne3) {
return -1;
}
const int64_t nb1 = dst->nb[1];
const int64_t nb2 = dst->nb[2];
const int64_t nb3 = dst->nb[3];
const int64_t nb01 = src0->nb[1];
const int64_t nb02 = src0->nb[2];
const int64_t nb03 = src0->nb[3];
const int64_t channels_per_group = (ne2 + n_groups - 1) / n_groups;
if (channels_per_group <= 0) {
return -1;
}
const int64_t active_groups = (ne2 + channels_per_group - 1) / channels_per_group;
const int64_t total_work = active_groups * ne3;
const int64_t rows_per_write_group = et_rows_per_cacheline_group(ne0, sizeof(float));
for (int64_t work = thread_id; work < total_work; work += num_threads) {
const int64_t i3 = work / active_groups;
const int64_t group_idx = work % active_groups;
const int64_t channel_start = group_idx * channels_per_group;
int64_t channel_end = channel_start + channels_per_group;
if (channel_end > ne2) {
channel_end = ne2;
}
const int64_t channel_count = channel_end - channel_start;
if (channel_count <= 0) {
continue;
}
float sum = 0.0f;
float denom = 0.0f;
for (int64_t i2 = channel_start; i2 < channel_end; ++i2) {
for (int64_t i1 = 0; i1 < ne1; ++i1) {
const float * src_row = (const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
for (int64_t i0 = 0; i0 < ne0; ++i0) {
sum += src_row[i0];
denom += 1.0f;
}
}
}
const float mean = et_fdiv(sum, denom);
float var_sum = 0.0f;
for (int64_t i2 = channel_start; i2 < channel_end; ++i2) {
for (int64_t i1 = 0; i1 < ne1; ++i1) {
const float * src_row = (const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
for (int64_t i0 = 0; i0 < ne0; ++i0) {
const float centered = src_row[i0] - mean;
var_sum += centered * centered;
}
}
}
const float variance = et_fdiv(var_sum, denom);
const float scale = et_fdiv(1.0f, et_sqrtf(variance + eps));
if (ne0 % 16 == 0) {
for (int64_t i2 = channel_start; i2 < channel_end; ++i2) {
for (int64_t i1 = 0; i1 < ne1; ++i1) {
const float * src_row =
(const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_row = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
for (int64_t i0 = 0; i0 < ne0; ++i0) {
dst_row[i0] = (src_row[i0] - mean) * scale;
}
}
}
} else {
const int64_t total_rows_in_group = channel_count * ne1;
const int64_t total_write_groups = (total_rows_in_group + rows_per_write_group - 1) / rows_per_write_group;
for (int64_t write_group = 0; write_group < total_write_groups; ++write_group) {
const int64_t row_start = write_group * rows_per_write_group;
int64_t row_end = row_start + rows_per_write_group;
if (row_end > total_rows_in_group) {
row_end = total_rows_in_group;
}
for (int64_t row = row_start; row < row_end; ++row) {
const int64_t local_i2 = row / ne1;
const int64_t i1 = row % ne1;
const int64_t i2 = channel_start + local_i2;
const float * src_row =
(const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_row = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
for (int64_t i0 = 0; i0 < ne0; ++i0) {
dst_row[i0] = (src_row[i0] - mean) * scale;
}
}
}
}
}
return 0;
}
-130
View File
@@ -1,130 +0,0 @@
//******************************************************************************
// IM2COL Kernel
// Baseline scalar implementation for:
// src1: [N, IC, IH, IW] -> dst: [N, OH, OW, IC*KH*KW] (2D)
// src1: [N, IC, IW] -> dst: [N, 1, OW, IC* KW] (1D)
//
// Work is distributed by row-groups so threads own cache-line-aligned chunks of
// destination rows even when ne0 is not cache aligned.
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdint.h>
static inline void im2col_store_elem(void * dst_base, enum ggml_type dst_type, int64_t idx, float value) {
if (dst_type == GGML_TYPE_F32) {
((float *) dst_base)[idx] = value;
} else {
((uint16_t *) dst_base)[idx] = fp32_to_fp16(value);
}
}
static inline float im2col_load_src_elem(const void * src_base, enum ggml_type src_type, int64_t idx) {
if (src_type == GGML_TYPE_F32) {
return ((const float *) src_base)[idx];
}
return fp16_to_fp32(((const uint16_t *) src_base)[idx]);
}
int entry_point(struct ggml_et_binary_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * src1 = &params->src1;
struct ggml_tensor * dst = &params->dst;
if (!src1->data || !dst->data) {
return -1;
}
if (!((dst->type == GGML_TYPE_F32 && src1->type == GGML_TYPE_F32) ||
(dst->type == GGML_TYPE_F16 && (src1->type == GGML_TYPE_F16 || src1->type == GGML_TYPE_F32)))) {
return -1;
}
const int32_t s0 = ((const int32_t *) dst->op_params)[0];
const int32_t s1 = ((const int32_t *) dst->op_params)[1];
const int32_t p0 = ((const int32_t *) dst->op_params)[2];
const int32_t p1 = ((const int32_t *) dst->op_params)[3];
const int32_t d0 = ((const int32_t *) dst->op_params)[4];
const int32_t d1 = ((const int32_t *) dst->op_params)[5];
const int32_t is_2d = ((const int32_t *) dst->op_params)[6];
const int64_t N = is_2d ? src1->ne[3] : src1->ne[2];
const int64_t IC = is_2d ? src1->ne[2] : src1->ne[1];
const int64_t IH = is_2d ? src1->ne[1] : 1;
const int64_t IW = src1->ne[0];
const int64_t KH = is_2d ? src0->ne[1] : 1;
const int64_t KW = src0->ne[0];
const int64_t OH = is_2d ? dst->ne[2] : 1;
const int64_t OW = dst->ne[1];
const int64_t row_elems = dst->ne[0];
const int64_t total_rows = OW * OH * N;
const size_t src_batch_stride = is_2d ? src1->nb[3] : src1->nb[2];
const size_t src_channel_stride = is_2d ? src1->nb[2] : src1->nb[1];
const size_t dst_row_stride = dst->nb[1];
const size_t dst_plane_stride = is_2d ? dst->nb[2] : 0;
const size_t dst_batch_stride = is_2d ? dst->nb[3] : dst->nb[2];
const int64_t dst_elem_size = (dst->type == GGML_TYPE_F32) ? (int64_t) sizeof(float) : (int64_t) sizeof(uint16_t);
const int64_t rows_per_group = et_rows_per_cacheline_group(row_elems, dst_elem_size);
const int64_t total_groups = (total_rows + rows_per_group - 1) / rows_per_group;
for (int64_t grp = thread_id; grp < total_groups; grp += num_threads) {
const int64_t row_start = grp * rows_per_group;
int64_t row_end = row_start + rows_per_group;
if (row_end > total_rows) {
row_end = total_rows;
}
for (int64_t row = row_start; row < row_end; ++row) {
const int64_t in = row / (OH * OW);
const int64_t rem = row % (OH * OW);
const int64_t ioh = rem / OW;
const int64_t iow = rem % OW;
void * dst_row = (char *) dst->data + in * dst_batch_stride + ioh * dst_plane_stride + iow * dst_row_stride;
for (int64_t iic = 0; iic < IC; ++iic) {
const void * src_channel = (const char *) src1->data + in * src_batch_stride + iic * src_channel_stride;
for (int64_t ikh = 0; ikh < KH; ++ikh) {
for (int64_t ikw = 0; ikw < KW; ++ikw) {
const int64_t iiw = iow * s0 + ikw * d0 - p0;
const int64_t iih = ioh * s1 + ikh * d1 - p1;
const int64_t dst_idx = iic * (KH * KW) + ikh * KW + ikw;
if (iiw < 0 || iiw >= IW || iih < 0 || iih >= IH) {
im2col_store_elem(dst_row, dst->type, dst_idx, 0.0f);
} else {
const int64_t src_idx = iih * IW + iiw;
const float value = im2col_load_src_elem(src_channel, src1->type, src_idx);
im2col_store_elem(dst_row, dst->type, dst_idx, value);
}
}
}
}
}
}
return 0;
}
@@ -1,237 +0,0 @@
//******************************************************************************
// L2 Norm F32 Kernel (L2 Normalization)
// y[i] = x[i] / max(sqrt(sum(x^2)), eps)
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <assert.h>
#include <stdint.h>
#include <string.h>
// L2 Norm kernel parameters structure
struct ggml_et_l2_norm_params {
struct ggml_tensor src0; // F32 input tensor
struct ggml_tensor dst; // F32 output tensor
float eps; // Epsilon parameter for numerical stability
};
int entry_point(struct ggml_et_l2_norm_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1; // Invalid pointer
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
float eps = params->eps;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1; // Unsupported type combination
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1; // Null data pointer
}
if (eps < 0.0f) {
return -1; // Invalid epsilon
}
const int64_t ne0 = dst->ne[0];
const int64_t ne1 = dst->ne[1];
const int64_t ne2 = dst->ne[2];
const int64_t ne3 = dst->ne[3];
const size_t nb0 = dst->nb[0], nb1 = dst->nb[1], nb2 = dst->nb[2], nb3 = dst->nb[3];
const size_t nb00 = src0->nb[0], nb01 = src0->nb[1], nb02 = src0->nb[2], nb03 = src0->nb[3];
(void) nb0;
(void) nb00;
if (src0->ne[0] != ne0 || src0->ne[1] != ne1 || src0->ne[2] != ne2 || src0->ne[3] != ne3) {
return -1; // Shape mismatch
}
const int32_t total_rows = (int32_t) (ne1 * ne2 * ne3);
const int shire_threads = SOC_MINIONS_PER_SHIRE * NUM_HARTS_PER_MINION;
if (total_rows >= shire_threads) {
// Row-parallel: each thread processes whole rows
for (int64_t i3 = 0; i3 < ne3; i3++) {
for (int64_t i2 = 0; i2 < ne2; i2++) {
for (int64_t i1 = thread_id; i1 < ne1; i1 += num_threads) {
const float * src_ptr =
(const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_ptr = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
float zero = 0.0f;
__asm__ volatile("fbc.ps f10, %[z]\n" : : [z] "m"(zero) : "f10");
for (int32_t i0 = 0; i0 < (int32_t) ne0; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fmadd.ps f10, f11, f11, f10\n"
:
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0])
: "f10", "f11");
}
float sum_sq;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(sum_sq)::"t0", "f1", "f2", "f3", "f4", "f5");
float l2_norm = et_powf(sum_sq, 0.5f);
if (l2_norm < eps) {
l2_norm = eps;
}
const float scale = et_fdiv(1.0f, l2_norm);
for (int32_t i0 = 0; i0 < (int32_t) ne0; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fbc.ps f12, %[scale_ptr]\n"
"fmul.ps f13, f11, f12\n"
"fsw.ps f13, %[result]\n"
: [result] "=m"(*(float (*)[8]) & dst_ptr[i0])
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0]), [scale_ptr] "m"(scale)
: "f11", "f12", "f13");
}
}
}
}
} else {
// Intra-row: threads within each shire cooperate via L2 SCP
int shire_tid = thread_id % shire_threads;
int threads_per_row = shire_threads / total_rows;
int my_row = shire_tid / threads_per_row;
int local_tid = shire_tid % threads_per_row;
int group_base = my_row * threads_per_row;
if (my_row >= total_rows) {
FENCE;
et_barrier(ET_BARRIER_SHIRE);
return 0;
}
int64_t i1 = my_row % ne1;
int64_t i2 = (my_row / ne1) % ne2;
int64_t i3 = my_row / (ne1 * ne2);
const float * src_ptr = (const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_ptr = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
const int32_t elems_per_cl = 16;
int32_t total_cls = ((int32_t) ne0 + elems_per_cl - 1) / elems_per_cl;
int32_t cls_per_thread = (total_cls + threads_per_row - 1) / threads_per_row;
int32_t my_start = local_tid * cls_per_thread * elems_per_cl;
int32_t my_end = my_start + cls_per_thread * elems_per_cl;
if (my_end > (int32_t) ne0) {
my_end = (int32_t) ne0;
}
if (my_start >= (int32_t) ne0) {
my_start = 0;
my_end = 0;
}
unsigned long saved_mask;
__asm__ volatile("mova.x.m %0" : "=r"(saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
// Phase 1: partial sum of squares
__asm__ volatile("fbci.pi f10, 0" ::: "f10");
for (int32_t i0 = my_start; i0 < my_end; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fmadd.ps f10, f11, f11, f10\n"
:
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0])
: "f10", "f11");
}
float partial_sum;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(partial_sum)::"t0", "f1", "f2", "f3", "f4", "f5");
// Phase 2: L2SCP exchange
volatile float * my_slot = (volatile float *) et_shire_l2scp_local((uint64_t) shire_tid * 64);
*my_slot = partial_sum;
FENCE;
evict_to_l2((const void *) my_slot, 1, 64);
WAIT_CACHEOPS;
et_barrier(ET_BARRIER_SHIRE);
// Phase 3: all threads reduce + apply scale to own chunk
int workers = threads_per_row < total_cls ? threads_per_row : total_cls;
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
evict_to_l2((const void *) slot, 1, 64);
}
WAIT_CACHEOPS;
float total_sum_sq = 0.0f;
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
total_sum_sq += *slot;
}
float l2_norm = et_powf(total_sum_sq, 0.5f);
if (l2_norm < eps) {
l2_norm = eps;
}
const float scale = et_fdiv(1.0f, l2_norm);
if (my_start < my_end) {
uint32_t scale_bits;
__asm__ volatile("fmv.x.s %0, %1" : "=r"(scale_bits) : "f"(scale));
__asm__ volatile("fbcx.ps f13, %[sb]\n" : : [sb] "r"(scale_bits) : "f13");
for (int32_t i0 = my_start; i0 < my_end; i0 += 8) {
__asm__ volatile(
"flw.ps f12, %[x_vec]\n"
"fmul.ps f14, f12, f13\n"
"fsw.ps f14, %[result]\n"
: [result] "=m"(*(float (*)[8]) & dst_ptr[i0])
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0])
: "f12", "f14");
}
}
__asm__ volatile("mova.m.x %0" ::"r"(saved_mask));
}
return 0;
}
-85
View File
@@ -1,85 +0,0 @@
/*-------------------------------------------------------------------------
* Independent Linker Script for GGML Bare Metal Kernels
*-------------------------------------------------------------------------
*/
/* Define maximum number of harts (threads) - simplified for bare metal */
MAX_HARTS = 2112;
SECTIONS
{
/* Start at the base address passed by -Wl,--defsym=BASE_ADDRESS=... */
. = BASE_ADDRESS;
/* Export entry point symbol for runtime compatibility */
KERNEL_UMODE_ENTRY = BASE_ADDRESS;
/* Initialization section - must come first */
.text.init :
{
*(.text.init)
}
/* Align to cache line boundary */
. = ALIGN(64);
/* Main text section for code */
.text : {
*(.text)
*(.text.*)
}
. = ALIGN(64);
/* Data section with global pointer setup */
.data :
{
_data_start = .;
. = ALIGN(64);
/* Small data section and global pointer */
*(.sdata .sdata.*)
PROVIDE( __global_pointer$ = . + 0x800 );
/* Regular data */
*(.data .data.*)
. = ALIGN(64);
_data_end = .;
}
. = ALIGN(64);
/* BSS section for uninitialized data */
.bss(NOLOAD) :
{
_bss_start = .;
*(.sbss*);
*(.bss*);
. = ALIGN(64);
_bss_end = .;
}
/* Thread Local Storage (TLS) sections */
. = ALIGN(64);
.tdata :
{
*(.tdata*)
. = ALIGN(64);
}
__tdata_start = ADDR(.tdata);
.tbss : {
__tbss_start = .;
*(.tbss*)
}
. = . + SIZEOF(.tbss);
. = ALIGN(64);
__tbss_end = .;
/* TLS allocation area for all harts */
.tls-alloc ALIGN(64) (NOLOAD) : {
__tls_alloc_start = .;
. = . + (ABSOLUTE(__tbss_end) - ABSOLUTE(__tdata_start)) * MAX_HARTS;
}
/* End of kernel image */
_end = .;
}
-299
View File
@@ -1,299 +0,0 @@
//******************************************************************************
// ET Floating Point Math Library
// Provides ET hardware-specific math functions, FP16 conversion, and trig functions
// for bare metal kernels
//******************************************************************************
#ifndef MATH_FP_H
#define MATH_FP_H
#include <stdint.h>
//******************************************************************************
// ET Hardware Math Functions
//******************************************************************************
// ET hardware division function (uses FRCP.PS instruction)
static inline float et_fdiv(float a, float b) {
float d;
unsigned long temp;
__asm__ volatile(
"mova.x.m %[temp] \n\t"
"mov.m.x m0, x0, 1 \n\t"
"frcp.ps %[d], %[b] \n\t"
"fmul.s %[d], %[d], %[a] \n\t"
"mova.m.x %[temp] \n\t"
: [temp] "=&r"(temp), [d] "=&f"(d)
: [a] "f"(a), [b] "f"(b));
return d;
}
// Power function using ET hardware vector instructions
// Implements pow(base, exp) = exp(exp * ln(base)) using FLOG.PS and FEXP.PS
static inline float et_powf(float base, float exp) {
// Handle special cases
if (base <= 0.0f) {
if (base == 0.0f) {
if (exp > 0.0f) {
return 0.0f;
}
// For exp <= 0, return +infinity (IEEE 754: sign=0, exp=0xFF, mantissa=0)
union {
float f;
uint32_t i;
} inf = { .i = 0x7F800000 };
return inf.f;
}
// For negative base, return NaN (IEEE 754: exp=0xFF, mantissa!=0)
union {
float f;
uint32_t i;
} nan = { .i = 0x7FC00000 };
return nan.f;
}
if (base == 1.0f) {
return 1.0f;
}
if (exp == 0.0f) {
return 1.0f;
}
if (exp == 1.0f) {
return base;
}
// Use ET hardware instructions following DNN library pattern:
// pow(base, exp) = exp(exp * ln(base))
float result;
unsigned long temp;
__asm__ volatile(
"mova.x.m %[temp] \n\t" // Save current mask state
"mov.m.x m0, x0, 1 \n\t" // Set mask register m0 to enable element 0
"flog.ps %[result], %[base] \n\t" // result = ln(base)
"fmul.s %[result], %[result], %[exp]\n\t" // result = ln(base) * exp
"fexp.ps %[result], %[result] \n\t" // result = exp(ln(base) * exp) = base^exp
"mova.m.x %[temp] \n\t" // Restore mask state
: [temp] "=&r"(temp), [result] "=&f"(result)
: [base] "f"(base), [exp] "f"(exp));
return result;
}
// Natural logarithm.
static inline float et_logf(float x) {
// Handle special cases
if (x < 0.0f) {
// Return NaN for negative input
union {
float f;
uint32_t i;
} nan = { .i = 0x7FC00000 };
return nan.f;
}
if (x == 0.0f) {
// Return -infinity for log(0)
union {
float f;
uint32_t i;
} inf = { .i = 0xFF800000 };
return inf.f;
}
if (x == 1.0f) {
return 0.0f;
}
float log2_result;
unsigned long temp;
__asm__ volatile(
"mova.x.m %[temp] \n\t" // Save current mask state
"mov.m.x m0, x0, 1 \n\t" // Set mask register m0 to enable element 0
"flog.ps %[result], %[x] \n\t" // result = log2(x)
"mova.m.x %[temp] \n\t" // Restore mask state
: [temp] "=&r"(temp), [result] "=&f"(log2_result)
: [x] "f"(x));
// Convert log2 to natural log: ln(x) = log2(x) * ln(2)
const float ln2 = 0.69314718055994530942f;
return log2_result * ln2;
}
// Square root function implemented as et_powf(x, 0.5)
static inline float et_sqrtf(float x) {
// Handle special cases
if (x < 0.0f) {
// Return NaN for negative input (IEEE 754: exp=0xFF, mantissa!=0)
union {
float f;
uint32_t i;
} nan = { .i = 0x7FC00000 };
return nan.f;
}
if (x == 0.0f) {
return 0.0f;
}
return et_powf(x, 0.5f);
}
// Base-2 exponential: returns 2^x using the ET hardware FEXP.PS instruction.
// No base conversion, no special-case clamping — this is the raw hardware op
// with just the mask save/restore wrapper. Caller is responsible for ensuring
// x is in a range that produces a useful result (roughly [-126, 128] for fp32).
static inline float __attribute__((always_inline)) et_exp2f(float x) {
unsigned long old_mask;
float out;
__asm__ volatile(
"mova.x.m %[ms] \n\t"
"mov.m.x m0, x0, 1 \n\t"
"fexp.ps %[out], %[x] \n\t"
"mova.m.x %[ms] \n\t"
: [ms] "=&r"(old_mask), [out] "=&f"(out)
: [x] "f"(x));
return out;
}
// Exponential function using ET hardware FEXP.PS instruction
// Note: FEXP.PS computes 2^x, so we need to convert: exp(x) = 2^(x * log2(e))
static inline float et_expf(float x) {
// Handle special cases
if (x > 88.0f) {
// For x > 88, exp(x) would overflow, return +infinity
union {
float f;
uint32_t i;
} inf = { .i = 0x7F800000 };
return inf.f;
}
if (x < -87.0f) {
// For x < -87, exp(x) is essentially 0
return 0.0f;
}
// Convert to base-2 exponent: x * log2(e)
const float log2e = 1.4426950408889634f; // log2(e)
float x_log2e = x * log2e;
// Use ET hardware instruction: fexp.ps computes 2^x
float result;
unsigned long temp;
__asm__ volatile(
"mova.x.m %[temp] \n\t" // Save current mask state
"mov.m.x m0, x0, 1 \n\t" // Set mask register m0 to enable element 0
"fexp.ps %[result], %[x_log2e] \n\t" // result = 2^(x * log2(e)) = exp(x)
"mova.m.x %[temp] \n\t" // Restore mask state
: [temp] "=&r"(temp), [result] "=&f"(result)
: [x_log2e] "f"(x_log2e));
return result;
}
//******************************************************************************
// Trigonometric Functions
//******************************************************************************
// FSIN.PS
// Sine function using Taylor series
static inline float et_sinf(float x) {
const float pi = 3.14159265358979323846f;
const float two_pi = 6.28318530717958647693f;
const float pi_over_2 = 1.57079632679489661923f;
if (x > pi || x < -pi) {
float cycles = x * et_fdiv(1.0f, two_pi);
int n = (int) cycles;
if (x < 0.0f) {
n--; // Floor for negative
}
x = x - (float) n * two_pi;
}
// sin(x) = sin(π - x) for x in [π/2, π]
// sin(x) = -sin(-π - x) for x in [-π, -π/2]
int negate = 0;
if (x > pi_over_2) {
x = pi - x;
} else if (x < -pi_over_2) {
x = -pi - x;
negate = 1;
}
// sin(x) ≈ x - x^3/3! + x^5/5! - x^7/7! + x^9/9! - x^11/11!
const float x2 = x * x;
const float x3 = x2 * x;
const float x5 = x3 * x2;
const float x7 = x5 * x2;
const float x9 = x7 * x2;
const float x11 = x9 * x2;
float result = x - x3 * et_fdiv(1.0f, 6.0f) // x^3/3!
+ x5 * et_fdiv(1.0f, 120.0f) // x^5/5!
- x7 * et_fdiv(1.0f, 5040.0f) // x^7/7!
+ x9 * et_fdiv(1.0f, 362880.0f) // x^9/9!
- x11 * et_fdiv(1.0f, 39916800.0f); // x^11/11!
return negate ? -result : result;
}
// Cosine function using identity cos(x) = sin(x + π/2)
static inline float et_cosf(float x) {
const float pi_over_2 = 1.57079632679489661923f;
return et_sinf(x + pi_over_2);
}
//******************************************************************************
// FP16 <-> FP32 Conversion Functions
//******************************************************************************
// Convert FP16 (IEEE 754 half precision) to FP32 (single precision)
// Uses ET hardware FCVT.PS.F16 instruction for accurate conversion
static inline float fp16_to_fp32(uint16_t h) {
float result;
unsigned long temp;
uint32_t raw = (uint32_t) h;
__asm__ volatile(
"mova.x.m %[temp] \n\t" // Save current mask state
"mov.m.x m0, x0, 1 \n\t" // Set mask register m0 to enable element 0
"fbcx.ps %[result], %[raw] \n\t" // Broadcast raw FP16 bits into vector register
"fcvt.ps.f16 %[result], %[result] \n\t" // Convert FP16 to FP32
"mova.m.x %[temp] \n\t" // Restore mask state
: [temp] "=&r"(temp), [result] "=&f"(result)
: [raw] "r"(raw));
return result;
}
// Convert FP32 (single precision) to FP16 (IEEE 754 half precision)
// Uses ET hardware FCVT.F16.PS instruction for accurate conversion
static inline uint16_t fp32_to_fp16(float f) {
float result_f;
unsigned long temp;
__asm__ volatile(
"mova.x.m %[temp] \n\t" // Save current mask state
"mov.m.x m0, x0, 1 \n\t" // Set mask register m0 to enable element 0
"fcvt.f16.ps %[result], %[f] \n\t" // Convert FP32 to FP16 (result in lower 16 bits)
"mova.m.x %[temp] \n\t" // Restore mask state
: [temp] "=&r"(temp), [result] "=&f"(result_f)
: [f] "f"(f));
// Extract lower 16 bits containing the FP16 value
// The instruction zero-extends to 32 bits, so upper 16 bits are 0
uint32_t result_bits = *(uint32_t *) &result_f;
return (uint16_t) result_bits;
}
#endif // MATH_FP_H
-220
View File
@@ -1,220 +0,0 @@
//******************************************************************************
// MEAN F32 Kernel
// Row-wise mean reduction: dst[0, i1, i2, i3] = mean(src0[0..ne00-1, i1, i2, i3])
//
// Modes:
// - total_rows >= shire_threads: row-parallel, each thread handles whole rows.
// - total_rows < shire_threads: intra-row reduction within a shire. Threads
// within a shire cooperate via shire-local L2 SCP slots. All shires
// duplicate the work because L2 SCP is per-shire (no cross-shire coherency).
//
// ne00 may be any positive size and rows may have any 4-byte alignment. We
// take the 8-wide vector path only when the row pointer is 32B-aligned and
// fall back to scalar for the leftover tail (or for the entire row when the
// row start is not 32B-aligned).
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_mean_params {
struct ggml_tensor src0; // F32 input [ne00, ne01, ne02, ne03]
struct ggml_tensor dst; // F32 output [1, ne01, ne02, ne03]
};
// Sum a contiguous F32 slice [base+i_lo, base+i_hi). Uses the 8-wide vector
// path only when `base + i_lo` is 32B-aligned; the tail (and the whole slice
// when misaligned) is summed with scalar fadd.s.
static inline float partial_sum_slice(const float * base, int32_t i_lo, int32_t i_hi) {
if (i_lo >= i_hi) {
return 0.0f;
}
const float * p = base + i_lo;
int32_t n = i_hi - i_lo;
float acc = 0.0f;
int32_t i = 0;
if (n >= 8 && (((uintptr_t) p) & 31) == 0) {
float zero = 0.0f;
__asm__ volatile("fbc.ps f10, %[z]\n" : : [z] "m"(zero) : "f10");
for (; i + 8 <= n; i += 8) {
__asm__ volatile(
"flw.ps f11, %[x]\n"
"fadd.ps f10, f10, f11\n"
:
: [x] "m"(*(const float (*)[8]) & p[i])
: "f10", "f11");
}
float vec_sum;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(vec_sum)::"t0", "f1", "f2", "f3", "f4", "f5");
acc = vec_sum;
}
for (; i < n; i++) {
acc += p[i];
}
return acc;
}
int entry_point(struct ggml_et_mean_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1;
}
const int64_t ne00 = src0->ne[0];
const int64_t ne01 = src0->ne[1];
const int64_t ne02 = src0->ne[2];
const int64_t ne03 = src0->ne[3];
const size_t nb01 = src0->nb[1];
const size_t nb02 = src0->nb[2];
const size_t nb03 = src0->nb[3];
const size_t nb1 = dst->nb[1];
const size_t nb2 = dst->nb[2];
const size_t nb3 = dst->nb[3];
if (ne00 <= 0) {
return 0;
}
const int32_t total_rows = (int32_t) (ne01 * ne02 * ne03);
const int shire_threads = SOC_MINIONS_PER_SHIRE * NUM_HARTS_PER_MINION;
const float inv_ne00 = et_fdiv(1.0f, (float) (int32_t) ne00);
// Row-parallel: each thread owns whole rows.
if (total_rows >= shire_threads) {
for (int64_t ir = thread_id; ir < total_rows; ir += num_threads) {
const int64_t i03 = ir / (ne02 * ne01);
const int64_t i02 = (ir - i03 * ne02 * ne01) / ne01;
const int64_t i01 = ir - i03 * ne02 * ne01 - i02 * ne01;
const float * src_row = (const float *) ((const char *) src0_data + i01 * nb01 + i02 * nb02 + i03 * nb03);
float * dst_ptr = (float *) ((char *) dst_data + i01 * nb1 + i02 * nb2 + i03 * nb3);
float row_sum = partial_sum_slice(src_row, 0, (int32_t) ne00);
atomic_store_f32(dst_ptr, row_sum * inv_ne00);
}
// Shire co-work
} else {
int shire_tid = thread_id % shire_threads;
int threads_per_row = shire_threads / total_rows;
int my_row = shire_tid / threads_per_row;
int local_tid = shire_tid % threads_per_row;
int group_base = my_row * threads_per_row;
if (my_row >= total_rows) {
FENCE;
et_barrier(ET_BARRIER_SHIRE);
return 0;
}
int64_t i1 = my_row % ne01;
int64_t i2 = (my_row / ne01) % ne02;
int64_t i3 = my_row / (ne01 * ne02);
const float * src_ptr = (const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_ptr = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
// Chunk size in elements, rounded up to a multiple of 8 so that every
// thread's slice start stays 32B-aligned relative to src_ptr (which
// matters for the vector path inside partial_sum_slice).
int32_t chunk = ((int32_t) ne00 + threads_per_row - 1) / threads_per_row;
chunk = (chunk + 7) & ~7;
if (chunk < 8) {
chunk = 8;
}
int32_t my_start = local_tid * chunk;
int32_t my_end = my_start + chunk;
if (my_end > (int32_t) ne00) {
my_end = (int32_t) ne00;
}
if (my_start > (int32_t) ne00) {
my_start = my_end = (int32_t) ne00;
}
int workers = ((int32_t) ne00 + chunk - 1) / chunk;
if (workers > threads_per_row) {
workers = threads_per_row;
}
unsigned long saved_mask;
__asm__ volatile("mova.x.m %0" : "=r"(saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
float partial_sum = partial_sum_slice(src_ptr, my_start, my_end);
// Publish partial to shire-local L2 SCP slot (64B per slot, one per
// hart). evict_to_l2 is required on the WRITER because scalar stores
// land in L1D first; readers must also evict before reading.
volatile float * my_slot = (volatile float *) et_shire_l2scp_local((uint64_t) shire_tid * 64);
*my_slot = partial_sum;
FENCE;
evict_to_l2((const void *) my_slot, 1, 64);
WAIT_CACHEOPS;
et_barrier(ET_BARRIER_SHIRE);
if (local_tid == 0) {
// Reader-side evictions for every contributing peer slot.
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
evict_to_l2((const void *) slot, 1, 64);
}
WAIT_CACHEOPS;
float total_sum = 0.0f;
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
total_sum += *slot;
}
atomic_store_f32(dst_ptr, total_sum * inv_ne00);
}
__asm__ volatile("mova.m.x %0" ::"r"(saved_mask));
}
return 0;
}
-181
View File
@@ -1,181 +0,0 @@
//******************************************************************************
// Memory Operations Kernel — tensor_store based memset
//
// Uses the tensor engine's store path (bypasses L1+L2 caches) to achieve hiher
// performance. Unrolled vector writes can write at ~25GB/s and tensor writes
// can so ~71 GB/s. Only even harts (hart 0 per minion) participate, as due to
// hardware design (only thye have matrix engine access and co-op stores seems
// slower)
//******************************************************************************
#include "platform.h"
#include "tensor.h"
#include <etsoc/common/utils.h>
#include <stdint.h>
// Operation identifiers for memops kernel
enum ggml_et_memop_type {
GGML_ET_MEMOP_MEMSET = 0,
};
// Memset operation parameters (must match host-side struct in ggml-et-memops.cpp)
struct memset_params {
uint32_t op_type;
uint32_t value;
void * dst_ptr;
size_t size;
};
// Fill all 32 f-regs with a replicated byte pattern
static inline void __attribute__((always_inline)) fill_fregs(uint32_t fill32) {
register uint64_t val __asm__("a2") = fill32;
__asm__ __volatile__(
"fbcx.ps f0, %[v]\n\t"
"fbcx.ps f1, %[v]\n\t"
"fbcx.ps f2, %[v]\n\t"
"fbcx.ps f3, %[v]\n\t"
"fbcx.ps f4, %[v]\n\t"
"fbcx.ps f5, %[v]\n\t"
"fbcx.ps f6, %[v]\n\t"
"fbcx.ps f7, %[v]\n\t"
"fbcx.ps f8, %[v]\n\t"
"fbcx.ps f9, %[v]\n\t"
"fbcx.ps f10, %[v]\n\t"
"fbcx.ps f11, %[v]\n\t"
"fbcx.ps f12, %[v]\n\t"
"fbcx.ps f13, %[v]\n\t"
"fbcx.ps f14, %[v]\n\t"
"fbcx.ps f15, %[v]\n\t"
"fbcx.ps f16, %[v]\n\t"
"fbcx.ps f17, %[v]\n\t"
"fbcx.ps f18, %[v]\n\t"
"fbcx.ps f19, %[v]\n\t"
"fbcx.ps f20, %[v]\n\t"
"fbcx.ps f21, %[v]\n\t"
"fbcx.ps f22, %[v]\n\t"
"fbcx.ps f23, %[v]\n\t"
"fbcx.ps f24, %[v]\n\t"
"fbcx.ps f25, %[v]\n\t"
"fbcx.ps f26, %[v]\n\t"
"fbcx.ps f27, %[v]\n\t"
"fbcx.ps f28, %[v]\n\t"
"fbcx.ps f29, %[v]\n\t"
"fbcx.ps f30, %[v]\n\t"
"fbcx.ps f31, %[v]\n\t" ::[v] "r"(val)
: "f0", "f1", "f2", "f3", "f4", "f5", "f6", "f7", "f8", "f9", "f10", "f11", "f12", "f13", "f14", "f15", "f16",
"f17", "f18", "f19", "f20", "f21", "f22", "f23", "f24", "f25", "f26", "f27", "f28", "f29", "f30", "f31");
}
// Fill a partial region [start, end) using tensor_store for 16-byte-aligned
// chunks and byte stores for any remainder < 16 bytes.
// Assumes f-regs are already loaded with the fill pattern.
static void memset_tail(uint8_t * start, uint8_t * end, uint8_t val) {
uint8_t * cur = start;
// Full 64-byte rows via tensor_store (up to 16 at a time = 1KB)
while (cur + 64 <= end) {
size_t rows = (end - cur) / 64;
if (rows > 16) {
rows = 16;
}
tensor_store(0, 0, 3, rows - 1, (uintptr_t) cur, 0, 64);
cur += rows * 64;
}
// Remaining 16-byte aligned chunk (16, 32, or 48 bytes)
if (cur + 16 <= end) {
size_t cols = (end - cur) / 16;
tensor_store(0, 0, cols - 1, 0, (uintptr_t) cur, 0, 64);
cur += cols * 16;
}
tensor_wait(TENSOR_STORE_WAIT);
// Final < 16 bytes with byte stores
while (cur < end) {
*(volatile uint8_t *) cur = val;
cur++;
}
}
#define ALIGN_UP(ptr, align) ((uint8_t *) (((uintptr_t) (ptr) + (align) - 1) & ~((uintptr_t) (align) - 1)))
int entry_point(struct memset_params * params, kernel_environment_t * env) {
uint64_t hart_id = get_hart_id();
// Only even harts have tensor engine access
if (hart_id & 1) {
return 0;
}
if (!params || ((uintptr_t) params & 0x7) != 0) {
return -1;
}
if (params->op_type != GGML_ET_MEMOP_MEMSET) {
return -1;
}
uint8_t * dst = (uint8_t *) params->dst_ptr;
size_t size = params->size;
if (!dst || size == 0) {
return -1;
}
// Dynamic hart count from shire_mask
int num_even_harts = manual_popcountll(env->shire_mask) * SOC_MINIONS_PER_SHIRE;
// global_id: shire * 32 + minion (for even harts)
uint64_t global_id = ((hart_id >> 6) << 5) + ((hart_id >> 1) & 0x1F);
uint8_t val = params->value & 0xFF;
uint32_t fill32 = val | ((uint32_t) val << 8) | ((uint32_t) val << 16) | ((uint32_t) val << 24);
uint8_t * end = dst + size;
setup_cache_scp();
CLEAR_TENSOR_ERROR;
fill_fregs(fill32);
// Align to 16 bytes (tensor_store minimum alignment)
uint8_t * base = ALIGN_UP(dst, 16);
if (base > end) {
base = end;
}
// Hart 0 handles head bytes before alignment
if (global_id == 0) {
volatile uint8_t * p = dst;
while (p < (volatile uint8_t *) base) {
*p++ = val;
}
}
// Bulk: 1KB blocks distributed across all harts (base is already 16-byte aligned)
size_t aligned_size = end - base;
size_t total_blocks = aligned_size / 1024;
if (total_blocks > 0) {
size_t blocks_per_hart = total_blocks / num_even_harts;
size_t extra = total_blocks % num_even_harts;
size_t my_start = blocks_per_hart * global_id + (global_id < extra ? global_id : extra);
size_t my_count = blocks_per_hart + (global_id < extra ? 1 : 0);
uint8_t * addr = base + my_start * 1024;
for (size_t b = 0; b < my_count; b++) {
tensor_store(0, 0, 3, 15, (uintptr_t) addr, 0, 64);
addr += 1024;
}
tensor_wait(TENSOR_STORE_WAIT);
}
// Hart 0 handles the tail after the last full 1KB block
if (global_id == 0) {
memset_tail(base + total_blocks * 1024, end, val);
}
FENCE;
return 0;
}
@@ -1,358 +0,0 @@
//******************************************************************************
// MUL_MAT Kernel
// Matrix multiplication: C[M,N] = A[M,K] * B[K,N]
//******************************************************************************
#include "block_ops.h"
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include <stdint.h>
#define STRIDE_M 2048 /* 32 shires x 32 minions x 2 harts */
#define STRIDE_M_KSPLIT 1024 /* 32 shires x 32 minions (both harts share rows) */
#define KSPLIT_MIN_K_BLOCKS 256 /* K >= 8192 elements */
#define KSPLIT_SMALL_ROWS_K_BLOCKS 64 /* K >= 2048 elements for very small M */
#define KSPLIT_MAX_ROWS 8 /* max rows per minion for K-split */
#define TILE_KB 256 /* K-tile size in Q4_0 blocks (8192 elems, 32KB B data) */
#define KSPLIT_GROUP_ROWS 4
#define SIMPLE_X2_ROWS 2
int entry_point(struct ggml_et_binary_params * params, void * env) {
uint64_t hart_id = get_hart_id();
// Matrix dimensions
const int64_t K = params->src0.ne[0];
const int64_t M = params->src0.ne[1];
const int64_t N = params->src1.ne[1];
const int64_t ne02 = params->src0.ne[2];
const int64_t ne03 = params->src0.ne[3];
const int64_t ne12 = params->src1.ne[2];
const int64_t ne13 = params->src1.ne[3];
// Strides (in bytes)
const size_t nb01 = params->src0.nb[1];
const size_t nb02 = params->src0.nb[2];
const size_t nb03 = params->src0.nb[3];
const size_t nb11 = params->src1.nb[1];
const size_t nb12 = params->src1.nb[2];
const size_t nb13 = params->src1.nb[3];
const size_t nbd1 = params->dst.nb[1];
const size_t nbd2 = params->dst.nb[2];
const size_t nbd3 = params->dst.nb[3];
// Q4_0 block size is 32
const int64_t K_blocks = K / 32;
const int use_simple_x2 = ((nb01 & 31) == 0);
// Broadcasting ratios
const int64_t r2 = ne12 / ne02;
const int64_t r3 = ne13 / ne03;
// K-split decision
const int64_t minion_id = hart_id >> 1; /* 0..1023 global */
const int64_t local_minion = (hart_id >> 1) & 0x1F; /* 0..31 within shire */
const int is_hart1 = hart_id & 1;
const int64_t rows_per_minion = (M + STRIDE_M_KSPLIT - 1) / STRIDE_M_KSPLIT;
const int64_t k_half = K_blocks / 2;
const int use_ksplit_small_rows = (rows_per_minion <= 2) && (K_blocks >= KSPLIT_SMALL_ROWS_K_BLOCKS);
/*
* K-split when K is large enough to benefit, and either:
* - few rows (4): always safe, proven working
* - more rows (5-8): only if each hart's half fits in one tile,
* otherwise L1 thrashing from 2 harts × 8 rows kills performance
*
* Also allow K-split earlier for the low-M regime (2 rows/minion). In
* that case the simple row-striped path leaves half the machine idle, so
* using both harts on each row pays off even for moderate K.
*/
const int use_ksplit = ((K_blocks >= KSPLIT_MIN_K_BLOCKS) && (rows_per_minion <= KSPLIT_MAX_ROWS) &&
(rows_per_minion <= 4 || k_half <= TILE_KB)) ||
use_ksplit_small_rows;
const int use_ksplit_group = !use_ksplit && (K_blocks >= KSPLIT_MIN_K_BLOCKS) && (rows_per_minion > 4) &&
(rows_per_minion <= KSPLIT_MAX_ROWS);
if (use_ksplit) {
/* Each hart processes half the K dimension */
const int64_t k_start = is_hart1 ? k_half : 0;
const int64_t k_len = is_hart1 ? (K_blocks - k_half) : k_half;
/* One cache-line-aligned L2SCP slot per minion for exchange */
volatile float * l2scp_slot = (volatile float *) et_shire_l2scp_local(local_minion * 64);
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
for (int64_t m = minion_id; m < M; m += STRIDE_M_KSPLIT) {
const block_q4_0 * q_row = (const block_q4_0 *) (src0_ptr2 + m * nb01);
float partial = compute_row_dot_q4_0(q_row + k_start, b_col_base + k_start * 32, k_len);
if (is_hart1) {
*l2scp_slot = partial;
FENCE;
flush_to_l2((const void *) l2scp_slot, 1, 64);
WAIT_CACHEOPS;
et_sem_post(ET_BARRIER_MINION);
et_sem_wait(ET_BARRIER_MINION);
} else {
et_sem_wait(ET_BARRIER_MINION);
float other = *l2scp_slot;
et_sem_post(ET_BARRIER_MINION);
float * dst_entry = (float *) (dst_ptr2 + n * nbd1 + m * sizeof(float));
atomic_store_f32((volatile float *) dst_entry, partial + other);
}
}
}
}
}
} else if (use_ksplit_group) {
/*
* Grouped K-split for the 5-8 rows/minion regime.
*
* Both harts process the same 4-row group, each on half of K, and
* exchange 4 partial sums once per group instead of once per row.
* This keeps the K-split bandwidth benefit while cutting semaphore
* traffic by 4x relative to the old per-row exchange.
*/
const int64_t k_start = is_hart1 ? k_half : 0;
const int64_t k_len = is_hart1 ? (K_blocks - k_half) : k_half;
volatile float * l2scp_slot = (volatile float *) et_shire_l2scp_local(local_minion * 64);
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
for (int64_t m_base = minion_id; m_base < M; m_base += STRIDE_M_KSPLIT * KSPLIT_GROUP_ROWS) {
const int64_t m0 = m_base;
const int64_t m1 = m0 + STRIDE_M_KSPLIT;
const int64_t m2 = m1 + STRIDE_M_KSPLIT;
const int64_t m3 = m2 + STRIDE_M_KSPLIT;
float s0 = 0.0f, s1 = 0.0f, s2 = 0.0f, s3 = 0.0f;
for (int64_t kb = 0; kb < K_blocks; kb += TILE_KB) {
int64_t tile_len = k_len - kb;
if (tile_len > TILE_KB) {
tile_len = TILE_KB;
}
if (tile_len <= 0) {
break;
}
const float * b_tile = b_col_base + (k_start + kb) * 32;
const int64_t row_kb = k_start + kb;
if (m0 < M) {
s0 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m0 * nb01) + row_kb,
b_tile, tile_len);
}
if (m1 < M) {
s1 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m1 * nb01) + row_kb,
b_tile, tile_len);
}
if (m2 < M) {
s2 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m2 * nb01) + row_kb,
b_tile, tile_len);
}
if (m3 < M) {
s3 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m3 * nb01) + row_kb,
b_tile, tile_len);
}
}
if (is_hart1) {
l2scp_slot[0] = s0;
l2scp_slot[1] = s1;
l2scp_slot[2] = s2;
l2scp_slot[3] = s3;
FENCE;
flush_to_l2((const void *) l2scp_slot, 1, 64);
WAIT_CACHEOPS;
et_sem_post(ET_BARRIER_MINION);
et_sem_wait(ET_BARRIER_MINION);
} else {
et_sem_wait(ET_BARRIER_MINION);
const float p0 = l2scp_slot[0];
const float p1 = l2scp_slot[1];
const float p2 = l2scp_slot[2];
const float p3 = l2scp_slot[3];
et_sem_post(ET_BARRIER_MINION);
float * c_base = (float *) (dst_ptr2 + n * nbd1);
if (m0 < M) {
atomic_store_f32((volatile float *) (c_base + m0), s0 + p0);
}
if (m1 < M) {
atomic_store_f32((volatile float *) (c_base + m1), s1 + p1);
}
if (m2 < M) {
atomic_store_f32((volatile float *) (c_base + m2), s2 + p2);
}
if (m3 < M) {
atomic_store_f32((volatile float *) (c_base + m3), s3 + p3);
}
}
}
}
}
}
} else if (K_blocks > TILE_KB) {
/*
* Tile-outer with scalar row groups: process up to 4 rows per
* hart sharing each B tile before advancing to the next tile.
* Uses scalar float variables (not an array) to accumulate across
* tiles avoids the flw/fadd.s/fsw stack ops that corrupt vector
* register state on ET-SoC-1's MMX-style shared FP file.
*/
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
for (int64_t m0 = hart_id; m0 < M; m0 += STRIDE_M * 4) {
const int64_t m1 = m0 + STRIDE_M;
const int64_t m2 = m0 + STRIDE_M * 2;
const int64_t m3 = m0 + STRIDE_M * 3;
float s0 = 0.0f, s1 = 0.0f, s2 = 0.0f, s3 = 0.0f;
for (int64_t kb = 0; kb < K_blocks; kb += TILE_KB) {
int64_t tile_len = K_blocks - kb;
if (tile_len > TILE_KB) {
tile_len = TILE_KB;
}
const float * b_tile = b_col_base + kb * 32;
s0 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m0 * nb01) + kb, b_tile,
tile_len);
if (m1 < M) {
s1 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m1 * nb01) + kb, b_tile,
tile_len);
}
if (m2 < M) {
s2 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m2 * nb01) + kb, b_tile,
tile_len);
}
if (m3 < M) {
s3 += compute_row_dot_q4_0((const block_q4_0 *) (src0_ptr2 + m3 * nb01) + kb, b_tile,
tile_len);
}
}
float * dst_base = (float *) (dst_ptr2 + n * nbd1);
atomic_store_f32((volatile float *) (dst_base + m0), s0);
if (m1 < M) {
atomic_store_f32((volatile float *) (dst_base + m1), s1);
}
if (m2 < M) {
atomic_store_f32((volatile float *) (dst_base + m2), s2);
}
if (m3 < M) {
atomic_store_f32((volatile float *) (dst_base + m3), s3);
}
}
}
}
}
} else {
/*
* Simple path for small K.
*
* When `nb01` is 32-byte aligned, every row has the same block-alignment
* pattern. That lets us compute two rows together and reuse each loaded
* B chunk across both rows instead of reloading it in a second dot call.
*/
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
q4_dot_state q4_state;
q4_dot_begin(&q4_state);
if (use_simple_x2) {
for (int64_t m0 = hart_id; m0 < M; m0 += STRIDE_M * SIMPLE_X2_ROWS) {
const int64_t m1 = m0 + STRIDE_M;
const block_q4_0 * q_row0 = (const block_q4_0 *) (src0_ptr2 + m0 * nb01);
if (m1 < M) {
const block_q4_0 * q_row1 = (const block_q4_0 *) (src0_ptr2 + m1 * nb01);
float s0, s1;
q4_dot_compute_x2_aligned(q_row0, q_row1, b_col_base, K_blocks, &s0, &s1);
float * dst0 = (float *) (dst_ptr2 + n * nbd1 + m0 * sizeof(float));
float * dst1 = (float *) (dst_ptr2 + n * nbd1 + m1 * sizeof(float));
atomic_store_f32((volatile float *) dst0, s0);
atomic_store_f32((volatile float *) dst1, s1);
} else {
float sum = q4_dot_compute(q_row0, b_col_base, K_blocks);
float * dst = (float *) (dst_ptr2 + n * nbd1 + m0 * sizeof(float));
atomic_store_f32((volatile float *) dst, sum);
}
}
} else {
for (int64_t m = hart_id; m < M; m += STRIDE_M) {
const block_q4_0 * q_row = (const block_q4_0 *) (src0_ptr2 + m * nb01);
float sum = q4_dot_compute(q_row, b_col_base, K_blocks);
float * dst_entry = (float *) (dst_ptr2 + n * nbd1 + m * sizeof(float));
atomic_store_f32((volatile float *) dst_entry, sum);
}
}
q4_dot_end(&q4_state);
}
}
}
}
return 0;
}
@@ -1,368 +0,0 @@
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include "tensor.h"
#include <etsoc/common/utils.h>
#include <stdint.h>
// Q4_0 x F32 -> F32 MUL_MAT on the tensor (matrix) engine, TensorFMA32.
// Hart 1: dequantize Q4_0 weights to FP32 into double-buffered L2 SCP.
// Hart 0: tensor engine compute (FMA, reduce, store).
#define NUM_COMPUTE_SHIRES 32
#define MINIONS_PER_SHIRE 32
#define TILE_M 16
#define TILE_N 16
#define BLOCK_K QK4_0 // 32 elements per Q4_0 block
#define FMA_K 16 // tensor FMA k-width for FP32 (a_num_cols = FMA_K-1)
#define CACHEOP_MAX 0
#define REP_RATE 0
#define A_L1_START 0 // L1 SCP lines 0..15 for A (activations)
#define B_L1_START 16 // L1 SCP lines 16..31 for B (dequantized weights)
// L2 SCP layout per minion (double-buffered dequant panel + sync counters).
// panel = BLOCK_K k-lines x TILE_M m (FP32) = 32 * 64 = 2048 bytes, in TenB
// [k][m] order: panel[k*TILE_M + m].
#define SCP_PANEL_SIZE (BLOCK_K * TILE_M * (uint64_t) sizeof(float)) // 2048
#define SCP_READY_OFF (2 * SCP_PANEL_SIZE) // 4096
#define SCP_CONSUMED_OFF (SCP_READY_OFF + 64) // 4160
#define SCP_PER_MINION (SCP_CONSUMED_OFF + 64) // 4224
// Signal a counter value to the other hart via L2 SCP.
static inline void __attribute__((always_inline)) scp_signal(volatile uint32_t * flag, uint32_t value) {
*flag = value;
FENCE;
evict_to_l2((const void *) flag, 1, 64);
WAIT_CACHEOPS;
}
// Wait for a counter in L2 SCP to reach the expected value.
static inline void __attribute__((always_inline)) scp_wait(volatile uint32_t * flag, uint32_t expected) {
while (1) {
evict_to_l2((const void *) flag, 1, 64);
WAIT_CACHEOPS;
if (*flag >= expected) {
return;
}
}
}
// Dequantize one 32-element Q4_0 block of TILE_M weight rows into the FP32
// panel, written directly in TenB [k][m] order: panel[k*TILE_M + m].
// Low nibble of byte i -> k = i
// High nibble of byte i -> k = i + 16
// value = d * (nibble - 8)
//
// Vectorized: for each weight row m we gather 8 packed bytes at a time, expand
// the low/high nibbles to FP32 (nibble-8), scale by the block's fp16 d, and
// fscw.ps-scatter the 8 values down 8 panel lines (stride 64B) at column m.
// 4 groups of 8 cover the 32 k-values (low 0..15, high 16..31).
static inline void __attribute__((always_inline)) dequant_q4_0_panel(float * panel,
const char * src0_batch,
int64_t mb,
int64_t kb_block,
int64_t nb1_0) {
static const int32_t __attribute__((aligned(32))) scatter_idx[8] = {
0, 64, 128, 192, 256, 320, 384, 448 // byte offsets: 8 lines apart
};
static const int32_t __attribute__((aligned(32))) gather_idx[8] = {
0, 1, 2, 3, 4, 5, 6, 7 // 8 consecutive bytes
};
unsigned long old_mask;
__asm__ volatile(
"mova.x.m %[ms] \n\t"
"mov.m.x m0, x0, 0xFF \n\t" // all 8 lanes active
"flw.ps f1, (%[sidx]) \n\t" // f1 = scatter offsets
"flw.ps f2, (%[gidx]) \n\t" // f2 = gather offsets
: [ms] "=&r"(old_mask)
: [sidx] "r"(scatter_idx), [gidx] "r"(gather_idx)
: "f1", "f2");
char * pbase = (char *) panel;
for (int j = 0; j < TILE_M; ++j) {
const block_q4_0 * blk = (const block_q4_0 *) (src0_batch + (mb + j) * nb1_0) + kb_block;
uint32_t scale_raw = (uint32_t) blk->d;
const uint8_t * qs = blk->qs;
char * col = pbase + j * 4; // column m=j of the panel
__asm__ volatile(
"fbcx.ps f3, %[sb] \n\t" // broadcast fp16 scale bits
"fcvt.ps.f16 f3, f3 \n\t" // -> d in all 8 lanes (fp32)
"fgb.ps f4, f2(%[qs0]) \n\t" // gather qs[0..7]
"fandi.pi f5, f4, 15 \n\t" // low nibble
"faddi.pi f5, f5, -8 \n\t"
"fcvt.ps.pw f5, f5, rne \n\t"
"fmul.ps f5, f5, f3 \n\t"
"fscw.ps f5, f1(%[c0]) \n\t" // k=0..7 -> lines 0..7
"fsrli.pi f6, f4, 4 \n\t" // high nibble
"fandi.pi f6, f6, 15 \n\t"
"faddi.pi f6, f6, -8 \n\t"
"fcvt.ps.pw f6, f6, rne \n\t"
"fmul.ps f6, f6, f3 \n\t"
"fscw.ps f6, f1(%[c16]) \n\t" // k=16..23 -> lines 16..23
"fgb.ps f4, f2(%[qs8]) \n\t" // gather qs[8..15]
"fandi.pi f5, f4, 15 \n\t"
"faddi.pi f5, f5, -8 \n\t"
"fcvt.ps.pw f5, f5, rne \n\t"
"fmul.ps f5, f5, f3 \n\t"
"fscw.ps f5, f1(%[c8]) \n\t" // k=8..15 -> lines 8..15
"fsrli.pi f6, f4, 4 \n\t"
"fandi.pi f6, f6, 15 \n\t"
"faddi.pi f6, f6, -8 \n\t"
"fcvt.ps.pw f6, f6, rne \n\t"
"fmul.ps f6, f6, f3 \n\t"
"fscw.ps f6, f1(%[c24]) \n\t" // k=24..31 -> lines 24..31
:
: [sb] "r"(scale_raw), [qs0] "r"(qs), [qs8] "r"(qs + 8), [c0] "r"(col), [c8] "r"(col + 8 * 64),
[c16] "r"(col + 16 * 64), [c24] "r"(col + 24 * 64)
: "f3", "f4", "f5", "f6", "memory");
}
__asm__ volatile("mova.m.x %0" ::"r"(old_mask));
}
int entry_point(struct ggml_et_binary_params * params, void * env) {
(void) env;
uint64_t hart_id = get_hart_id();
uint64_t shire_id = get_shire_id();
if (shire_id >= NUM_COMPUTE_SHIRES) {
return 0;
}
const int is_hart1 = hart_id & 1;
uint64_t local_minion = (hart_id >> 1) & 0x1F;
// Dimensions (both harts need these for tile assignment)
const int64_t K = params->src0.ne[0];
const int64_t M = params->src0.ne[1];
const int64_t N = params->src1.ne[1];
if ((M % TILE_M) != 0) {
return 0;
}
if ((K % BLOCK_K) != 0) {
return 0;
}
const int64_t ne2_0 = params->src0.ne[2], ne3_0 = params->src0.ne[3];
const int64_t ne2_1 = params->src1.ne[2], ne3_1 = params->src1.ne[3];
const int64_t nb1_0 = params->src0.nb[1];
const int64_t nb2_0 = params->src0.nb[2], nb3_0 = params->src0.nb[3];
const int64_t nb1_1 = params->src1.nb[1];
const int64_t nb2_1 = params->src1.nb[2], nb3_1 = params->src1.nb[3];
const int64_t nb1_d = params->dst.nb[1];
const int64_t nb2_d = params->dst.nb[2], nb3_d = params->dst.nb[3];
const char * src0_base = (const char *) params->src0.data;
const char * src1_base = (const char *) params->src1.data;
char * dst_base = (char *) params->dst.data;
const int64_t m_tiles = M / TILE_M;
const int64_t n_tiles = (N + TILE_N - 1) / TILE_N;
const int64_t batch_count = ne2_1 * ne3_1;
const int64_t base_tiles = m_tiles * n_tiles * batch_count;
const int64_t r2 = ne2_1 / ne2_0;
const int64_t r3 = ne3_1 / ne3_0;
const int64_t k_steps = K / BLOCK_K; // number of Q4_0 blocks
// Force a single K-split.
const int64_t k_splits = 1;
const int64_t tiles_per_shire = MINIONS_PER_SHIRE / k_splits;
const int64_t k_split = local_minion % k_splits;
const int64_t local_tile_idx = local_minion / k_splits;
const int64_t tiles_stride = (int64_t) NUM_COMPUTE_SHIRES * tiles_per_shire;
const int64_t k_steps_per_split = k_steps / k_splits;
const int64_t kb_start = k_split * k_steps_per_split; // first block
const int64_t kb_end = kb_start + k_steps_per_split; // one past last
// L2 SCP pointers for this minion's double-buffered panels + sync.
uint64_t scp_base = local_minion * SCP_PER_MINION;
float * scp_panel[2] = {
(float *) et_shire_l2scp_local(scp_base),
(float *) et_shire_l2scp_local(scp_base + SCP_PANEL_SIZE),
};
volatile uint32_t * ready_ctr = (volatile uint32_t *) et_shire_l2scp_local(scp_base + SCP_READY_OFF);
volatile uint32_t * consumed_ctr = (volatile uint32_t *) et_shire_l2scp_local(scp_base + SCP_CONSUMED_OFF);
// ================================================================
// Hart 1: Q4_0 weight dequant producer
// ================================================================
if (is_hart1) {
scp_signal(ready_ctr, 0);
scp_signal(consumed_ctr, 0);
uint32_t chunk_id = 0;
for (int64_t tile = (int64_t) shire_id + local_tile_idx * NUM_COMPUTE_SHIRES; tile < base_tiles;
tile += tiles_stride) {
const int64_t tiles_per_batch = m_tiles * n_tiles;
const int64_t batch_idx = tile / tiles_per_batch;
const int64_t tile_in_batch = tile % tiles_per_batch;
const int64_t mb_idx = tile_in_batch % m_tiles;
const int64_t i3 = batch_idx / ne2_1;
const int64_t i2 = batch_idx % ne2_1;
const int64_t i2_0 = i2 / r2;
const int64_t i3_0 = i3 / r3;
const char * src0_batch = src0_base + i3_0 * nb3_0 + i2_0 * nb2_0;
const int64_t mb = mb_idx * TILE_M;
for (int64_t kb = kb_start; kb < kb_end; ++kb) {
int buf = chunk_id & 1;
// Back-pressure: wait for hart 0 to finish with this buffer.
if (chunk_id >= 2) {
scp_wait(consumed_ctr, chunk_id - 1);
}
dequant_q4_0_panel(scp_panel[buf], src0_batch, mb, kb, nb1_0);
FENCE;
flush_to_l2(scp_panel[buf], BLOCK_K, 64);
WAIT_CACHEOPS;
chunk_id++;
scp_signal(ready_ctr, chunk_id);
}
}
FENCE;
return 0;
}
// ================================================================
// Hart 0: tensor engine compute
// ================================================================
uint64_t my_minion_id = get_minion_id();
const uint64_t group_base_global = my_minion_id - k_split;
setup_cache_scp();
#if CACHEOP_MAX > 0 || REP_RATE > 0
ucache_control(1, REP_RATE, CACHEOP_MAX);
#endif
CLEAR_TENSOR_ERROR;
evict_to_l2((const void *) ready_ctr, 1, 64);
WAIT_CACHEOPS;
evict_to_l2((const void *) consumed_ctr, 1, 64);
WAIT_CACHEOPS;
uint32_t chunk_id = 0;
for (int64_t tile = (int64_t) shire_id + local_tile_idx * NUM_COMPUTE_SHIRES; tile < base_tiles;
tile += tiles_stride) {
const int64_t tiles_per_batch = m_tiles * n_tiles;
const int64_t batch_idx = tile / tiles_per_batch;
const int64_t tile_in_batch = tile % tiles_per_batch;
const int64_t nb_idx = tile_in_batch / m_tiles;
const int64_t mb_idx = tile_in_batch % m_tiles;
const int64_t i3 = batch_idx / ne2_1;
const int64_t i2 = batch_idx % ne2_1;
const char * src1_batch = src1_base + i3 * nb3_1 + i2 * nb2_1;
char * dst_batch = dst_base + i3 * nb3_d + i2 * nb2_d;
const int64_t mb = mb_idx * TILE_M;
const int64_t nb = nb_idx * TILE_N;
const int64_t n_cur = (nb + TILE_N <= N) ? TILE_N : (N - nb);
// Partial-N tiles run TensorFMA32 with a_num_rows = n_cur-1.
// Errata Type D workaround for n_cur == 4 (AROWS==3): pad A to AROWS==4.
const int64_t arows_fma = (n_cur == 4) ? 4 : (n_cur - 1);
if (n_cur == 4) {
// Zero the padded 5th A row (line A_L1_START+4) once; the per-pass A
// load only writes lines A_L1_START..+3, so this persists.
static const float __attribute__((aligned(64))) zero_line[16] = { 0 };
tensor_load(false, false, A_L1_START + 4, TENSOR_LOAD_PLAIN, 0, (uint64_t) zero_line, 0,
0, // 1 line
64, 0);
tensor_wait(TENSOR_LOAD_WAIT_0);
}
int first = 1; // first_pass=1 only for the very first FMA of the tile
for (int64_t kb = kb_start; kb < kb_end; ++kb) {
int buf = chunk_id & 1;
// Wait for hart 1 to finish dequantizing this block.
chunk_id++;
scp_wait(ready_ctr, chunk_id);
// Two FMA passes over the 32-wide block (16 K-cols each).
for (int half = 0; half < 2; ++half) {
const int64_t k_elem = kb * BLOCK_K + half * FMA_K;
// Load A (activations) for this 16-K sub-tile, PLAIN.
tensor_load(false, false, A_L1_START, TENSOR_LOAD_PLAIN, 0,
(uint64_t) (src1_batch + nb * nb1_1 + k_elem * (int64_t) sizeof(float)), 0, n_cur - 1,
(uint64_t) nb1_1, 0);
// Load B (dequantized weights) half from L2 SCP panel, PLAIN.
tensor_load(false, false, B_L1_START, TENSOR_LOAD_PLAIN, 0,
(uint64_t) (scp_panel[buf] + (int64_t) half * FMA_K * TILE_M), 0, FMA_K - 1, 64, 1);
tensor_wait(TENSOR_LOAD_WAIT_0);
tensor_wait(TENSOR_LOAD_WAIT_1);
tensor_fma(false,
3, // b_num_col: (16/4)-1
arows_fma, // a_num_rows (n_cur-1, or 4 for the n_cur==4 errata pad)
FMA_K - 1, // a_num_cols
0, false, false, false, false, B_L1_START, A_L1_START, TENSOR_FMA_OP_FP32, first);
tensor_wait(TENSOR_FMA_WAIT);
first = 0;
}
// Signal that this buffer is free for hart 1 to reuse.
scp_signal(consumed_ctr, chunk_id);
}
// K-split ring reduce.
if (k_splits > 1) {
const uint64_t num_regs = (uint64_t) n_cur * 2;
if (k_split > 0) {
tensor_reduce_recv(0, TENSOR_REDUCE_OP_FADD, num_regs, group_base_global + k_split - 1);
tensor_wait(TENSOR_REDUCE_WAIT);
}
if (k_split < k_splits - 1) {
tensor_reduce_send(0, num_regs, group_base_global + k_split + 1);
tensor_wait(TENSOR_REDUCE_WAIT);
}
}
// Store FP32 result tile (only the last k-split owns the final sum).
if (k_split == k_splits - 1) {
tensor_store(0, 0, 3, n_cur - 1, (uint64_t) (dst_batch + nb * nb1_d + mb * (int64_t) sizeof(float)), 0,
(uint64_t) nb1_d);
tensor_wait(TENSOR_STORE_WAIT);
}
}
FENCE;
return 0;
}
@@ -1,413 +0,0 @@
//******************************************************************************
// MUL_MAT Kernel
// Matrix multiplication: C[M,N] = A[M,K] * B[K,N]
//******************************************************************************
#include "block_ops.h"
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include <stdint.h>
#define STRIDE_M 2048 /* 32 shires x 32 minions x 2 harts */
#define STRIDE_M_KSPLIT 1024 /* 32 shires x 32 minions (both harts share rows) */
#define KSPLIT_MIN_K_BLOCKS 256 /* K >= 8192 elements */
#define KSPLIT_SMALL_ROWS_K_BLOCKS 64 /* K >= 2048 elements for very small M */
#define KSPLIT_MAX_ROWS 8 /* max rows per minion for K-split */
#define TILE_KB 256 /* K-tile size in Q8_0 blocks (8192 elems, 32KB B data) */
#define KSPLIT_GROUP_ROWS 4
#define SIMPLE_X2_ROWS 2
static inline size_t tensor_bytes(const struct ggml_tensor * t) {
return (size_t) t->ne[0] * t->ne[1] * t->ne[2] * t->ne[3] * t->nb[0];
}
int entry_point(struct ggml_et_mm_q8_params * params, void * env) {
uint64_t hart_id = get_hart_id();
// Matrix dimensions
const int64_t K = params->src0.ne[0];
const int64_t M = params->src0.ne[1];
const int64_t N = params->src1.ne[1];
const int64_t ne02 = params->src0.ne[2];
const int64_t ne03 = params->src0.ne[3];
const int64_t ne12 = params->src1.ne[2];
const int64_t ne13 = params->src1.ne[3];
// Strides (in bytes)
const size_t nb01 = params->src0.nb[1];
const size_t nb02 = params->src0.nb[2];
const size_t nb03 = params->src0.nb[3];
const size_t nb11 = params->src1.nb[1];
const size_t nb12 = params->src1.nb[2];
const size_t nb13 = params->src1.nb[3];
const size_t nbd1 = params->dst.nb[1];
const size_t nbd2 = params->dst.nb[2];
const size_t nbd3 = params->dst.nb[3];
// Optional residual bias
const char * bias_base = (const char *) params->bias.data;
const size_t nbb1 = params->bias.nb[1];
const size_t nbb2 = params->bias.nb[2];
const size_t nbb3 = params->bias.nb[3];
// Q8_0 block size is 32
const int64_t K_blocks = K / 32;
const int use_simple_x2 = ((nb01 & 31) == 0);
// Broadcasting ratios
const int64_t r2 = ne12 / ne02;
const int64_t r3 = ne13 / ne03;
// K-split decision
const int64_t minion_id = hart_id >> 1; /* 0..1023 global */
const int64_t local_minion = (hart_id >> 1) & 0x1F; /* 0..31 within shire */
const int is_hart1 = hart_id & 1;
const int64_t rows_per_minion = (M + STRIDE_M_KSPLIT - 1) / STRIDE_M_KSPLIT;
const int64_t k_half = K_blocks / 2;
const int use_ksplit_small_rows = (rows_per_minion <= 2) && (K_blocks >= KSPLIT_SMALL_ROWS_K_BLOCKS);
/*
* K-split when K is large enough to benefit, and either:
* - few rows (4): always safe, proven working
* - more rows (5-8): only if each hart's half fits in one tile,
* otherwise L1 thrashing from 2 harts × 8 rows kills performance
*
* Also allow K-split earlier for the low-M regime (2 rows/minion). In
* that case the simple row-striped path leaves half the machine idle, so
* using both harts on each row pays off even for moderate K.
*/
const int use_ksplit = ((K_blocks >= KSPLIT_MIN_K_BLOCKS) && (rows_per_minion <= KSPLIT_MAX_ROWS) &&
(rows_per_minion <= 4 || k_half <= TILE_KB)) ||
use_ksplit_small_rows;
const int use_ksplit_group = !use_ksplit && (K_blocks >= KSPLIT_MIN_K_BLOCKS) && (rows_per_minion > 4) &&
(rows_per_minion <= KSPLIT_MAX_ROWS);
evict_region_past_l2(params->src1.data, tensor_bytes(&params->src1));
if (params->bias.data) {
evict_region_past_l2(params->bias.data, tensor_bytes(&params->bias));
}
if (use_ksplit) {
/* Each hart processes half the K dimension */
const int64_t k_start = is_hart1 ? k_half : 0;
const int64_t k_len = is_hart1 ? (K_blocks - k_half) : k_half;
/* One cache-line-aligned L2SCP slot per minion for exchange */
volatile float * l2scp_slot = (volatile float *) et_shire_l2scp_local(local_minion * 64);
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
const char * bias_ptr3 = bias_base ? bias_base + i3 * nbb3 : (const char *) 0;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
const char * bias_ptr2 = bias_ptr3 ? bias_ptr3 + i2 * nbb2 : (const char *) 0;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
const float * bias_n = bias_ptr2 ? (const float *) (bias_ptr2 + n * nbb1) : (const float *) 0;
for (int64_t m = minion_id; m < M; m += STRIDE_M_KSPLIT) {
const block_q8_0 * q_row = (const block_q8_0 *) (src0_ptr2 + m * nb01);
float partial = compute_row_dot_q8_0(q_row + k_start, b_col_base + k_start * 32, k_len);
if (is_hart1) {
*l2scp_slot = partial;
FENCE;
flush_to_l2((const void *) l2scp_slot, 1, 64);
WAIT_CACHEOPS;
et_sem_post(ET_BARRIER_MINION);
et_sem_wait(ET_BARRIER_MINION);
} else {
et_sem_wait(ET_BARRIER_MINION);
float other = *l2scp_slot;
et_sem_post(ET_BARRIER_MINION);
float * dst_entry = (float *) (dst_ptr2 + n * nbd1 + m * sizeof(float));
float sum = partial + other;
if (bias_n) {
sum += bias_n[m];
}
atomic_store_f32((volatile float *) dst_entry, sum);
}
}
}
}
}
} else if (use_ksplit_group) {
/*
* Grouped K-split for the 5-8 rows/minion regime.
*
* Both harts process the same 4-row group, each on half of K, and
* exchange 4 partial sums once per group instead of once per row.
* This keeps the K-split bandwidth benefit while cutting semaphore
* traffic by 4x relative to the old per-row exchange.
*/
const int64_t k_start = is_hart1 ? k_half : 0;
const int64_t k_len = is_hart1 ? (K_blocks - k_half) : k_half;
volatile float * l2scp_slot = (volatile float *) et_shire_l2scp_local(local_minion * 64);
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
const char * bias_ptr3 = bias_base ? bias_base + i3 * nbb3 : (const char *) 0;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
const char * bias_ptr2 = bias_ptr3 ? bias_ptr3 + i2 * nbb2 : (const char *) 0;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
const float * bias_n = bias_ptr2 ? (const float *) (bias_ptr2 + n * nbb1) : (const float *) 0;
for (int64_t m_base = minion_id; m_base < M; m_base += STRIDE_M_KSPLIT * KSPLIT_GROUP_ROWS) {
const int64_t m0 = m_base;
const int64_t m1 = m0 + STRIDE_M_KSPLIT;
const int64_t m2 = m1 + STRIDE_M_KSPLIT;
const int64_t m3 = m2 + STRIDE_M_KSPLIT;
float s0 = 0.0f, s1 = 0.0f, s2 = 0.0f, s3 = 0.0f;
for (int64_t kb = 0; kb < K_blocks; kb += TILE_KB) {
int64_t tile_len = k_len - kb;
if (tile_len > TILE_KB) {
tile_len = TILE_KB;
}
if (tile_len <= 0) {
break;
}
const float * b_tile = b_col_base + (k_start + kb) * 32;
const int64_t row_kb = k_start + kb;
if (m0 < M) {
s0 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m0 * nb01) + row_kb,
b_tile, tile_len);
}
if (m1 < M) {
s1 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m1 * nb01) + row_kb,
b_tile, tile_len);
}
if (m2 < M) {
s2 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m2 * nb01) + row_kb,
b_tile, tile_len);
}
if (m3 < M) {
s3 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m3 * nb01) + row_kb,
b_tile, tile_len);
}
}
if (is_hart1) {
l2scp_slot[0] = s0;
l2scp_slot[1] = s1;
l2scp_slot[2] = s2;
l2scp_slot[3] = s3;
FENCE;
flush_to_l2((const void *) l2scp_slot, 1, 64);
WAIT_CACHEOPS;
et_sem_post(ET_BARRIER_MINION);
et_sem_wait(ET_BARRIER_MINION);
} else {
et_sem_wait(ET_BARRIER_MINION);
const float p0 = l2scp_slot[0];
const float p1 = l2scp_slot[1];
const float p2 = l2scp_slot[2];
const float p3 = l2scp_slot[3];
et_sem_post(ET_BARRIER_MINION);
float * c_base = (float *) (dst_ptr2 + n * nbd1);
const float b0 = bias_n ? bias_n[m0] : 0.0f;
const float b1 = (bias_n && m1 < M) ? bias_n[m1] : 0.0f;
const float b2 = (bias_n && m2 < M) ? bias_n[m2] : 0.0f;
const float b3 = (bias_n && m3 < M) ? bias_n[m3] : 0.0f;
if (m0 < M) {
atomic_store_f32((volatile float *) (c_base + m0), s0 + p0 + b0);
}
if (m1 < M) {
atomic_store_f32((volatile float *) (c_base + m1), s1 + p1 + b1);
}
if (m2 < M) {
atomic_store_f32((volatile float *) (c_base + m2), s2 + p2 + b2);
}
if (m3 < M) {
atomic_store_f32((volatile float *) (c_base + m3), s3 + p3 + b3);
}
}
}
}
}
}
} else if (K_blocks > TILE_KB) {
/*
* Tile-outer with scalar row groups: process up to 4 rows per
* hart sharing each B tile before advancing to the next tile.
* Uses scalar float variables (not an array) to accumulate across
* tiles avoids the flw/fadd.s/fsw stack ops that corrupt vector
* register state on ET-SoC-1's MMX-style shared FP file.
*/
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
const char * bias_ptr3 = bias_base ? bias_base + i3 * nbb3 : (const char *) 0;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
const char * bias_ptr2 = bias_ptr3 ? bias_ptr3 + i2 * nbb2 : (const char *) 0;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
const float * bias_n = bias_ptr2 ? (const float *) (bias_ptr2 + n * nbb1) : (const float *) 0;
for (int64_t m0 = hart_id; m0 < M; m0 += STRIDE_M * 4) {
const int64_t m1 = m0 + STRIDE_M;
const int64_t m2 = m0 + STRIDE_M * 2;
const int64_t m3 = m0 + STRIDE_M * 3;
float s0 = 0.0f, s1 = 0.0f, s2 = 0.0f, s3 = 0.0f;
for (int64_t kb = 0; kb < K_blocks; kb += TILE_KB) {
int64_t tile_len = K_blocks - kb;
if (tile_len > TILE_KB) {
tile_len = TILE_KB;
}
const float * b_tile = b_col_base + kb * 32;
s0 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m0 * nb01) + kb, b_tile,
tile_len);
if (m1 < M) {
s1 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m1 * nb01) + kb, b_tile,
tile_len);
}
if (m2 < M) {
s2 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m2 * nb01) + kb, b_tile,
tile_len);
}
if (m3 < M) {
s3 += compute_row_dot_q8_0((const block_q8_0 *) (src0_ptr2 + m3 * nb01) + kb, b_tile,
tile_len);
}
}
float * dst_base = (float *) (dst_ptr2 + n * nbd1);
const float b0 = bias_n ? bias_n[m0] : 0.0f;
const float b1 = (bias_n && m1 < M) ? bias_n[m1] : 0.0f;
const float b2 = (bias_n && m2 < M) ? bias_n[m2] : 0.0f;
const float b3 = (bias_n && m3 < M) ? bias_n[m3] : 0.0f;
atomic_store_f32((volatile float *) (dst_base + m0), s0 + b0);
if (m1 < M) {
atomic_store_f32((volatile float *) (dst_base + m1), s1 + b1);
}
if (m2 < M) {
atomic_store_f32((volatile float *) (dst_base + m2), s2 + b2);
}
if (m3 < M) {
atomic_store_f32((volatile float *) (dst_base + m3), s3 + b3);
}
}
}
}
}
} else {
/*
* Simple path for small K.
*
* When `nb01` is 32-byte aligned, every row has the same block-alignment
* pattern. That lets us compute two rows together and reuse each loaded
* B chunk across both rows instead of reloading it in a second dot call.
*/
for (int64_t i3 = 0; i3 < ne13; i3++) {
const int64_t i03 = i3 / r3;
const char * src0_ptr3 = (const char *) params->src0.data + i03 * nb03;
const char * src1_ptr3 = (const char *) params->src1.data + i3 * nb13;
char * dst_ptr3 = (char *) params->dst.data + i3 * nbd3;
const char * bias_ptr3 = bias_base ? bias_base + i3 * nbb3 : (const char *) 0;
for (int64_t i2 = 0; i2 < ne12; i2++) {
const int64_t i02 = i2 / r2;
const char * src0_ptr2 = src0_ptr3 + i02 * nb02;
const char * src1_ptr2 = src1_ptr3 + i2 * nb12;
char * dst_ptr2 = dst_ptr3 + i2 * nbd2;
const char * bias_ptr2 = bias_ptr3 ? bias_ptr3 + i2 * nbb2 : (const char *) 0;
for (int64_t n = 0; n < N; n++) {
const float * b_col_base = (const float *) (src1_ptr2 + n * nb11);
const float * bias_n = bias_ptr2 ? (const float *) (bias_ptr2 + n * nbb1) : (const float *) 0;
q8_dot_state q8_state;
q8_dot_begin(&q8_state);
if (use_simple_x2) {
for (int64_t m0 = hart_id; m0 < M; m0 += STRIDE_M * SIMPLE_X2_ROWS) {
const int64_t m1 = m0 + STRIDE_M;
const block_q8_0 * q_row0 = (const block_q8_0 *) (src0_ptr2 + m0 * nb01);
if (m1 < M) {
const block_q8_0 * q_row1 = (const block_q8_0 *) (src0_ptr2 + m1 * nb01);
float s0, s1;
q8_dot_compute_x2_aligned(q_row0, q_row1, b_col_base, K_blocks, &s0, &s1);
float * dst0 = (float *) (dst_ptr2 + n * nbd1 + m0 * sizeof(float));
float * dst1 = (float *) (dst_ptr2 + n * nbd1 + m1 * sizeof(float));
if (bias_n) {
s0 += bias_n[m0];
s1 += bias_n[m1];
}
atomic_store_f32((volatile float *) dst0, s0);
atomic_store_f32((volatile float *) dst1, s1);
} else {
float sum = q8_dot_compute(q_row0, b_col_base, K_blocks);
float * dst = (float *) (dst_ptr2 + n * nbd1 + m0 * sizeof(float));
if (bias_n) {
sum += bias_n[m0];
}
atomic_store_f32((volatile float *) dst, sum);
}
}
} else {
for (int64_t m = hart_id; m < M; m += STRIDE_M) {
const block_q8_0 * q_row = (const block_q8_0 *) (src0_ptr2 + m * nb01);
float sum = q8_dot_compute(q_row, b_col_base, K_blocks);
float * dst_entry = (float *) (dst_ptr2 + n * nbd1 + m * sizeof(float));
if (bias_n) {
sum += bias_n[m];
}
atomic_store_f32((volatile float *) dst_entry, sum);
}
}
q8_dot_end(&q8_state);
}
}
}
}
#ifdef ET_UBERKERNEL
FENCE;
evict_region_past_l2(params->dst.data, tensor_bytes(&params->dst));
WAIT_CACHEOPS;
FENCE;
#endif
return 0;
}
@@ -1,142 +0,0 @@
//******************************************************************************
// MUL_MAT Kernel
// Matrix multiplication: C[M,N] = A[M,K] * B[K,N]
//******************************************************************************
#include "block_ops.h"
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include <stdint.h>
int entry_point(struct ggml_et_binary_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
// Thread coordination
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0 || (thread_id & 1)) {
return 0; // Skip odd threads to avoid resource contention
}
int effective_thread_id = thread_id / 2;
int effective_num_threads = (num_threads + 1) / 2;
// Extract tensor references
struct ggml_tensor * src0 = &params->src0; // Weight matrix A (F16)
struct ggml_tensor * src1 = &params->src1; // Activation matrix B (F16/F32)
struct ggml_tensor * dst = &params->dst; // Output matrix C (F32)
// Generic non-matrix-engine path: F16 x (F16/F32) -> F32
if (src0->type != GGML_TYPE_F16 || (src1->type != GGML_TYPE_F16 && src1->type != GGML_TYPE_F32) ||
dst->type != GGML_TYPE_F32) {
return -1;
}
const uint16_t * src0_data = (const uint16_t *) src0->data;
float * dst_data = (float *) dst->data;
// Dimensions and Strides
const int64_t K = src0->ne[0];
const int64_t M = src0->ne[1];
const int64_t N = src1->ne[1];
const int64_t ne02 = src0->ne[2], ne03 = src0->ne[3];
const int64_t ne12 = src1->ne[2], ne13 = src1->ne[3];
const int64_t ne2 = dst->ne[2], ne3 = dst->ne[3];
const size_t nb01 = src0->nb[1], nb02 = src0->nb[2], nb03 = src0->nb[3];
const size_t nb11 = src1->nb[1], nb12 = src1->nb[2], nb13 = src1->nb[3];
const size_t nb1 = dst->nb[1], nb2 = dst->nb[2], nb3 = dst->nb[3];
// F16 specific block size (Usually QK_F16)
const int block_size = QK_F16;
const int64_t K_blocks = K / block_size;
const int64_t K_remainder = K % block_size;
// Threading distribution
const uint64_t total_elements = M * N * ne2 * ne3;
const uint64_t per_thread = 16;
const uint64_t threads_stride = per_thread * effective_num_threads;
if (effective_thread_id * per_thread >= total_elements) {
return 0;
}
// Broadcasting support
const int64_t r2 = ne12 / ne02;
const int64_t r3 = ne13 / ne03;
for (uint64_t base_idx = effective_thread_id * per_thread; base_idx < total_elements; base_idx += threads_stride) {
for (uint64_t j = 0; j < per_thread; j++) {
const uint64_t idx = base_idx + j;
if (idx >= total_elements) {
break;
}
// Index decoding
const int64_t i3 = idx / (M * N * ne2);
const int64_t rem3 = idx % (M * N * ne2);
const int64_t i2 = rem3 / (M * N);
const int64_t rem2 = rem3 % (M * N);
const int64_t n = rem2 / M;
const int64_t m = rem2 % M;
const int64_t i03 = i3 / r3, i02 = i2 / r2;
const int64_t i13 = (ne13 > 1) ? i3 : 0, i12 = (ne12 > 1) ? i2 : 0;
float sum = 0.0f;
const uint16_t * f16_row =
(const uint16_t *) ((const char *) src0_data + m * nb01 + i02 * nb02 + i03 * nb03);
if (src1->type == GGML_TYPE_F32) {
const float * src1_data = (const float *) src1->data;
for (int64_t kb = 0; kb < K_blocks; kb++) {
const float * b_col_ptr =
(const float *) ((const char *) src1_data + (kb * block_size) * sizeof(float) + n * nb11 +
i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f16_naive(&f16_row[kb * block_size], b_col_ptr);
}
if (K_remainder > 0) {
const int64_t offset = K_blocks * block_size;
const float * b_col_ptr = (const float *) ((const char *) src1_data + offset * sizeof(float) +
n * nb11 + i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f16_partial(&f16_row[offset], b_col_ptr, K_remainder);
}
} else {
const uint16_t * src1_data = (const uint16_t *) src1->data;
for (int64_t kb = 0; kb < K_blocks; kb++) {
const uint16_t * b_col_ptr =
(const uint16_t *) ((const char *) src1_data + (kb * block_size) * sizeof(uint16_t) + n * nb11 +
i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f16_f16_partial(&f16_row[kb * block_size], b_col_ptr, block_size);
}
if (K_remainder > 0) {
const int64_t offset = K_blocks * block_size;
const uint16_t * b_col_ptr =
(const uint16_t *) ((const char *) src1_data + offset * sizeof(uint16_t) + n * nb11 +
i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f16_f16_partial(&f16_row[offset], b_col_ptr, K_remainder);
}
}
// Atomic store for output
volatile float * c_element =
(volatile float *) ((char *) dst_data + m * dst->nb[0] + n * nb1 + i2 * nb2 + i3 * nb3);
atomic_store_f32(c_element, sum);
}
}
return 0;
}
@@ -1,329 +0,0 @@
#include "ggml_tensor.h"
#include "platform.h"
#include "tensor.h"
#include <etsoc/common/utils.h>
#include <stdint.h>
// FP16 x FP16 -> FP32 MUL_MAT with hart 1 B-panel packing
//
// Hart 0: tensor engine (load A, load B from SCP, FMA, reduce, store)
// Hart 1: pack B into double-buffered L2 SCP panels, flush for tensor_load
//
// Sync: monotonic counters in L2 SCP with evict-based coherency.
// Double-buffered bpanel allows pack/FMA overlap.
//
#define NUM_COMPUTE_SHIRES 32
#define MINIONS_PER_SHIRE 32
#define TILE_M 16
#define TILE_N 16
#define TILE_K 32
#define CACHEOP_MAX 0
#define REP_RATE 0
#define A_L1_START 0 // SCP lines 0..15 for A
#define B_L1_START 16 // SCP lines 16..31 for B
typedef uint16_t et_fp16_t;
// L2 SCP layout per minion (double-buffered bpanel + sync counters)
// [0..1023] bpanel buffer 0 (16 lines x 64 bytes)
// [1024..2047] bpanel buffer 1
// [2048..2111] ready counter (hart1 -> hart0, own cache line)
// [2112..2175] consumed counter (hart0 -> hart1, own cache line)
#define SCP_BPANEL_SIZE (16 * 32 * sizeof(et_fp16_t)) // 1024 bytes
#define SCP_READY_OFF (2 * SCP_BPANEL_SIZE) // 2048
#define SCP_CONSUMED_OFF (SCP_READY_OFF + 64) // 2112
#define SCP_PER_MINION (SCP_CONSUMED_OFF + 64) // 2176
// Signal a counter value to the other hart via L2 SCP.
static inline void __attribute__((always_inline)) scp_signal(volatile uint32_t * flag, uint32_t value) {
*flag = value;
FENCE;
evict_to_l2((const void *) flag, 1, 64);
WAIT_CACHEOPS;
}
// Wait for a counter in L2 SCP to reach the expected value.
static inline void __attribute__((always_inline)) scp_wait(volatile uint32_t * flag, uint32_t expected) {
while (1) {
evict_to_l2((const void *) flag, 1, 64);
WAIT_CACHEOPS;
if (*flag >= expected) {
return;
}
}
}
/**
* Build the interleaved B panel that TensorFMA16A32 expects (vectorized).
*
* Output: 16 lines x 32 fp16 = 1024 bytes, 64-byte aligned.
* out[l][j*2+0] = src0[mb + j][kb + 2*l]
* out[l][j*2+1] = src0[mb + j][kb + 2*l + 1]
*
* Uses fsch.ps scatter store: load 8 pairs per row, scatter to 8 output lines.
*/
static inline void __attribute__((always_inline)) pack_b_interleaved(et_fp16_t * out,
const char * src0_batch,
int64_t mb,
int64_t kb,
int64_t nb1_0) {
static const int32_t __attribute__((aligned(32))) scatter_idx[8] = { 0, 64, 128, 192, 256, 320, 384, 448 };
unsigned long old_mask;
__asm__ volatile(
"mova.x.m %[ms] \n\t"
"mov.m.x m0, x0, 0xFF \n\t"
"flw.ps f1, 0(%[idx]) \n\t"
: [ms] "=&r"(old_mask)
: [idx] "r"(scatter_idx)
: "f1");
for (int j = 0; j < TILE_M; ++j) {
const et_fp16_t * row = (const et_fp16_t *) (src0_batch + (mb + j) * nb1_0) + kb;
char * dst = (char *) out + j * 4;
__asm__ volatile(
"flw.ps f2, 0(%[src]) \n\t"
"flw.ps f3, 32(%[src]) \n\t"
"fscw.ps f2, f1(%[d0]) \n\t"
"fscw.ps f3, f1(%[d1]) \n\t"
:
: [src] "r"(row), [d0] "r"(dst), [d1] "r"(dst + 512)
: "f2", "f3", "memory");
}
__asm__ volatile("mova.m.x %[ms] \n\t" : : [ms] "r"(old_mask));
}
int entry_point(struct ggml_et_binary_params * params, void * env) {
(void) env;
uint64_t hart_id = get_hart_id();
uint64_t shire_id = get_shire_id();
if (shire_id >= NUM_COMPUTE_SHIRES) {
return 0;
}
const int is_hart1 = hart_id & 1;
uint64_t local_minion = (hart_id >> 1) & 0x1F;
// Dimensions (both harts need these for tile assignment)
const int64_t K = params->src0.ne[0];
const int64_t M = params->src0.ne[1];
const int64_t N = params->src1.ne[1];
const int64_t ne2_0 = params->src0.ne[2], ne3_0 = params->src0.ne[3];
const int64_t ne2_1 = params->src1.ne[2], ne3_1 = params->src1.ne[3];
const int64_t nb1_0 = params->src0.nb[1];
const int64_t nb2_0 = params->src0.nb[2], nb3_0 = params->src0.nb[3];
const int64_t nb1_1 = params->src1.nb[1];
const int64_t nb2_1 = params->src1.nb[2], nb3_1 = params->src1.nb[3];
const int64_t nb1_d = params->dst.nb[1];
const int64_t nb2_d = params->dst.nb[2], nb3_d = params->dst.nb[3];
const char * src0_base = (const char *) params->src0.data;
const char * src1_base = (const char *) params->src1.data;
char * dst_base = (char *) params->dst.data;
if ((M % TILE_M) != 0) {
return 0;
}
if ((K % TILE_K) != 0) {
return 0;
}
const int64_t m_tiles = M / TILE_M;
const int64_t n_tiles = (N + TILE_N - 1) / TILE_N;
const int64_t batch_count = ne2_1 * ne3_1;
const int64_t base_tiles = m_tiles * n_tiles * batch_count;
const int64_t r2 = ne2_1 / ne2_0;
const int64_t r3 = ne3_1 / ne3_0;
const int64_t total_harts = NUM_COMPUTE_SHIRES * MINIONS_PER_SHIRE;
const int64_t k_steps = K / TILE_K;
int64_t k_splits = 1;
if (base_tiles < total_harts) {
k_splits = (total_harts + base_tiles - 1) / base_tiles;
int64_t ks = 1;
while (ks * 2 <= k_splits && ks * 2 <= 32 && k_steps % (ks * 2) == 0) {
ks *= 2;
}
k_splits = ks;
}
const int64_t tiles_per_shire = MINIONS_PER_SHIRE / k_splits;
const int64_t k_split = local_minion % k_splits;
const int64_t local_tile_idx = local_minion / k_splits;
const int64_t tiles_stride = (int64_t) NUM_COMPUTE_SHIRES * tiles_per_shire;
const int64_t k_steps_per_split = k_steps / k_splits;
const int64_t k_start = k_split * k_steps_per_split * TILE_K;
const int64_t k_end = k_start + k_steps_per_split * TILE_K;
// L2 SCP pointers for this minion's double-buffered panels + sync
uint64_t scp_base = local_minion * SCP_PER_MINION;
et_fp16_t * scp_bp[2] = {
(et_fp16_t *) et_shire_l2scp_local(scp_base),
(et_fp16_t *) et_shire_l2scp_local(scp_base + SCP_BPANEL_SIZE),
};
volatile uint32_t * ready_ctr = (volatile uint32_t *) et_shire_l2scp_local(scp_base + SCP_READY_OFF);
volatile uint32_t * consumed_ctr = (volatile uint32_t *) et_shire_l2scp_local(scp_base + SCP_CONSUMED_OFF);
// ================================================================
// Hart 1: B-panel packer
// ================================================================
if (is_hart1) {
// Initialize sync counters
scp_signal(ready_ctr, 0);
scp_signal(consumed_ctr, 0);
uint32_t chunk_id = 0;
for (int64_t tile = (int64_t) shire_id + local_tile_idx * NUM_COMPUTE_SHIRES; tile < base_tiles;
tile += tiles_stride) {
const int64_t tiles_per_batch = m_tiles * n_tiles;
const int64_t batch_idx = tile / tiles_per_batch;
const int64_t tile_in_batch = tile % tiles_per_batch;
const int64_t mb_idx = tile_in_batch % m_tiles;
const int64_t i3 = batch_idx / ne2_1;
const int64_t i2 = batch_idx % ne2_1;
const int64_t i2_0 = i2 / r2;
const int64_t i3_0 = i3 / r3;
const char * src0_batch = src0_base + i3_0 * nb3_0 + i2_0 * nb2_0;
const int64_t mb = mb_idx * TILE_M;
for (int64_t kb = k_start; kb < k_end; kb += TILE_K) {
int buf = chunk_id & 1;
// Back-pressure: wait for hart 0 to finish with this buffer
if (chunk_id >= 2) {
scp_wait(consumed_ctr, chunk_id - 1);
}
pack_b_interleaved(scp_bp[buf], src0_batch, mb, kb, nb1_0);
FENCE;
flush_to_l2(scp_bp[buf], 16, 64);
WAIT_CACHEOPS;
chunk_id++;
scp_signal(ready_ctr, chunk_id);
}
}
FENCE;
return 0;
}
// ================================================================
// Hart 0: tensor engine compute
// ================================================================
uint64_t my_minion_id = get_minion_id();
const uint64_t group_base_global = my_minion_id - k_split;
setup_cache_scp();
#if CACHEOP_MAX > 0 || REP_RATE > 0
ucache_control(1, REP_RATE, CACHEOP_MAX);
#endif
CLEAR_TENSOR_ERROR;
// Evict any stale L1D copies of sync counters
evict_to_l2((const void *) ready_ctr, 1, 64);
WAIT_CACHEOPS;
evict_to_l2((const void *) consumed_ctr, 1, 64);
WAIT_CACHEOPS;
uint32_t chunk_id = 0;
for (int64_t tile = (int64_t) shire_id + local_tile_idx * NUM_COMPUTE_SHIRES; tile < base_tiles;
tile += tiles_stride) {
const int64_t tiles_per_batch = m_tiles * n_tiles;
const int64_t batch_idx = tile / tiles_per_batch;
const int64_t tile_in_batch = tile % tiles_per_batch;
const int64_t nb_idx = tile_in_batch / m_tiles;
const int64_t mb_idx = tile_in_batch % m_tiles;
const int64_t i3 = batch_idx / ne2_1;
const int64_t i2 = batch_idx % ne2_1;
const char * src1_batch = src1_base + i3 * nb3_1 + i2 * nb2_1;
char * dst_batch = dst_base + i3 * nb3_d + i2 * nb2_d;
const int64_t mb = mb_idx * TILE_M;
const int64_t nb = nb_idx * TILE_N;
const int64_t n_cur = (nb + TILE_N <= N) ? TILE_N : (N - nb);
// Set tensor_mask for partial N tiles
if (n_cur < TILE_N) {
uint64_t mask = (1ULL << n_cur) - 1;
__asm__ __volatile__("csrw 0x805, %0" : : "r"(mask));
}
for (int64_t kb = k_start; kb < k_end; kb += TILE_K) {
int buf = chunk_id & 1;
// Start loading A from DRAM (overlaps with waiting for hart 1)
tensor_load((n_cur < TILE_N), false, A_L1_START, TENSOR_LOAD_PLAIN, 0,
(uint64_t) (src1_batch + nb * nb1_1 + kb * (int64_t) sizeof(et_fp16_t)), 0, n_cur - 1,
(uint64_t) nb1_1, 0);
// Wait for hart 1 to finish packing this chunk
chunk_id++;
scp_wait(ready_ctr, chunk_id);
// Load B from L2 SCP (hart 1 already flushed it)
tensor_load(false, false, B_L1_START, TENSOR_LOAD_PLAIN, 0, (uint64_t) scp_bp[buf], 0, 15, 64, 1);
tensor_wait(TENSOR_LOAD_WAIT_0);
tensor_wait(TENSOR_LOAD_WAIT_1);
// TensorFMA16A32
tensor_fma((n_cur < TILE_N), 3, n_cur - 1, 15, 0, false, false, false, false, B_L1_START, A_L1_START,
TENSOR_FMA_OP_FP16, (kb == k_start));
tensor_wait(TENSOR_FMA_WAIT);
// Signal that this buffer is free for hart 1 to reuse
scp_signal(consumed_ctr, chunk_id);
}
// K-split ring reduce
if (k_splits > 1) {
const uint64_t num_regs = (uint64_t) n_cur * 2;
if (k_split > 0) {
tensor_reduce_recv(0, TENSOR_REDUCE_OP_FADD, num_regs, group_base_global + k_split - 1);
tensor_wait(TENSOR_REDUCE_WAIT);
}
if (k_split < k_splits - 1) {
tensor_reduce_send(0, num_regs, group_base_global + k_split + 1);
tensor_wait(TENSOR_REDUCE_WAIT);
}
}
// Store FP32 result tile
if (k_split == k_splits - 1) {
tensor_store(0, 0, 3, n_cur - 1, (uint64_t) (dst_batch + nb * nb1_d + mb * (int64_t) sizeof(float)), 0,
(uint64_t) nb1_d);
tensor_wait(TENSOR_STORE_WAIT);
}
}
FENCE;
return 0;
}
@@ -1,137 +0,0 @@
#include "block_ops.h"
#include "ggml_tensor.h"
#include "platform.h"
#include "quants.h"
#include <etsoc/common/utils.h>
#include <stdint.h>
#include <stdio.h>
int entry_point(struct ggml_et_binary_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
// Thread coordination
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0 || (thread_id & 1)) {
return 0; // Skip odd threads to avoid resource contention
}
int effective_thread_id = thread_id / 2;
int effective_num_threads = (num_threads + 1) / 2;
// Extract tensor references
struct ggml_tensor * src0 = &params->src0; // Weight matrix A (F32)
struct ggml_tensor * src1 = &params->src1; // Activation matrix B (F16/F32)
struct ggml_tensor * dst = &params->dst; // Output matrix C (F32)
// Generic non-matrix-engine path: F32 x (F16/F32) -> F32
if (src0->type != GGML_TYPE_F32 || (src1->type != GGML_TYPE_F16 && src1->type != GGML_TYPE_F32) ||
dst->type != GGML_TYPE_F32) {
return -1;
}
const float * src0_data = (const float *) src0->data;
float * dst_data = (float *) dst->data;
// Dimensions and Strides
const int64_t K = src0->ne[0];
const int64_t M = src0->ne[1];
const int64_t N = src1->ne[1];
const int64_t ne02 = src0->ne[2], ne03 = src0->ne[3];
const int64_t ne12 = src1->ne[2], ne13 = src1->ne[3];
const int64_t ne2 = dst->ne[2], ne3 = dst->ne[3];
const size_t nb01 = src0->nb[1], nb02 = src0->nb[2], nb03 = src0->nb[3];
const size_t nb11 = src1->nb[1], nb12 = src1->nb[2], nb13 = src1->nb[3];
const size_t nb1 = dst->nb[1], nb2 = dst->nb[2], nb3 = dst->nb[3];
// F32 specific block size and counts
const int block_size = QK_F32;
const int64_t K_blocks = K / block_size;
const int64_t K_remainder = K % block_size;
// Threading distribution
const uint64_t total_elements = M * N * ne2 * ne3;
const uint64_t per_thread = 16;
const uint64_t threads_stride = per_thread * effective_num_threads;
if (effective_thread_id * per_thread >= total_elements) {
return 0;
}
// Broadcasting support
const int64_t r2 = ne12 / ne02;
const int64_t r3 = ne13 / ne03;
for (uint64_t base_idx = effective_thread_id * per_thread; base_idx < total_elements; base_idx += threads_stride) {
for (uint64_t j = 0; j < per_thread; j++) {
const uint64_t idx = base_idx + j;
if (idx >= total_elements) {
break;
}
// Index decoding
const int64_t i3 = idx / (M * N * ne2);
const int64_t rem3 = idx % (M * N * ne2);
const int64_t i2 = rem3 / (M * N);
const int64_t rem2 = rem3 % (M * N);
const int64_t n = rem2 / M;
const int64_t m = rem2 % M;
const int64_t i03 = i3 / r3, i02 = i2 / r2;
const int64_t i13 = (ne13 > 1) ? i3 : 0, i12 = (ne12 > 1) ? i2 : 0;
float sum = 0.0f;
const float * f32_row = (const float *) ((const char *) src0_data + m * nb01 + i02 * nb02 + i03 * nb03);
if (src1->type == GGML_TYPE_F32) {
const float * src1_data = (const float *) src1->data;
for (int64_t kb = 0; kb < K_blocks; kb++) {
const float * b_col_ptr =
(const float *) ((const char *) src1_data + (kb * block_size) * sizeof(float) + n * nb11 +
i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f32(&f32_row[kb * block_size], b_col_ptr);
}
if (K_remainder > 0) {
const int64_t offset = K_blocks * block_size;
const float * b_col_ptr = (const float *) ((const char *) src1_data + offset * sizeof(float) +
n * nb11 + i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f32_partial(&f32_row[offset], b_col_ptr, K_remainder);
}
} else {
const uint16_t * src1_data = (const uint16_t *) src1->data;
for (int64_t kb = 0; kb < K_blocks; kb++) {
const uint16_t * b_col_ptr =
(const uint16_t *) ((const char *) src1_data + (kb * block_size) * sizeof(uint16_t) + n * nb11 +
i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f32_f16_partial(&f32_row[kb * block_size], b_col_ptr, block_size);
}
if (K_remainder > 0) {
const int64_t offset = K_blocks * block_size;
const uint16_t * b_col_ptr =
(const uint16_t *) ((const char *) src1_data + offset * sizeof(uint16_t) + n * nb11 +
i12 * nb12 + i13 * nb13);
sum += compute_block_dot_product_f32_f16_partial(&f32_row[offset], b_col_ptr, K_remainder);
}
}
// Atomic store for output
volatile float * c_element =
(volatile float *) ((char *) dst_data + m * dst->nb[0] + n * nb1 + i2 * nb2 + i3 * nb3);
atomic_store_f32(c_element, sum);
}
}
return 0;
}
@@ -1,155 +0,0 @@
#include "ggml_tensor.h"
#include "platform.h"
#include "tensor.h"
#include <etsoc/common/utils.h>
#include <stdint.h>
/*
* F32 Matrix Multiply for ET-SoC-1 TensorFMA32.
*
* K-parallel + interleaved tiles + ring reduce.
* No batched-K yet (needs investigation on hang).
* This is the last known working version.
*/
#define NUM_COMPUTE_SHIRES 32
#define MINIONS_PER_SHIRE 32
#define TILE_K 16
#define TILE_M 16
/* ── Tuning knobs ───────────────────────────────────────────────────── */
#define TILE_N 16
#define CACHEOP_MAX 0
#define REP_RATE 0
/* ─────────────────────────────────────────────────────────────────── */
int entry_point(struct ggml_et_binary_params * params, void * env) {
uint64_t hart_id = get_hart_id();
uint64_t shire_id = get_shire_id();
if (shire_id >= NUM_COMPUTE_SHIRES) {
return 0;
}
if (hart_id & 1) {
return 0;
}
uint64_t local_minion = (hart_id >> 1) & 0x1F;
uint64_t my_minion_id = get_minion_id();
const int64_t K = params->src0.ne[0];
const int64_t M = params->src0.ne[1];
const int64_t N = params->src1.ne[1];
const int64_t ne2_0 = params->src0.ne[2], ne3_0 = params->src0.ne[3];
const int64_t ne2_1 = params->src1.ne[2], ne3_1 = params->src1.ne[3];
const int64_t nb1_0 = params->src0.nb[1];
const int64_t nb2_0 = params->src0.nb[2], nb3_0 = params->src0.nb[3];
const int64_t nb1_1 = params->src1.nb[1];
const int64_t nb2_1 = params->src1.nb[2], nb3_1 = params->src1.nb[3];
const int64_t nb1_d = params->dst.nb[1];
const int64_t nb2_d = params->dst.nb[2], nb3_d = params->dst.nb[3];
const char * src0_base = (const char *) params->src0.data;
const char * src1_base = (const char *) params->src1.data;
char * dst_base = (char *) params->dst.data;
setup_cache_scp();
#if CACHEOP_MAX > 0 || REP_RATE > 0
ucache_control(1, REP_RATE, CACHEOP_MAX);
#endif
CLEAR_TENSOR_ERROR;
const int64_t m_tiles = M / TILE_M;
const int64_t n_tiles = (N + TILE_N - 1) / TILE_N;
const int64_t batch_count = ne2_1 * ne3_1;
const int64_t base_tiles = m_tiles * n_tiles * batch_count;
const int64_t r2 = ne2_1 / ne2_0;
const int64_t r3 = ne3_1 / ne3_0;
const int64_t total_harts = NUM_COMPUTE_SHIRES * MINIONS_PER_SHIRE;
const int64_t k_steps = K / TILE_K;
int64_t k_splits = 1;
if (base_tiles < total_harts) {
k_splits = (total_harts + base_tiles - 1) / base_tiles;
int64_t ks = 1;
while (ks * 2 <= k_splits && ks * 2 <= 32 && k_steps % (ks * 2) == 0) {
ks *= 2;
}
k_splits = ks;
}
const int64_t tiles_per_shire = MINIONS_PER_SHIRE / k_splits;
const int64_t k_split = local_minion % k_splits;
const int64_t local_tile_idx = local_minion / k_splits;
const int64_t tiles_stride = (int64_t) NUM_COMPUTE_SHIRES * tiles_per_shire;
const int64_t k_steps_per_split = k_steps / k_splits;
const int64_t k_start = k_split * k_steps_per_split * TILE_K;
const int64_t k_end = k_start + k_steps_per_split * TILE_K;
const uint64_t group_base_global = my_minion_id - k_split;
for (int64_t tile = (int64_t) shire_id + local_tile_idx * NUM_COMPUTE_SHIRES; tile < base_tiles;
tile += tiles_stride) {
const int64_t tiles_per_batch = m_tiles * n_tiles;
const int64_t batch_idx = tile / tiles_per_batch;
const int64_t tile_in_batch = tile % tiles_per_batch;
const int64_t nb_idx = tile_in_batch / m_tiles;
const int64_t mb_idx = tile_in_batch % m_tiles;
const int64_t i3 = batch_idx / ne2_1;
const int64_t i2 = batch_idx % ne2_1;
const int64_t i2_0 = i2 / r2;
const int64_t i3_0 = i3 / r3;
const char * src0_batch = src0_base + i3_0 * nb3_0 + i2_0 * nb2_0;
const char * src1_batch = src1_base + i3 * nb3_1 + i2 * nb2_1;
char * dst_batch = dst_base + i3 * nb3_d + i2 * nb2_d;
const int64_t mb = mb_idx * TILE_M;
const int64_t nb = nb_idx * TILE_N;
const int64_t n_cur = (nb + TILE_N <= N) ? TILE_N : (N - nb);
for (int64_t kb = k_start; kb < k_end; kb += TILE_K) {
tensor_load(false, false, 0, 0, 0, (uint64_t) (src1_batch + nb * nb1_1 + kb * sizeof(float)), 0, n_cur - 1,
(uint64_t) nb1_1, 0);
tensor_load(false, false, TILE_K, 7, 0, (uint64_t) (src0_batch + mb * nb1_0 + kb * sizeof(float)), 0,
TILE_K - 1, (uint64_t) nb1_0, 1);
tensor_wait(TENSOR_LOAD_WAIT_0);
tensor_wait(TENSOR_LOAD_WAIT_1);
tensor_fma(false, 3, n_cur - 1, TILE_K - 1, 0, false, false, false, false, TILE_K, 0, 0, (kb == k_start));
tensor_wait(TENSOR_FMA_WAIT);
}
if (k_splits > 1) {
const uint64_t num_regs = (uint64_t) n_cur * 2;
if (k_split > 0) {
tensor_reduce_recv(0, TENSOR_REDUCE_OP_FADD, num_regs, group_base_global + k_split - 1);
tensor_wait(TENSOR_REDUCE_WAIT);
}
if (k_split < k_splits - 1) {
tensor_reduce_send(0, num_regs, group_base_global + k_split + 1);
tensor_wait(TENSOR_REDUCE_WAIT);
}
}
if (k_split == k_splits - 1) {
tensor_store(0, 0, 3, n_cur - 1, (uint64_t) (dst_batch + nb * nb1_d + mb * sizeof(float)), 0,
(uint64_t) nb1_d);
tensor_wait(TENSOR_STORE_WAIT);
}
}
FENCE;
return 0;
}
@@ -1,169 +0,0 @@
//******************************************************************************
// MUL_MAT_ID kernel specialized for Q4_0 weights (Mixture of Experts).
//
// C[m, s, b] = Sum(k=0..K-1) A[k, m, ids[s,b]] * B[k, s % ne11, b]
// A: Q4_0 [K, M, n_expert] weights
// B: F32 [K, n_cols, batch] activations
// ids: I32 [n_expert_used, batch]
// C: F32 [M, n_expert_used, batch]
//
// Strategy: All harts active. Flat m-major output partition allows amortized
// expert lookups and 2-row x2 dot products.
//******************************************************************************
#include "block_ops.h"
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include <stdint.h>
int entry_point(struct ggml_et_mul_mat_id_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || !params) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * src1 = &params->src1;
struct ggml_tensor * src2 = &params->src2;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_Q4_0 || src1->type != GGML_TYPE_F32 || src2->type != GGML_TYPE_I32 ||
dst->type != GGML_TYPE_F32) {
return -1;
}
const void * src0_data = src0->data;
const float * src1_data = (const float *) src1->data;
const int32_t * src2_data = (const int32_t *) src2->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !src1_data || !src2_data || !dst_data) {
return -1;
}
const int64_t K = src0->ne[0];
const int64_t M = src0->ne[1];
const int64_t n_expert = src0->ne[2];
const int64_t n_expert_used = src2->ne[0];
const int64_t batch = src2->ne[1];
const int64_t ne11 = src1->ne[1];
if (K % QK4_0 != 0) {
return -1;
}
const size_t nb01 = src0->nb[1]; // Q4_0 row stride
const size_t nb02 = src0->nb[2]; // expert stride
const size_t nb11 = src1->nb[1]; // activation column stride
const size_t nb12 = src1->nb[2]; // activation batch stride
const size_t nb20 = src2->nb[0];
const size_t nb21 = src2->nb[1];
const size_t nbd0 = dst->nb[0];
const size_t nbd1 = dst->nb[1];
const size_t nbd2 = dst->nb[2];
if (src0->nb[0] != sizeof(block_q4_0) || src1->nb[0] != sizeof(float) || src2->nb[0] != sizeof(int32_t) ||
nbd0 != sizeof(float)) {
return -1;
}
const int64_t K_blocks = K / QK4_0;
const int use_x2 = ((nb01 & 31) == 0);
const uint64_t total_outputs = (uint64_t) M * (uint64_t) n_expert_used * (uint64_t) batch;
if (total_outputs == 0) {
return 0;
}
// Even partition: hart h owns outputs [h*chunk, (h+1)*chunk).
const uint64_t chunk = (total_outputs + (uint64_t) num_threads - 1) / (uint64_t) num_threads;
const uint64_t my_start = (uint64_t) thread_id * chunk;
if (my_start >= total_outputs) {
return 0;
}
uint64_t my_end = my_start + chunk;
if (my_end > total_outputs) {
my_end = total_outputs;
}
// Save mask register once; full lanes for vector dot.
q4_dot_state q4_state;
q4_dot_begin(&q4_state);
const uint64_t per_batch = (uint64_t) M * (uint64_t) n_expert_used;
uint64_t idx = my_start;
while (idx < my_end) {
// Decode (m, slot, batch) from the m-major linear index.
const int64_t batch_idx = (int64_t) (idx / per_batch);
const uint64_t rem = idx - (uint64_t) batch_idx * per_batch;
const int64_t slot_idx = (int64_t) (rem / (uint64_t) M);
const int64_t m0 = (int64_t) (rem - (uint64_t) slot_idx * (uint64_t) M);
// How many outputs left in this (slot, batch) run AND in my range.
const uint64_t run_end_global =
(uint64_t) batch_idx * per_batch + (uint64_t) slot_idx * (uint64_t) M + (uint64_t) M;
const uint64_t end_in_my = (run_end_global < my_end) ? run_end_global : my_end;
int64_t run_len = (int64_t) (end_in_my - idx);
// Resolve expert + B column + dst slot for this run.
const int32_t expert_id =
*(const int32_t *) ((const char *) src2_data + slot_idx * (int64_t) nb20 + batch_idx * (int64_t) nb21);
char * dst_slot = (char *) dst_data + slot_idx * (int64_t) nbd1 + batch_idx * (int64_t) nbd2;
if (expert_id < 0 || expert_id >= n_expert) {
// Invalid expert id — zero out this run's outputs.
int64_t m = m0;
for (int64_t i = 0; i < run_len; i++, m++) {
atomic_store_f32((volatile float *) (dst_slot + m * (int64_t) nbd0), 0.0f);
}
idx += (uint64_t) run_len;
continue;
}
const int64_t col_idx = slot_idx % ne11;
const float * b_col_base =
(const float *) ((const char *) src1_data + col_idx * (int64_t) nb11 + batch_idx * (int64_t) nb12);
const char * expert_base = (const char *) src0_data + expert_id * (int64_t) nb02;
int64_t m = m0;
int64_t left = run_len;
// Paired-row dots: halves B bandwidth for runs >= 2.
if (use_x2) {
while (left >= 2) {
const block_q4_0 * row0 = (const block_q4_0 *) (expert_base + m * (int64_t) nb01);
const block_q4_0 * row1 = (const block_q4_0 *) (expert_base + (m + 1) * (int64_t) nb01);
float s0, s1;
q4_dot_compute_x2_aligned(row0, row1, b_col_base, K_blocks, &s0, &s1);
atomic_store_f32((volatile float *) (dst_slot + m * (int64_t) nbd0), s0);
atomic_store_f32((volatile float *) (dst_slot + (m + 1) * (int64_t) nbd0), s1);
m += 2;
left -= 2;
}
}
// Tail / non-aligned fallback: single-row dots.
while (left > 0) {
const block_q4_0 * row = (const block_q4_0 *) (expert_base + m * (int64_t) nb01);
float s = q4_dot_compute(row, b_col_base, K_blocks);
atomic_store_f32((volatile float *) (dst_slot + m * (int64_t) nbd0), s);
m++;
left--;
}
idx += (uint64_t) run_len;
}
q4_dot_end(&q4_state);
return 0;
}
@@ -1,160 +0,0 @@
//******************************************************************************
// MUL_MAT_ID kernel specialized for Q8_0 weights (Mixture of Experts).
//
// C[m, s, b] = Sum(k=0..K-1) A[k, m, ids[s,b]] * B[k, s % ne11, b]
// A: Q8_0 [K, M, n_expert] weights
// B: F32 [K, n_cols, batch] activations
// ids: I32 [n_expert_used, batch]
// C: F32 [M, n_expert_used, batch]
//
// Strategy mirrors mul_mat_id_Q4_0.c.
//******************************************************************************
#include "block_ops.h"
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include <stdint.h>
int entry_point(struct ggml_et_mul_mat_id_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env || !params) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * src1 = &params->src1;
struct ggml_tensor * src2 = &params->src2;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_Q8_0 || src1->type != GGML_TYPE_F32 || src2->type != GGML_TYPE_I32 ||
dst->type != GGML_TYPE_F32) {
return -1;
}
const void * src0_data = src0->data;
const float * src1_data = (const float *) src1->data;
const int32_t * src2_data = (const int32_t *) src2->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !src1_data || !src2_data || !dst_data) {
return -1;
}
const int64_t K = src0->ne[0];
const int64_t M = src0->ne[1];
const int64_t n_expert = src0->ne[2];
const int64_t n_expert_used = src2->ne[0];
const int64_t batch = src2->ne[1];
const int64_t ne11 = src1->ne[1];
if (K % QK8_0 != 0) {
return -1;
}
const size_t nb01 = src0->nb[1];
const size_t nb02 = src0->nb[2];
const size_t nb11 = src1->nb[1];
const size_t nb12 = src1->nb[2];
const size_t nb20 = src2->nb[0];
const size_t nb21 = src2->nb[1];
const size_t nbd0 = dst->nb[0];
const size_t nbd1 = dst->nb[1];
const size_t nbd2 = dst->nb[2];
if (src0->nb[0] != sizeof(block_q8_0) || src1->nb[0] != sizeof(float) || src2->nb[0] != sizeof(int32_t) ||
nbd0 != sizeof(float)) {
return -1;
}
const int64_t K_blocks = K / QK8_0;
const int use_x2 = ((nb01 & 31) == 0);
const uint64_t total_outputs = (uint64_t) M * (uint64_t) n_expert_used * (uint64_t) batch;
if (total_outputs == 0) {
return 0;
}
const uint64_t chunk = (total_outputs + (uint64_t) num_threads - 1) / (uint64_t) num_threads;
const uint64_t my_start = (uint64_t) thread_id * chunk;
if (my_start >= total_outputs) {
return 0;
}
uint64_t my_end = my_start + chunk;
if (my_end > total_outputs) {
my_end = total_outputs;
}
q8_dot_state q8_state;
q8_dot_begin(&q8_state);
const uint64_t per_batch = (uint64_t) M * (uint64_t) n_expert_used;
uint64_t idx = my_start;
while (idx < my_end) {
const int64_t batch_idx = (int64_t) (idx / per_batch);
const uint64_t rem = idx - (uint64_t) batch_idx * per_batch;
const int64_t slot_idx = (int64_t) (rem / (uint64_t) M);
const int64_t m0 = (int64_t) (rem - (uint64_t) slot_idx * (uint64_t) M);
const uint64_t run_end_global =
(uint64_t) batch_idx * per_batch + (uint64_t) slot_idx * (uint64_t) M + (uint64_t) M;
const uint64_t end_in_my = (run_end_global < my_end) ? run_end_global : my_end;
int64_t run_len = (int64_t) (end_in_my - idx);
const int32_t expert_id =
*(const int32_t *) ((const char *) src2_data + slot_idx * (int64_t) nb20 + batch_idx * (int64_t) nb21);
char * dst_slot = (char *) dst_data + slot_idx * (int64_t) nbd1 + batch_idx * (int64_t) nbd2;
if (expert_id < 0 || expert_id >= n_expert) {
int64_t m = m0;
for (int64_t i = 0; i < run_len; i++, m++) {
atomic_store_f32((volatile float *) (dst_slot + m * (int64_t) nbd0), 0.0f);
}
idx += (uint64_t) run_len;
continue;
}
const int64_t col_idx = slot_idx % ne11;
const float * b_col_base =
(const float *) ((const char *) src1_data + col_idx * (int64_t) nb11 + batch_idx * (int64_t) nb12);
const char * expert_base = (const char *) src0_data + expert_id * (int64_t) nb02;
int64_t m = m0;
int64_t left = run_len;
if (use_x2) {
while (left >= 2) {
const block_q8_0 * row0 = (const block_q8_0 *) (expert_base + m * (int64_t) nb01);
const block_q8_0 * row1 = (const block_q8_0 *) (expert_base + (m + 1) * (int64_t) nb01);
float s0, s1;
q8_dot_compute_x2_aligned(row0, row1, b_col_base, K_blocks, &s0, &s1);
atomic_store_f32((volatile float *) (dst_slot + m * (int64_t) nbd0), s0);
atomic_store_f32((volatile float *) (dst_slot + (m + 1) * (int64_t) nbd0), s1);
m += 2;
left -= 2;
}
}
while (left > 0) {
const block_q8_0 * row = (const block_q8_0 *) (expert_base + m * (int64_t) nb01);
float s = q8_dot_compute(row, b_col_base, K_blocks);
atomic_store_f32((volatile float *) (dst_slot + m * (int64_t) nbd0), s);
m++;
left--;
}
idx += (uint64_t) run_len;
}
q8_dot_end(&q8_state);
return 0;
}
@@ -1,288 +0,0 @@
//******************************************************************************
// Bare Metal MUL_MAT_ID Kernel (Mixture of Experts)
//
// ALGORITHM:
// MUL_MAT_ID performs batched matrix multiplication with expert routing.
// Each output element selects which expert matrix to use based on an index tensor.
//
// INPUTS:
// src0 (as): Expert weight matrices [K, M, n_expert]
// - Stack of n_expert matrices, each of size [K, M]
// src1 (b): Activation vectors [K, n_cols, batch]
// - n_cols can be 1 (broadcast) or n_expert_used (per-expert inputs)
// src2 (ids): Expert selection indices [n_expert_used, batch] (int32)
// - For each (slot, batch), specifies which expert from src0 to use
//
// OUTPUT:
// dst: Result [M, n_expert_used, batch, 1]
//
// COMPUTATION:
// For each output position (m, slot, batch):
// expert_id = ids[slot, batch] // Which expert to use (0..n_expert-1)
// col_idx = slot % src1.ne[1] // Which column in src1 (handles broadcasting)
// dst[m, slot, batch] = dot_product(
// src0[0:K, m, expert_id], // Row m from selected expert matrix
// src1[0:K, col_idx, batch] // Column from activations (may broadcast)
// )
//
// BROADCASTING:
// - When src1.ne[1] == 1: All expert slots use the same activation column
// - When src1.ne[1] == n_expert_used: Each slot has its own activation column
// - General case: col_idx = slot % src1.ne[1] (modulo handles both cases)
//
// MATH NOTATION:
// C[m, s, b] = Sum(k=0 to K-1) A[k, m, ids[s,b]] x B[k, s % ne11, b]
// where:
// m: [0, M) - output feature index
// s: [0, n_expert_used) - expert slot index
// b: [0, batch) - batch index
// k: [0, K) - hidden dimension
// ne11 = src1->ne[1] - number of columns in src1
//******************************************************************************
#include "block_ops.h"
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include "quants.h"
#include <stdint.h>
// Main entry point for MUL_MAT_ID kernel (Mixture of Experts)
int entry_point(struct ggml_et_mul_mat_id_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
// Get thread coordination info
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return -1;
}
// Use even threads only to avoid resource contention
// Each minion has 2 threads sharing instruction/data cache, NOC to RAM, and FPU
// Odd threads return immediately to avoid fighting for shared resources
if (thread_id & 1) {
return 0; // Odd thread - skip work
}
// Adjust thread count and ID for even-only threading
int effective_thread_id = thread_id / 2;
int effective_num_threads = (num_threads + 1) / 2; // Ceiling division
// Validate params
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
// Extract tensor references
struct ggml_tensor * src0 = &params->src0; // Expert weight matrices [K, M, n_expert]
struct ggml_tensor * src1 = &params->src1; // Activations [K, n_expert_used, batch]
struct ggml_tensor * src2 = &params->src2; // Expert indices [n_expert_used, batch] (I32)
struct ggml_tensor * dst = &params->dst; // Output [M, n_expert_used, batch, 1]
// Validate tensor types
if (src1->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32 || src2->type != GGML_TYPE_I32) {
return -1;
}
// Get data pointers
const void * src0_data = src0->data; // Expert matrices (Q8_0/F16/F32)
const float * src1_data = (const float *) src1->data; // Activations (F32)
const int32_t * src2_data = (const int32_t *) src2->data; // Expert IDs (I32)
float * dst_data = (float *) dst->data; // Output (F32)
if (!src0_data || !src1_data || !src2_data || !dst_data) {
return -1;
}
// Determine block size based on src0 type
int block_size;
switch (src0->type) {
case GGML_TYPE_Q8_0:
block_size = QK8_0;
break;
case GGML_TYPE_Q4_0:
block_size = QK4_0;
break;
case GGML_TYPE_F16:
block_size = QK_F16;
break;
case GGML_TYPE_F32:
block_size = QK_F32;
break;
default:
return -1;
}
// Get dimensions
// src0: [K, M, n_expert] - expert weight matrices
// src1: [K, n_expert_used, batch] - activations
// src2: [n_expert_used, batch] - expert indices
// dst: [M, n_expert_used, batch, 1] - output
const int64_t K = src0->ne[0]; // Hidden dimension
const int64_t M = src0->ne[1]; // Output features
const int64_t n_expert = src0->ne[2]; // Number of experts
const int64_t n_expert_used = src2->ne[0]; // Experts used per token
const int64_t batch = src2->ne[1]; // Batch size
// Strides (in bytes)
const size_t nb01 = src0->nb[1]; // src0 row stride
const size_t nb02 = src0->nb[2]; // src0 expert stride
const size_t nb11 = src1->nb[1]; // src1 column stride
const size_t nb12 = src1->nb[2]; // src1 batch stride
const size_t nb20 = src2->nb[0]; // src2 element stride
const size_t nb21 = src2->nb[1]; // src2 batch stride
const size_t nb1 = dst->nb[1]; // dst column stride
const size_t nb2 = dst->nb[2]; // dst batch stride
// Verify K dimension alignment for quantization
// Q8_0 requires strict alignment (quantized data must be block-aligned)
// F32 and F16 can handle partial blocks with scalar remainders
if ((src0->type == GGML_TYPE_Q8_0 || src0->type == GGML_TYPE_Q4_0) && K % block_size != 0) {
return -1; // Q8_0 requires K to be multiple of block_size
}
// Verify first dimension is contiguous
size_t expected_element_size_src0;
if (src0->type == GGML_TYPE_Q8_0) {
expected_element_size_src0 = sizeof(block_q8_0);
} else if (src0->type == GGML_TYPE_Q4_0) {
expected_element_size_src0 = sizeof(block_q4_0);
} else if (src0->type == GGML_TYPE_F16) {
expected_element_size_src0 = sizeof(uint16_t);
} else if (src0->type == GGML_TYPE_F32) {
expected_element_size_src0 = sizeof(float);
} else {
return -1;
}
if (src0->nb[0] != expected_element_size_src0 || src1->nb[0] != sizeof(float) || src2->nb[0] != sizeof(int32_t) ||
dst->nb[0] != sizeof(float)) {
return -1;
}
const int64_t K_blocks = K / block_size;
// Threading: distribute output elements across threads
// Total output elements = M * n_expert_used * batch
const uint64_t total_elements = M * n_expert_used * batch;
const uint64_t per_thread = 16;
const uint64_t threads_stride = per_thread * effective_num_threads;
if (effective_thread_id * per_thread >= total_elements) {
return 0;
}
// Process elements assigned to this thread
for (uint64_t base_idx = effective_thread_id * per_thread; base_idx < total_elements; base_idx += threads_stride) {
for (uint64_t j = 0; j < per_thread; j++) {
const uint64_t idx = base_idx + j;
if (idx >= total_elements) {
break;
}
// Decode linear index to (m, n_idx, batch_idx)
// Layout: m + M * (n_idx + n_expert_used * batch_idx)
const int64_t batch_idx = idx / (M * n_expert_used);
const int64_t rem = idx % (M * n_expert_used);
const int64_t n_idx = rem / M;
const int64_t m = rem % M;
// Get expert ID from src2[n_idx, batch_idx]
const int32_t expert_id = *(const int32_t *) ((const char *) src2_data + n_idx * nb20 + batch_idx * nb21);
// Validate expert ID
if (expert_id < 0 || expert_id >= n_expert) {
// Invalid expert ID - write zero and continue
volatile float * dst_element =
(volatile float *) ((char *) dst_data + m * dst->nb[0] + n_idx * nb1 + batch_idx * nb2);
atomic_store_f32(dst_element, 0.0f);
continue;
}
// Compute dot product: expert_matrix[m, :] x activations[:, col_idx, batch_idx]
// Use modulo to handle broadcasting: when src1 has fewer columns than expert slots,
// multiple slots share the same activation column (col_idx = n_idx % src1->ne[1])
const int64_t col_idx = n_idx % src1->ne[1];
float sum = 0.0f;
// Type switch hoisted outside block loop: one branch per element, not per block
const char * expert_row_base = (const char *) src0_data + m * nb01 + expert_id * nb02;
switch (src0->type) {
case GGML_TYPE_Q8_0:
{
const block_q8_0 * q8_row = (const block_q8_0 *) expert_row_base;
const float * b_col_base =
(const float *) ((const char *) src1_data + col_idx * nb11 + batch_idx * nb12);
sum += compute_row_dot_q8_0(q8_row, b_col_base, K_blocks);
break;
}
case GGML_TYPE_Q4_0:
{
const block_q4_0 * q4_row = (const block_q4_0 *) expert_row_base;
const float * b_col_base =
(const float *) ((const char *) src1_data + col_idx * nb11 + batch_idx * nb12);
sum += compute_row_dot_q4_0(q4_row, b_col_base, K_blocks);
break;
}
case GGML_TYPE_F16:
{
const uint16_t * f16_row = (const uint16_t *) expert_row_base;
const int64_t K_remainder = K % block_size;
for (int64_t kb = 0; kb < K_blocks; kb++) {
const float * b_col_ptr =
(const float *) ((const char *) src1_data + (kb * block_size) * sizeof(float) +
col_idx * nb11 + batch_idx * nb12);
sum += compute_block_dot_product_f16_naive(&f16_row[kb * block_size], b_col_ptr);
}
if (K_remainder > 0) {
const int64_t offset = K_blocks * block_size;
const float * b_col_ptr =
(const float *) ((const char *) src1_data + offset * sizeof(float) + col_idx * nb11 +
batch_idx * nb12);
sum += compute_block_dot_product_f16_partial(&f16_row[offset], b_col_ptr, K_remainder);
}
break;
}
case GGML_TYPE_F32:
{
const float * f32_row = (const float *) expert_row_base;
const int64_t K_remainder = K % block_size;
for (int64_t kb = 0; kb < K_blocks; kb++) {
const float * b_col_ptr =
(const float *) ((const char *) src1_data + (kb * block_size) * sizeof(float) +
col_idx * nb11 + batch_idx * nb12);
sum += compute_block_dot_product_f32(&f32_row[kb * block_size], b_col_ptr);
}
if (K_remainder > 0) {
const int64_t offset = K_blocks * block_size;
const float * b_col_ptr =
(const float *) ((const char *) src1_data + offset * sizeof(float) + col_idx * nb11 +
batch_idx * nb12);
sum += compute_block_dot_product_f32_partial(&f32_row[offset], b_col_ptr, K_remainder);
}
break;
}
default:
return -1;
}
// Store result using atomic store to avoid cache coherency issues
// when multiple threads write to the same cache line (64 bytes = 16 floats)
volatile float * dst_element =
(volatile float *) ((char *) dst_data + m * dst->nb[0] + n_idx * nb1 + batch_idx * nb2);
atomic_store_f32(dst_element, sum);
}
}
return 0;
}
-328
View File
@@ -1,328 +0,0 @@
//******************************************************************************
// Norm F32 Kernel (Layer Normalization)
// y[i] = (x[i] - mean) / sqrt(variance + eps)
// where mean = sum(x) / N, variance = sum((x - mean)^2) / N
//******************************************************************************
#include "ggml_tensor.h"
#include "math_fp.h"
#include "platform.h"
#include <assert.h>
#include <stdint.h>
#include <string.h>
// Norm kernel parameters structure
struct ggml_et_norm_params {
struct ggml_tensor src0; // F32 input tensor
struct ggml_tensor dst; // F32 output tensor
float eps; // Epsilon parameter for numerical stability
};
int entry_point(struct ggml_et_norm_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1; // Invalid pointer
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
float eps = params->eps;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1; // Unsupported type combination
}
float * src0_data = (float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1; // Null data pointer
}
if (eps < 0.0f) {
return -1; // Invalid epsilon
}
const int64_t ne0 = dst->ne[0];
const int64_t ne1 = dst->ne[1];
const int64_t ne2 = dst->ne[2];
const int64_t ne3 = dst->ne[3];
const size_t nb0 = dst->nb[0], nb1 = dst->nb[1], nb2 = dst->nb[2], nb3 = dst->nb[3];
const size_t nb00 = src0->nb[0], nb01 = src0->nb[1], nb02 = src0->nb[2], nb03 = src0->nb[3];
if (src0->ne[0] != ne0 || src0->ne[1] != ne1 || src0->ne[2] != ne2 || src0->ne[3] != ne3) {
return -1; // Shape mismatch
}
const int32_t total_rows = (int32_t) (ne1 * ne2 * ne3);
const int shire_threads = SOC_MINIONS_PER_SHIRE * NUM_HARTS_PER_MINION;
if (total_rows >= shire_threads) {
// Row-parallel: each thread processes whole rows
for (int64_t i3 = 0; i3 < ne3; i3++) {
for (int64_t i2 = 0; i2 < ne2; i2++) {
for (int64_t i1 = thread_id; i1 < ne1; i1 += num_threads) {
const float * src_ptr =
(const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_ptr = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
// Step 1: sum for mean
float zero = 0.0f;
__asm__ volatile("fbc.ps f10, %[z]\n" : : [z] "m"(zero) : "f10");
for (int32_t i0 = 0; i0 < (int32_t) ne0; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fadd.ps f10, f10, f11\n"
:
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0])
: "f10", "f11");
}
float sum;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(sum)::"t0", "f1", "f2", "f3", "f4", "f5");
const float mean = et_fdiv(sum, (float) (int32_t) ne0);
// Step 2: compute (x - mean) → dst, accumulate variance
__asm__ volatile("fbc.ps f10, %[z]\n" : : [z] "m"(zero) : "f10");
for (int32_t i0 = 0; i0 < (int32_t) ne0; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fbc.ps f12, %[mean_ptr]\n"
"fsub.ps f13, f11, f12\n"
"fsw.ps f13, %[result]\n"
"fmadd.ps f10, f13, f13, f10\n"
: [result] "=m"(*(float (*)[8]) & dst_ptr[i0])
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0]), [mean_ptr] "m"(mean)
: "f10", "f11", "f12", "f13");
}
float var_sum;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(var_sum)::"t0", "f1", "f2", "f3", "f4", "f5");
const float variance = et_fdiv(var_sum, (float) (int32_t) ne0);
const float scale = et_powf(variance + eps, -0.5f);
if (!(scale > 0.0f)) {
return -1;
}
// Step 3: apply scale to centered values in dst
for (int32_t i0 = 0; i0 < (int32_t) ne0; i0 += 8) {
__asm__ volatile(
"flw.ps f12, %[y_vec]\n"
"fbc.ps f13, %[scale_ptr]\n"
"fmul.ps f14, f12, f13\n"
"fsw.ps f14, %[result]\n"
: [result] "=m"(*(float (*)[8]) & dst_ptr[i0])
: [y_vec] "m"(*(const float (*)[8]) & dst_ptr[i0]), [scale_ptr] "m"(scale)
: "f12", "f13", "f14");
}
}
}
}
} else {
// Intra-row: threads within each shire cooperate via L2 SCP.
// Two reductions needed: sum (for mean), then variance sum.
int shire_tid = thread_id % shire_threads;
int threads_per_row = shire_threads / total_rows;
int my_row = shire_tid / threads_per_row;
int local_tid = shire_tid % threads_per_row;
int group_base = my_row * threads_per_row;
if (my_row >= total_rows) {
FENCE;
et_barrier(ET_BARRIER_SHIRE);
// Second barrier for variance exchange
FENCE;
et_barrier(ET_BARRIER_SHIRE);
return 0;
}
int64_t i1 = my_row % ne1;
int64_t i2 = (my_row / ne1) % ne2;
int64_t i3 = my_row / (ne1 * ne2);
const float * src_ptr = (const float *) ((const char *) src0_data + i3 * nb03 + i2 * nb02 + i1 * nb01);
float * dst_ptr = (float *) ((char *) dst_data + i3 * nb3 + i2 * nb2 + i1 * nb1);
const int32_t elems_per_cl = 16;
int32_t total_cls = ((int32_t) ne0 + elems_per_cl - 1) / elems_per_cl;
int32_t cls_per_thread = (total_cls + threads_per_row - 1) / threads_per_row;
int32_t my_start = local_tid * cls_per_thread * elems_per_cl;
int32_t my_end = my_start + cls_per_thread * elems_per_cl;
if (my_end > (int32_t) ne0) {
my_end = (int32_t) ne0;
}
if (my_start >= (int32_t) ne0) {
my_start = 0;
my_end = 0;
}
int workers = threads_per_row < total_cls ? threads_per_row : total_cls;
unsigned long saved_mask;
__asm__ volatile("mova.x.m %0" : "=r"(saved_mask));
__asm__ volatile("mov.m.x m0, x0, 0xFF");
// ---- Reduction 1: partial sum for mean ----
__asm__ volatile("fbci.pi f10, 0" ::: "f10");
for (int32_t i0 = my_start; i0 < my_end; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fadd.ps f10, f10, f11\n"
:
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0])
: "f10", "f11");
}
float partial_sum;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(partial_sum)::"t0", "f1", "f2", "f3", "f4", "f5");
// L2SCP exchange for sum
volatile float * my_slot = (volatile float *) et_shire_l2scp_local((uint64_t) shire_tid * 64);
*my_slot = partial_sum;
FENCE;
evict_to_l2((const void *) my_slot, 1, 64);
WAIT_CACHEOPS;
et_barrier(ET_BARRIER_SHIRE);
// All threads read sum, compute mean
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
evict_to_l2((const void *) slot, 1, 64);
}
WAIT_CACHEOPS;
float total_sum = 0.0f;
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
total_sum += *slot;
}
const float mean = et_fdiv(total_sum, (float) (int32_t) ne0);
// ---- Reduction 2: compute (x - mean) → dst chunk, partial variance ----
__asm__ volatile("fbci.pi f10, 0" ::: "f10");
if (my_start < my_end) {
uint32_t mean_bits;
__asm__ volatile("fmv.x.s %0, %1" : "=r"(mean_bits) : "f"(mean));
__asm__ volatile("fbcx.ps f15, %[mb]\n" : : [mb] "r"(mean_bits) : "f15");
for (int32_t i0 = my_start; i0 < my_end; i0 += 8) {
__asm__ volatile(
"flw.ps f11, %[x_vec]\n"
"fsub.ps f13, f11, f15\n"
"fsw.ps f13, %[result]\n"
"fmadd.ps f10, f13, f13, f10\n"
: [result] "=m"(*(float (*)[8]) & dst_ptr[i0])
: [x_vec] "m"(*(const float (*)[8]) & src_ptr[i0])
: "f10", "f11", "f13");
}
}
float partial_var;
__asm__ __volatile__(
"fswizz.ps f1, f10, 0xB1 \n\t"
"fadd.ps f2, f10, f1, rne \n\t"
"fswizz.ps f3, f2, 0x4E \n\t"
"fadd.ps f4, f2, f3, rne \n\t"
"fmvz.x.ps t0, f4, 4 \n\t"
"fbcx.ps f5, t0 \n\t"
"fadd.ps %[vout], f4, f5, rne \n\t"
: [vout] "=f"(partial_var)::"t0", "f1", "f2", "f3", "f4", "f5");
// L2SCP exchange for variance (reuse same slots)
*my_slot = partial_var;
FENCE;
evict_to_l2((const void *) my_slot, 1, 64);
WAIT_CACHEOPS;
et_barrier(ET_BARRIER_SHIRE);
// All threads read variance, compute scale, apply to own chunk
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
evict_to_l2((const void *) slot, 1, 64);
}
WAIT_CACHEOPS;
float total_var = 0.0f;
for (int t = 0; t < workers; t++) {
volatile float * slot = (volatile float *) et_shire_l2scp_local((uint64_t) (group_base + t) * 64);
total_var += *slot;
}
const float variance = et_fdiv(total_var, (float) (int32_t) ne0);
const float scale = et_powf(variance + eps, -0.5f);
if (!(scale > 0.0f)) {
__asm__ volatile("mova.m.x %0" ::"r"(saved_mask));
return -1;
}
// Apply scale to centered values (already in dst from reduction 2)
if (my_start < my_end) {
uint32_t scale_bits;
__asm__ volatile("fmv.x.s %0, %1" : "=r"(scale_bits) : "f"(scale));
__asm__ volatile("fbcx.ps f13, %[sb]\n" : : [sb] "r"(scale_bits) : "f13");
for (int32_t i0 = my_start; i0 < my_end; i0 += 8) {
__asm__ volatile(
"flw.ps f12, %[y_vec]\n"
"fmul.ps f14, f12, f13\n"
"fsw.ps f14, %[result]\n"
: [result] "=m"(*(float (*)[8]) & dst_ptr[i0])
: [y_vec] "m"(*(const float (*)[8]) & dst_ptr[i0])
: "f12", "f14");
}
}
__asm__ volatile("mova.m.x %0" ::"r"(saved_mask));
}
return 0;
}
-165
View File
@@ -1,165 +0,0 @@
//******************************************************************************
// Bare Metal PAD F32 Kernel
// Zero-pads an F32 tensor along dimensions 1-3.
//
// Constraints:
// - No dim0 padding (lp[0]==0, rp[0]==0)
// - dst contiguous
// - src nb[0] == 4 (dim0 contiguous for vectorized reads)
// - Zero-pad only (no circular mode)
//
// Two paths:
// Aligned (ne0 % 16 == 0): rows distributed across harts, vectorized.
// Small (16 % ne0 == 0): cache-line distributed, scalar per-element.
//******************************************************************************
#include "ggml_tensor.h"
#include "platform.h"
#include <stdint.h>
struct ggml_et_pad_params {
struct ggml_tensor src0;
struct ggml_tensor dst;
int32_t lp[4];
int32_t rp[4];
};
// Vectorized copy with scalar tail
static inline void vec_copy_f32(float * dst, const float * src, int32_t n) {
int32_t i = 0;
const int32_t vec_end = (n / 8) * 8;
for (; i < vec_end; i += 8) {
__asm__ volatile(
"flw.ps f10, %[s]\n"
"fsw.ps f10, %[d]\n"
: [d] "=m"(*(float (*)[8]) & dst[i])
: [s] "m"(*(const float (*)[8]) & src[i])
: "f10");
}
for (; i < n; i++) {
dst[i] = src[i];
}
}
int entry_point(struct ggml_et_pad_params * params, void * env) {
kernel_environment_t * kernel_env = (kernel_environment_t *) env;
if (!kernel_env) {
return -1;
}
int thread_id = get_relative_thread_id(kernel_env->shire_mask);
int num_threads = get_num_threads(kernel_env->shire_mask);
if (thread_id < 0) {
return 0;
}
if (params == 0 || ((uint64_t) params & 0x7) != 0) {
return -1;
}
struct ggml_tensor * src0 = &params->src0;
struct ggml_tensor * dst = &params->dst;
if (src0->type != GGML_TYPE_F32 || dst->type != GGML_TYPE_F32) {
return -1;
}
const float * src0_data = (const float *) src0->data;
float * dst_data = (float *) dst->data;
if (!src0_data || !dst_data) {
return -1;
}
// Dst dimensions
const int64_t ne0 = dst->ne[0];
const int64_t ne1 = dst->ne[1];
const int64_t ne2 = dst->ne[2];
const int64_t ne3 = dst->ne[3];
// Src strides (byte offsets)
const int64_t nb1_src = src0->nb[1];
const int64_t nb2_src = src0->nb[2];
const int64_t nb3_src = src0->nb[3];
// Padding values
const int32_t lp1 = params->lp[1];
const int32_t rp1 = params->rp[1];
const int32_t lp2 = params->lp[2];
const int32_t rp2 = params->rp[2];
const int32_t lp3 = params->lp[3];
const int32_t rp3 = params->rp[3];
const int64_t total_rows = ne1 * ne2 * ne3;
const int64_t total_elements = ne0 * total_rows;
if (total_elements == 0) {
return 0;
}
// Broadcast 0.0f to SIMD register for vectorized zero-fill
float zero = 0.0f;
__asm__ volatile("fbc.ps f12, %[v]\n" : : [v] "m"(zero) : "f12");
// Aligned: ne0 % 16 == 0 -> row-based distribution, vectorized
if (ne0 % 16 == 0) {
for (int64_t row = thread_id; row < total_rows; row += num_threads) {
const int64_t i3 = row / (ne1 * ne2);
const int64_t i2 = (row / ne1) % ne2;
const int64_t i1 = row % ne1;
float * dst_row = dst_data + row * ne0;
if (i1 >= lp1 && i1 < ne1 - rp1 && i2 >= lp2 && i2 < ne2 - rp2 && i3 >= lp3 && i3 < ne3 - rp3) {
const float * src_row = (const float *) ((const char *) src0_data + (i1 - lp1) * nb1_src +
(i2 - lp2) * nb2_src + (i3 - lp3) * nb3_src);
vec_copy_f32(dst_row, src_row, (int32_t) ne0);
} else {
int64_t i = 0;
const int64_t vec_end = (ne0 / 8) * 8;
for (; i < vec_end; i += 8) {
__asm__ volatile("fsw.ps f12, %[d]\n" : [d] "=m"(*(float (*)[8]) & dst_row[i])::"f12");
}
}
}
return 0;
}
// Small-ne0 path: 16 % ne0 == 0 -> cache-line distributed, scalar
const int64_t elems_per_cl = 16;
const int64_t total_cl = (total_elements + elems_per_cl - 1) / elems_per_cl;
const int64_t ne1_data_end = ne1 - rp1;
const int64_t ne2_data_end = ne2 - rp2;
const int64_t ne3_data_end = ne3 - rp3;
for (int64_t cl = thread_id; cl < total_cl; cl += num_threads) {
const int64_t elem_start = cl * elems_per_cl;
int64_t elem_end = elem_start + elems_per_cl;
if (elem_end > total_elements) {
elem_end = total_elements;
}
for (int64_t idx = elem_start; idx < elem_end; idx++) {
const int64_t i0 = idx % ne0;
const int64_t rem = idx / ne0;
const int64_t i1 = rem % ne1;
const int64_t rem2 = rem / ne1;
const int64_t i2 = rem2 % ne2;
const int64_t i3 = rem2 / ne2;
if (i1 >= lp1 && i1 < ne1_data_end && i2 >= lp2 && i2 < ne2_data_end && i3 >= lp3 && i3 < ne3_data_end) {
const float * sp = (const float *) ((const char *) src0_data + i0 * 4 + (i1 - lp1) * nb1_src +
(i2 - lp2) * nb2_src + (i3 - lp3) * nb3_src);
dst_data[idx] = *sp;
} else {
dst_data[idx] = 0.0f;
}
}
}
return 0;
}

Some files were not shown because too many files have changed in this diff Show More