1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77
78. 78
79. 79
80. 80
81. 81
82. 82
83. 83
84. 84
85. 85

//+build !noasm,!appengine,gc

// Copyright (c) 2020 MinIO Inc. All rights reserved.
// Use of this source code is governed by a license that can be
// found in the LICENSE file.

package md5simd

// Helper struct for sorting blocks based on length
type lane struct {
	len uint
	pos uint
}

type digest struct {
	s [4]uint32
}

// Helper struct for generating number of rounds in combination with mask for valid lanes
type maskRounds struct {
	mask   uint64
	rounds uint64
}

func generateMaskAndRounds8(input [8][]byte, mr *[8]maskRounds) (rounds int) {
	// Sort on blocks length small to large
	var sorted [8]lane
	for c, inpt := range input[:] {
		sorted[c] = lane{uint(len(inpt)), uint(c)}
		for i := c - 1; i >= 0; i-- {
			// swap so largest is at the end...
			if sorted[i].len > sorted[i+1].len {
				sorted[i], sorted[i+1] = sorted[i+1], sorted[i]
				continue
			}
			break
		}
	}

	// Create mask array including 'rounds' (of processing blocks of 64 bytes) between masks
	m, round := uint64(0xff), uint64(0)

	for _, s := range sorted[:] {
		if s.len > 0 {
			if uint64(s.len)>>6 > round {
				mr[rounds] = maskRounds{m, (uint64(s.len) >> 6) - round}
				rounds++
			}
			round = uint64(s.len) >> 6
		}
		m = m & ^(1 << uint(s.pos))
	}
	return
}

func generateMaskAndRounds16(input [16][]byte, mr *[16]maskRounds) (rounds int) {
	// Sort on blocks length small to large
	var sorted [16]lane
	for c, inpt := range input[:] {
		sorted[c] = lane{uint(len(inpt)), uint(c)}
		for i := c - 1; i >= 0; i-- {
			// swap so largest is at the end...
			if sorted[i].len > sorted[i+1].len {
				sorted[i], sorted[i+1] = sorted[i+1], sorted[i]
				continue
			}
			break
		}
	}

	// Create mask array including 'rounds' (of processing blocks of 64 bytes) between masks
	m, round := uint64(0xffff), uint64(0)

	for _, s := range sorted[:] {
		if s.len > 0 {
			if uint64(s.len)>>6 > round {
				mr[rounds] = maskRounds{m, (uint64(s.len) >> 6) - round}
				rounds++
			}
			round = uint64(s.len) >> 6
		}
		m = m & ^(1 << uint(s.pos))
	}
	return
}