summaryrefslogtreecommitdiff
path: root/token.c
blob: dbe4125ff7d9f064853e993aeef406789c91ad88 (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
#include "token.h"
#include "slice.h"
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>

Token *
token_create(Slice slice, unsigned int type)
{
	Token *token = malloc(sizeof(Token));
	if (token == NULL) {
		perror("token_create:malloc");
		return NULL;
	}
	token->slice = slice;
	token->type = type;
	token->string_ptr = 0;
	token->prev = NULL;
	token->next = NULL;
	return token;
}

void
token_destroy(Token *token)
{
	while (token != NULL) {
		Token *next = token->next;
		if (token->type == TOK_GROUP) {
			token_destroy(token->group.tokens);
			token_destroy(token->group.scope);
		}
		free(token);
		token = next;
	}
}

Token *
token_append(Token **list, Token *elem)
{
	if (*list == NULL) {
		*list = elem;
		return *list;
	}

	Token *end = token_last(*list);
	end->next = elem;
	elem->prev = end;
	return *list;
}

Token *
token_prepend(Token **list, Token *elem)
{
	elem->next = *list;
	if (*list)
		(*list)->prev = elem;
	*list = elem;
	return *list;
}

void
token_delete(Token **list, Token *elem)
{
	token_extract(list, elem);
	free(elem);
}

Token *
token_extract(Token **list, Token *elem)
{
	if (elem->prev != NULL)
		elem->prev->next = elem->next;
	if (elem->next != NULL)
		elem->next->prev = elem->prev;
	if (*list == elem)
		*list = elem->next;
	elem->prev = NULL;
	elem->next = NULL;
	return elem;
}

Token *
token_search(Token *list, unsigned int type)
{
	while (list != NULL) {
		if (list->type == type)
			return list;
		list = list->next;
	}
	return NULL;
}

Token *
token_search_closing(Token *list, unsigned int type, unsigned int opn)
{
	int count = 0;
	while (list != NULL) {
		if (list->type == opn)
			count += 1;
		if (list->type == type) {
			count -= 1;
			if (count <= 0)
				return list;
		}
		list = list->next;
	}
	return NULL;
}

Token *
token_print(Token *token, int recurse, int depth)
{
	Token *tok = token;
	while (token != NULL) {
		for (int i = 0; i < depth * 2; i++)
			putchar(' ');
		if (token->type == TOK_GROUP) {
			printf("type: TOK_GROUP  group.type: %c\n",
			       token->group.type);
			if (token->group.scope != NULL)
				token_print(token->group.scope, 1, depth);
			token_print(token->group.tokens, 1, depth + 1);
		} else {
			printf("type: %c  slice: \"", token->type);
			slice_write(token->slice);
			printf("\"");
			if (token->type == TOK_STRING)
				printf("  string_ptr: %ld", token->string_ptr);
			printf("\n");
		}
		if (!recurse)
			return tok;
		token = token->next;
	}
	return tok;
}

int
token_isgroup(Token *token, unsigned int type)
{
	return (token->type == TOK_GROUP && token->group.type == type);
}

int
token_len(Token *token)
{
	int len = 0;
	while (token != NULL) {
		len += 1;
		token = token->next;
	}
	return len;
}

Token *
token_last(Token *token)
{
	if (token == NULL)
		return NULL;
	while (token->next != NULL)
		token = token->next;
	return token;
}