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
|
/*========================== begin_copyright_notice ============================
Copyright (C) 2017-2021 Intel Corporation
SPDX-License-Identifier: MIT
============================= end_copyright_notice ===========================*/
#ifndef __OPTIMIZER_H__
#define __OPTIMIZER_H__
#include "BuildIR.h"
#include "HWConformity.h"
#include "EmuInt64Add.h"
#include "LocalScheduler/LocalScheduler_G4IR.h"
#include "LocalScheduler/SWSB_G4IR.h"
#include <optional>
#include <unordered_set>
typedef struct _AddrSubReg_Node {
short immAddrOff = 0;
int subReg = 0;
INST_LIST_ITER iter;
bool canRemoveInst = false;
bool canUseImmed = false;
bool usedImmed = false;
} AddrSubReg_Node;
/**
* Below data structures are used for message header optimization
*/
typedef enum _HEADER_ORDER_ {
HEADER_UNDEF = 0,
HEADER_FULL_REGISTER = 1,
HEADER_X = 2,
HEADER_Y = 3,
HEADER_SIZE = 4
} HEADER_ORDER;
namespace vISA {
class MSGTable {
public:
// below instructions are to be compared against the current send
G4_INST *send = nullptr; // the reference send
G4_INST *a0Dot0 = nullptr; // def of a0.0
G4_INST *m = nullptr; // def of m
G4_INST *mDot0= nullptr; // def of m.0: X
G4_INST *mDot1= nullptr; // def of m.1: Y
G4_INST *mDot2= nullptr; // def of m.2: size
INST_LIST_ITER a0Dot0_it;
INST_LIST_ITER m_it;
INST_LIST_ITER mDot0_it;
INST_LIST_ITER mDot1_it;
INST_LIST_ITER mDot2_it;
bool invalid = false;
bool opt = false; // if the catched send is used
// below shows whether there are new defs to determine reuse or remove
// if redundant, then remove; otherwise, reuse the catched header
bool isXRedef = false; // X is used to define m.0
bool isYRedef = false; // Y is used to define m.1
bool isSizeRedef = false; // Size is used to define m.2
bool isR0Dot0Redef = false; // r0.0 is used to define m
HEADER_ORDER first = HEADER_UNDEF;
void insertHeaderMovInst(G4_INST *, IR_Builder &, G4_BB *);
void reusePreviousHeader(G4_INST *, G4_INST *, G4_INST *, IR_Builder &);
~MSGTable() = default;
}; // to remove redundant message headers
} // namespace vISA
typedef std::list<vISA::MSGTable *> MSGTableList;
typedef std::list<vISA::MSGTable *>::iterator MSGTable_ITER;
#define MESSAGE_HEADER_THRESHOLD 1
typedef struct _DEFA0 {
vISA::G4_INST *pred = nullptr;
vISA::G4_INST *curr = nullptr;
INST_LIST_ITER predIt;
INST_LIST_ITER currIt;
bool isA0Redef = false;
} DEFA0;
/**
* end of data structures for message header optimization
*/
// auxiliary structure for inserting save and restore instructions
namespace vISA {
class Optimizer {
IR_Builder &builder;
G4_Kernel &kernel;
FlowGraph &fg;
vISA::Mem_Manager &mem;
//
// optimization phases
//
G4_SrcModifier mergeModifier(G4_Operand *def, G4_Operand *use);
void cleanMessageHeader();
void forceNoMaskOnM0();
void sendFusion();
void renameRegister();
void localDefHoisting();
void reassociateConst();
void removePartialMovs();
void localCopyPropagation();
void localInstCombine();
void optimizeLogicOperation();
void cselPeepHoleOpt();
void forceAssignRegs();
void forceSpillVars();
void preRegAlloc();
void regAlloc();
void insertFallThroughJump();
void reverseOffsetProp(AddrSubReg_Node addrRegInfo[8], int subReg,
unsigned int srcNum, INST_LIST_ITER lastIter,
INST_LIST_ITER iend);
void removePseudoMov();
void FoldAddrImmediate();
bool foldCmpSel(G4_BB *BB, G4_INST *selInst, INST_LIST_ITER &selInst_II);
bool foldPseudoNot(G4_BB *bb, INST_LIST_ITER &iter);
bool createSmov(G4_BB *bb, G4_INST *flagMove, G4_INST *nextInst);
bool foldCmpToCondMod(G4_BB *BB, INST_LIST_ITER &iter);
void sinkBarrierWait();
void HWWorkaround();
void preRA_HWWorkaround();
void postRA_HWWorkaround();
void normalizeRegion();
void initializePayload();
void dumpPayload();
void collectStats();
void createR0Copy();
void fixEndIfWhileLabels();
void mergeScalarInst();
void EmulateInt64Add() { ::EmulateInt64Add(builder, kernel); }
void HWConformityChk() { ::HWConformityChk(builder, kernel); }
void removeRedundMov() { fg.removeRedundMov(); }
void removeEmptyBlocks() { fg.removeEmptyBlocks(); }
void reassignBlockIDs() { fg.reassignBlockIDs(); }
void evalAddrExp() { kernel.evalAddrExp(); }
void ACCSchedule() {
kernel.fg.resetLocalDataFlowData();
kernel.fg.localDataFlowAnalysis();
preRA_ACC_Scheduler Sched(kernel);
Sched.run();
}
void preRA_Schedule() {
unsigned KernelPressure = 0;
preRA_Scheduler Sched(kernel);
if (kernel.useAutoGRFSelection()) {
unsigned InitialGRFNumber = kernel.getNumRegTotal();
Sched.runWithGRFSelection(KernelPressure);
// FIXME: remove the platform check when 3D regressions are resolved
bool PlatformCheck = true;
if (PlatformCheck && InitialGRFNumber != kernel.getNumRegTotal() &&
kernel.getNumRegTotal() > InitialGRFNumber)
Sched.run(KernelPressure);
} else {
Sched.run(KernelPressure);
}
// Update Jit info for max register pressure
kernel.fg.builder->getJitInfo()->stats.maxGRFPressurePreRA = KernelPressure;
}
void localSchedule() {
LocalScheduler lSched(kernel.fg);
lSched.localScheduling();
}
void adjustIndirectCallOffsetAfterSWSBSet();
// For HW debugging
void zeroSomeARF();
void addSWSBInfo();
void lowerMadSequence();
void LVN();
void ifCvt();
void ifCvtFCCall();
void dce();
void accSubPostSchedule();
void accSubBeforeRA();
void HWDebug();
void s0SubAfterRA();
// return true if BuiltInR0 gets a different allocation than r0
bool R0CopyNeeded();
private:
/* below member functions are used for message header opt */
bool isHeaderOptCandidate(G4_INST *, G4_INST *);
bool isHeaderOptReuse(G4_INST *, G4_INST *);
bool headerOptValidityCheck(MSGTable *, MSGTable *);
bool isHeaderCachingCandidate(G4_INST *);
void messageHeaderReport(size_t, size_t, G4_Kernel &);
void optMessageHeaders(MSGTableList &, G4_BB *, DEFA0 &);
void addEntryToMessageTable(G4_INST *, MSGTableList &, G4_BB *,
INST_LIST_ITER, DEFA0 &);
bool chkNewDefBetweenSends(G4_INST *, MSGTableList &, DEFA0 &);
/* below member functions are used for barrier header opt */
void removeRedundantBarrierHeaders(G4_INST *, G4_SrcRegRegion *, bool);
bool isBarrierPattern(G4_INST *, G4_SrcRegRegion *&);
void hoistBarrierHeaderToTop(G4_SrcRegRegion *);
/* end of member functions for message header opt */
void cleanupBindless();
void cleanupA0Movs();
G4_Operand *updateSendsHeaderReuse(std::vector<std::vector<G4_INST *>> &,
std::vector<G4_INST *> &, INST_LIST_ITER);
void countGRFUsage();
void changeMoveType();
void split4GRFVars();
void legalizeType();
void analyzeMove();
void staticProfiling();
void removeIntrinsics();
unsigned int numBankConflicts;
bool chkFwdOutputHazard(INST_LIST_ITER &, INST_LIST_ITER &);
bool chkFwdOutputHazard(G4_INST *, INST_LIST_ITER);
bool chkBwdOutputHazard(INST_LIST_ITER &, INST_LIST_ITER &);
bool chkBwdOutputHazard(G4_INST *, INST_LIST_ITER &);
bool chkBwdOutputHazard(G4_INST *, INST_LIST_ITER &, G4_INST *);
bool chkBwdWARdep(G4_INST *, INST_LIST_ITER);
bool chkBwdWAWdep(G4_INST *, INST_LIST_ITER);
// various HW WA
void addSwitchOptionToBB(G4_BB *, bool isSubroutine = false);
void linePlaneWA(G4_INST *inst);
void fixSendSrcRegion(G4_INST *inst);
void clearARFDependencies();
void mulMacRSWA();
void clearSendDependencies();
void loadThreadPayload();
void addFFIDProlog();
void addEmaskSetupProlog();
void insertFenceBeforeEOT();
void insertScratchReadBeforeEOT();
void resetA0();
void setA0toTdrForSendc();
void replaceRetWithJmpi();
void prepareNoMaskWA();
void applyNoMaskWA();
void applyFusedCallWA();
void finishFusedCallWA_preSWSB();
void finishFusedCallWA();
void insertFenceAtEntry();
void expandMulPostSchedule();
void expandMadwPostSchedule();
void fixReadSuppressioninFPU0();
void prepareDPASFuseRSWA();
void applyBarrierWA(INST_LIST_ITER it, G4_BB *bb);
void applyNamedBarrierWA(INST_LIST_ITER it, G4_BB *bb);
void insertIEEEExceptionTrap();
void expandIEEEExceptionTrap(INST_LIST_ITER it, G4_BB *bb);
void fixDirectAddrBoundOnDst();
typedef std::vector<vISA::G4_INST *> InstListType;
// create instruction sequence to calculate call offset from ip
void expandIndirectCallWithRegTarget();
// a helper function to create instruction sequence to replace indirect call
// with jmpi
void createInstForJmpiSequence(InstListType &insts, G4_INST *fcall);
// a hlper function to create the instructions to calculate the jump target
// offset, return G4_Declare of the new created jmp target
G4_Declare *createInstsForCallTargetOffset(InstListType &insts,
G4_INST *fcall,
int64_t adjust_off);
// a helper function to create the instructions to get ip from call's dst
// This is a WA for platforms can't support ip register
// The inst_with_ip must be:
// 1. an add instruction with ip register as its src0.
// its src0 will be replaced with call's dst. or
// 2. a mov instruction.
// its dst is used. No change to the mov instruction.
// In both case, the dst of inst_with_ip is used to save IP.
void replaceIPWithCall(InstListType &insts, G4_INST *inst_with_ip);
void insertDummyAdd(G4_BB *bb, INST_LIST_ITER inst_it, int imm = 0);
void insertDummyMad(G4_BB *bb, INST_LIST_ITER inst_it);
void insertDummyCsel(G4_BB *bb, INST_LIST_ITER inst_it, bool newBB);
void insertDummyMov(G4_BB *bb, INST_LIST_ITER inst_it, G4_Operand *opnd);
void insertDummyMovForHWRSWADPAS(G4_BB *bb);
void insertDummyMovForHWRSWAonaAllpipelines();
void insertDummyMovForHWRSWAonDPAS();
void insertDummyMovForHWRSWA();
void insertHashMovs();
void insertDummyCompactInst();
void swapSrc1Src2OfMadForCompaction();
void removeLifetimeOps();
void recomputeBound(std::unordered_set<G4_Declare *> &declares);
void mapOrphans();
void cloneSampleInst();
/// Each optimization should be a member function of this class.
/// This defines a pass type as a pointer to member function.
typedef void (Optimizer::*PassType)();
/// Data structure that collects information about passes.
struct PassInfo {
/// The pass to be executed for this kernel.
PassType Pass;
/// The member function name as a pass.
const char *Name;
/// The option that controls this pass. This might not be a one-to-one
/// relation between pass and option. For example, multiple passes
/// could be mapped to a single option, like vISA_EnableAlways.
vISAOptions Option;
/// Corresponding timer for this pass. When it is not a concrete
/// timer i.e. TIMER_NUM_TIMERS, then no time will be recorded.
TimerID Timer;
PassInfo(PassType P, const char *N, vISAOptions O,
TimerID T = TimerID::NUM_TIMERS)
: Pass(P), Name(N), Option(O), Timer(T) {}
PassInfo()
: Pass(0), Name(0), Option(vISA_EnableAlways),
Timer(TimerID::NUM_TIMERS) {}
};
bool foldPseudoAndOr(G4_BB *bb, INST_LIST_ITER &iter);
public:
/// Index enum for each pass in the pass array.
enum PassIndex {
PI_cleanMessageHeader = 0,
PI_forceNoMaskOnM0,
PI_sendFusion,
PI_renameRegister,
PI_localDefHoisting,
PI_localCopyPropagation,
PI_localInstCombine,
PI_removePartialMovs,
PI_cselPeepHoleOpt,
PI_optimizeLogicOperation,
PI_EmulateInt64Add,
PI_HWConformityChk, // always
PI_preRA_HWWorkaround, // always, each WA under specific control
PI_postRA_HWWorkaround, // always, each WA under specific control
PI_preRA_Schedule,
PI_preRegAlloc, // always
PI_regAlloc, // always
PI_removeLifetimeOps, // always
PI_removeRedundMov, // always
PI_removeEmptyBlocks, // always
PI_insertFallThroughJump, // always
PI_reassignBlockIDs, // always
PI_evalAddrExp, // always
PI_FoldAddrImmediate,
PI_localSchedule,
PI_HWWorkaround, // always
PI_fixEndIfWhileLabels, // always
PI_HWDebug,
PI_insertDummyMovForHWRSWA,
PI_insertDummyCompactInst,
PI_swapSrc1Src2OfMadForCompaction,
PI_mergeScalarInst,
PI_lowerMadSequence,
PI_LVN,
PI_ifCvt,
PI_normalizeRegion, // always
PI_dumpPayload,
PI_collectStats, // always
PI_createR0Copy,
PI_initializePayload,
PI_cleanupBindless,
PI_cleanupA0Movs,
PI_countGRFUsage,
PI_changeMoveType,
PI_accSubBeforeRA,
PI_accSubPostSchedule,
PI_s0SubAfterRA,
PI_removePseudoMov,
PI_dce,
PI_reassociateConst,
PI_split4GRFVars,
PI_loadThreadPayload,
PI_addFFIDProlog,
PI_addEmaskSetupProlog,
PI_insertFenceBeforeEOT,
PI_insertScratchReadBeforeEOT,
PI_mapOrphans,
PI_legalizeType,
PI_analyzeMove,
PI_removeIntrinsics,
PI_expandMulPostSchedule,
PI_zeroSomeARF,
PI_addSWSBInfo,
PI_expandMadwPostSchedule,
PI_ACCSchedule,
PI_staticProfiling,
PI_sinkBarrierWait,
PI_NUM_PASSES
};
private:
/// Array of passes registered.
PassInfo Passes[PI_NUM_PASSES];
// indicates whether RA has failed
bool RAFail;
// Name of the pass that we should stop before/after, from the
// -stopbefore/-stopafter flag.
std::string StopBeforePass;
std::string StopAfterPass;
// Whether we have hit the stop-after pass.
bool EarlyExited = false;
/// Initialize all passes during the construction.
void initOptimizations();
/// Common interface to execute a pass.
void runPass(PassIndex Index);
bool isCopyPropProfitable(G4_INST *movInst) const;
std::optional<INST_LIST_ITER> findFenceCommitPos(INST_LIST_ITER fence,
G4_BB *bb) const;
bool addFenceCommit(INST_LIST_ITER iter, G4_BB *bb, bool scheduleFenceCommit);
public:
Optimizer(vISA::Mem_Manager &m, IR_Builder &b, G4_Kernel &k, FlowGraph &f)
: builder(b), kernel(k), fg(f), mem(m), RAFail(false) {
numBankConflicts = 0;
#ifndef DLL_MODE
if (auto PassName = k.getOptions()->getOptionCstr(vISA_StopBeforePass)) {
StopBeforePass = std::string(PassName);
}
if (auto PassName = k.getOptions()->getOptionCstr(vISA_StopAfterPass)) {
StopAfterPass = std::string(PassName);
}
#endif // DLL_MODE
initOptimizations();
}
Optimizer(const Optimizer&) = delete;
Optimizer& operator=(const Optimizer&) = delete;
~Optimizer() {
// Normally, noMask Info will be freed in postRA workaround.
// But in case RA fails, postRA will not be invoked. Thus, need
// to free memory allocated in preRA_HWWorkaround() here as well.
if (builder.hasFusedEUNoMaskWA()) {
kernel.deleteEUFusionNoMaskWAInfo();
}
}
int optimization();
};
} // namespace vISA
#endif // __OPTIMIZER_H__
|