summaryrefslogtreecommitdiff
path: root/src/libdisfluid/disfluid-cache-group.h
blob: b0a94af0156df733c6cdbda8ed0a623be8ec8f10 (plain)
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
#ifndef DISFLUID_DISFLUID_CACHE_GROUP_INCLUDED
# define DISFLUID_DISFLUID_CACHE_GROUP_INCLUDED

# include <config.h>
# include "string-desc.h"
# include <stdbool.h>

MAYBE_UNUSED static int
ao_cache_group_read (int fd, size_t offset,
		     size_t *n_entries, size_t **entry_offsets);

MAYBE_UNUSED static int
ao_cache_group_push (int fd, size_t *offset,
		     size_t n_entries, const size_t *entry_offsets);

MAYBE_UNUSED static int
ao_cache_group_invalidate (int fd, size_t offset, size_t *invalidated_offset);

# include "disfluid-append-only-file.h"
# include "safe-alloc.h"

/* The cache group is organized as follows:

   - on 8 bytes, the number of entries,
   - on 8 bytes, the offset of the entry array.
 */

static int
ao_cache_group_read (int fd,
		     size_t offset, size_t *n_entries, size_t **entry_offsets)
{
  uint8_t header[16];
  string_desc_t header_desc = {
    ._nbytes = sizeof (header),
    ._data = header
  };
  *n_entries = 0;
  *entry_offsets = NULL;
  size_t array_offset = 0;
  if (ao_file_read (fd, offset, header_desc) < 0)
    {
      return -1;
    }
  for (size_t i = 0; i < 8; i++)
    {
      *n_entries *= 256;
      *n_entries += header[i];
    }
  for (size_t i = 8; i < 16; i++)
    {
      array_offset *= 256;
      array_offset += header[i];
    }
  uint8_t *array_data = NULL;
  if (ALLOC_N (array_data, *n_entries * 8) < 0
      || ALLOC_N (*entry_offsets, *n_entries) < 0)
    {
      FREE (array_data);
      FREE (*entry_offsets);
      return -1;
    }
  string_desc_t array_desc = {
    ._nbytes = *n_entries * 8,
    ._data = array_data
  };
  if (ao_file_read (fd, array_offset, array_desc) < 0)
    {
      FREE (array_data);
      FREE (*entry_offsets);
      return -1;
    }
  for (size_t i = 0; i < *n_entries; i++)
    {
      (*entry_offsets)[i] = 0;
      for (size_t j = i * 8; j < (i + 1) * 8; j++)
	{
	  (*entry_offsets)[i] *= 256;
	  (*entry_offsets)[i] += array_data[j];
	}
    }
  FREE (array_data);
  return 0;
}

static int
ao_cache_group_push (int fd,
		     size_t *offset,
		     size_t n_entries, const size_t *entry_offsets)
{
  uint8_t *array_data = NULL;
  if (ALLOC_N (array_data, n_entries * 8) < 0)
    {
      return -1;
    }
  for (size_t i = 0; i < n_entries; i++)
    {
      size_t offset = entry_offsets[i];
      for (size_t j = 8 * (i + 1); j-- > 8 * i;)
	{
	  array_data[j] = offset % 256;
	  offset /= 256;
	}
    }
  string_desc_t array_desc = {
    ._nbytes = n_entries * 8,
    ._data = array_data
  };
  size_t array_offset;
  if (ao_file_push_data (fd, array_desc, &array_offset) < 0)
    {
      FREE (array_data);
      return -1;
    }
  FREE (array_data);
  uint8_t header_data[16] = { 0 };
  for (size_t i = 8; i-- > 0;)
    {
      header_data[i] = n_entries % 256;
      n_entries /= 256;
    }
  for (size_t i = 16; i-- > 8;)
    {
      header_data[i] = array_offset % 256;
      array_offset /= 256;
    }
  string_desc_t header_desc = {
    ._nbytes = 16,
    ._data = header_data
  };
  return ao_file_push_data (fd, header_desc, offset);
}

MAYBE_UNUSED static int
ao_cache_group_invalidate (int fd, size_t offset, size_t *invalidated_offset)
{
  size_t n_entries = 42;
  size_t *offsets = NULL;
  int error = ao_cache_group_read (fd, offset, &n_entries, &offsets);
  if (error != 0)
    {
      FREE (offsets);
      return -1;
    }
  bool changed = false;
  for (size_t i = 0; i < n_entries; i++)
    {
      size_t old_offset = offsets[i];
      size_t new_offset = 42;
      if (ao_cache_entry_invalidate (fd, old_offset, &new_offset) < 0)
	{
	  FREE (offsets);
	  return -1;
	}
      if (old_offset != new_offset)
	{
	  changed = true;
	}
      offsets[i] = new_offset;
    }
  if (changed)
    {
      if (ao_cache_group_push (fd, invalidated_offset, n_entries, offsets) <
	  0)
	{
	  FREE (offsets);
	  return -1;
	}
    }
  else
    {
      *invalidated_offset = offset;
    }
  FREE (offsets);
  return 0;
}

#endif /* DISFLUID_DISFLUID_CACHE_GROUP_INCLUDED */