开源 企业版 高校版 私有云 模力方舟 AI 队友
代码拉取完成,页面将自动刷新
捐赠
捐赠前请先登录
扫描微信二维码支付
取消
支付完成
支付提示
将跳转至支付宝完成支付
确定
取消
1 Star 0 Fork 3

xiongying/Halide

加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
已有帐号? 立即登录
文件
main
分支 (1093)
标签 (17)
main
xtensa-codegen
vksnk/dma-limit-channels
rootjalex/trs-codegen-cross
abadams/fix_7374
abadams/remove_hack_from_gpu_only_aottest
srj/gpu-cache
srj/generator_aot_gpu_multi_context_threaded
srj/xtensa-merge
abadams/vector_scan
abadams/fix_7365
darya-ver/ir-viz
vulkan-phase2-runtime
srj/param-map-deprecation
srj/rt-return-types
srj/main-vs2022
release/15.x
srj/param-map
abadams/ir_builder_unique_ptr
vksnk/restrict
v14.0.0
v13.0.4
v13.0.3
v13.0.2
v13.0.1
v13.0.0
v12.0.1
v12.0.0
v11.0.1
v11.0.0
v10.0.1
v10.0.0
release_2019_08_27
release_8.0.0
v8.0.0
release_2018_02_15
release_2013_11_11
main
分支 (1093)
标签 (17)
main
xtensa-codegen
vksnk/dma-limit-channels
rootjalex/trs-codegen-cross
abadams/fix_7374
abadams/remove_hack_from_gpu_only_aottest
srj/gpu-cache
srj/generator_aot_gpu_multi_context_threaded
srj/xtensa-merge
abadams/vector_scan
abadams/fix_7365
darya-ver/ir-viz
vulkan-phase2-runtime
srj/param-map-deprecation
srj/rt-return-types
srj/main-vs2022
release/15.x
srj/param-map
abadams/ir_builder_unique_ptr
vksnk/restrict
v14.0.0
v13.0.4
v13.0.3
v13.0.2
v13.0.1
v13.0.0
v12.0.1
v12.0.0
v11.0.1
v11.0.0
v10.0.1
v10.0.0
release_2019_08_27
release_8.0.0
v8.0.0
release_2018_02_15
release_2013_11_11
克隆/下载
克隆/下载
提示
下载代码请复制以下命令到终端执行
为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置
初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置
1 生成 RSA 密钥
2 获取 RSA 公钥内容,并配置到 SSH公钥
在 Gitee 上使用 SVN,请访问 使用指南
使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议 配置并使用私人令牌 替代登录密码进行克隆、推送等操作
Username for 'https://gitee.com': userName
Password for 'https://userName@gitee.com': # 私人令牌
main
分支 (1093)
标签 (17)
main
xtensa-codegen
vksnk/dma-limit-channels
rootjalex/trs-codegen-cross
abadams/fix_7374
abadams/remove_hack_from_gpu_only_aottest
srj/gpu-cache
srj/generator_aot_gpu_multi_context_threaded
srj/xtensa-merge
abadams/vector_scan
abadams/fix_7365
darya-ver/ir-viz
vulkan-phase2-runtime
srj/param-map-deprecation
srj/rt-return-types
srj/main-vs2022
release/15.x
srj/param-map
abadams/ir_builder_unique_ptr
vksnk/restrict
v14.0.0
v13.0.4
v13.0.3
v13.0.2
v13.0.1
v13.0.0
v12.0.1
v12.0.0
v11.0.1
v11.0.0
v10.0.1
v10.0.0
release_2019_08_27
release_8.0.0
v8.0.0
release_2018_02_15
release_2013_11_11
Halide
/
src
/
CodeGen_Metal_Dev.cpp
Halide
/
src
/
CodeGen_Metal_Dev.cpp
CodeGen_Metal_Dev.cpp 29.14 KB
一键复制 编辑 原始数据 按行查看 历史
Volodymyr Kysenko 提交于 2022年10月18日 06:07 +08:00 . Generate dot() in the Metal backend (#7085)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840
#include <algorithm>
#include <sstream>
#include <utility>
#include "CodeGen_GPU_Dev.h"
#include "CodeGen_Internal.h"
#include "CodeGen_Metal_Dev.h"
#include "Debug.h"
#include "IROperator.h"
namespace Halide {
namespace Internal {
using std::ostringstream;
using std::sort;
using std::string;
using std::vector;
static ostringstream nil;
namespace {
class CodeGen_Metal_Dev : public CodeGen_GPU_Dev {
public:
CodeGen_Metal_Dev(const Target &target);
/** Compile a GPU kernel into the module. This may be called many times
* with different kernels, which will all be accumulated into a single
* source module shared by a given Halide pipeline. */
void add_kernel(Stmt stmt,
const std::string &name,
const std::vector<DeviceArgument> &args) override;
/** (Re)initialize the GPU kernel module. This is separate from compile,
* since a GPU device module will often have many kernels compiled into it
* for a single pipeline. */
void init_module() override;
std::vector<char> compile_to_src() override;
std::string get_current_kernel_name() override;
void dump() override;
std::string print_gpu_name(const std::string &name) override;
std::string api_unique_name() override {
return "metal";
}
protected:
class CodeGen_Metal_C : public CodeGen_GPU_C {
public:
CodeGen_Metal_C(std::ostream &s, const Target &t)
: CodeGen_GPU_C(s, t) {
}
void add_kernel(const Stmt &stmt,
const std::string &name,
const std::vector<DeviceArgument> &args);
protected:
using CodeGen_GPU_C::visit;
std::string print_type(Type type, AppendSpaceIfNeeded space_option = DoNotAppendSpace) override;
// Vectors in Metal come in two varieties, regular and packed.
// For storage allocations and pointers used in address arithmetic,
// packed types must be used. For temporaries, constructors, etc.
// regular types must be used.
// This concept also potentially applies to half types, which are
// often only supported for storage, not arithmetic,
// hence the method name.
std::string print_storage_type(Type type);
std::string print_type_maybe_storage(Type type, bool storage, AppendSpaceIfNeeded space);
std::string print_reinterpret(Type type, const Expr &e) override;
std::string print_extern_call(const Call *op) override;
std::string get_memory_space(const std::string &);
std::string shared_name;
void visit(const Min *) override;
void visit(const Max *) override;
void visit(const Div *) override;
void visit(const Mod *) override;
void visit(const For *) override;
void visit(const Ramp *op) override;
void visit(const Broadcast *op) override;
void visit(const Call *op) override;
void visit(const Load *op) override;
void visit(const Store *op) override;
void visit(const Select *op) override;
void visit(const Allocate *op) override;
void visit(const Free *op) override;
void visit(const Cast *op) override;
void visit(const VectorReduce *op) override;
void visit(const Atomic *op) override;
};
std::ostringstream src_stream;
std::string cur_kernel_name;
CodeGen_Metal_C metal_c;
};
CodeGen_Metal_Dev::CodeGen_Metal_Dev(const Target &t)
: metal_c(src_stream, t) {
}
string CodeGen_Metal_Dev::CodeGen_Metal_C::print_type_maybe_storage(Type type, bool storage, AppendSpaceIfNeeded space) {
ostringstream oss;
// Storage uses packed vector types.
if (storage && type.lanes() != 1) {
oss << "packed_";
}
if (type.is_float()) {
if (type.bits() == 16) {
oss << "half";
} else if (type.bits() == 32) {
oss << "float";
} else if (type.bits() == 64) {
oss << "double";
} else {
user_error << "Can't represent a float with this many bits in Metal C: " << type << "\n";
}
} else {
if (type.is_uint() && type.bits() > 1) {
oss << "u";
}
switch (type.bits()) {
case 1:
oss << "bool";
break;
case 8:
oss << "char";
break;
case 16:
oss << "short";
break;
case 32:
oss << "int";
break;
case 64:
user_error << "Metal does not support 64-bit integers.\n";
break;
default:
user_error << "Can't represent an integer with this many bits in Metal C: " << type << "\n";
}
}
if (type.lanes() != 1) {
switch (type.lanes()) {
case 2:
case 3:
case 4:
oss << type.lanes();
break;
default:
user_error << "Unsupported vector width in Metal C: " << type << "\n";
}
}
if (space == AppendSpace) {
oss << " ";
}
return oss.str();
}
string CodeGen_Metal_Dev::CodeGen_Metal_C::print_type(Type type, AppendSpaceIfNeeded space) {
return print_type_maybe_storage(type, false, space);
}
string CodeGen_Metal_Dev::CodeGen_Metal_C::print_storage_type(Type type) {
return print_type_maybe_storage(type, true, DoNotAppendSpace);
}
string CodeGen_Metal_Dev::CodeGen_Metal_C::print_reinterpret(Type type, const Expr &e) {
ostringstream oss;
string temp = unique_name('V');
string expr = print_expr(e);
stream << get_indent() << print_type(e.type()) << " " << temp << " = " << expr << ";\n";
oss << "*(" << print_type(type) << " thread *)(&" << temp << ")";
return oss.str();
}
namespace {
string simt_intrinsic(const string &name) {
if (ends_with(name, ".__thread_id_x")) {
return "tid_in_tgroup.x";
} else if (ends_with(name, ".__thread_id_y")) {
return "tid_in_tgroup.y";
} else if (ends_with(name, ".__thread_id_z")) {
return "tid_in_tgroup.z";
} else if (ends_with(name, ".__thread_id_w")) {
user_error << "Metal does not support more than three dimensions in a kernel (threads).\n";
} else if (ends_with(name, ".__block_id_x")) {
return "tgroup_index.x";
} else if (ends_with(name, ".__block_id_y")) {
return "tgroup_index.y";
} else if (ends_with(name, ".__block_id_z")) {
return "tgroup_index.z";
} else if (ends_with(name, ".__block_id_w")) {
user_error << "Metal does not support more than three dimensions in a kernel (groups).\n";
}
internal_error << "simt_intrinsic called on bad variable name: " << name << "\n";
return "";
}
} // namespace
string CodeGen_Metal_Dev::CodeGen_Metal_C::print_extern_call(const Call *op) {
internal_assert(!function_takes_user_context(op->name));
vector<string> args(op->args.size());
for (size_t i = 0; i < op->args.size(); i++) {
args[i] = print_expr(op->args[i]);
}
ostringstream rhs;
rhs << op->name << "(" << with_commas(args) << ")";
return rhs.str();
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Max *op) {
print_expr(Call::make(op->type, "max", {op->a, op->b}, Call::Extern));
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Min *op) {
print_expr(Call::make(op->type, "min", {op->a, op->b}, Call::Extern));
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const VectorReduce *op) {
if (op->op == VectorReduce::Add && op->type.is_float() && (op->type.lanes() == 1)) {
if (const Mul *maybe_mul = op->value.as<Mul>()) {
string a = print_expr(maybe_mul->a);
string b = print_expr(maybe_mul->b);
ostringstream rhs;
rhs << "dot(" << a << ", " << b << ")";
print_assignment(op->type, rhs.str());
return;
}
}
CodeGen_GPU_C::visit(op);
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Div *op) {
int bits;
if (is_const_power_of_two_integer(op->b, &bits)) {
ostringstream oss;
oss << print_expr(op->a) << " >> " << bits;
print_assignment(op->type, oss.str());
} else if (op->type.is_int()) {
print_expr(lower_euclidean_div(op->a, op->b));
} else {
visit_binop(op->type, op->a, op->b, "/");
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Mod *op) {
int bits;
if (is_const_power_of_two_integer(op->b, &bits)) {
ostringstream oss;
oss << print_expr(op->a) << " & " << ((1 << bits) - 1);
print_assignment(op->type, oss.str());
} else if (op->type.is_int()) {
print_expr(lower_euclidean_mod(op->a, op->b));
} else {
visit_binop(op->type, op->a, op->b, "%");
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const For *loop) {
user_assert(loop->for_type != ForType::GPULane)
<< "The Metal backend does not support the gpu_lanes() scheduling directive.";
if (is_gpu_var(loop->name)) {
internal_assert((loop->for_type == ForType::GPUBlock) ||
(loop->for_type == ForType::GPUThread))
<< "kernel loop must be either gpu block or gpu thread\n";
internal_assert(is_const_zero(loop->min));
stream << get_indent() << print_type(Int(32)) << " " << print_name(loop->name)
<< " = " << simt_intrinsic(loop->name) << ";\n";
loop->body.accept(this);
} else {
user_assert(loop->for_type != ForType::Parallel) << "Cannot use parallel loops inside Metal kernel\n";
CodeGen_GPU_C::visit(loop);
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Ramp *op) {
string id_base = print_expr(op->base);
string id_stride = print_expr(op->stride);
ostringstream rhs;
rhs << id_base << " + " << id_stride << " * "
<< print_type(op->type.with_lanes(op->lanes)) << "(0";
// Note 0 written above.
for (int i = 1; i < op->lanes; ++i) {
rhs << ", " << i;
}
rhs << ")";
print_assignment(op->type.with_lanes(op->lanes), rhs.str());
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Broadcast *op) {
string id_value = print_expr(op->value);
ostringstream rhs;
rhs << print_type(op->type.with_lanes(op->lanes)) << "(" << id_value << ")";
print_assignment(op->type.with_lanes(op->lanes), rhs.str());
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Call *op) {
if (op->is_intrinsic(Call::gpu_thread_barrier)) {
internal_assert(op->args.size() == 1) << "gpu_thread_barrier() intrinsic must specify memory fence type.\n";
const auto *fence_type_ptr = as_const_int(op->args[0]);
internal_assert(fence_type_ptr) << "gpu_thread_barrier() parameter is not a constant integer.\n";
auto fence_type = *fence_type_ptr;
// This is quite annoying: even though the MSL docs claim these flags can be combined,
// Metal compilers prior to Metal 1.2 give compiler errors. So, we do not combine them,
// and rather use a preprocessor definition to do the right thing.
stream << get_indent() << "threadgroup_barrier(";
if (fence_type & CodeGen_GPU_Dev::MemoryFenceType::Device &&
fence_type & CodeGen_GPU_Dev::MemoryFenceType::Shared) {
stream << "_halide_mem_fence_device_and_threadgroup";
} else if (fence_type & CodeGen_GPU_Dev::MemoryFenceType::Device) {
stream << "mem_flags::mem_device";
} else if (fence_type & CodeGen_GPU_Dev::MemoryFenceType::Shared) {
stream << "mem_flags::mem_threadgroup";
} else {
stream << "mem_flags::mem_none";
}
stream << ");\n";
print_assignment(op->type, "0");
} else {
CodeGen_GPU_C::visit(op);
}
}
namespace {
// If e is a ramp expression with stride 1, return the base, otherwise undefined.
Expr is_ramp_one(const Expr &e) {
const Ramp *r = e.as<Ramp>();
if (r == nullptr) {
return Expr();
}
if (is_const_one(r->stride)) {
return r->base;
}
return Expr();
}
} // namespace
string CodeGen_Metal_Dev::CodeGen_Metal_C::get_memory_space(const string &buf) {
if (buf == shared_name) {
return "threadgroup";
} else {
return "__address_space_" + print_name(buf);
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Load *op) {
user_assert(is_const_one(op->predicate)) << "Predicated load is not supported inside Metal kernel.\n";
user_assert(op->type.lanes() <= 4) << "Vectorization by widths greater than 4 is not supported by Metal -- type is " << op->type << ".\n";
// If we're loading a contiguous ramp, load from a vector type pointer.
Expr ramp_base = is_ramp_one(op->index);
if (ramp_base.defined()) {
internal_assert(op->type.is_vector());
string id_ramp_base = print_expr(ramp_base);
ostringstream rhs;
rhs << "*(" << get_memory_space(op->name) << " " << print_storage_type(op->type) << " *)(("
<< get_memory_space(op->name) << " " << print_type(op->type.element_of()) << " *)" << print_name(op->name)
<< " + " << id_ramp_base << ")";
print_assignment(op->type, rhs.str());
return;
}
string id_index = print_expr(op->index);
// Get the rhs just for the cache.
bool type_cast_needed = !(allocations.contains(op->name) &&
allocations.get(op->name).type == op->type);
ostringstream rhs;
if (type_cast_needed) {
rhs << "((" << get_memory_space(op->name) << " "
<< print_storage_type(op->type) << " *)"
<< print_name(op->name)
<< ")";
} else {
rhs << print_name(op->name);
}
rhs << "[" << id_index << "]";
std::map<string, string>::iterator cached = cache.find(rhs.str());
if (cached != cache.end()) {
id = cached->second;
return;
}
if (op->index.type().is_vector()) {
// If index is a vector, gather vector elements.
internal_assert(op->type.is_vector());
// This has to be underscore as print_name prepends an underscore to
// names without one and that results in a name mismatch if a Load
// appears as the value of a Let
id = unique_name('_');
cache[rhs.str()] = id;
stream << get_indent() << print_type(op->type)
<< " " << id << ";\n";
for (int i = 0; i < op->type.lanes(); ++i) {
stream << get_indent();
stream
<< id << "[" << i << "]"
<< " = ((" << get_memory_space(op->name) << " "
<< print_type(op->type.element_of()) << "*)"
<< print_name(op->name) << ")"
<< "[" << id_index << "[" << i << "]];\n";
}
} else {
print_assignment(op->type, rhs.str());
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Store *op) {
user_assert(is_const_one(op->predicate)) << "Predicated store is not supported inside Metal kernel.\n";
user_assert(op->value.type().lanes() <= 4) << "Vectorization by widths greater than 4 is not supported by Metal -- type is " << op->value.type() << ".\n";
string id_value = print_expr(op->value);
Type t = op->value.type();
// If we're writing a contiguous ramp, store through a pointer of vector type.
Expr ramp_base = is_ramp_one(op->index);
if (ramp_base.defined()) {
internal_assert(op->value.type().is_vector());
string id_ramp_base = print_expr(ramp_base);
stream << get_indent() << "*(" << get_memory_space(op->name) << " " << print_storage_type(t) << " *)(("
<< get_memory_space(op->name) << " " << print_type(t.element_of()) << " *)" << print_name(op->name)
<< " + " << id_ramp_base << ") = " << id_value << ";\n";
} else if (op->index.type().is_vector()) {
// If index is a vector, scatter vector elements.
internal_assert(t.is_vector());
string id_index = print_expr(op->index);
for (int i = 0; i < t.lanes(); ++i) {
stream << get_indent() << "((" << get_memory_space(op->name) << " "
<< print_storage_type(t.element_of()) << " *)"
<< print_name(op->name)
<< ")["
<< id_index << "[" << i << "]] = "
<< id_value << "[" << i << "];\n";
}
} else {
bool type_cast_needed = !(allocations.contains(op->name) &&
allocations.get(op->name).type == t);
string id_index = print_expr(op->index);
string id_value = print_expr(op->value);
stream << get_indent();
if (type_cast_needed) {
stream << "(("
<< get_memory_space(op->name) << " "
<< print_storage_type(t)
<< " *)"
<< print_name(op->name)
<< ")";
} else {
stream << print_name(op->name);
}
stream << "[" << id_index << "] = "
<< id_value << ";\n";
}
cache.clear();
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Select *op) {
ostringstream rhs;
string true_val = print_expr(op->true_value);
string false_val = print_expr(op->false_value);
string cond = print_expr(op->condition);
rhs << "(" << print_type(op->type) << ")"
<< "select(" << false_val
<< ", " << true_val
<< ", " << cond
<< ")";
print_assignment(op->type, rhs.str());
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Allocate *op) {
if (op->memory_type == MemoryType::GPUShared) {
// Already handled
op->body.accept(this);
} else {
open_scope();
debug(2) << "Allocate " << op->name << " on device\n";
debug(3) << "Pushing allocation called " << op->name << " onto the symbol table\n";
// Allocation is not a shared memory allocation, just make a local declaration.
// It must have a constant size.
int32_t size = op->constant_allocation_size();
user_assert(size > 0)
<< "Allocation " << op->name << " has a dynamic size. "
<< "Only fixed-size allocations are supported on the gpu. "
<< "Try storing into shared memory instead.";
stream << get_indent() << print_storage_type(op->type) << " "
<< print_name(op->name) << "[" << size << "];\n";
stream << get_indent() << "#define " << get_memory_space(op->name) << " thread\n";
Allocation alloc;
alloc.type = op->type;
allocations.push(op->name, alloc);
op->body.accept(this);
// Should have been freed internally
internal_assert(!allocations.contains(op->name));
close_scope("alloc " + print_name(op->name));
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Free *op) {
if (op->name == shared_name) {
return;
} else {
// Should have been freed internally
internal_assert(allocations.contains(op->name));
allocations.pop(op->name);
stream << get_indent() << "#undef " << get_memory_space(op->name) << "\n";
}
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Cast *op) {
print_assignment(op->type, print_type(op->type) + "(" + print_expr(op->value) + ")");
}
void CodeGen_Metal_Dev::CodeGen_Metal_C::visit(const Atomic *op) {
// It might be possible to support atomic but this is not trivial.
// Metal requires atomic data types to be wrapped in an atomic integer data type.
user_assert(false) << "Atomic updates are not supported inside Metal kernels";
}
void CodeGen_Metal_Dev::add_kernel(Stmt s,
const string &name,
const vector<DeviceArgument> &args) {
debug(2) << "CodeGen_Metal_Dev::compile " << name << "\n";
// We need to scalarize/de-predicate any loads/stores, since Metal does not
// support predication.
s = scalarize_predicated_loads_stores(s);
debug(2) << "CodeGen_Metal_Dev: after removing predication: \n"
<< s;
// TODO: do we have to uniquify these names, or can we trust that they are safe?
cur_kernel_name = name;
metal_c.add_kernel(s, name, args);
}
namespace {
struct BufferSize {
string name;
size_t size = 0;
BufferSize() = default;
BufferSize(string name, size_t size)
: name(std::move(name)), size(size) {
}
bool operator<(const BufferSize &r) const {
return size < r.size;
}
};
} // namespace
void CodeGen_Metal_Dev::CodeGen_Metal_C::add_kernel(const Stmt &s,
const string &name,
const vector<DeviceArgument> &args) {
debug(2) << "Adding Metal kernel " << name << "\n";
// Figure out which arguments should be passed in constant.
// Such arguments should be:
// - not written to,
// - loads are block-uniform,
// - constant size,
// - and all allocations together should be less than the max constant
// buffer size given by CL_DEVICE_MAX_CONSTANT_BUFFER_SIZE.
// The last condition is handled via the preprocessor in the kernel
// declaration.
vector<BufferSize> constants;
for (const auto &arg : args) {
if (arg.is_buffer &&
CodeGen_GPU_Dev::is_buffer_constant(s, arg.name) &&
arg.size > 0) {
constants.emplace_back(arg.name, arg.size);
}
}
// Sort the constant candidates from smallest to largest. This will put
// as many of the constant allocations in constant as possible.
// Ideally, we would prioritize constant buffers by how frequently they
// are accessed.
sort(constants.begin(), constants.end());
// Compute the cumulative sum of the constants.
for (size_t i = 1; i < constants.size(); i++) {
constants[i].size += constants[i - 1].size;
}
// Create preprocessor replacements for the address spaces of all our buffers.
stream << "// Address spaces for " << name << "\n";
for (const auto &arg : args) {
if (arg.is_buffer) {
vector<BufferSize>::iterator constant = constants.begin();
while (constant != constants.end() &&
constant->name != arg.name) {
constant++;
}
if (constant != constants.end()) {
stream << "#if " << constant->size << " < MAX_CONSTANT_BUFFER_SIZE && "
<< constant - constants.begin() << " < MAX_CONSTANT_ARGS\n";
stream << "#define " << get_memory_space(arg.name) << " constant\n";
stream << "#else\n";
stream << "#define " << get_memory_space(arg.name) << " device\n";
stream << "#endif\n";
} else {
stream << "#define " << get_memory_space(arg.name) << " device\n";
}
}
}
// Emit a struct to hold the scalar args of the kernel
bool any_scalar_args = false;
for (const auto &arg : args) {
if (!arg.is_buffer) {
if (!any_scalar_args) {
stream << "struct " + name + "_args {\n";
any_scalar_args = true;
}
stream << print_type(arg.type)
<< " "
<< print_name(arg.name)
<< ";\n";
}
}
if (any_scalar_args) {
stream << "};\n";
}
// Emit the function prototype
stream << "kernel void " << name << "(\n";
stream << "uint3 tgroup_index [[ threadgroup_position_in_grid ]],\n"
<< "uint3 tid_in_tgroup [[ thread_position_in_threadgroup ]]";
size_t buffer_index = 0;
if (any_scalar_args) {
stream << ",\nconst device " << name << "_args *_scalar_args [[ buffer(0) ]]";
buffer_index++;
}
for (const auto &arg : args) {
if (arg.is_buffer) {
stream << ",\n";
stream << " " << get_memory_space(arg.name) << " ";
if (!arg.write) {
stream << "const ";
}
stream << print_storage_type(arg.type) << " *"
<< print_name(arg.name) << " [[ buffer(" << buffer_index++ << ") ]]";
Allocation alloc;
alloc.type = arg.type;
allocations.push(arg.name, alloc);
}
}
class FindShared : public IRVisitor {
using IRVisitor::visit;
void visit(const Allocate *op) override {
if (op->memory_type == MemoryType::GPUShared) {
internal_assert(alloc == nullptr)
<< "Found multiple shared allocations in metal kernel\n";
alloc = op;
}
}
public:
const Allocate *alloc = nullptr;
} find_shared;
s.accept(&find_shared);
if (find_shared.alloc) {
shared_name = find_shared.alloc->name;
} else {
shared_name = "__shared";
}
// Note that int4 below is an int32x4, not an int4_t. The type
// is chosen to be large to maximize alignment.
stream << ",\n"
<< " threadgroup int4* "
<< print_name(shared_name) << " [[ threadgroup(0) ]]"
<< ")\n";
open_scope();
// Unpack args struct into local variables to match naming of generated code.
for (const auto &arg : args) {
if (!arg.is_buffer) {
stream << print_type(arg.type)
<< " "
<< print_name(arg.name)
<< " = _scalar_args->" << print_name(arg.name)
<< ";\n";
}
}
print(s);
close_scope("kernel " + name);
for (const auto &arg : args) {
// Remove buffer arguments from allocation scope
if (arg.is_buffer) {
allocations.pop(arg.name);
}
}
// Undef all the buffer address spaces, in case they're different in another kernel.
for (const auto &arg : args) {
if (arg.is_buffer) {
stream << "#undef " << get_memory_space(arg.name) << "\n";
}
}
}
void CodeGen_Metal_Dev::init_module() {
debug(2) << "Metal device codegen init_module\n";
// wipe the internal kernel source
src_stream.str("");
src_stream.clear();
// Write out the Halide math functions.
src_stream << "#pragma clang diagnostic ignored \"-Wunused-function\"\n"
<< "#include <metal_stdlib>\n"
<< "using namespace metal;\n" // Seems like the right way to go.
<< "namespace {\n"
<< "constexpr float float_from_bits(unsigned int x) {return as_type<float>(x);}\n"
<< "constexpr float nan_f32() { return as_type<float>(0x7fc00000); }\n" // Quiet NaN with minimum fractional value.
<< "constexpr float neg_inf_f32() { return float_from_bits(0xff800000); }\n"
<< "constexpr float inf_f32() { return float_from_bits(0x7f800000); }\n"
<< "float fast_inverse_f32(float x) { return 1.0f / x; }\n"
<< "#define is_nan_f32 isnan\n"
<< "#define is_inf_f32 isinf\n"
<< "#define is_finite_f32 isfinite\n"
<< "#define sqrt_f32 sqrt\n"
<< "#define sin_f32 sin\n"
<< "#define cos_f32 cos\n"
<< "#define exp_f32 exp\n"
<< "#define log_f32 log\n"
<< "#define abs_f32 fabs\n"
<< "#define floor_f32 floor\n"
<< "#define ceil_f32 ceil\n"
<< "#define trunc_f32 trunc\n"
<< "#define pow_f32 pow\n"
<< "#define asin_f32 asin\n"
<< "#define acos_f32 acos\n"
<< "#define tan_f32 tan\n"
<< "#define atan_f32 atan\n"
<< "#define atan2_f32 atan2\n"
<< "#define sinh_f32 sinh\n"
<< "#define asinh_f32 asinh\n"
<< "#define cosh_f32 cosh\n"
<< "#define acosh_f32 acosh\n"
<< "#define tanh_f32 tanh\n"
<< "#define atanh_f32 atanh\n"
<< "#define fast_inverse_sqrt_f32 rsqrt\n"
// This is quite annoying: even though the MSL docs claim
// all versions of Metal support the same memory fence
// names, the truth is that 1.0 does not.
<< "#if __METAL_VERSION__ >= 120\n"
<< "#define _halide_mem_fence_device_and_threadgroup (mem_flags::mem_device | mem_flags::mem_threadgroup)\n"
<< "#else\n"
<< "#define _halide_mem_fence_device_and_threadgroup mem_flags::mem_device_and_threadgroup\n"
<< "#endif\n"
<< "}\n"; // close namespace
src_stream << "#define halide_maybe_unused(x) (void)(x)\n";
src_stream << "\n";
cur_kernel_name = "";
}
vector<char> CodeGen_Metal_Dev::compile_to_src() {
string str = src_stream.str();
debug(1) << "Metal kernel:\n"
<< str << "\n";
vector<char> buffer(str.begin(), str.end());
buffer.push_back(0);
return buffer;
}
string CodeGen_Metal_Dev::get_current_kernel_name() {
return cur_kernel_name;
}
void CodeGen_Metal_Dev::dump() {
std::cerr << src_stream.str() << "\n";
}
std::string CodeGen_Metal_Dev::print_gpu_name(const std::string &name) {
return name;
}
} // namespace
std::unique_ptr<CodeGen_GPU_Dev> new_CodeGen_Metal_Dev(const Target &target) {
return std::make_unique<CodeGen_Metal_Dev>(target);
}
} // namespace Internal
} // namespace Halide
Loading...
举报
举报成功
我们将于2个工作日内通过站内信反馈结果给你!
请认真填写举报原因,尽可能描述详细。
请选择举报类型
取消
发送
误判申诉

此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。

如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。

取消
提交

简介

MIT计算机科学和人工智能实验室的研究人员创造出一种专门设计简化图像处理的程序语言Halide,源代码托管在GitHub上,目前二进制程序只支持Mac OS X和Ubuntu 12
取消

发行版

暂无发行版

贡献者

全部

近期动态

不能加载更多了
编辑仓库简介
简介内容
主页
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C/C++
1
https://gitee.com/VisionDeveloper/Halide.git
git@gitee.com:VisionDeveloper/Halide.git
VisionDeveloper
Halide
Halide
main
点此查找更多帮助

搜索帮助

评论
仓库举报
回到顶部
登录提示
该操作需登录 Gitee 帐号,请先登录后再操作。
立即登录
没有帐号,去注册

AltStyle によって変換されたページ (->オリジナル) /