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
|
/*
* cook - file construction tool
* Copyright (C) 1997 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 manipulate lex filename lists
*/
#include <lex/filename.h>
#include <lex/filenamelist.h>
#include <mem.h>
void
lex_filename_list_constructor(this)
lex_filename_list_ty *this;
{
this->length = 0;
this->maximum = 0;
this->list = 0;
}
lex_filename_list_ty *
lex_filename_list_new()
{
lex_filename_list_ty *this;
this = mem_alloc(sizeof(lex_filename_list_ty));
lex_filename_list_constructor(this);
return this;
}
void
lex_filename_list_destructor(this)
lex_filename_list_ty *this;
{
size_t j;
for (j = 0; j < this->length; ++j)
lex_filename_delete(this->list[j]);
if (this->list)
mem_free(this->list);
this->length = 0;
this->maximum = 0;
this->list = 0;
}
void
lex_filename_list_delete(this)
lex_filename_list_ty *this;
{
lex_filename_list_destructor(this);
mem_free(this);
}
void
lex_filename_list_push_back(this, p)
lex_filename_list_ty *this;
lex_filename_ty *p;
{
if (this->length >= this->maximum)
{
size_t nbytes;
this->maximum = this->maximum * 2 + 4;
nbytes = this->maximum * sizeof(this->list[0]);
this->list = mem_change_size(this->list, nbytes);
}
this->list[this->length++] = p;
}
lex_filename_ty *
lex_filename_list_pop_front(this)
lex_filename_list_ty *this;
{
lex_filename_ty *p;
size_t j;
if (!this->length)
return 0;
p = this->list[0];
for (j = 1; j < this->length; ++j)
this->list[j - 1] = this->list[j];
this->length--;
return p;
}
|