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
|
// Code generated by command: go run sort_asm.go -pkg qsort -out ../qsort/sort_amd64.s -stubs ../qsort/sort_amd64.go. DO NOT EDIT.
//go:build !purego
package qsort
//go:noescape
func distributeForward64(data []uint64, scratch []uint64, limit int, lo int, hi int) int
//go:noescape
func distributeBackward64(data []uint64, scratch []uint64, limit int, lo int, hi int) int
//go:noescape
func insertionsort128NoSwap(data []struct {
hi uint64
lo uint64
}, base int, swap func(int, int))
//go:noescape
func distributeForward128(data []struct {
hi uint64
lo uint64
}, scratch []struct {
hi uint64
lo uint64
}, limit int, lo int, hi int) int
//go:noescape
func distributeBackward128(data []struct {
hi uint64
lo uint64
}, scratch []struct {
hi uint64
lo uint64
}, limit int, lo int, hi int) int
//go:noescape
func insertionsort256NoSwap(data []struct {
a uint64
b uint64
c uint64
d uint64
}, base int, swap func(int, int))
//go:noescape
func distributeForward256(data []struct {
a uint64
b uint64
c uint64
d uint64
}, scratch []struct {
a uint64
b uint64
c uint64
d uint64
}, limit int, lo int, hi int) int
//go:noescape
func distributeBackward256(data []struct {
a uint64
b uint64
c uint64
d uint64
}, scratch []struct {
a uint64
b uint64
c uint64
d uint64
}, limit int, lo int, hi int) int
|