| /external/llvm/test/CodeGen/X86/ |
| atom-bypass-slow-division-64.ll | 15 ; CHECK: divw
29 ; CHECK: divw
42 ; CHECK: divw
46 ; CHECK-NOT: divw
|
| slow-div.ll | 2 ; RUN: llc -mtriple=x86_64-unknown-linux-gnu -mattr=+idivq-to-divw < %s | FileCheck -check-prefix=DIV64 %s
19 ; DIV32-NOT: divw
23 ; DIV64: divw
|
| fast-isel-divrem.ll | 72 ; CHECK: divw
82 ; CHECK: divw
|
| /prebuilts/go/darwin-x86/src/cmd/internal/obj/ppc64/ |
| anames.go | 55 "DIVW",
|
| /prebuilts/go/linux-x86/src/cmd/internal/obj/ppc64/ |
| anames.go | 55 "DIVW",
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/internal/obj/ppc64/ |
| anames.go | 58 "DIVW",
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/internal/obj/ppc64/ |
| anames.go | 58 "DIVW",
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| natconv.go | 343 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
344 // incrementally shortened q for a total of n + (n-1) + (n-2) ... + 2 + 1, or n(n+1)/2 divW()'s.
346 // the size of q. Using the iterative method on both halves means 2 * (n/2)(n/2 + 1)/2 divW()'s
347 // plus the expensive long div(). Asymptotically, the ratio is favorable at 1/2 the divW()'s, and
349 // split would take longer (because of the nat/nat div()) than the twice as many divW()'s of the
392 q, r = q.divW(q, bb)
406 q, r = q.divW(q, bb)
|
| natconv_test.go | 38 q, r = q.divW(q, Word(base))
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/ |
| natconv.go | 340 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
341 // incrementally shortened q for a total of n + (n-1) + (n-2) ... + 2 + 1, or n(n+1)/2 divW()'s.
343 // the size of q. Using the iterative method on both halves means 2 * (n/2)(n/2 + 1)/2 divW()'s
344 // plus the expensive long div(). Asymptotically, the ratio is favorable at 1/2 the divW()'s, and
346 // split would take longer (because of the nat/nat div()) than the twice as many divW()'s of the
389 q, r = q.divW(q, bb)
403 q, r = q.divW(q, bb)
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| natconv.go | 340 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
341 // incrementally shortened q for a total of n + (n-1) + (n-2) ... + 2 + 1, or n(n+1)/2 divW()'s.
343 // the size of q. Using the iterative method on both halves means 2 * (n/2)(n/2 + 1)/2 divW()'s
344 // plus the expensive long div(). Asymptotically, the ratio is favorable at 1/2 the divW()'s, and
346 // split would take longer (because of the nat/nat div()) than the twice as many divW()'s of the
389 q, r = q.divW(q, bb)
403 q, r = q.divW(q, bb)
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| natconv.go | 343 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
344 // incrementally shortened q for a total of n + (n-1) + (n-2) ... + 2 + 1, or n(n+1)/2 divW()'s.
346 // the size of q. Using the iterative method on both halves means 2 * (n/2)(n/2 + 1)/2 divW()'s
347 // plus the expensive long div(). Asymptotically, the ratio is favorable at 1/2 the divW()'s, and
349 // split would take longer (because of the nat/nat div()) than the twice as many divW()'s of the
392 q, r = q.divW(q, bb)
406 q, r = q.divW(q, bb)
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/big/ |
| natconv.go | 340 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
341 // incrementally shortened q for a total of n + (n-1) + (n-2) ... + 2 + 1, or n(n+1)/2 divW()'s.
343 // the size of q. Using the iterative method on both halves means 2 * (n/2)(n/2 + 1)/2 divW()'s
344 // plus the expensive long div(). Asymptotically, the ratio is favorable at 1/2 the divW()'s, and
346 // split would take longer (because of the nat/nat div()) than the twice as many divW()'s of the
389 q, r = q.divW(q, bb)
403 q, r = q.divW(q, bb)
|
| /prebuilts/go/linux-x86/src/math/big/ |
| natconv.go | 340 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
341 // incrementally shortened q for a total of n + (n-1) + (n-2) ... + 2 + 1, or n(n+1)/2 divW()'s.
343 // the size of q. Using the iterative method on both halves means 2 * (n/2)(n/2 + 1)/2 divW()'s
344 // plus the expensive long div(). Asymptotically, the ratio is favorable at 1/2 the divW()'s, and
346 // split would take longer (because of the nat/nat div()) than the twice as many divW()'s of the
389 q, r = q.divW(q, bb)
403 q, r = q.divW(q, bb)
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/internal/obj/x86/ |
| anames.go | 61 "DIVW",
|
| /prebuilts/go/darwin-x86/src/cmd/internal/obj/x86/ |
| anames.go | 58 "DIVW",
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/internal/obj/x86/ |
| anames.go | 61 "DIVW",
|
| /prebuilts/go/linux-x86/src/cmd/internal/obj/x86/ |
| anames.go | 58 "DIVW",
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
| general.s | 169 divw %cx
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/ppc/ |
| 476.s | 100 divw 10,11,12
101 divw. 11,12,13
|
| a2.s | 118 divw. 20,21,22
119 divw 20,21,22
|
| /external/valgrind/none/tests/ppc32/ |
| jm-int.stdout.exp | 42 divw 00000000, 000f423f => 00000000 (00000000 00000000)
43 divw 00000000, ffffffff => 00000000 (00000000 00000000)
44 divw 000f423f, 000f423f => 00000001 (00000000 00000000)
45 divw 000f423f, ffffffff => fff0bdc1 (00000000 00000000)
46 divw ffffffff, 000f423f => 00000000 (00000000 00000000)
47 divw ffffffff, ffffffff => 00000001 (00000000 00000000)
191 divw. 00000000, 000f423f => 00000000 (20000000 00000000)
192 divw. 00000000, ffffffff => 00000000 (20000000 00000000)
193 divw. 000f423f, 000f423f => 00000001 (40000000 00000000)
194 divw. 000f423f, ffffffff => fff0bdc1 (80000000 00000000
[all...] |
| /external/llvm/test/MC/PowerPC/ |
| ppc64-encoding.s | 419 # CHECK-BE: divw 2, 3, 4 # encoding: [0x7c,0x43,0x23,0xd6]
420 # CHECK-LE: divw 2, 3, 4 # encoding: [0xd6,0x23,0x43,0x7c]
421 divw 2, 3, 4
422 # CHECK-BE: divw. 2, 3, 4 # encoding: [0x7c,0x43,0x23,0xd7]
423 # CHECK-LE: divw. 2, 3, 4 # encoding: [0xd7,0x23,0x43,0x7c]
424 divw. 2, 3, 4
[all...] |
| /external/llvm/test/MC/Disassembler/PowerPC/ |
| ppc64-encoding.txt | 328 # CHECK: divw 2, 3, 4
331 # CHECK: divw. 2, 3, 4
|
| ppc64le-encoding.txt | 328 # CHECK: divw 2, 3, 4
331 # CHECK: divw. 2, 3, 4
|
