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
|
/*
* This file is part of flex.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE.
*/
%{
/* A template scanner file to build "scanner.c".
* The whole idea is to cause memory realloc by
* 1. pushing a lot on the condition stack, and
* 2. eating input greater than YY_BUF_SIZE
*/
#include <stdio.h>
#include <stdlib.h>
#include "config.h"
/* Insanely small read buffer. This pretty much guarantees at least one realloc. */
#ifdef YY_BUF_SIZE
#undef YY_BUF_SIZE
#endif
#define YY_BUF_SIZE 8
%}
%option 8bit prefix="test"
%option nounput nomain noyywrap noinput noyy_top_state
%option warn stack nodefault reentrant
%option noyyalloc noyyrealloc noyyfree
%x parens
%%
<INITIAL>{
"(" { printf("yy_push_state(parens)\n"); yy_push_state(parens,yyscanner); }
len=[0-9]+ { printf("About read token where %s\n",yytext); }
0+ { }
.|\n { }
}
<parens>{
"(" { printf("yy_push_state(parens)\n"); yy_push_state(parens,yyscanner); }
")" { printf("yy_pop_state()\n");yy_pop_state(yyscanner);}
[^()\n]+ { }
.|\n { }
}
%%
/* total memory allocated */
static size_t total_mem=0;
/* track the amount of memory for ptr. */
struct memsz {
void* p;
size_t sz;
};
static struct memsz * ptrs=0; /* Array of pairs. */
static int nptrs=0; /* Number of pairs in array. */
static int arrsz=0; /* Capacity of array. */
static void dump_mem(FILE* fp){
int i;
fprintf(fp,"\tptrs[%d] = {", nptrs);
for (i=0; i < arrsz; i++)
fprintf(fp," {%#lx,%ld},", (long)ptrs[i].p, (long)ptrs[i].sz);
fprintf(fp,"}\n");
}
void * testalloc(yy_size_t n , void* yyscanner)
{
(void)yyscanner;
void * p;
int i;
total_mem += n;
p = malloc(n);
if( nptrs >= arrsz){
/* increase array size by 1 */
arrsz++;
ptrs = realloc(ptrs, (size_t) arrsz * sizeof(struct memsz));
ptrs[nptrs].p = 0;
ptrs[nptrs].sz = 0;
}
/* find a null slot */
for(i=0; i < arrsz ; i++)
if (ptrs[i].p == 0) {
ptrs[i].p = p;
ptrs[i].sz = n;
}
nptrs++;
printf("yyflex_alloc(%8ld) total=%8ld return=%#10lx\n",(long)n,(long)total_mem,(long)p);
dump_mem(stdout);
return p;
}
void * testrealloc(void* p, yy_size_t n , void* yyscanner)
{
(void)yyscanner;
int i;
for (i=0; i < arrsz; i++)
if ( ptrs[i].p == p){
total_mem -= ptrs[i].sz;
total_mem += n;
ptrs[i].p = realloc(p, n);
ptrs[i].sz = n;
printf("yyflex_realloc(%#10lx,%8ld) total=%8ld return=%8lx\n",
(long)p,(long)n,(long)total_mem,(long)ptrs[i].p);
dump_mem(stdout);
return ptrs[i].p;
}
fprintf(stderr,"ERROR: yyflex_realloc could not locate pointer %#lx.\n",(long)p);
dump_mem(stdout);
exit(1);
}
void testfree(void* p , void* yyscanner)
{
(void)yyscanner;
int i;
for (i=0; i < arrsz; i++)
if ( ptrs[i].p == p){
total_mem -= ptrs[i].sz;
free(p);
ptrs[i].p = 0;
ptrs[i].sz = 0;
nptrs--;
printf("yyflex_free(%#10lx) total=%8ld\n",(long)p,(long)total_mem);
dump_mem(stdout);
return;
}
fprintf(stderr,"ERROR: yyflex_free could not locate pointer %#lx.\n",(long)p);
dump_mem(stdout);
exit(1);
}
int main(void);
int
main (void)
{
yyscan_t scanner;
arrsz = 1;
ptrs = calloc(1, sizeof(struct memsz));
nptrs = 0;
testlex_init(&scanner);
testset_in(stdin,scanner);
testset_out(stdout,scanner);
testlex(scanner);
testlex_destroy(scanner);
free(ptrs);
if ( nptrs > 0 || total_mem > 0){
fprintf(stderr,"Oops. Looks like a memory leak: nptrs=%d, unfreed memory=%ld\n",nptrs,(long)total_mem);
exit(1);
}
printf("TEST RETURNING OK.\n");
return 0;
}
|
