@@ -23,20 +23,20 @@ static SECP256K1_INLINE size_t child2(size_t i) {
23
23
return child1 (i )+ 1 ;
24
24
}
25
25
26
- static SECP256K1_INLINE void swap64 (unsigned char * a , size_t i , size_t j , size_t stride ) {
26
+ static SECP256K1_INLINE void heap_swap64 (unsigned char * a , size_t i , size_t j , size_t stride ) {
27
27
unsigned char tmp [64 ];
28
28
VERIFY_CHECK (stride <= 64 );
29
29
memcpy (tmp , a + i * stride , stride );
30
30
memmove (a + i * stride , a + j * stride , stride );
31
31
memcpy (a + j * stride , tmp , stride );
32
32
}
33
33
34
- static SECP256K1_INLINE void swap (unsigned char * a , size_t i , size_t j , size_t stride ) {
34
+ static SECP256K1_INLINE void heap_swap (unsigned char * a , size_t i , size_t j , size_t stride ) {
35
35
while (64 < stride ) {
36
- swap64 (a + (stride - 64 ), i , j , 64 );
36
+ heap_swap64 (a + (stride - 64 ), i , j , 64 );
37
37
stride -= 64 ;
38
38
}
39
- swap64 (a , i , j , stride );
39
+ heap_swap64 (a , i , j , stride );
40
40
}
41
41
42
42
static SECP256K1_INLINE void heap_down (unsigned char * a , size_t i , size_t heap_size , size_t stride ,
@@ -71,7 +71,7 @@ static SECP256K1_INLINE void heap_down(unsigned char *a, size_t i, size_t heap_s
71
71
if (child2 (i ) < heap_size
72
72
&& 0 <= cmp (a + child2 (i )* stride , a + child1 (i )* stride , cmp_data )) {
73
73
if (0 < cmp (a + child2 (i )* stride , a + i * stride , cmp_data )) {
74
- swap (a , i , child2 (i ), stride );
74
+ heap_swap (a , i , child2 (i ), stride );
75
75
i = child2 (i );
76
76
} else {
77
77
/* At this point we have [child2(i)] >= [child1(i)] and we have
@@ -80,7 +80,7 @@ static SECP256K1_INLINE void heap_down(unsigned char *a, size_t i, size_t heap_s
80
80
return ;
81
81
}
82
82
} else if (0 < cmp (a + child1 (i )* stride , a + i * stride , cmp_data )) {
83
- swap (a , i , child1 (i ), stride );
83
+ heap_swap (a , i , child1 (i ), stride );
84
84
i = child1 (i );
85
85
} else {
86
86
return ;
@@ -106,7 +106,7 @@ static void secp256k1_hsort(void *ptr, size_t count, size_t size,
106
106
}
107
107
for (i = count ; 1 < i ; -- i ) {
108
108
/* Extract the largest value from the heap */
109
- swap (ptr , 0 , i - 1 , size );
109
+ heap_swap (ptr , 0 , i - 1 , size );
110
110
111
111
/* Repair the heap condition */
112
112
heap_down (ptr , 0 , i - 1 , size , cmp , cmp_data );
0 commit comments