/linux-master/Documentation/sphinx/ |
H A D | parse-headers.pl | 383 to replace the default references by a custom one. 394 Copyright (c) 2016 by Mauro Carvalho Chehab <mchehab+samsung@kernel.org>. 399 There is NO WARRANTY, to the extent permitted by law.
|
/linux-master/drivers/gpu/drm/amd/amdkfd/ |
H A D | cwsr_trap_handler_gfx9.asm | 107 var TTMP_SAVE_RCNT_FIRST_REPLAY_SHIFT = 26 // bits [31:26] unused by SPI debug data 221 // Caused by instruction fetch memory violation. 307 // If not caused by trap then halt wave to prevent re-entry. 334 s_and_b64 exec, exec, exec // Restore STATUS.EXECZ, not writable by s_setreg_b32 335 s_and_b64 vcc, vcc, vcc // Restore STATUS.VCCZ, not writable by s_setreg_b32 370 // Save trap temporaries 4-11, 13 initialized by SPI debug dispatch logic 752 s_add_u32 s_restore_mem_offset, s_restore_mem_offset, 256*2 //mem offset increased by 128DW 825 s_sub_u32 s_restore_mem_offset, s_restore_mem_offset, 16*4 // restore SGPR from S[n] to S[0], by 16 sgprs group 895 // Restore trap temporaries 4-11, 13 initialized by SPI debug dispatch logic 911 s_and_b64 exec, exec, exec // Restore STATUS.EXECZ, not writable by s_setreg_b3 [all...] |
/linux-master/arch/m68k/ifpsp060/src/ |
H A D | ilsp.S | 10 To the maximum extent permitted by applicable law, 16 To the maximum extent permitted by applicable law, 26 No licenses are granted by implication, estoppel or otherwise under any patents 85 # sign info for later. Separate out special cases like divide-by-zero # 90 # zero, then perform a divide-by-zero using a 16-bit implemented # 228 # the values at the location pointed to by a0. 291 # In the general case, four quotient words would be created by 387 # now test the word by multiplying it by the divisor (V1V2) and comparing 589 # the values at the location pointed to by a [all...] |
H A D | pfpsp.S | 10 To the maximum extent permitted by applicable law, 16 To the maximum extent permitted by applicable law, 26 No licenses are granted by implication, estoppel or otherwise under any patents 35 # example) that are referenced by the FPSP package itself in order 448 set dz_bit, 2 # divide by zero 483 set adz_mask, 0x00000010 # accrued divide by zero 915 # from all dyadics by the '0110xxx pattern 1146 # from the FP register file. The instruction is then emulated by # 1147 # choosing an emulation routine from a table of routines indexed by # 1156 # handler loads the packed op (by callin [all...] |
/linux-master/arch/m68k/fpsp040/ |
H A D | stan.S | 9 | by address register a0. 31 | 4. (k is even) Tan(X) = tan(r) and tan(r) is approximated by a 37 | 4. (k is odd) Tan(X) = -cot(r). Since tan(r) is approximated by a 47 | 8. Overwrite X by X := X rem 2Pi. Now that |X| <= Pi, go back to 2. 317 |--case, reduce argument by one remainder step to make subsequent reduction
|
H A D | ssin.S | 10 | by address register a0. 36 | k by k := k + AdjN. 41 | where cos(r) is approximated by an even polynomial in r, 46 | where sin(r) is approximated by an odd polynomial in r 54 | 9. Overwrite X by X := X rem 2Pi. Now that |X| <= Pi, go back to 3. 80 | 8. Overwrite X by X := X rem 2Pi. Now that |X| <= Pi, go back to 2. 386 |--case, reduce argument by one remainder step to make subsequent reduction
|
H A D | scale.S | 5 | scaled by the source operand. If the absolute value of 41 | This entry point is used by the unimplemented instruction exception 297 | by first shifting the bits in the mantissa until it is normalized,
|
H A D | setox.S | 11 | Double-extended value in memory location pointed to by address 71 | in Steps 1.1 and 1.3 can be performed by integer comparison. 86 | Notes: The calculation in 2.2 is really performed by 127 | Step 4. Approximate exp(R)-1 by a polynomial 141 | Step 5. Compute 2^(J/64)*exp(R) = 2^(J/64)*(1+p) by 177 | raised by 7.3. That is the only exception raised by 7.3. 216 | precision prescribed by the user FPCR. 247 | Step 4. Approximate exp(R)-1 by a polynomial 261 | Step 5. Compute 2^(J/64)*p by [all...] |
H A D | do_func.S | 9 | do_func by forcing the default result. Normalized and 99 | by index into tbldo. 154 | [Used by slogn, slognp1, slog10, and slog2] 169 fbeq t_dz2 |if = -1, divide by zero exception
|
H A D | satan.S | 8 | Input: Double-extended value in memory location pointed to by address 30 | Step 3. Approximate arctan(u) by a polynomial poly. 37 | Step 6. Approximate arctan(X) by an odd polynomial in X. Exit. 39 | Step 7. Define X' = -1/X. Approximate arctan(X') by an odd polynomial in X'.
|
/linux-master/arch/x86/crypto/ |
H A D | sha512-ssse3-asm.S | 156 # K[t-1]+W[t-1] which were previously stored at WK_2 by the message 167 # by one tab. Vectored instructions (for the message scheduler) are indented 168 # by two tabs. 274 # The size of the message pointed to by "data" must be an integer multiple 311 # +1 iteration because the scheduler leads hashing by 1 iteration
|
H A D | crc32c-pcl-intel-asm_64.S | 64 # efficient "by-1" code. This "by-1" code only handles up to 255 bytes, so 226 pclmulqdq $0x00, %xmm0, %xmm1 # Multiply by K2 229 pclmulqdq $0x10, %xmm0, %xmm2 # Multiply by K1
|
/linux-master/arch/arm/mm/ |
H A D | cache-v7.S | 32 * the clean + invalidate performed by v7_flush_dcache_all causes a bunch 35 * processor. We fix this by performing an invalidate, rather than a 52 movs r1, r2, lsl r1 @ #1 shifted left by same amount 158 movne r6, r6, lsl r5 @ 1 shifted left by same amount 165 mcr p15, 0, r5, c7, c14, 2 @ clean & invalidate by set/way
|
H A D | cache-v7m.S | 50 * dcisw: Invalidate data cache by set/way 57 * dccisw: Clean and invalidate data cache by set/way 64 * dccimvac: Clean and invalidate data cache line by MVA to PoC. 73 * dcimvac: Invalidate data cache line by MVA to PoC 82 * dccmvau: Clean data cache line by MVA to PoU 89 * dccmvac: Clean data cache line by MVA to PoC 96 * icimvau: Invalidate instruction caches by MVA to PoU 104 * rt data ignored by ICIALLU(IS), so can be used for the address 113 * rt data ignored by BPIALL, so it can be used for the address 211 dccisw r11, r6 @ clean/invalidate by se [all...] |
/linux-master/arch/s390/boot/ |
H A D | head.S | 18 * 5) direct call of start by the SALIPL loader 108 tm 30(%r5),0x0f # by verifying if any of the 215 # this is called either by the ipl loader or directly by PSW restart
|
/linux-master/sound/drivers/ |
H A D | pcmtest.c | 142 static inline void inc_buf_pos(struct pcmtst_buf_iter *v_iter, size_t by, size_t bytes) argument 144 v_iter->total_bytes += by; 145 v_iter->buf_pos += by; 339 * Here we iterate through the buffer by (buffer_size / iterates_per_second) bytes.
|
/linux-master/arch/xtensa/lib/ |
H A D | memset.S | 26 * If destination is unaligned, align it by conditionally 105 bltui a4, 8, .Lbyteset # do short copies byte by byte 123 * Byte by byte set
|
H A D | usercopy.S | 35 * If destination is unaligned, align it by conditionally 90 bltui a4, 7, .Lbytecopy # do short copies byte by byte 102 bltui a4, 6, .Lbytecopy # do short copies byte by byte 113 * Byte by byte copy
|
/linux-master/scripts/package/ |
H A D | kernel.spec | 28 Summary: Header files for the Linux kernel for use by glibc
|
/linux-master/tools/testing/selftests/mm/ |
H A D | run_vmtests.sh | 27 Alternatively, specific groups tests can be run by passing a string 29 separated by spaces:
|
/linux-master/arch/powerpc/boot/ |
H A D | div64.S | 3 * Divide a 64-bit unsigned number by a 32-bit unsigned number. 41 mulhwu r9,r11,r4 # multiply the estimate by the divisor,
|
/linux-master/arch/arm/lib/ |
H A D | csumpartial.S | 74 movne r0, r0, ror #8 @ rotate checksum by 8 bits
|
H A D | backtrace.S | 41 ldr r0, [sp], #4 @ by stmfd for this CPU
|
/linux-master/usr/ |
H A D | gen_initramfs.sh | 18 -o <file> Create initramfs file named <file> by using gen_init_cpio 136 printf "by './' so that it won't be interpreted as an option." >&2 204 "-l") # files included in initramfs - used by kbuild
|
/linux-master/arch/arm/nwfpe/ |
H A D | entry.S | 121 @ is handled by undef hooks.
|