[go: up one dir, main page]

File: stracc.c

package info (click to toggle)
cook 2.10-1
  • links: PTS
  • area: main
  • in suites: potato
  • size: 6,856 kB
  • ctags: 3,842
  • sloc: ansic: 47,714; sh: 12,150; makefile: 4,317; yacc: 3,104; awk: 154
file content (227 lines) | stat: -rw-r--r-- 4,439 bytes parent folder | download | duplicates (4)
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
/*
 *	cook - file construction tool
 *	Copyright (C) 1998 Peter Miller;
 *	All rights reserved.
 *
 *	This program is free software; you can redistribute it and/or modify
 *	it under the terms of the GNU General Public License as published by
 *	the Free Software Foundation; either version 2 of the License, or
 *	(at your option) any later version.
 *
 *	This program is distributed in the hope that it will be useful,
 *	but WITHOUT ANY WARRANTY; without even the implied warranty of
 *	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *	GNU General Public License for more details.
 *
 *	You should have received a copy of the GNU General Public License
 *	along with this program; if not, write to the Free Software
 *	Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
 *
 * MANIFEST: functions to accumulate strings
 */

#include <ac/string.h>

#include <mem.h>
#include <stracc.h>
#include <trace.h>


void
stracc_constructor(sap)
	stracc		*sap;
{
	sap->sa_max = 0;
	sap->sa_len = 0;
	sap->sa_buf = 0;
	sap->sa_inuse = 0;
}


stracc *
stracc_new()
{
	stracc		*sap;

	sap = mem_alloc(sizeof(stracc));
	stracc_constructor(sap);
	return sap;
}


void
stracc_destructor(sap)
	stracc		*sap;
{
	assert(!sap->sa_inuse);
	if (sap->sa_buf)
		mem_free(sap->sa_buf);
	sap->sa_max = 0;
	sap->sa_len = 0;
	sap->sa_buf = 0;
	sap->sa_inuse = 0;
}


/*
 * NAME
 *	sa_open - start accumulating a string.
 *
 * SYNOPSIS
 *	void sa_open(stracc *);
 *
 * DESCRIPTION
 *	Sa_open begins accumulating a string for the lexical analyser.
 *	This allows virtually infinite length constructs within the
 *	lexical analyser.
 */

void
sa_open(sap)
	stracc		*sap;
{
	trace(("sa_open()\n{\n"/*}*/));
	assert(!sap->sa_inuse);
	sap->sa_inuse = 1;
	sap->sa_len = 0;
	trace((/*{*/"}\n"));
}


/*
 * NAME
 *	sa_char - add a character to the accumulating string
 *
 * SYNOPSIS
 *	void sa_char(stracc *, int c);
 *
 * DESCRIPTION
 *	Sa_char adds a character to the accumulating string.
 *
 * CAVEAT
 *	Sa_open must have been called previously.
 */

void
sa_char(sap, c)
	stracc		*sap;
	int		c;
{
	trace(("sa_char(c = '%c')\n{\n"/*}*/, c));
	assert(sap->sa_inuse);
	if (sap->sa_len >= sap->sa_max)
	{
		sap->sa_max = sap->sa_max * 2 + 16;
		sap->sa_buf = mem_change_size(sap->sa_buf, sap->sa_max);
	}
	sap->sa_buf[sap->sa_len++] = c;
	trace((/*{*/"}\n"));
}


/*
 * NAME
 *	sa_close - finish accumulating a string
 *
 * SYNOPSIS
 *	string_ty *sa_close(stracc *);
 *
 * DESCRIPTION
 *	Sa_close finished accumulating a string and
 *	returns a pointer to the string in dynamic memory.
 *
 * CAVEAT
 *	Sa_open must have been called previously.
 *
 *	The value returned by this function is allocated in dynamic memory.
 *	It is the responsibility of the caller to ensure that it is freed when
 *	finished with, by a call to str_free().
 */

string_ty *
sa_close(sap)
	stracc		*sap;
{
	string_ty	*val;

	trace(("sa_close()\n{\n"/*}*/));
	assert(sap->sa_inuse);
	val = str_n_from_c(sap->sa_buf, sap->sa_len);
	sap->sa_inuse = 0;
	trace(("return %08lX;\n", val));
	trace((/*{*/"}\n"));
	return val;
}


/*
 * NAME
 *	sa_mark - mark place when accumulating a string
 *
 * SYNOPSIS
 *	size_t sa_mark(stracc *);
 *
 * DESACRIPTION
 *	Sa_mark returns an indicator as to where the string being accumulated
 *	is up to.
 *
 * CAVEAT
 *	Sa_open must have been called previously.
 *	Do not use the returned value for anything other than passing to
 *	sa_goto as an argument.
 */

size_t
sa_mark(sap)
	stracc		*sap;
{
	assert(sap->sa_inuse);
	return (sap->sa_len);
}


/*
 * NAME
 *	sa_goto - shorten the accumulated string
 *
 * SYNOPSIS
 *	void sa_goto(stracc *, size_t mark);
 *
 * DESACRIPTION
 *	Sa_goto shotens the accumulating string to a point
 *	previously determined by sa_mark.
 *
 * CAVEAT
 *	Sa_open must have been called previously.
 *	The mark argument must have previously been returned by sa_mark,
 *	and sa_close not called in the interim.
 */

void
sa_goto(sap, n)
	stracc		*sap;
	size_t		n;
{
	assert(sap->sa_inuse);
	assert(n <= sap->sa_len);
	sap->sa_len = n;
}


void
sa_chars(sap, cp, len)
	stracc		*sap;
	const char	*cp;
	size_t		len;
{
	trace(("sa_chars()\n{\n"/*}*/));
	assert(sap->sa_inuse);
	while (sap->sa_len + len > sap->sa_max)
	{
		sap->sa_max = sap->sa_max * 2 + 16;
		sap->sa_buf = mem_change_size(sap->sa_buf, sap->sa_max);
	}
	memcpy(sap->sa_buf + sap->sa_len, cp, len);
	sap->sa_len += len;
	trace((/*{*/"}\n"));
}