#include <assert.h>
// Set the elements between buf[start] and buf[stop-1] to (i+value)%256
-void set(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
+static void set(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
for(size_t i = start; i < stop; i++) {
buf[i] = (i+value)%256;
}
}
// Return the number of times that an element is equal to (i+value)%256 between buf[start] and buf[stop-1].
-int count_all(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
+static int count_all(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
size_t occ = 0;
for(size_t i = start ; i < stop ; i++) {
if(buf[i] == (i+value)%256) {
}
// Return true iff the values from buf[start] to buf[stop-1] are all equal to (i+value)%256.
-int check_all(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
+static int check_all(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
size_t occ = count_all(buf, start, stop, value);
return occ == stop-start;
}
// Return true iff "enough" elements are equal to (i+value)%256 between buf[start] and buf[stop-1].
-int check_enough(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
+static int check_enough(uint8_t *buf, size_t start, size_t stop, uint8_t value) {
int page_size = 0x1000;
size_t size = stop-start;
if(size <= 2*page_size) // we are not sure to have a whole page that is shared