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
|
/*
* awka.c --- some speciallized memory allocation routines
*
* $Log: awka.c,v $
* Revision 1.2 89/03/31 13:26:15 david
* GNU license
*
* Revision 1.1 89/03/22 21:04:00 david
* Initial revision
*
*/
/*
* Copyright (C) 1986, 1988, 1989 the Free Software Foundation, Inc.
*
* This file is part of GAWK, the GNU implementation of the
* AWK Progamming Language.
*
* GAWK 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 1, or (at your option)
* any later version.
*
* GAWK 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 GAWK; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "awk.h"
#define NODECHUNK 50
NODE *nextfree = NULL;
NODE *lastfree = NULL;
NODE *
newnode(ty)
NODETYPE ty;
{
NODE *it;
NODE *np;
if (nextfree == lastfree) {
emalloc(nextfree, NODE *, NODECHUNK * sizeof(NODE), "newnode");
for (np = nextfree; np < &nextfree[NODECHUNK - 1]; np++)
np->nextp = np + 1;
np->nextp = lastfree;
lastfree = np;
}
it = nextfree;
nextfree = nextfree->nextp;
it->type = ty;
it->flags = MALLOC;
return it;
}
freenode(it)
NODE *it;
{
lastfree->nextp = it;
it->nextp = NULL;
lastfree = it;
}
|
