-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjournal_kv.c
More file actions
140 lines (131 loc) · 3.06 KB
/
Copy pathjournal_kv.c
File metadata and controls
140 lines (131 loc) · 3.06 KB
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
#define _POSIX_C_SOURCE 200809L
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
typedef struct {
uint32_t klen;
uint32_t vlen;
} rec_hdr_t;
typedef struct {
char *key;
char *val;
} kv_t;
typedef struct {
kv_t *items;
size_t len;
size_t cap;
} kv_map_t;
static void map_init(kv_map_t *m)
{
m->items = NULL;
m->len = 0;
m->cap = 0;
}
static void map_set(kv_map_t *m, const char *k, const char *v)
{
for (size_t i = 0; i < m->len; i++) {
if (strcmp(m->items[i].key, k) == 0) {
free(m->items[i].val);
m->items[i].val = strdup(v);
return;
}
}
if (m->len == m->cap) {
size_t ncap = m->cap ? m->cap * 2 : 8;
kv_t *ni = realloc(m->items, ncap * sizeof(kv_t));
if (!ni) return;
m->items = ni;
m->cap = ncap;
}
m->items[m->len].key = strdup(k);
m->items[m->len].val = strdup(v);
m->len++;
}
static void map_free(kv_map_t *m)
{
for (size_t i = 0; i < m->len; i++) {
free(m->items[i].key);
free(m->items[i].val);
}
free(m->items);
}
static int journal_append(int fd, const char *k, const char *v)
{
rec_hdr_t h;
h.klen = (uint32_t)strlen(k);
h.vlen = (uint32_t)strlen(v);
if (write(fd, &h, sizeof h) != (ssize_t)sizeof h) return -1;
if (write(fd, k, h.klen) != (ssize_t)h.klen) return -1;
if (write(fd, v, h.vlen) != (ssize_t)h.vlen) return -1;
if (fsync(fd) < 0) return -1;
return 0;
}
static int journal_replay(int fd, kv_map_t *m)
{
lseek(fd, 0, SEEK_SET);
rec_hdr_t h;
for (;;) {
ssize_t n = read(fd, &h, sizeof h);
if (n == 0) break;
if (n != (ssize_t)sizeof h) return -1;
char *k = malloc(h.klen + 1);
char *v = malloc(h.vlen + 1);
if (!k || !v) {
free(k);
free(v);
return -1;
}
if (read(fd, k, h.klen) != (ssize_t)h.klen) {
free(k);
free(v);
return -1;
}
if (read(fd, v, h.vlen) != (ssize_t)h.vlen) {
free(k);
free(v);
return -1;
}
k[h.klen] = 0;
v[h.vlen] = 0;
map_set(m, k, v);
free(k);
free(v);
}
return 0;
}
int main(void)
{
const char *path = "journal_kv.log";
int fd = open(path, O_WRONLY | O_CREAT | O_APPEND, 0644);
if (fd < 0) {
perror("open");
return 1;
}
journal_append(fd, "user", "alice");
journal_append(fd, "mode", "debug");
journal_append(fd, "user", "bob");
close(fd);
fd = open(path, O_RDONLY);
if (fd < 0) {
perror("open");
return 1;
}
kv_map_t m;
map_init(&m);
if (journal_replay(fd, &m) < 0) {
perror("journal_replay");
close(fd);
return 1;
}
close(fd);
for (size_t i = 0; i < m.len; i++) {
printf("%s=%s\n", m.items[i].key, m.items[i].val);
}
map_free(&m);
return 0;
}