Skip to content

Commit 71a206f

Browse files
Merge #194: extrakeys: rename swap/swap64 to fix OpenBSD 7.1 compilation
db64847 extrakeys: rename swap/swap64 to fix OpenBSD 7.1 compilation (Jon Griffiths) Pull request description: OpenBSD defines swap64 in <endian.h>. ACKs for top commit: real-or-random: ACK db64847 jonasnick: ACK db64847 Tree-SHA512: a3bf4175918c06457ec941eb029fded98d367c82a352024a9f96919219cc494e40f96e090dc03b73d0d22b99374f0656f27b755a56caebcd5df27efbd978fd56
2 parents 7a30cb0 + db64847 commit 71a206f

File tree

1 file changed

+7
-7
lines changed

1 file changed

+7
-7
lines changed

src/modules/extrakeys/hsort_impl.h

+7-7
Original file line numberDiff line numberDiff line change
@@ -23,20 +23,20 @@ static SECP256K1_INLINE size_t child2(size_t i) {
2323
return child1(i)+1;
2424
}
2525

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) {
2727
unsigned char tmp[64];
2828
VERIFY_CHECK(stride <= 64);
2929
memcpy(tmp, a + i*stride, stride);
3030
memmove(a + i*stride, a + j*stride, stride);
3131
memcpy(a + j*stride, tmp, stride);
3232
}
3333

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) {
3535
while (64 < stride) {
36-
swap64(a + (stride - 64), i, j, 64);
36+
heap_swap64(a + (stride - 64), i, j, 64);
3737
stride -= 64;
3838
}
39-
swap64(a, i, j, stride);
39+
heap_swap64(a, i, j, stride);
4040
}
4141

4242
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
7171
if (child2(i) < heap_size
7272
&& 0 <= cmp(a + child2(i)*stride, a + child1(i)*stride, cmp_data)) {
7373
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);
7575
i = child2(i);
7676
} else {
7777
/* 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
8080
return;
8181
}
8282
} 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);
8484
i = child1(i);
8585
} else {
8686
return;
@@ -106,7 +106,7 @@ static void secp256k1_hsort(void *ptr, size_t count, size_t size,
106106
}
107107
for(i = count; 1 < i; --i) {
108108
/* Extract the largest value from the heap */
109-
swap(ptr, 0, i-1, size);
109+
heap_swap(ptr, 0, i-1, size);
110110

111111
/* Repair the heap condition */
112112
heap_down(ptr, 0, i-1, size, cmp, cmp_data);

0 commit comments

Comments
 (0)