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
|
// Base class for passes that generate work-group functions out of a bunch
// of work-items.
//
// Copyright (c) 2011-2012 Carlos Sánchez de La Lama / URJC and
// 2012-2019 Pekka Jääskeläinen
// 2023-2024 Pekka Jääskeläinen / Intel Finland Oy
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#include "CompilerWarnings.h"
IGNORE_COMPILER_WARNING("-Wmaybe-uninitialized")
#include <llvm/ADT/Twine.h>
POP_COMPILER_DIAGS
IGNORE_COMPILER_WARNING("-Wunused-parameter")
#include <llvm/IR/Constants.h>
#include <llvm/IR/DIBuilder.h>
#include <llvm/IR/IRBuilder.h>
#include <llvm/IR/Instructions.h>
#include <llvm/IR/Metadata.h>
#include <llvm/IR/Module.h>
#include <llvm/IR/ValueSymbolTable.h>
#include <llvm/Support/CommandLine.h>
#include "DebugHelpers.h"
#include "Kernel.h"
#include "KernelCompilerUtils.h"
#include "LLVMUtils.h"
#include "WorkitemHandler.h"
POP_COMPILER_DIAGS
#include "pocl_llvm_api.h"
#include <iostream>
#include <sstream>
POP_COMPILER_DIAGS
namespace pocl {
using namespace llvm;
// Compiler-expanded function that can be used to allocate "local memory"
// dynamically in the work-group function. Used by SG/WG shuffle implementations
// as temporary storage.
constexpr const char *POCL_LOCAL_MEM_ALLOCA_FUNC_NAME =
"__pocl_local_mem_alloca";
// Another which multiplies the given size by the number of WIs in the WG.
constexpr const char *POCL_WORK_GROUP_ALLOCA_FUNC_NAME =
"__pocl_work_group_alloca";
/// Start processing a new kernel.
///
/// Should be invoked from the work-item handlers to initialize the internal
/// per-kernel data.
void WorkitemHandler::Initialize(Kernel *K_) {
K = K_;
M = K->getParent();
LocalMemAllocaFuncDecl =
K->getParent()->getFunction(POCL_LOCAL_MEM_ALLOCA_FUNC_NAME);
WorkGroupAllocaFuncDecl =
K->getParent()->getFunction(POCL_WORK_GROUP_ALLOCA_FUNC_NAME);
WGSizeInstr = nullptr;
getModuleIntMetadata(*M, "device_address_bits", AddressBits);
getModuleStringMetadata(*M, "KernelName", KernelName);
getModuleIntMetadata(*M, "WGMaxGridDimWidth", WGMaxGridDimWidth);
getModuleIntMetadata(*M, "WGLocalSizeX", WGLocalSizeX);
getModuleIntMetadata(*M, "WGLocalSizeY", WGLocalSizeY);
getModuleIntMetadata(*M, "WGLocalSizeZ", WGLocalSizeZ);
getModuleBoolMetadata(*M, "WGDynamicLocalSize", WGDynamicLocalSize);
getModuleBoolMetadata(*M, "WGAssumeZeroGlobalOffset",
WGAssumeZeroGlobalOffset);
if (WGLocalSizeX == 0)
WGLocalSizeX = 1;
if (WGLocalSizeY == 0)
WGLocalSizeY = 1;
if (WGLocalSizeZ == 0)
WGLocalSizeZ = 1;
SizeTWidth = AddressBits;
ST = pocl::SizeT(M);
LocalIdGlobals = {M->getOrInsertGlobal(LID_G_NAME(0), ST),
M->getOrInsertGlobal(LID_G_NAME(1), ST),
M->getOrInsertGlobal(LID_G_NAME(2), ST)};
LocalSizeGlobals = {M->getOrInsertGlobal(LS_G_NAME(0), ST),
M->getOrInsertGlobal(LS_G_NAME(1), ST),
M->getOrInsertGlobal(LS_G_NAME(2), ST)};
GlobalIdGlobals = {M->getOrInsertGlobal(GID_G_NAME(0), ST),
M->getOrInsertGlobal(GID_G_NAME(1), ST),
M->getOrInsertGlobal(GID_G_NAME(2), ST)};
GroupIdGlobals = {M->getOrInsertGlobal(GROUP_ID_G_NAME(0), ST),
M->getOrInsertGlobal(GROUP_ID_G_NAME(1), ST),
M->getOrInsertGlobal(GROUP_ID_G_NAME(2), ST)};
NumGroupsGlobals = {M->getOrInsertGlobal(NGROUPS_G_NAME(0), ST),
M->getOrInsertGlobal(NGROUPS_G_NAME(1), ST),
M->getOrInsertGlobal(NGROUPS_G_NAME(2), ST)};
GlobalIdOrigins = {0, 0, 0};
GlobalSizes = {0, 0, 0};
}
bool WorkitemHandler::dominatesUse(llvm::DominatorTree &DT, Instruction &Inst,
unsigned OpNum) {
Instruction *Op = cast<Instruction>(Inst.getOperand(OpNum));
BasicBlock *OpBlock = Op->getParent();
PHINode *PN = dyn_cast<PHINode>(&Inst);
// DT can handle non phi instructions for us.
if (!PN)
{
// Definition must dominate use unless use is unreachable!
return Op->getParent() == Inst.getParent() || DT.dominates(Op, &Inst);
}
// PHI nodes are more difficult than other nodes because they actually
// "use" the value in the predecessor basic blocks they correspond to.
unsigned Val = PHINode::getIncomingValueNumForOperand(OpNum);
BasicBlock *PredBB = PN->getIncomingBlock(Val);
return (PredBB && DT.dominates(OpBlock, PredBB));
}
/* Fixes the undominated variable uses.
These appear when a conditional barrier kernel is replicated to
form a copy of the *same basic block* in the alternative
"barrier path".
E.g., from
A -> [exit], A -> B -> [exit]
a replicated CFG as follows, is created:
A1 -> (T) A2 -> [exit1], A1 -> (F) A2' -> B1, B2 -> [exit2]
The regions are correct because of the barrier semantics
of "all or none". In case any barrier enters the [exit1]
from A1, all must (because there's a barrier in the else
branch).
Here at A2 and A2' one creates the same variables.
However, B2 does not know which copy
to refer to, the ones created in A2 or ones in A2' (correct).
The mapping data contains only one possibility, the
one that was placed there last. Thus, the instructions in B2
might end up referring to the variables defined in A2
which do not nominate them.
The variable references are fixed by exploiting the knowledge
of the naming convention of the cloned variables.
One potential alternative way would be to collect the refmaps per BB,
not globally. Then as a final phase traverse through the
basic blocks starting from the beginning and propagating the
reference data downwards, the data from the new BB overwriting
the old one. This should ensure the reachability without
the costly dominance analysis.
*/
bool WorkitemHandler::fixUndominatedVariableUses(llvm::DominatorTree &DT,
llvm::Function &F) {
bool changed = false;
DT.reset();
DT.recalculate(F);
for (Function::iterator i = F.begin(), e = F.end(); i != e; ++i)
{
llvm::BasicBlock *bb = &*i;
for (llvm::BasicBlock::iterator ins = bb->begin(), inse = bb->end();
ins != inse; ++ins)
{
for (unsigned opr = 0; opr < ins->getNumOperands(); ++opr)
{
if (!isa<Instruction>(ins->getOperand(opr))) continue;
Instruction *operand = cast<Instruction>(ins->getOperand(opr));
if (dominatesUse(DT, *ins, opr))
continue;
#ifdef DEBUG_REFERENCE_FIXING
std::cout << "### dominance error!" << std::endl;
operand->dump();
std::cout << "### does not dominate:" << std::endl;
ins->dump();
#endif
StringRef baseName;
std::pair< StringRef, StringRef > pieces =
operand->getName().rsplit('.');
if (pieces.second.starts_with("pocl_"))
baseName = pieces.first;
else
baseName = operand->getName();
Value *alternative = NULL;
unsigned int copy_i = 0;
do {
std::ostringstream alternativeName;
alternativeName << baseName.str();
if (copy_i > 0)
alternativeName << ".pocl_" << copy_i;
alternative =
F.getValueSymbolTable()->lookup(alternativeName.str());
if (alternative != NULL)
{
ins->setOperand(opr, alternative);
if (dominatesUse(DT, *ins, opr))
break;
}
if (copy_i > 10000 && alternative == NULL)
break; /* ran out of possibilities */
++copy_i;
} while (true);
if (alternative != NULL) {
#ifdef DEBUG_REFERENCE_FIXING
std::cout << "### found the alternative:" << std::endl;
alternative->dump();
#endif
changed |= true;
} else {
#ifdef DEBUG_REFERENCE_FIXING
std::cout << "### didn't find an alternative for" << std::endl;
operand->dump();
std::cerr << "### BB:" << std::endl;
operand->getParent()->dump();
std::cerr << "### the user BB:" << std::endl;
ins->getParent()->dump();
#endif
std::cerr << "Could not find a dominating alternative variable." << std::endl;
dumpCFG(F, "broken.dot");
abort();
}
}
}
}
return changed;
}
/**
* Moves the phi nodes in the beginning of the src to the beginning of
* the dst.
*
* MergeBlockIntoPredecessor function from llvm discards the phi nodes
* of the replicated BB because it has only one entry.
*/
void
WorkitemHandler::movePhiNodes(llvm::BasicBlock* Src, llvm::BasicBlock* Dst) {
while (PHINode *PN = dyn_cast<PHINode>(Src->begin()))
#if LLVM_MAJOR < 20
PN->moveBefore(Dst->getFirstNonPHI());
#else
PN->moveBefore(Dst->getFirstNonPHIIt());
#endif
}
/// Returns the instruction in the entry block which computes the global
/// size for the given \param Dim.
llvm::Instruction *WorkitemHandler::getGlobalSize(int Dim) {
llvm::Instruction *GSize = GlobalSizes[Dim];
if (GSize != nullptr)
return GSize;
GlobalVariable *LocalSize = cast<GlobalVariable>(LocalSizeGlobals[Dim]);
GlobalVariable *GroupCount = cast<GlobalVariable>(M->getOrInsertGlobal(
std::string("_num_groups_") + (char)('x' + Dim), ST));
CreateBuilder(Builder, K->getEntryBlock());
GSize = cast<llvm::Instruction>(
Builder.CreateBinOp(Instruction::Mul, Builder.CreateLoad(ST, LocalSize),
Builder.CreateLoad(ST, GroupCount),
std::string("_global_size_") + (char)('x' + Dim)));
GlobalSizes[Dim] = GSize;
return GSize;
}
/// Returns the instruction in the entry block which computes the "base" for
/// the global id which has all components except the local id offset included.
llvm::Instruction *WorkitemHandler::getGlobalIdOrigin(int Dim) {
llvm::Instruction *Origin = GlobalIdOrigins[Dim];
if (Origin != nullptr)
return Origin;
GlobalVariable *LocalSize = cast<GlobalVariable>(M->getOrInsertGlobal(
std::string("_local_size_") + (char)('x' + Dim), ST));
GlobalVariable *GlobalOffset = cast<GlobalVariable>(M->getOrInsertGlobal(
std::string("_global_offset_") + (char)('x' + Dim), ST));
GlobalVariable *GroupId = cast<GlobalVariable>(
M->getOrInsertGlobal(std::string("_group_id_") + (char)('x' + Dim), ST));
assert(LocalSize != nullptr);
assert(GlobalOffset != nullptr);
assert(GroupId != nullptr);
CreateBuilder(Builder, K->getEntryBlock());
Origin = cast<llvm::Instruction>(
Builder.CreateBinOp(Instruction::Mul, Builder.CreateLoad(ST, LocalSize),
Builder.CreateLoad(ST, GroupId)));
Origin = cast<llvm::Instruction>(Builder.CreateBinOp(
Instruction::Add, Builder.CreateLoad(ST, GlobalOffset), Origin));
GlobalIdOrigins[Dim] = Origin;
llvm::GlobalVariable *GlobalId =
cast<GlobalVariable>(M->getOrInsertGlobal(GID_G_NAME(Dim), ST));
// Initialize the global id to the first value just in case we won't create
// a loop for a 1-sized dimensions which would create the monotonically
// incrementing GID.
Builder.CreateStore(Origin, GlobalId);
return Origin;
}
/**
* Scans for usages of global id and replaces with global_id_base + local_id.
*
* This should be called for WorkitemHandlers that do not produce the global
* id within the handler like WILoops does.
*/
void WorkitemHandler::GenerateGlobalIdComputation() {
for (Function::iterator FI = K->begin(), FE = K->end(); FI != FE; ++FI) {
for (BasicBlock::iterator II = FI->begin(), IE = FI->end(); II != IE;) {
llvm::LoadInst *GIdLoad = dyn_cast<llvm::LoadInst>(II);
++II;
if (GIdLoad == NULL)
continue;
for (int Dim = 0; Dim < 3; ++Dim) {
GlobalVariable *GlobalId = M->getGlobalVariable(GID_G_NAME(Dim));
if (GIdLoad->getOperand(0) != GlobalId) {
continue;
}
IRBuilder<> FBuilder(GIdLoad);
Instruction *LocalId =
FBuilder.CreateLoad(ST, M->getGlobalVariable(LID_G_NAME(Dim)));
Instruction *GlobalIdOrigin = getGlobalIdOrigin(Dim);
Instruction *GidStore = FBuilder.CreateStore(
FBuilder.CreateAdd(GlobalIdOrigin, LocalId), GlobalId);
break;
}
}
}
}
// this must be at least the alignment of largest OpenCL type (= 128 bytes)
#define CONTEXT_ARRAY_ALIGN MAX_EXTENDED_ALIGNMENT
/// Creates a well aligned and padded context array for the given value.
///
/// This is not entirely trivial to get right since we want to align the
/// innermost dimension with natural alignment in order to enable vectorized
/// accesses to intra-kernel arrays from the different work-items.
/// In the case of unaligned kernel arrays we have to add padding to make
/// each WI's array nicely aligned.
///
/// \param Instr the original per work-item instruction.
/// \param Before the instruction before which to create the alloca.
/// \param Name for the context array.
/// \param PaddingAdded set to true in case padding was added to align the
/// arrayified object.
llvm::AllocaInst *WorkitemHandler::createAlignedAndPaddedContextAlloca(
llvm::Instruction *Inst, llvm::Instruction *Before, const std::string &Name,
bool &PaddingAdded) {
PaddingAdded = false;
BasicBlock &BB = Inst->getParent()->getParent()->getEntryBlock();
IRBuilder<> Builder(Before);
Function *FF = Inst->getParent()->getParent();
Module *M = Inst->getParent()->getParent()->getParent();
const llvm::DataLayout &Layout = M->getDataLayout();
DICompileUnit *CU = nullptr;
std::unique_ptr<DIBuilder> DB;
if (M->debug_compile_units_begin() != M->debug_compile_units_end()) {
CU = *M->debug_compile_units_begin();
DB = std::unique_ptr<DIBuilder>{new DIBuilder(*M, true, CU)};
}
// find the original debug metadata corresponding to the variable
Value *DebugVal = nullptr;
IntrinsicInst *DebugCall = nullptr;
if (CU != nullptr) {
for (BasicBlock &BB : (*FF)) {
for (Instruction &I : BB) {
IntrinsicInst *CI = dyn_cast<IntrinsicInst>(&I);
if (CI && (CI->getIntrinsicID() == llvm::Intrinsic::dbg_declare)) {
Metadata *Meta =
cast<MetadataAsValue>(CI->getOperand(0))->getMetadata();
if (isa<ValueAsMetadata>(Meta)) {
Value *V = cast<ValueAsMetadata>(Meta)->getValue();
if (Inst == V) {
DebugVal = V;
DebugCall = CI;
break;
}
}
}
}
}
}
#ifdef DEBUG_DEBUG_DATA_GENERATION
if (DebugVal && DebugCall) {
std::cerr << "### DI INTRIN: \n";
DebugCall->dump();
std::cerr << "### DI VALUE: \n";
DebugVal->dump();
}
#endif
llvm::Type *ElementType = nullptr;
Type *AllocType = nullptr;
if (AllocaInst *SrcAlloca = dyn_cast<AllocaInst>(Inst)) {
// If the variable to be context saved was itself an alloca, create one
// big alloca that stores the data of all the work-items and directly
// return pointers to that array. This enables moving all the allocas to
// the entry node without breaking the parallel loop. Otherwise we would
// need to rely on a dynamic alloca to allocate unique stack space to all
// the work-items when its wiloop iteration is executed.
ElementType = SrcAlloca->getAllocatedType();
AllocType = ElementType;
uint64_t Alignment = SrcAlloca->getAlign().value();
uint64_t StoreSize = Layout.getTypeStoreSize(SrcAlloca->getAllocatedType());
if ((Alignment > 1) && (StoreSize & (Alignment - 1))) {
uint64_t AlignedSize = (StoreSize & (~(Alignment - 1))) + Alignment;
#ifdef DEBUG_WORK_ITEM_LOOPS
std::cerr << "### unaligned type found: padding " << StoreSize << " to "
<< AlignedSize << "\n";
#endif
assert(AlignedSize > StoreSize);
uint64_t RequiredExtraBytes = AlignedSize - StoreSize;
// n-dim context array: In case the elementType itself is an array or
// a struct, we must take into account it could be alloca-ed with
// alignment and loads or stores might use vectorized instructions
// expecting proper alignment.
// Because of that, we cannot simply allocate x*y*z*(size), but must
// pad the inner row to ensure the alignment to the next element.
if (isa<ArrayType>(ElementType)) {
ArrayType *StructPadding = ArrayType::get(
Type::getInt8Ty(M->getContext()), RequiredExtraBytes);
std::vector<Type *> PaddedStructElements;
PaddedStructElements.push_back(ElementType);
PaddedStructElements.push_back(StructPadding);
const ArrayRef<Type *> NewStructElements(PaddedStructElements);
AllocType = StructType::get(M->getContext(), NewStructElements, true);
PaddingAdded = true;
uint64_t NewStoreSize = Layout.getTypeStoreSize(AllocType);
assert(NewStoreSize == AlignedSize);
} else if (isa<StructType>(ElementType)) {
StructType *OldStruct = dyn_cast<StructType>(ElementType);
ArrayType *StructPadding = ArrayType::get(
Type::getInt8Ty(M->getContext()), RequiredExtraBytes);
std::vector<Type *> PaddedStructElements;
for (size_t j = 0; j < OldStruct->getNumElements(); j++)
PaddedStructElements.push_back(OldStruct->getElementType(j));
PaddedStructElements.push_back(StructPadding);
PaddingAdded = true;
const ArrayRef<Type *> NewStructElements(PaddedStructElements);
AllocType = StructType::get(OldStruct->getContext(), NewStructElements,
OldStruct->isPacked());
uint64_t NewStoreSize = Layout.getTypeStoreSize(AllocType);
assert(NewStoreSize == AlignedSize);
}
}
} else {
ElementType = Inst->getType();
AllocType = ElementType;
}
llvm::AllocaInst *Alloca = nullptr;
if (WGDynamicLocalSize) {
GlobalVariable *LocalSize;
LoadInst *LocalSizeLoad[3];
for (int i = 0; i < 3; ++i) {
std::string Name = LS_G_NAME(i);
LocalSize = cast<GlobalVariable>(M->getOrInsertGlobal(Name, ST));
LocalSizeLoad[i] = Builder.CreateLoad(ST, LocalSize);
}
Value *LocalXTimesY = Builder.CreateBinOp(
Instruction::Mul, LocalSizeLoad[0], LocalSizeLoad[1], "tmp");
Value *NumberOfWorkItems = Builder.CreateBinOp(
Instruction::Mul, LocalXTimesY, LocalSizeLoad[2], "num_wi");
Alloca = Builder.CreateAlloca(AllocType, NumberOfWorkItems, Name);
} else {
llvm::Type *ContextArrayType = ArrayType::get(
ArrayType::get(ArrayType::get(AllocType, WGLocalSizeX), WGLocalSizeY),
WGLocalSizeZ);
Alloca = Builder.CreateAlloca(ContextArrayType, nullptr, Name);
}
// Generously align the context arrays to enable wide vector accesses to them.
// Also at least LLVM 3.3 produced illegal code at least for a Core i5 when
// aligned only at the element size.
Alloca->setAlignment(llvm::Align(CONTEXT_ARRAY_ALIGN));
if (DebugVal && DebugCall && !WGDynamicLocalSize) {
llvm::SmallVector<llvm::Metadata *, 4> Subscripts;
Subscripts.push_back(DB->getOrCreateSubrange(0, WGLocalSizeZ));
Subscripts.push_back(DB->getOrCreateSubrange(0, WGLocalSizeY));
Subscripts.push_back(DB->getOrCreateSubrange(0, WGLocalSizeX));
llvm::DINodeArray SubscriptArray = DB->getOrCreateArray(Subscripts);
size_t SizeBits;
SizeBits = Alloca
->getAllocationSizeInBits(M->getDataLayout())
.value_or(TypeSize(0, false))
.getFixedValue();
assert(SizeBits != 0);
// if (size == 0) WGLocalSizeX * WGLocalSizeY * WGLocalSizeZ * 8 *
// Alloca->getAllocatedType()->getScalarSizeInBits();
size_t AlignBits = Alloca->getAlign().value() * 8;
Metadata *VariableDebugMeta =
cast<MetadataAsValue>(DebugCall->getOperand(1))->getMetadata();
#ifdef DEBUG_WORK_ITEM_LOOPS
std::cerr << "### VariableDebugMeta : ";
VariableDebugMeta->dump();
std::cerr << "### sizeBits : " << SizeBits << " alignBits: " << AlignBits
<< "\n";
#endif
DILocalVariable *LocalVar = dyn_cast<DILocalVariable>(VariableDebugMeta);
assert(LocalVar);
if (LocalVar) {
DICompositeType *CT = DB->createArrayType(
SizeBits, AlignBits, LocalVar->getType(), SubscriptArray);
#ifdef DEBUG_WORK_ITEM_LOOPS
std::cerr << "### DICompositeType:\n";
CT->dump();
#endif
DILocalVariable *NewLocalVar = DB->createAutoVariable(
LocalVar->getScope(), LocalVar->getName(), LocalVar->getFile(),
LocalVar->getLine(), CT, false, LocalVar->getFlags());
Metadata *NewMeta = ValueAsMetadata::get(Alloca);
DebugCall->setOperand(0, MetadataAsValue::get(M->getContext(), NewMeta));
MetadataAsValue *NewLV =
MetadataAsValue::get(M->getContext(), NewLocalVar);
DebugCall->setOperand(1, NewLV);
DebugCall->removeFromParent();
DebugCall->insertAfter(Alloca);
}
}
return Alloca;
}
/// Creates a GEP to a context array in the currently handled parallel region.
///
/// \param CtxArrayAlloca the context array alloca to address.
/// \param Before the instruction in the parallel region to insert the GEP
/// before.
/// \param AlignPading If this is set to true, the CArrayAlloca's innermost
/// dimension has the alignment padding which should be taken in account in
/// addressing the array.
llvm::GetElementPtrInst *
WorkitemHandler::createContextArrayGEP(llvm::AllocaInst *CtxArrayAlloca,
llvm::Instruction *Before,
bool AlignPadding) {
std::vector<llvm::Value *> GEPArgs;
if (WGDynamicLocalSize) {
GEPArgs.push_back(getLinearWIIndexInRegion(Before));
} else {
GEPArgs.push_back(ConstantInt::get(ST, 0));
GEPArgs.push_back(getLocalIdInRegion(Before, 2));
GEPArgs.push_back(getLocalIdInRegion(Before, 1));
GEPArgs.push_back(getLocalIdInRegion(Before, 0));
}
if (AlignPadding)
GEPArgs.push_back(
ConstantInt::get(Type::getInt32Ty(CtxArrayAlloca->getContext()), 0));
IRBuilder<> Builder(Before);
llvm::GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Builder.CreateGEP(
CtxArrayAlloca->getAllocatedType(), CtxArrayAlloca, GEPArgs));
assert(GEP != nullptr);
return GEP;
}
/// Checks if it's OK to mark the work-item loops in the currently processed
/// kernel as parallel loops.
///
/// Currently the only known reason to not mark them is to workaround a VPlan
/// crash that occurs with volatile memory accesses inside the parallel
/// WI-loops. Thus, we return false only in case of using LLVM 17+,
/// where the issue is producible, and if the loop contains volatile accesses.
/// The PoCL issue: https://github.com/pocl/pocl/issues/1556
///
/// We could make this Loop/PRegion-specific, but it seems not worth the effort
/// at this point as WorkitemLoops doesn't have a ready loop at hand when it
/// needs to annotate it, and luckily volatile usage is not common and ruins
/// the perf anyhow.
///
/// \return False in case we should _not_ add the parallel loop metadata,
/// even though the loop is known to be parallel.
bool WorkitemHandler::canAnnotateParallelLoops() {
for (auto &BB : *K) {
for (auto &I : BB) {
if (I.isVolatile())
return false;
}
}
return true;
}
/// Returns the instruction in the entry block of the currently handled kernel
/// which computes the total size of work-items in the work-group.
///
/// If it doesn't exist, creates and adds it to the end of the entry block.
llvm::Instruction *WorkitemHandler::getWorkGroupSizeInstr() {
if (WGSizeInstr != nullptr)
return WGSizeInstr;
IRBuilder<> Builder(K->getEntryBlock().getTerminator());
llvm::Module *M = K->getParent();
GlobalVariable *GV = M->getGlobalVariable("_local_size_x");
if (GV != NULL) {
WGSizeInstr = Builder.CreateLoad(ST, GV);
}
GV = M->getGlobalVariable("_local_size_y");
if (GV != NULL) {
WGSizeInstr = cast<llvm::Instruction>(Builder.CreateBinOp(
Instruction::Mul, Builder.CreateLoad(ST, GV), WGSizeInstr));
}
GV = M->getGlobalVariable("_local_size_z");
if (GV != NULL) {
WGSizeInstr = cast<llvm::Instruction>(Builder.CreateBinOp(
Instruction::Mul, Builder.CreateLoad(ST, GV), WGSizeInstr));
}
return WGSizeInstr;
}
/// Converts calls to the __pocl_{work_group,local_mem}_alloca() pseudo
/// functions to allocas in the current kernel.
///
/// These compiler-expanded functions are used to allocate temporary
/// storage for subgroup implementation. Search for their usage in the
/// bitcode library for examples.
bool WorkitemHandler::handleLocalMemAllocas() {
std::vector<CallInst *> InstructionsToFix;
for (BasicBlock &BB : *K) {
for (Instruction &I : BB) {
if (!isa<CallInst>(I))
continue;
CallInst &Call = cast<CallInst>(I);
if (Call.getCalledFunction() == nullptr ||
(Call.getCalledFunction() != LocalMemAllocaFuncDecl &&
Call.getCalledFunction() != WorkGroupAllocaFuncDecl))
continue;
InstructionsToFix.push_back(&Call);
}
}
bool Changed = false;
for (CallInst *Call : InstructionsToFix) {
Value *Size = Call->getArgOperand(0);
Align Alignment =
cast<ConstantInt>(Call->getArgOperand(1))->getAlignValue();
Value *ExtraSize = Call->getArgOperand(2);
IRBuilder<> Builder(K->getEntryBlock().getTerminator());
if (Call->getCalledFunction() == WorkGroupAllocaFuncDecl) {
Instruction *WGSize = getWorkGroupSizeInstr();
Size = Builder.CreateBinOp(Instruction::Mul, WGSize, Size);
Size = Builder.CreateBinOp(Instruction::Add, Size, ExtraSize);
}
AllocaInst *Alloca = new AllocaInst(
llvm::Type::getInt8Ty(Call->getContext()), 0, Size, Alignment,
"__pocl_wg_alloca", Inst2InsertPt(K->getEntryBlock().getTerminator()));
Call->replaceAllUsesWith(Alloca);
Call->eraseFromParent();
Changed = true;
}
return Changed;
}
/// Converts some of the work-item function calls to loads from the pseudo
/// variables or precomputed values from within the kernel function.
///
/// Currently handles get_global_size(), get_local_id(), get_global_id() and
/// get_group_id() calls. Expands the calls next to their users for easier
/// analysis.
void WorkitemHandler::handleWorkitemFunctions() {
std::set<llvm::Instruction *> InstrsToDelete;
for (Function::iterator BBI = K->begin(), BBE = K->end(); BBI != BBE; ++BBI) {
llvm::BasicBlock &BB = *BBI;
for (llvm::BasicBlock::iterator II = BB.begin(); II != BB.end(); ++II) {
llvm::Instruction *Instr = &*II;
llvm::CallInst *Call = dyn_cast<llvm::CallInst>(Instr);
if (Call == nullptr)
continue;
if (isCompilerExpandableWIFunctionCall(*Call)) {
auto Callee = Call->getCalledFunction();
int Dim =
cast<llvm::ConstantInt>(Call->getArgOperand(0))->getZExtValue();
for (Instruction::use_iterator UI = Call->use_begin(),
UE = Call->use_end();
UI != UE;) {
llvm::Instruction *User = cast<Instruction>(UI->getUser());
llvm::Instruction *InsertBefore = User;
if (isa<PHINode>(InsertBefore))
InsertBefore = Call;
IRBuilder<> Builder(InsertBefore);
llvm::Value *Replacement = nullptr;
if (Dim >= 3) {
if (Callee->getName() == GID_BUILTIN_NAME ||
Callee->getName() == GROUP_ID_BUILTIN_NAME ||
Callee->getName() == LID_BUILTIN_NAME ||
Callee->getName() == GOFF_BUILTIN_NAME ||
Callee->getName() == GLID_BUILTIN_NAME ||
Callee->getName() == LLID_BUILTIN_NAME)
Replacement = ConstantInt::get(Call->getType(), 0);
else
Replacement = ConstantInt::get(Call->getType(), 1);
} else if (Callee->getName() == GID_BUILTIN_NAME)
Replacement = Builder.CreateLoad(ST, GlobalIdGlobals[Dim]);
else if (Callee->getName() == GROUP_ID_BUILTIN_NAME)
Replacement = Builder.CreateLoad(ST, GroupIdGlobals[Dim]);
else if (Callee->getName() == NGROUPS_BUILTIN_NAME)
Replacement = Builder.CreateLoad(ST, NumGroupsGlobals[Dim]);
else if (Callee->getName() == LS_BUILTIN_NAME)
Replacement = Builder.CreateLoad(ST, LocalSizeGlobals[Dim]);
else if (Callee->getName() == LID_BUILTIN_NAME)
Replacement = getLocalIdInRegion(InsertBefore, Dim);
else if (Callee->getName() == GS_BUILTIN_NAME)
Replacement = getGlobalSize(Dim);
User->replaceUsesOfWith(Call, Replacement);
UI = Call->use_begin();
UE = Call->use_end();
}
InstrsToDelete.insert(Call);
continue;
}
}
}
for (auto I : InstrsToDelete)
I->eraseFromParent();
}
} // namespace pocl
|