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
|
/* This file is part of the software similarity tester SIM.
Written by Dick Grune, Vrije Universiteit, Amsterdam.
$Id: tokenarray.c,v 1.22 2016-05-29 15:26:50 dick Exp $
*/
#include <stdio.h>
#include <stdlib.h>
#include "sim.h"
#include "Malloc.h"
#include "token.h"
#include "lang.h"
#include "tokenarray.h"
#define Initial_Token_Array_Size 16384
Token *Token_Array; /* to be filled by Malloc() */
static size_t tk_size; /* size of Token_Array[] */
static size_t tk_free; /* next free position in Token_Array[]*/
void
Init_Token_Array(void) {
if (Token_Array) Free(Token_Array);
tk_size = Initial_Token_Array_Size;
Token_Array = (Token *)Malloc(sizeof (Token) * tk_size);
tk_free = 1; /* don't use position 0 */
}
void
Store_Token(Token tk) {
if (tk_free == tk_size) {
/* allocated array is full; try to increase its size */
size_t new_size = tk_size + tk_size/2;
if (new_size < tk_free)
fatal("out of address space");
Token *new_array =
(Token *)TryRealloc(
(char *)Token_Array, sizeof (Token) * new_size
);
if (!new_array) {
/* we failed */
fatal("out of memory: too much text");
}
Token_Array = new_array, tk_size = new_size;
}
/* now we are sure there is room enough */
Token_Array[tk_free++] = tk;
}
void
Free_Token_Array(void) {
if (Token_Array) {
Free(Token_Array); Token_Array = 0;
}
}
size_t
Token_Array_Length(void) {
return tk_free;
}
|
