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
|
#ifndef SOURCE_CC
#define SOURCE_CC
#include "common.cc"
#include "memory.cc"
typedef u32 Source_Id;
struct Span {
String file;
usize start, end;
Span(String file, usize start, usize end) : file(file), start(start), end(end) {}
};
struct Buffer {
String file;
String content;
Link link;
const Allocator* allocator;
usize cursor;
};
bool buffer_init(const Allocator* allocator,
const String* content_in, const String* file_in, Buffer** out) {
assert_neq(allocator, nullptr);
assert_neq(content_in, nullptr);
assert_neq(file_in, nullptr);
assert_neq(out, nullptr);
Buffer* buffer = allocate<Buffer>(allocator, 1);
if(buffer == nullptr) return false;
memset(buffer, 0, sizeof(*buffer));
String content, file;
bool ret = slice_copy(allocator, content_in, &content);
if (unlikely(!ret)) {
deallocate(allocator, (u8*)buffer);
return false;
}
ret = slice_copy(allocator, file_in, &file);
if (unlikely(!ret)) {
slice_deallocate(allocator, &content);
deallocate(allocator, (u8*)buffer);
return false;
}
buffer->file = file;
buffer->content = content;
buffer->allocator = allocator;
*out = buffer;
return true;
}
void buffer_deinit(Buffer* buffer) {
assert_neq(buffer, nullptr);
const Allocator* allocator = buffer->allocator;
if(allocator == nullptr) return;
slice_deallocate(buffer->allocator, &buffer->file);
slice_deallocate(buffer->allocator, &buffer->content);
memset(buffer, 0, sizeof(*buffer));
deallocate(allocator, (u8*)buffer);
}
struct Buffer_Stack {
Link* stack;
};
void buffer_stack_push(Buffer_Stack* manager, Buffer* b) {
assert_neq(manager, nullptr);
assert_neq(b, nullptr);
if (likely(manager->stack != nullptr)) link_after(manager->stack, &b->link);
manager->stack = &b->link;
}
bool buffer_stack_pop(Buffer_Stack* manager, Buffer** b) {
assert_neq(manager, nullptr);
assert_neq(b, nullptr);
Link* link = manager->stack;
if (unlikely(link == nullptr)) return false;
Link* next = link->prev;
link_remove(link);
manager->stack = next;
Buffer* buffer = containerof(Buffer, link, link);
*b = buffer;
return true;
}
#endif
|
