lichen.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

#include "lichen.h"
#include <stdio.h>
#include <string.h>


void li_xorshift32_seed(struct li_xorshift32_t *xor, uint32_t seed) {
  xor->state = seed ? seed : 1;
  xor->generator.rand = li_xorshift32;
  xor->generator.state = &(xor->state);
}


uint32_t li_xorshift32(void *s) {
  uint64_t x = *((uint64_t*)s);
  x ^= x >> 12;
  x ^= x << 25;
  x ^= x >> 27;
  x *= 0x2545F4914F6CDD1DULL;
  *((uint64_t*)s) = x;
  // return just top 32 bits
  return x >> 32;
}


li_llnode_t * li_alloc_llnode() {
  li_llnode_t *n = malloc(sizeof(li_llnode_t));
  if (n == NULL) {
    fprintf(stderr, "failed to allocate linked-list node\n");
    return NULL;
  } else {
    n->tag = 0;
    n->data = 0;
    n->next = NULL;
    return n;
  }
}


li_llnode_t * li_copy_llnode(li_llnode_t *n) {
  li_llnode_t *m = li_alloc_llnode();
  if (m == NULL) {
    return NULL;
  }
  memcpy(m, n, sizeof(li_llnode_t));
  return m;
}

void li_free_llnode(li_llnode_t *n, void (*free_data)(void*)) {
  if (n != NULL) {
    free_data(n->data);
  }
  free(n);
}