Home
last modified time | relevance | path

Searched full:jump (Results 1 – 25 of 1026) sorted by relevance

12345678910>>...42

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineJumpTableInfo.h1 //===-- CodeGen/MachineJumpTableInfo.h - Abstract Jump Tables --*- C++ -*-===//
9 // The MachineJumpTableInfo class keeps track of jump tables referenced by
12 // Instructions reference the address of these jump tables through the use of
15 // function jump tables.
32 /// MachineJumpTableEntry - One jump table in the jump table info.
35 /// MBBs - The vector of basic blocks from which to create the jump table.
44 /// JTEntryKind - This enum indicates how each entry of the jump table is
62 /// the address of the jump table. This is used for PIC jump table
[all...]
/freebsd/sys/dev/pms/RefTisa/tisa/sassata/common/
H A Dwcs.h40 0x0ff, // 0x007 = 7 - JUMP
47 0x0ff, // 0x00e = 14 - JUMP
58 0x0ff, // 0x019 = 25 - JUMP
61 0x0ff, // 0x01c = 28 - JUMP
65 0x0ff, // 0x020 = 32 - JUMP
74 0x0ff, // 0x029 = 41 - JUMP
117 0x0ff, // 0x054 = 84 - JUMP
120 0x0ff, // 0x057 = 87 - JUMP
123 0x0ff, // 0x05a = 90 - JUMP
126 0x0ff, // 0x05d = 93 - JUMP
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp634 for (auto &Jump : Path) { in joinIsolatedComponents() local
635 Jump->Flow += 1; in joinIsolatedComponents()
636 Func.Blocks[Jump->Target].Flow += 1; in joinIsolatedComponents()
638 findReachable(Jump->Target, Visited); in joinIsolatedComponents()
655 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findReachable() local
656 uint64_t Dst = Jump->Target; in findReachable()
657 if (Jump->Flow > 0 && !Visited[Dst]) { in findReachable()
706 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findShortestPath() local
707 uint64_t Dst = Jump->Target; in findShortestPath()
708 int64_t JumpDist = jumpDistance(Jump); in findShortestPath()
[all …]
H A DCodeLayout.cpp13 // optimizing jump locality and thus processor I-cache utilization. This is
95 cl::desc("The maximum distance (in bytes) of a forward jump for ExtTSP"));
99 cl::desc("The maximum distance (in bytes) of a backward jump for ExtTSP"));
142 // Compute the Ext-TSP score for a given jump. in extTSPScore()
151 // Compute the Ext-TSP score for a jump between a given pair of blocks, in extTSPScore()
152 // using their sizes, (estimated) addresses and the jump execution count. in extTSPScore()
259 /// An arc in the graph, typically corresponding to a jump between two nodes.
269 // Source node of the jump.
271 // Target node of the jump.
275 // Whether the jump correspond in isCold()
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonDepMask.h232 /*jump #r22:2*/
238 /*if (!Pu4) jump:nt #r15:2*/
244 /*if (!Pu4.new) jump:nt #r15:2*/
250 /*if (!Pu4.new) jump:t #r15:2*/
256 /*if (!Pu4) jump:t #r15:2*/
262 /*if (Pu4) jump:nt #r15:2*/
268 /*if (Pu4.new) jump:nt #r15:2*/
274 /*if (Pu4.new) jump:t #r15:2*/
280 /*if (Pu4) jump:t #r15:2*/
346 /*if (!cmp.eq(Ns8.new,Rt32)) jump:nt #r9:2*/
[all …]
H A DHexagonNewValueJump.cpp1 //===- HexagonNewValueJump.cpp - Hexagon Backend New Value Jump -----------===//
12 // jump instructions, we are forced to write after register allocation.
16 // The basic approach looks for sequence of predicated jump, compare instruciton
18 // all, it collapses compare and jump instruction into a new value jump
57 STATISTIC(NumNVJGenerated, "Number of New Value Jump Instructions created");
61 "New Value Jump"));
162 // feeder insn between its definition, this MI and jump, jmpInst in INITIALIZE_PASS_DEPENDENCY()
168 // if (p0.new) jump:t .LBB29_45 in INITIALIZE_PASS_DEPENDENCY()
173 // if (p0.new) jump:t .LBB29_45 in INITIALIZE_PASS_DEPENDENCY()
174 // and result WAR hazards if converted to New Value Jump. in INITIALIZE_PASS_DEPENDENCY()
[all …]
H A DHexagonCFGOptimizer.cpp129 // BB1: if (p0) jump BB3 in runOnMachineFunction()
131 // BB2: jump BB4 in runOnMachineFunction()
136 // BB1: if (!p0) jump BB4 in runOnMachineFunction()
141 // BB1: if (p0) jump BB3 in runOnMachineFunction()
143 // BB2: jump BB4 in runOnMachineFunction()
148 // jump BB4 in runOnMachineFunction()
151 // BB1: if (!p0) jump BB4 in runOnMachineFunction()
185 // Ensure that BB2 has one instruction -- an unconditional jump. in runOnMachineFunction()
188 assert(JumpAroundTarget && "jump target is needed to process second basic block"); in runOnMachineFunction()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h42 /// A wrapper of a jump between two basic blocks.
93 /// The cost of increasing a jump's count by one.
96 /// The cost of increasing a fall-through jump's count by one.
99 /// The cost of decreasing a jump's count by one.
102 /// The cost of decreasing a fall-through jump's count by one.
105 /// The cost of increasing an unknown jump's count by one.
108 /// The cost of increasing an unknown fall-through jump's count by one.
111 /// The cost of taking an unlikely block/jump.
221 for (auto &Jump : Func.Jumps) { in apply()
222 Edge E = std::make_pair(BasicBlocks[Jump in apply()
265 FlowJump Jump; createFlowFunction() local
[all...]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/
H A Ddffma.S126 if (!P_TMP) jump .Lfma_abnormal_ab
132 if (!P_TMP.new) jump:nt .Lfma_abnormal_c
275 if (!cmp.eq(LEFTSHIFT.new,TMP)) jump:t 1f // all sign bits?
304 // If EXPA is overflow/underflow, jump to ovf_unf
307 if (!P_TMP.new) jump:nt .Lfma_ovf_unf
348 if (p0.new) jump:nt .Ladd_yields_zero
386 if (p0.new) jump:nt .Lfma_ovf
390 if (p0.new) jump:nt .Lpossible_unf
522 if (!p0.new) jump:nt .Lnan
535 if (p1) jump .Lab_inf
[all …]
H A Ddfaddsub.S90 if (!NORMAL) jump .Ladd_abnormal // If abnormal, go to special code
138 if (!p0.new) jump:nt .Ladd_ovf_unf
145 if (p0.new) jump:nt .Ladd_zero // or maybe conversion handles zero case correctly?
155 jump __qdsp_adddf3
196 if (p0.new) jump:nt .Ladd_zero
208 if (p0.new) jump:nt .Ladd_ovf
270 if (!p0.new) jump:nt .Linvalid_nan_add
278 if (p1.new) jump:nt .Linf_add
282 if (p2.new) jump:nt .LB_zero // so return A or special 0+0
288 if (p0.new) jump:nt .Ladd_two_subnormal
[all …]
H A Ddfdiv.S97 if (!NORMAL) jump .Ldiv_abnormal
215 if (!NO_OVF_UNF) jump .Ldiv_ovf_unf
233 if (P_TMP.new) jump:nt .Ldiv_ovf
237 if (P_TMP.new) jump:nt .Lpossible_unf // round up to normal possible...
373 if (!P_TMP) jump .Ldiv_nan
374 if (P_INF) jump .Ldiv_invalid
377 if (P_ZERO) jump .Ldiv_invalid
388 if (!P_ZERO) jump .Ldiv_zero_result
389 if (!P_INF) jump .Ldiv_inf_result
430 jump .Ldenorm_continue
[all …]
H A Ddfmul.S97 if (!p0) jump .Lmul_abnormal
126 if (!p0.new) jump:nt .Lmul_ovf_unf
188 if (p0.new) jump:nt .Lmul_ovf
192 if (p0.new) jump:nt .Lpossible_unf
298 if (!p0.new) jump:nt .Linvalid_nan
314 if (p1) jump .Ltrue_inf
318 if (p0) jump .Linvalid_zeroinf
319 if (p2) jump .Ltrue_zero // so return zero
329 if (p0.new) jump:nt .Lmul_tiny
344 jump __hexagon_muldf3
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixBrTableDefaults.cpp10 /// guarding br_table instructions. Since jump tables on most targets cannot
11 /// handle out of range indices, LLVM emits these checks before most jump
98 // Find the conditional jump to the default target. If it doesn't exist, the in fixBrTableDefault()
105 assert(Analyzed && "Could not analyze jump header branches"); in fixBrTableDefault()
108 // Here are the possible outcomes. '_' is nullptr, `J` is the jump table block in fixBrTableDefault()
112 // _ | _ | No default block, header falls through to jump table in fixBrTableDefault()
113 // J | _ | No default block, header jumps to the jump table in fixBrTableDefault()
114 // D | _ | Header jumps to the default and falls through to the jump table in fixBrTableDefault()
115 // D | J | Header jumps to the default and also to the jump table in fixBrTableDefault()
118 "Expected jump or fallthrough to br_table block"); in fixBrTableDefault()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DJumpDiagnostics.cpp1 //===--- JumpDiagnostics.cpp - Protected scope jump analysis ------*- C++ -*-=//
55 /// InDiag - The note to emit if there is a jump into this scope.
58 /// OutDiag - The note to emit if there is an indirect jump out
384 // Cannot jump into the middle of the condition. in BuildScopeInformation()
415 // Jump from the catch into the try is not allowed either. in BuildScopeInformation()
440 // Jump from __except or __finally into the __try are not allowed either. in BuildScopeInformation()
501 // Jump from the catch to the finally or try is not valid. in BuildScopeInformation()
512 // Jump from the finally to the try or catch is not valid. in BuildScopeInformation()
667 Stmt *Jump = Jumps.pop_back_val(); in VerifyJumps() local
670 if (GotoStmt *GS = dyn_cast<GotoStmt>(Jump)) { in VerifyJumps()
[all …]
/freebsd/contrib/bearssl/T0/
H A DOpcode.cs48 * Resolve the jump offset for this opcode. Displacement is
50 * the jump code; thus, 0 implies no jump at all.
54 throw new Exception("Not a jump opcode"); in ResolveJump()
88 * Get jump displacement. For non-jump opcodes, this returns 0.
112 * byte jump offsets when converting code to C.
H A DWordBuilder.cs303 * Add a forward unconditional jump. The new opcode address is
313 * Add a forward conditional jump, which will be taken at runtime
324 * Add a forward conditional jump, which will be taken at runtime
335 * Resolve a previous forward jump to the current code address.
347 * destination, to be used by an ulterior backward jump.
355 * Add a backward unconditional jump. The jump target is popped
365 * Add a backward conditional jump, which will be taken at runtime
366 * if the top-of-stack value is 'true'. The jump target is popped
376 * Add a backward conditional jump, which will be taken at runtime
377 * if the top-of-stack value is 'false'. The jump target is popped
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64CompressJumpTables.cpp1 //==-- AArch64CompressJumpTables.cpp - Compress jump tables for AArch64 --====//
7 // This pass looks at the basic blocks each jump-table refers to and works out
28 #define DEBUG_TYPE "aarch64-jump-tables"
30 STATISTIC(NumJT8, "Number of jump-tables with 1-byte entries");
31 STATISTIC(NumJT16, "Number of jump-tables with 2-byte entries");
32 STATISTIC(NumJT32, "Number of jump-tables with 4-byte entries");
63 return "AArch64 Compress Jump Tables"; in getPassName()
70 "AArch64 compress jump tables pass", false, false)
118 // The jump-table might have been optimized away. in compressJumpTable()
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A Di386.h146 /// A 32-bit PC-relative branch to a pointer jump stub.
148 /// The target of this relocation should be a pointer jump stub of the form:
161 /// identifies the call/branch as being to a pointer jump stub. For edges of
162 /// this kind the jump stub should not be bypassed (use
178 /// but identifies the call/branch as being to a pointer jump stub that may be
179 /// bypassed with a direct jump to the ultimate target if the ultimate target
281 /// i386 pointer jump stub content.
283 /// Contains the instruction sequence for an indirect jump via an in-memory
308 /// Create a jump stub block that jumps via the pointer at the given symbol.
320 // jump stub block are {0xff, 0x25} -- an indirect absolute in createPointerJumpStubBlock()
[all …]
/freebsd/sys/cddl/contrib/opensolaris/uts/common/dtrace/
H A Ddtrace_xoroshiro128_plus.c44 * This is the jump function for the generator. It is equivalent to 2^64 calls
52 static const uint64_t JUMP[] = { 0xbeac0467eba5facb, in dtrace_xoroshiro128_plus_jump() local
59 for (i = 0; i < sizeof JUMP / sizeof *JUMP; i++) { in dtrace_xoroshiro128_plus_jump()
61 if (JUMP[i] & 1ULL << b) { in dtrace_xoroshiro128_plus_jump()
/freebsd/contrib/lua/src/
H A Dlcode.c112 ** may be a jump target between the current instruction and the
151 ** Gets the destination address of a jump instruction. Used to traverse
164 ** Fix jump instruction at position 'pc' to jump to 'dest'.
165 ** (Jump addresses are relative in Lua)
179 ** Concatenate jump-list 'l2' into jump-list 'l1'
196 ** Create a jump instruction and return its position, so its destination
219 ** Code a "conditional jump", that is, a test or comparison opcode
220 ** followed by a jump. Return jump position.
229 ** returns current 'pc' and marks it as a jump target (to avoid wrong
240 ** jump (that is, its condition), or the jump itself if it is
[all …]
/freebsd/contrib/less/
H A Djump.c12 * Routines which jump to a new location in the file.
26 * Jump to the end of the file.
68 * Jump to the last buffered line in the file.
85 * Jump to line n in the file.
94 * If we can seek there, just jump to it. in jump_back()
135 * Jump to a specified percentage into the file.
163 * Jump to a specified position in the file.
220 * Jump to a specified position in the file.
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpTableToSwitch.cpp22 JumpTableSizeThreshold("jump-table-to-switch-size-threshold", cl::Hidden,
23 cl::desc("Only split jump tables with size less or "
28 // transformation. Currently we replace a jump table with a switch if all the
29 // functions in the jump table are smaller than the provided threshold.
31 "jump-table-to-switch-function-size-threshold", cl::Hidden,
32 cl::desc("Only split jump tables containing functions whose sizes are less "
36 #define DEBUG_TYPE "jump-table-to-switch"
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCCompound.cpp88 // "p0=cmp.eq(Rs16,Rt16); if (p0.new) jump:nt #r9:2" in getCompoundCandidateGroup()
89 // "Rd16=#U6 ; jump #r9:2" in getCompoundCandidateGroup()
90 // "Rd16=Rs16 ; jump #r9:2" in getCompoundCandidateGroup()
161 // Transfer and jump: in getCompoundCandidateGroup()
162 // Rd=#U6 ; jump #r9:2 in getCompoundCandidateGroup()
163 // Rd=Rs ; jump #r9:2 in getCompoundCandidateGroup()
164 // Do not test for jump range here. in getCompoundCandidateGroup()
218 CompoundInsn->addOperand(R.getOperand(0)); // Jump target in getCompoundInsn()
230 CompoundInsn->addOperand(R.getOperand(0)); // Jump target. in getCompoundInsn()
362 // Try to pair with another insn (B)undled with jump. in lookForCompound()
[all …]
/freebsd/contrib/bc/include/
H A Dstatus.h742 /// Unlocks signals. If a signal happened, then this will cause a jump.
753 /// used after labels that longjmp() goes to after the jump because the cleanup
755 /// doesn't jump.
764 /// happened, then this will cause a jump.
788 * initiates an exception/jump.
811 * Sets a jump like BC_SETJMP, but unlike BC_SETJMP, it assumes signals are
812 * locked and will just set the jump. This does *not* have a call to
815 * param l The label to jump to on a longjmp().
831 /// Used after cleanup labels set by BC_SETJMP and BC_SETJMP_LOCKED to jump to
862 /// Used after cleanup labels set by BC_SETJMP and BC_SETJMP_LOCKED to jump to
[all …]
/freebsd/sys/amd64/acpica/
H A Dacpi_wakecode.S124 * Now execute a far jump to turn on protected mode. This
135 .byte 0xea /* opcode for far jump */
200 * We do another far jump to reload %cs with the 64 bit selector.
202 * We cannot yet jump all the way to the kernel because we can only
211 .byte 0xea /* opcode for far jump */
222 * so use an indirect jump.
237 /* Jump to return address. */

12345678910>>...42