Home
last modified time | relevance | path

Searched refs:Jump (Results 1 – 25 of 68) sorted by relevance

123

/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp623 Jump->Flow += 1; in joinIsolatedComponents()
701 Parent[Dst] = Jump; in findShortestPath()
746 if (Jump->IsUnlikely) in jumpDistance()
748 if (Jump->Flow > 0) in jumpDistance()
889 if (Jump->IsUnlikely && Jump->Flow == 0) in ignoreJump()
1018 Jump->Flow = Flow; in rebalanceBlock()
1168 Jump.Flow = Flow; in extractWeights()
1180 InFlow[Jump.Target] += Jump.Flow; in verifyWeights()
1181 OutFlow[Jump.Source] += Jump.Flow; in verifyWeights()
1206 if (Jump.Flow > 0) { in verifyWeights()
[all …]
H A DCodeLayout.cpp160 class Jump;
200 class Jump { class
202 Jump(const Jump &) = delete;
203 Jump(Jump &&) = default;
204 Jump &operator=(const Jump &) = delete;
205 Jump &operator=(Jump &&) = default;
308 explicit ChainEdge(Jump *Jump) in ChainEdge() argument
309 : SrcChain(Jump->Source->CurChain), DstChain(Jump->Target->CurChain), in ChainEdge()
310 Jumps(1, Jump) {} in ChainEdge()
321 void appendJump(Jump *Jump) { Jumps.push_back(Jump); } in appendJump() argument
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h188 FlowJump Jump;
191 Func.Jumps.push_back(Jump);
197 for (auto &Jump : Func.Jumps) {
198 Func.Blocks[Jump.Source].SuccJumps.push_back(&Jump);
199 Func.Blocks[Jump.Target].PredJumps.push_back(&Jump);
222 for (auto &Jump : Func.Jumps) {
223 Edge E = std::make_pair(BasicBlocks[Jump.Source], BasicBlocks[Jump.Target]);
224 EdgeWeights[E] = Jump.Flow;
251 for (auto &Jump : Func.Jumps) {
259 Jump.IsUnlikely = true;
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dmin-jump-table.ll15 ; CHECK0-NEXT: Jump Tables:
16 ; CHECK2-NEXT: Jump Tables:
17 ; CHECK4-NOT: {{^}}Jump Tables:
18 ; CHECK8-NOT: {{^}}Jump Tables:
35 ; CHECK0-NEXT: Jump Tables:
36 ; CHECK2-NEXT: Jump Tables:
37 ; CHECK4-NEXT: Jump Tables:
38 ; CHECK8-NOT: {{^}}Jump Tables:
61 ; CHECK-NEXT: Jump Tables:
H A Dmax-jump-table.ll31 ; CHECK-NEXT: Jump Tables:
80 ; CHECK-NEXT: Jump Tables:
122 ; CHECK-NEXT: Jump Tables:
174 ; CHECK-NEXT: Jump Tables:
229 ; CHECK-NEXT: Jump Tables:
287 ; CHECK-NEXT: Jump Tables:
/llvm-project-15.0.7/clang/lib/Sema/
H A DJumpDiagnostics.cpp654 Stmt *Jump = Jumps.pop_back_val(); in VerifyJumps() local
657 if (GotoStmt *GS = dyn_cast<GotoStmt>(Jump)) { in VerifyJumps()
670 if (IndirectGotoStmt *IGS = dyn_cast<IndirectGotoStmt>(Jump)) { in VerifyJumps()
679 SwitchStmt *SS = cast<SwitchStmt>(Jump); in VerifyJumps()
856 static void DiagnoseIndirectOrAsmJumpStmt(Sema &S, Stmt *Jump, in DiagnoseIndirectOrAsmJumpStmt() argument
860 bool IsAsmGoto = isa<GCCAsmStmt>(Jump); in DiagnoseIndirectOrAsmJumpStmt()
861 S.Diag(Jump->getBeginLoc(), diag::err_indirect_goto_in_protected_scope) in DiagnoseIndirectOrAsmJumpStmt()
890 DiagnoseIndirectOrAsmJumpStmt(S, Jump, Target, Diagnosed); in DiagnoseIndirectOrAsmJump()
901 DiagnoseIndirectOrAsmJumpStmt(S, Jump, Target, Diagnosed); in DiagnoseIndirectOrAsmJump()
907 bool IsAsmGoto = isa<GCCAsmStmt>(Jump); in DiagnoseIndirectOrAsmJump()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DExtTSPReorderAlgorithm.cpp195 for (std::pair<Block *, uint64_t> Jump : OutJumps) { in hasOutJump()
196 if (Jump.first == Other) in hasOutJump()
203 for (std::pair<Block *, uint64_t> Jump : InJumps) { in hasInJump()
204 if (Jump.first == Other) in hasInJump()
523 for (std::pair<class Block *, uint64_t> &Jump : Block.OutJumps) { in initialize()
524 class Block *const SuccBlock = Jump.first; in initialize()
529 CurEdge->appendJump(&Block, SuccBlock, Jump.second); in initialize()
533 AllEdges.emplace_back(&Block, SuccBlock, Jump.second); in initialize()
683 const Block *SrcBlock = Jump.first.first; in score()
684 const Block *DstBlock = Jump.first.second; in score()
[all …]
/llvm-project-15.0.7/compiler-rt/test/asan/TestCases/Posix/
H A Dunpoison-alternate-stack.cpp40 template <class Jump>
41 void __attribute__((noinline)) poisonStackAndJump(TestContext &c, Jump jump) { in poisonStackAndJump()
/llvm-project-15.0.7/llvm/test/Transforms/ThinLTOBitcodeWriter/
H A Dcfi-debug-info-cloned-type-references-global-value.ll11 ; CHECK-DAG: !{i32 4, !"CFI Canonical Jump Tables", i32 0}
39 !15 = !{i32 4, !"CFI Canonical Jump Tables", i32 0}
H A Dcfi-functions-canonical-jump-tables.ll22 !0 = !{i32 4, !"CFI Canonical Jump Tables", i32 0}
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h1445 for (auto &Jump : ProbMatrix[I]) {
1446 Successors[Jump.first].push_back(I);
1475 for (auto &Jump : ProbMatrix[I]) {
1476 if (Jump.first == I) {
1477 OneMinusSelfProb -= Jump.second;
1479 NewFreq += Freq[Jump.first] * Jump.second;
1608 for (auto &Jump : Succs[Src]) {
1609 size_t Dst = Jump.first;
1610 Scaled64 Prob = Jump.second;
1632 for (const auto &Jump : ProbMatrix[I]) {
[all …]
/llvm-project-15.0.7/llvm/lib/Target/RISCV/
H A DRISCVSchedule.td20 def WriteJmp : SchedWrite; // Jump
21 def WriteJal : SchedWrite; // Jump and link
22 def WriteJalr : SchedWrite; // Jump and link register
23 def WriteJmpReg : SchedWrite; // Jump register
/llvm-project-15.0.7/llvm/test/Transforms/JumpThreading/
H A Ddegenerate-phi.ll4 ; This is actually a test for value tracking. Jump threading produces
H A Dno-irreducible-loops.ll5 ; Jump threading should not prevent this loop from being unrolled.
H A Ddivergent-target-test.ll7 ; Here we assure that for the target with no branch divergence usual Jump Threading optimization pe…
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dnocfivalue.ll37 !1 = !{i32 4, !"CFI Canonical Jump Tables", i32 0}
H A Dtagged-globals-static.ll45 ; Jump tables shouldn't go through the GOT.
/llvm-project-15.0.7/llvm/test/LTO/Resolution/X86/
H A Dexport-jumptable-noncanonical.ll35 !2 = !{i32 4, !"CFI Canonical Jump Tables", i32 0}
/llvm-project-15.0.7/llvm/test/Transforms/LowerTypeTests/
H A Dnocfivalue.ll36 !1 = !{i32 4, !"CFI Canonical Jump Tables", i32 0}
/llvm-project-15.0.7/llvm/test/MC/Disassembler/Hexagon/
H A Djr.txt16 # Jump to address from register
/llvm-project-15.0.7/bolt/test/X86/
H A Dsplit-func-jump-table-fragment-bidirection.s14 # CHECK: PIC Jump table JUMP_TABLE1 for function main, main.cold.1 at {{.*}} with a total count of…
H A Dtail-duplication-jt.s14 # CHECK: Jump table {{.*}} for function a at {{.*}} with a total count of 3
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/cppcoreguidelines/
H A Davoid-goto.rst23 // Jump label for the loop
/llvm-project-15.0.7/bolt/test/X86/Inputs/
H A Djump_table_icp.s190 # Jump tables
299 # Jump tables
/llvm-project-15.0.7/llvm/test/MC/Mips/
H A Dmicromips-jump-instructions.s8 # Jump instructions

123