| 74 | |
| 75 | |
| 76 | void tal_arr_randomize_(void *arr, size_t elemsize) |
| 77 | { |
| 78 | /* Easier arith. */ |
| 79 | char *carr = arr; |
| 80 | size_t n = tal_bytelen(arr) / elemsize; |
| 81 | |
| 82 | assert(tal_bytelen(arr) % elemsize == 0); |
| 83 | |
| 84 | /* From Wikipedia's Fischer-Yates shuffle article: |
| 85 | * |
| 86 | * for i from 0 to n−2 do |
| 87 | * j ← random integer such that i ≤ j < n |
| 88 | * exchange a[i] and a[j] |
| 89 | */ |
| 90 | if (n < 2) |
| 91 | return; |
| 92 | |
| 93 | for (size_t i = 0; i < n - 1; i++) { |
| 94 | size_t j = i + pseudorand(n - i); |
| 95 | char tmp[elemsize]; |
| 96 | |
| 97 | /* Technically, memcpy in place is undefined (src and dest overlap). */ |
| 98 | if (j == i) |
| 99 | continue; |
| 100 | memcpy(tmp, carr + i * elemsize, elemsize); |
| 101 | memcpy(carr + i * elemsize, carr + j * elemsize, elemsize); |
| 102 | memcpy(carr + j * elemsize, tmp, elemsize); |
| 103 | } |
| 104 | } |
nothing calls this directly
no test coverage detected