-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.cpp
70 lines (57 loc) · 1.49 KB
/
node.cpp
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
//
// Jisp - main.cpp
//
// Copyright (C) 1998-2017, James Anhalt III, All Rights Reserved
//
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#include "main.h"
#include "node.h"
struct TYPE {
ULONG size;
ULONG node;
ULONG used;
NODE *free;
PAGE *page;
};
#define NODESIZE(t) (sizeof(((NODE *)0)->t))
TYPE types[NT_LAST] = {
{ NODESIZE(free) },
{ NODESIZE(list) },
{ NODESIZE(text) },
{ NODESIZE(math) },
{ NODESIZE(name) },
{ NODESIZE(call) },
{ NODESIZE(call) },
{ NODESIZE(user) },
{ NODESIZE(user) },
{ NODESIZE(bind) },
{ NODESIZE(file) },
{ NODESIZE(fail) },
{ NODESIZE(hash) },
};
NODE *nodeGet(int type)
{
if ((unsigned)type >= NT_LAST)
return 0;
types[type].used += 1;
if (types[type].free != 0) {
NODE *node = types[type].free;
types[type].free = node->free.next;
node->free.next = 0;
return (node);
}
if (types[type].node == 0) {
PAGE *page = (PAGE *)VirtualAllocEx(GetCurrentProcess(), NULL, PAGE_SIZE, MEM_COMMIT, PAGE_READWRITE);
if (page == 0)
return 0;
page->head.type = type;
page->head.next = types[type].page;
types[type].page = page;
types[type].node = sizeof(page->head);
};
NODE *node = (NODE *)&types[type].page->data[types[type].node];
types[type].node += types[type].size;
if ((types[type].node + types[type].size) > PAGE_SIZE) types[type].node = 0;
return (node);
}