|
607
|
1 /* Micro-C Preprocessor Part */
|
|
327
|
2
|
|
607
|
3 /************************************************************************
|
|
|
4 ** Copyright (C) 2006 Shinji Kono
|
|
|
5 ** 連絡先： 琉球大学情報工学科 河野 真治
|
|
|
6 ** （E-Mail Address: kono@ie.u-ryukyu.ac.jp）
|
|
|
7 **
|
|
|
8 ** このソースのいかなる複写，改変，修正も許諾します。ただし、
|
|
|
9 ** その際には、誰が貢献したを示すこの部分を残すこと。
|
|
|
10 ** 再配布や雑誌の付録などの問い合わせも必要ありません。
|
|
|
11 ** 営利利用も上記に反しない範囲で許可します。
|
|
|
12 ** バイナリの配布の際にはversion messageを保存することを条件とします。
|
|
|
13 ** このプログラムについては特に何の保証もしない、悪しからず。
|
|
|
14 **
|
|
|
15 ** Everyone is permitted to do anything on this program
|
|
|
16 ** including copying, modifying, improving,
|
|
|
17 ** as long as you don't try to pretend that you wrote it.
|
|
|
18 ** i.e., the above copyright notice has to appear in all copies.
|
|
|
19 ** Binary distribution requires original version messages.
|
|
|
20 ** You don't have to ask before copying, redistribution or publishing.
|
|
|
21 ** THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
|
|
|
22 ***********************************************************************/
|
|
327
|
23 #include <stdio.h>
|
|
|
24 #include "mc.h"
|
|
|
25 #include "mc-parse.h"
|
|
|
26 #include "mc-macro.h"
|
|
456
|
27 #include "mc-codegen.h"
|
|
327
|
28 #include "mc-code.h"
|
|
705
|
29 #include "mc-inline.h"
|
|
327
|
30
|
|
|
31 extern struct {int fd,ln;char *name0;int inc;FILE *fcb;} *filep,filestack[FILES];
|
|
|
32
|
|
|
33 int in_macro_if = 0;
|
|
|
34 char *chinput;
|
|
721
|
35 int macro_history = 0;
|
|
|
36 int macro_history_save = 0;
|
|
327
|
37
|
|
|
38 static int mconcat=0;
|
|
|
39
|
|
|
40 static void macro_define0();
|
|
346
|
41 static int macro_args(char **pchptr);
|
|
327
|
42 static int macro_function(int macrop,char **pchptr,NMTBL *nptr,int history);
|
|
|
43 static void local_define(char *macro,char *value);
|
|
|
44 static int macro_eval(int macrop,char *body0,int history);
|
|
553
|
45 static char * mappend0(int lists,char **result);
|
|
327
|
46 static int macro_processing();
|
|
|
47
|
|
561
|
48 /*
|
|
712
|
49 nptr->dsp
|
|
|
50 list3s(MACRO,arg,char*)
|
|
|
51
|
|
|
52 list3s(STRING,next,char*)
|
|
|
53 */
|
|
|
54
|
|
|
55 /*
|
|
561
|
56
|
|
|
57 macro_expansion(NMTBL *nptrm)
|
|
|
58 innput macro term (and chptr for arguments)
|
|
|
59 result put into cheap, and chptr is set.
|
|
|
60 current ch and chptr are pushed into chptr stack.
|
|
327
|
61
|
|
561
|
62 ## concatenation requires repeated replace.
|
|
|
63
|
|
|
64 In macro_function and macro_eavl,
|
|
|
65 expand result is put into macrop local variable.
|
|
712
|
66 list3s(STRING,next,char*)
|
|
561
|
67 to generate result, mappend/reverse0 is necessary.
|
|
|
68
|
|
363
|
69 */
|
|
|
70
|
|
327
|
71 extern void
|
|
|
72 macro_expansion(NMTBL *nptrm)
|
|
|
73 {
|
|
|
74 int i = mode;
|
|
|
75 int macrop = 0;
|
|
|
76 int slfree = lfree;
|
|
540
|
77 int c;
|
|
|
78 char *macropp,*s,*t;
|
|
346
|
79 struct cheap scheap;
|
|
327
|
80 mode = STAT;
|
|
|
81
|
|
346
|
82 save_cheap(&scheap,cheap);
|
|
721
|
83 // save recursive macro list
|
|
|
84 macro_history_save = glist2(macro_history,macro_history_save);
|
|
346
|
85
|
|
625
|
86 // call macro evaluation interpreter
|
|
327
|
87 if (nptrm->sc == FMACRO) {
|
|
721
|
88 macrop=macro_function(macrop,&chptr,nptrm,macro_history);
|
|
327
|
89 } else {
|
|
721
|
90 macrop=macro_eval(macrop,scaddr(nptrm->dsp),macro_history);
|
|
327
|
91 }
|
|
625
|
92
|
|
|
93 // copy output from resulted listed string
|
|
|
94
|
|
347
|
95 cheap = reset_cheap(&scheap);
|
|
346
|
96 macropp = cheap->ptr;
|
|
561
|
97 // append result override, working cheap, but it's OK.
|
|
553
|
98 mappend0(reverse0(macrop),¯opp);
|
|
564
|
99 // cheap->ptr[-1] ='\n'; // makes some tokenize happy
|
|
|
100 // ## macro_result needs \n at end
|
|
|
101 cheap->ptr[-1] = 0; // makes some tokenize happy
|
|
|
102 t = cheap->ptr-2;
|
|
346
|
103 cheap->ptr[0] =0;
|
|
540
|
104 cheap = increment_cheap(cheap,¯opp);
|
|
625
|
105
|
|
|
106 // if we have ## (concatenation),
|
|
|
107 // remove \s**##\s*
|
|
|
108 // it is difficult to remove former space on the fly,
|
|
|
109 // so multi path loop is required
|
|
|
110
|
|
327
|
111 while (mconcat) {
|
|
|
112 // ## re-eval macro
|
|
540
|
113 // if (lsrc) printf("## before %s",macropp);
|
|
327
|
114 mconcat = 0;
|
|
|
115 macrop = 0;
|
|
540
|
116 for(s=t=macropp;*s;) {
|
|
|
117 if ((c=*s++)=='#'&&*s=='#') {
|
|
|
118 if (t>s-3) t=s-2; else t--;
|
|
|
119 while(*t<=' '&&t>macropp) t--; t++;
|
|
|
120 for(s++;*s && *s<=' ';) s++;
|
|
|
121 continue;
|
|
|
122 }
|
|
|
123 *t++=c;
|
|
|
124 }
|
|
|
125 *t++=0;
|
|
561
|
126 // evaluate generated result again
|
|
660
|
127 // if (0 && lsrc) {
|
|
|
128 // printf("### %s\n",macropp);
|
|
|
129 // if (t[-2]!='\n') putchar('\n');
|
|
|
130 // }
|
|
721
|
131 macrop=macro_eval(macrop,macropp,macro_history);
|
|
347
|
132 cheap = reset_cheap(&scheap);
|
|
346
|
133 macropp = cheap->ptr;
|
|
347
|
134 // will not override evaled list
|
|
553
|
135 mappend0(reverse0(macrop),¯opp);
|
|
564
|
136 // cheap->ptr[-1] ='\n';
|
|
|
137 cheap->ptr[-1] =0;
|
|
346
|
138 cheap->ptr[0] =0;
|
|
540
|
139 cheap = increment_cheap(cheap,¯opp);
|
|
327
|
140 }
|
|
346
|
141 cheap = reset_cheap(&scheap);
|
|
561
|
142 // genrated macro will be overwrited by cheap, but it's OK, again
|
|
327
|
143 mconcat = 0;
|
|
447
|
144 set_lfree(slfree);
|
|
690
|
145 #if 0
|
|
|
146 if (lsrc && !asmf && nptrm->sc==FMACRO) {
|
|
|
147 gen_comment(macropp);
|
|
|
148 if (0 && t[-2]!='\n') putchar('\n');
|
|
|
149 }
|
|
|
150 #endif
|
|
561
|
151 // push previous chptr, and change it to the generate macro
|
|
712
|
152 chptrsave = glist3s(STRING,chptrsave,chptr); // push old one into the stack
|
|
327
|
153 chsave = glist2(ch,chsave);
|
|
346
|
154 chptr = macropp;
|
|
327
|
155 ch = *chptr++;
|
|
|
156 mode = i;
|
|
|
157 }
|
|
|
158
|
|
|
159 /* file inclusion */
|
|
|
160
|
|
363
|
161 /*
|
|
|
162 file name concatenation
|
|
561
|
163 on cheap
|
|
363
|
164 */
|
|
|
165
|
|
327
|
166 static char *
|
|
346
|
167 expand_file_name(char *path,char *name)
|
|
327
|
168 {
|
|
346
|
169 char *p = cheap->ptr;
|
|
|
170 if (! *path) return name;
|
|
|
171 while(( *cheap->ptr = *path++ )) cheap = increment_cheap(cheap,&p);
|
|
|
172 if (cheap->ptr[-1]!='/') {
|
|
|
173 *cheap->ptr = '/'; cheap = increment_cheap(cheap,&p);
|
|
|
174 }
|
|
|
175 while(( *cheap->ptr = *name++ )) cheap = increment_cheap(cheap,&p);
|
|
351
|
176 *cheap->ptr = 0;
|
|
|
177 cheap = increment_cheap(cheap,&p);
|
|
327
|
178 return p;
|
|
|
179 }
|
|
|
180
|
|
363
|
181 /*
|
|
625
|
182 internal string compare routine
|
|
|
183 nameeq in mc-parse.c relies on
|
|
|
184 global name variable
|
|
|
185 */
|
|
|
186
|
|
|
187 static int
|
|
|
188 nameeq(char *p, char *q)
|
|
|
189 {
|
|
|
190 if (!p)
|
|
|
191 return 0;
|
|
|
192 while(*p)
|
|
|
193 if(*p++ != *q++) return 0;
|
|
|
194 return (*q==0);
|
|
|
195 }
|
|
|
196
|
|
|
197 /*
|
|
|
198 file name expansion
|
|
|
199
|
|
|
200 Get file name from input stream.
|
|
|
201 Result is store in filep structure.
|
|
|
202 included file is put on the filep stack
|
|
|
203 return filep
|
|
|
204
|
|
|
205 filename is copied into cheap
|
|
|
206
|
|
|
207 possibly expanded by search path (including current
|
|
|
208 directory ).
|
|
|
209
|
|
363
|
210 get file name
|
|
|
211 <name> => name
|
|
|
212 current_file_name_dir / name
|
|
|
213 libdir / name
|
|
|
214 "name" => name
|
|
|
215 current_file_name_dir / name
|
|
|
216 include_path / name
|
|
561
|
217 (no difference?)
|
|
|
218 next flag ignores the first occurence.
|
|
363
|
219 */
|
|
|
220
|
|
540
|
221
|
|
327
|
222 static FILE *
|
|
469
|
223 getfname(int next)
|
|
327
|
224 {
|
|
|
225 int i,end='"',err=0;
|
|
673
|
226 char *s,*p,**pp,*name,*prev=0;
|
|
327
|
227 FILE *fp;
|
|
346
|
228 struct cheap scheap;
|
|
|
229 name = cheap->ptr;
|
|
327
|
230
|
|
|
231 getch();
|
|
|
232 if(skipspc()=='"') { end = '"';
|
|
|
233 } else if (ch=='<') { end = '>';
|
|
|
234 } else { error(INCERR); err=1;
|
|
|
235 }
|
|
|
236 for(i=0;(getch()!=end && ch!='\n');) {
|
|
346
|
237 *cheap->ptr = ch;
|
|
|
238 cheap = increment_cheap(cheap,&name);
|
|
327
|
239 }
|
|
|
240 if(ch=='\n') error(INCERR);
|
|
|
241 if (err) return filep->fcb;
|
|
351
|
242 *cheap->ptr = 0;
|
|
|
243 cheap = increment_cheap(cheap,&name);
|
|
|
244 save_cheap(&scheap,cheap);
|
|
327
|
245 fp = fopen(name,"r") ;
|
|
540
|
246 if (next && fp) { fclose(fp); fp=0; next=0; prev=name; }
|
|
713
|
247 p = name;
|
|
|
248 if (!fp) {
|
|
556
|
249 // no deferenced on "" and <>?
|
|
|
250 for(pp=include_path; *pp;pp++) {
|
|
346
|
251 p = expand_file_name(*pp,name);
|
|
540
|
252 if(prev && nameeq(p,prev)) continue;
|
|
469
|
253 if ((fp = fopen(p,"r"))) {
|
|
|
254 if (next) {
|
|
540
|
255 fclose(fp); fp=0; next=0; prev=p;
|
|
469
|
256 continue;
|
|
|
257 } else
|
|
|
258 break ;
|
|
|
259 }
|
|
327
|
260 }
|
|
556
|
261 if (!fp /* && (end=='>'||filep->inc=='>') */ ) { // <> case only
|
|
539
|
262 for(pp=l_include_path; *pp;pp++) {
|
|
|
263 p = expand_file_name(*pp,name);
|
|
540
|
264 if(prev && nameeq(p,prev)) continue;
|
|
539
|
265 if ((fp = fopen(p,"r"))) {
|
|
|
266 if (next) {
|
|
540
|
267 fclose(fp); fp=0; next=0; prev=p;
|
|
539
|
268 continue;
|
|
|
269 } else
|
|
|
270 break ;
|
|
|
271 }
|
|
|
272 }
|
|
|
273 }
|
|
327
|
274 }
|
|
|
275 if(!fp) { error(FILERR); return filep->fcb; }
|
|
561
|
276 // we have so search current directory of the included file
|
|
|
277 // keep track the name
|
|
327
|
278 copy_current_file_dir(s=p);
|
|
351
|
279 // File name determined. Dispose extra copies.
|
|
|
280 cheap = reset_cheap(&scheap);
|
|
561
|
281 // Generated name needs copy.
|
|
346
|
282 if (p!=name) {
|
|
|
283 name = cheap->ptr;
|
|
|
284 while((*cheap->ptr = *s++)) cheap = increment_cheap(cheap,&name);
|
|
351
|
285 *cheap->ptr = 0;
|
|
|
286 cheap = increment_cheap(cheap,&name);
|
|
346
|
287 }
|
|
625
|
288 // should check filep over flow (sigh...)
|
|
327
|
289 (filep+1)->inc = end;
|
|
346
|
290 (filep+1)->name0 = name;
|
|
327
|
291 return ( (filep+1)->fcb = fp );
|
|
|
292 }
|
|
|
293
|
|
|
294 /* line input and conversion */
|
|
|
295
|
|
|
296 static int macro_if_depth ;
|
|
|
297 static int macro_if_current ;
|
|
|
298 static int macro_if_skip ;
|
|
|
299
|
|
363
|
300 /* there may extra non-terminate comment after #if/#else directive */
|
|
364
|
301 /* #endif / * hoge */
|
|
363
|
302 /* */
|
|
|
303 /* */
|
|
|
304
|
|
327
|
305 static int
|
|
|
306 skip_rest_of_line()
|
|
|
307 {
|
|
|
308 getch();
|
|
|
309 do {
|
|
|
310 while(ch!='\n'&&ch!='\r') {
|
|
|
311 if (!in_comment) {
|
|
|
312 if (ch=='/') {
|
|
|
313 getch();
|
|
|
314 if (ch=='/') in_comment=2;
|
|
|
315 else if (ch=='*') {
|
|
|
316 in_comment=1;
|
|
|
317 } else continue;
|
|
|
318 }
|
|
|
319 } else if (ch=='*') {
|
|
|
320 getch();
|
|
|
321 if (ch=='/') {
|
|
|
322 in_comment=0;
|
|
|
323 return macro_if_skip?0:1;
|
|
|
324 }
|
|
|
325 else continue;
|
|
|
326 }
|
|
|
327 getch();
|
|
|
328 }
|
|
|
329 if (in_comment==1) { getline(); getch(); }
|
|
|
330 } while(in_comment==1);
|
|
|
331 in_comment=0;
|
|
|
332 return 0;
|
|
|
333 }
|
|
|
334
|
|
363
|
335 /*
|
|
|
336 getline from chptr or chinput (for internal source)
|
|
|
337 with macro processing
|
|
561
|
338 generate comment
|
|
|
339 generate ST_COMMENT parse tree, in inline mode
|
|
|
340 In getch, if chptr is empty, pop chptr stack, if stack is empy
|
|
|
341 read from fp.
|
|
363
|
342 */
|
|
|
343
|
|
343
|
344 static int next_eof;
|
|
560
|
345 struct cheap *st_cheap, *cheap1;
|
|
|
346 // ST_COMMENT may interfere with other inrement_cheap, so we use
|
|
|
347 // another cheap area.
|
|
343
|
348
|
|
327
|
349 extern void
|
|
|
350 getline(void)
|
|
|
351 {
|
|
|
352 int i;
|
|
648
|
353 int c = 0;
|
|
625
|
354 char num[10]; // for 32bit
|
|
609
|
355 char *p;
|
|
327
|
356
|
|
343
|
357 if (next_eof) {
|
|
|
358 next_eof=0;
|
|
|
359 error(EOFERR);
|
|
|
360 }
|
|
327
|
361 do {
|
|
|
362 if (chinput) {
|
|
625
|
363 // some another input source ( init string )
|
|
327
|
364 if (! *chinput) {
|
|
|
365 chinput=0;
|
|
|
366 continue;
|
|
|
367 }
|
|
|
368 chptr=linebuf;
|
|
|
369 i=0;
|
|
|
370 while((*chptr++=c=*chinput++)&&(c!='\n')) {
|
|
|
371 if (++i > LBUFSIZE-2) error(LNERR);
|
|
|
372 }
|
|
|
373 } else {
|
|
625
|
374 // get the line from input stream
|
|
327
|
375 lineno++;
|
|
|
376 glineno++;
|
|
|
377 chptr=linebuf;
|
|
|
378 i=0;
|
|
|
379 while ((*chptr++ = c = getc(filep->fcb)) != '\n') {
|
|
|
380 if (++i > LBUFSIZE-2) error(LNERR);
|
|
609
|
381 if (c=='\r') {
|
|
|
382 c = getc(filep->fcb);
|
|
|
383 if (c == '\n') {
|
|
|
384 chptr[-1]='\n'; break;
|
|
|
385 } else {
|
|
|
386 // single cr equal to nl
|
|
|
387 ungetc(c,filep->fcb);
|
|
|
388 chptr[-1]=c='\n'; i--; break;
|
|
|
389 }
|
|
|
390 }
|
|
327
|
391 if (c==EOF) {
|
|
343
|
392 next_eof=1;
|
|
|
393 --chptr;
|
|
|
394 break;
|
|
327
|
395 }
|
|
|
396 }
|
|
|
397 }
|
|
625
|
398
|
|
327
|
399 *chptr = '\0';
|
|
455
|
400 if (lsrc && !asmf && !macro_if_skip && linebuf[0]) {
|
|
714
|
401 if (!inmode)
|
|
|
402 gen_comment(linebuf); // #if ed line will not be commented
|
|
455
|
403 if (inmode) {
|
|
561
|
404 // inline mode
|
|
625
|
405
|
|
|
406 // generate inlined line in assembler output
|
|
|
407
|
|
455
|
408 int i=0;
|
|
|
409 int c;
|
|
560
|
410 // should be done in some init
|
|
|
411 if (!st_cheap) {
|
|
|
412 st_cheap = cheap1 = new_cheap();
|
|
|
413 }
|
|
|
414
|
|
|
415 p = st_cheap->ptr;
|
|
455
|
416 sprintf(num,"%d: ",lineno);
|
|
713
|
417 parse = list4n(ST_COMMENT,parse,lineno,(NMTBL*)p);
|
|
509
|
418 // should contain file name
|
|
455
|
419 c = 0;
|
|
560
|
420 while((*st_cheap->ptr = num[c++]))
|
|
|
421 st_cheap = increment_cheap(st_cheap,&p);
|
|
|
422 while((c = *st_cheap->ptr = linebuf[i++])) {
|
|
|
423 st_cheap = increment_cheap(st_cheap,&p);
|
|
455
|
424 if (c=='\n') {
|
|
560
|
425 *st_cheap->ptr = 0;
|
|
|
426 st_cheap = increment_cheap(st_cheap,&p);
|
|
|
427 p = st_cheap->ptr;
|
|
711
|
428 // parse = list3n(ST_COMMENT,parse,(NMTBL*)p);
|
|
455
|
429 sprintf(num,"%d: ",lineno);
|
|
|
430 c = 0;
|
|
|
431 while((*cheap->ptr = num[c++]))
|
|
560
|
432 st_cheap = increment_cheap(st_cheap,&p);
|
|
455
|
433 }
|
|
|
434 }
|
|
|
435 }
|
|
|
436 }
|
|
609
|
437 p = chptr = linebuf; while(*p==' '||*p=='\t') p++;
|
|
|
438 if (*p == '#' && !in_comment && !in_quote) {
|
|
625
|
439 // macro directive
|
|
609
|
440 chptr = p;
|
|
327
|
441 if (macro_processing()) return;
|
|
|
442 }
|
|
647
|
443 if (c==EOF) break;
|
|
327
|
444 } while(!in_quote && (macro_if_skip || linebuf[0] == '#'));
|
|
|
445 }
|
|
|
446
|
|
|
447 /* preprocessor directive */
|
|
|
448
|
|
|
449 /* line continuation \\ */
|
|
|
450
|
|
|
451 extern void
|
|
|
452 check_macro_eof()
|
|
|
453 {
|
|
|
454 int c;
|
|
346
|
455 // can't be in macro expansion
|
|
327
|
456 for(c=0;c<LBUFSIZE-3&&chptr[c];c++);
|
|
|
457 if (c>0&&chptr[c-1]=='\\') {
|
|
|
458 return;
|
|
|
459 } else if (c>0&&chptr[c-1]=='\n') {
|
|
|
460 if (c>0&&chptr[c-2]=='\\') {
|
|
|
461 return;
|
|
|
462 } else {
|
|
|
463 c--;
|
|
|
464 }
|
|
|
465 }
|
|
|
466 chptr[c] = ';';
|
|
|
467 chptr[c+1] = '\n';
|
|
|
468 chptr[c+2] = 0;
|
|
|
469 }
|
|
|
470
|
|
363
|
471 /* #if hoge case */
|
|
|
472
|
|
327
|
473 static void
|
|
|
474 macro_if()
|
|
|
475 {
|
|
599
|
476 int i,stype=type; // expr destroy type
|
|
327
|
477 ch= *chptr;
|
|
599
|
478 in_macro_if = 1; // makes undefined symbol==list2(CONST,0)
|
|
327
|
479 check_macro_eof();
|
|
|
480 getsym(0);
|
|
|
481 /* i=cexpr(expr(1)); #if allow undefined symbols.. */
|
|
|
482 i=expr(1);
|
|
705
|
483 if (inmode) i = pexpr(i); // it contain const value only
|
|
327
|
484 in_macro_if = 0;
|
|
|
485 if (car(i)==CONST) i=cadr(i);
|
|
|
486 else i=0;
|
|
|
487 if (ch) {
|
|
|
488 if (chptr[-1]==ch) {
|
|
|
489 /* we are fall into getch(), which lost the last ch */
|
|
|
490 /* chptr[-1]==ch check is fanatic, but ... */
|
|
|
491 chptr--;
|
|
|
492 } else error(-1);
|
|
|
493 }
|
|
|
494 macro_if_depth = macro_if_current;
|
|
|
495 macro_if_skip = !i;
|
|
591
|
496 type=stype;
|
|
327
|
497 }
|
|
|
498
|
|
625
|
499 /*
|
|
|
500 Macro directive
|
|
|
501
|
|
|
502 implemented in simple hash
|
|
|
503
|
|
|
504 */
|
|
|
505
|
|
327
|
506 static int
|
|
|
507 macro_processing()
|
|
|
508 {
|
|
|
509 int i;
|
|
569
|
510 int c=0;
|
|
327
|
511 int mode_save;
|
|
469
|
512 int next;
|
|
327
|
513
|
|
|
514 ++chptr;
|
|
|
515 while (*chptr==' '||*chptr=='\t') ++chptr;
|
|
361
|
516 switch(chptr[0]*chptr[1]) {
|
|
|
517 case 'i'*'f':
|
|
|
518 if ((macroeq("ifdef") || macroeq("ifndef"))) {
|
|
|
519 c = (chptr[-4]=='n');
|
|
|
520 macro_if_current++;
|
|
|
521 if (!macro_if_skip) {
|
|
561
|
522 // try getsym in IFDEF mode to avoid symbol define
|
|
361
|
523 mode_save = mode; mode = IFDEF;
|
|
|
524 ch= *chptr;
|
|
|
525 i = getsym(0);
|
|
|
526 mode = mode_save;
|
|
|
527 macro_if_depth = macro_if_current;
|
|
|
528 macro_if_skip = (!i)^c;
|
|
|
529 }
|
|
327
|
530 return 0;
|
|
361
|
531 } else if (macroeq("if")) {
|
|
|
532 macro_if_current++;
|
|
|
533 if (!macro_if_skip) {
|
|
|
534 macro_if();
|
|
327
|
535 }
|
|
|
536 return 0;
|
|
|
537 }
|
|
361
|
538 break;
|
|
|
539 case 'e'*'l':
|
|
|
540 if (macroeq("elif")) {
|
|
|
541 if (macro_if_current==0) {
|
|
|
542 error(MCERR); /* extra #else */
|
|
|
543 return 0;
|
|
|
544 }
|
|
|
545 if (macro_if_current == macro_if_depth) {
|
|
|
546 if (!macro_if_skip || macro_if_skip==2) {
|
|
|
547 macro_if_skip=2;
|
|
|
548 return 0;
|
|
|
549 }
|
|
|
550 macro_if();
|
|
|
551 }
|
|
|
552 return 0;
|
|
|
553 } else if (macroeq("else")) {
|
|
|
554 if (macro_if_current==0) {
|
|
|
555 error(MCERR); /* extra #else */
|
|
327
|
556 return 0;
|
|
|
557 }
|
|
361
|
558 if (macro_if_current == macro_if_depth) {
|
|
|
559 if (macro_if_skip==2) ;
|
|
|
560 else if (macro_if_skip) macro_if_skip=0;
|
|
|
561 else macro_if_skip=1;
|
|
|
562 }
|
|
|
563 return skip_rest_of_line();
|
|
327
|
564 }
|
|
361
|
565 break;
|
|
|
566 case 'e'*'n':
|
|
|
567 if (macroeq("endif")) {
|
|
|
568 if (macro_if_current == macro_if_depth) {
|
|
|
569 macro_if_skip = 0;
|
|
|
570 macro_if_depth = --macro_if_current;
|
|
|
571 } else {
|
|
|
572 if (macro_if_current<=0) {
|
|
|
573 error(MCERR); /* extra #if */
|
|
|
574 return 0;
|
|
|
575 }
|
|
|
576 macro_if_current--;
|
|
|
577 }
|
|
|
578 return skip_rest_of_line();
|
|
|
579 }
|
|
327
|
580 }
|
|
|
581 if (macro_if_skip) return 0;
|
|
361
|
582 switch(chptr[0]) {
|
|
|
583 case 'd':
|
|
|
584 if (macroeq("define")) {
|
|
|
585 ch= *chptr;
|
|
|
586 macro_define0();
|
|
|
587 *(chptr = linebuf) = '\0';
|
|
|
588 return 0;
|
|
|
589 }
|
|
|
590 break;
|
|
|
591 case 'u':
|
|
|
592 if (macroeq("undef")) {
|
|
|
593 i=mode;
|
|
|
594 mode=IFDEF;
|
|
|
595 ch= *chptr;
|
|
|
596 if (getsym(0)) {
|
|
561
|
597 // make it EMPTY
|
|
361
|
598 if (nptr->sc == MACRO) {
|
|
|
599 nptr->sc = EMPTY;
|
|
|
600 } else if (nptr->sc == FMACRO) {
|
|
|
601 nptr->sc = EMPTY;
|
|
|
602 /* we cannot reclaim it's arg */
|
|
|
603 } else error(MCERR);
|
|
|
604 }
|
|
|
605 mode=i;
|
|
|
606 return 0;
|
|
327
|
607 }
|
|
361
|
608 break;
|
|
|
609 case 'i':
|
|
469
|
610 next = 1;
|
|
|
611 if (macroeq("include_next")|| (next=0, macroeq("include"))) {
|
|
361
|
612 if(filep+1 >= filestack + FILES) error(FILERR);
|
|
469
|
613 if ( ((filep+1)->fcb=getfname(next)) == NULL) error(FILERR);
|
|
361
|
614 (filep+1)->ln=lineno;
|
|
|
615 lineno=0;
|
|
|
616 ++filep;
|
|
|
617 *(chptr = linebuf) = '\0';
|
|
|
618 return 0;
|
|
|
619 }
|
|
|
620 break;
|
|
609
|
621 case 'p':
|
|
|
622 if (macroeq("pragma")) {
|
|
|
623 getline();
|
|
|
624 return 0;
|
|
|
625 }
|
|
|
626 break;
|
|
327
|
627 #if ASM_CODE
|
|
561
|
628 // deprecated, use asm function
|
|
361
|
629 case 'a':
|
|
609
|
630 if (macroeq("asm")) {
|
|
361
|
631 if (asmf) error(MCERR);
|
|
|
632 asmf = 1;
|
|
327
|
633 getline();
|
|
361
|
634 while (asmf) {
|
|
561
|
635 printf("%s",linebuf);
|
|
361
|
636 getline();
|
|
|
637 }
|
|
|
638 return 0;
|
|
327
|
639 }
|
|
361
|
640 break;
|
|
|
641 case 'e':
|
|
|
642 if (macroeq("endasm")) {
|
|
|
643 if (!asmf) error(MCERR);
|
|
|
644 asmf = 0;
|
|
|
645 return 0;
|
|
|
646 }
|
|
|
647 break;
|
|
327
|
648 #endif
|
|
609
|
649 case ' ': case '\t': case '\n': case 0:
|
|
327
|
650 getline();
|
|
361
|
651 return 0;
|
|
|
652 }
|
|
|
653 error(MCERR);
|
|
327
|
654 return 0;
|
|
|
655 }
|
|
|
656
|
|
|
657 extern int
|
|
|
658 macroeq(char *s)
|
|
|
659 {
|
|
|
660 char *p;
|
|
|
661
|
|
|
662 for (p = chptr; *s;) if (*s++ != *p++) return 0;
|
|
|
663 chptr = p;
|
|
|
664 return 1;
|
|
|
665 }
|
|
|
666
|
|
|
667 /* macro interpreter */
|
|
|
668
|
|
561
|
669 /* generate macro define */
|
|
|
670
|
|
327
|
671 extern void
|
|
|
672 macro_define(char *macro)
|
|
|
673 {
|
|
|
674 char *chptr_save;
|
|
|
675 int chsave;
|
|
|
676
|
|
|
677 chptr_save = chptr;
|
|
|
678 chsave = ch;
|
|
|
679 chptr = macro;
|
|
|
680 ch= *chptr++;
|
|
|
681 macro_define0();
|
|
|
682 chptr = chptr_save;
|
|
|
683 ch = chsave;
|
|
|
684 }
|
|
|
685
|
|
625
|
686 /* macro define from chptr
|
|
|
687
|
|
|
688 body will be copied and stored in nptr->dsp
|
|
712
|
689 list3s( STRING, list of argments (if any), char *)
|
|
625
|
690 We don't expand macro here, it just copied.
|
|
|
691
|
|
|
692 */
|
|
363
|
693
|
|
327
|
694 static void
|
|
|
695 macro_define0()
|
|
|
696 {
|
|
|
697 int i,args,c;
|
|
346
|
698 char **body;
|
|
327
|
699
|
|
|
700 i=mode;
|
|
|
701 mode=MDECL;
|
|
|
702 // ch= *chptr; ??
|
|
|
703 // fprintf(stderr,"macro def: ch %c *chptr %c\n",ch,*chptr);
|
|
|
704 getsym(0);
|
|
|
705 // fprintf(stderr,"macro def: %s =>",name);
|
|
|
706 if (nptr->sc != EMPTY) { /* override existing macro */
|
|
|
707 }
|
|
|
708 args = 0;
|
|
|
709 if (ch=='(') {
|
|
|
710 nptr->sc = FMACRO;
|
|
346
|
711 args = macro_args(&chptr);
|
|
327
|
712 } else {
|
|
|
713 nptr->sc = MACRO;
|
|
|
714 nptr->ty = -1;
|
|
|
715 }
|
|
|
716 // equal is allowed for -Dhoge=aho option
|
|
534
|
717 // if (ch=='=') chptr++;
|
|
327
|
718 while((c=*chptr)==' '||c=='\t') chptr++;
|
|
712
|
719 nptr->dsp = list3s(MACRO,args,cheap->ptr); /* macro body */
|
|
|
720 body = (char **)&scaddr(nptr->dsp);
|
|
561
|
721
|
|
|
722 // now copy it to the body
|
|
346
|
723 while ((*cheap->ptr = c = *chptr++)
|
|
327
|
724 && c != '\n') {
|
|
346
|
725 cheap = increment_cheap(cheap,body);
|
|
327
|
726 if (c=='/'&&chptr[0]=='/') {
|
|
351
|
727 cheap->ptr--;
|
|
|
728 *cheap->ptr = '\0';
|
|
|
729 while(*chptr++); break;
|
|
327
|
730 } else if (c=='/'&&chptr[0]=='*') {
|
|
346
|
731 cheap->ptr--; chptr++;
|
|
614
|
732 for(;;) {
|
|
|
733 c = *chptr++;
|
|
|
734 if (!c) {
|
|
|
735 getline();
|
|
|
736 continue;
|
|
|
737 }
|
|
327
|
738 if (c=='*'&&chptr[0]=='/') {
|
|
|
739 c = *chptr++; break;
|
|
|
740 }
|
|
|
741 }
|
|
|
742 if (!c) break;
|
|
|
743 } else if (c=='\\' && (*chptr=='\n'||*chptr==0)) {
|
|
|
744 chptr++;
|
|
346
|
745 cheap->ptr--;
|
|
327
|
746 getline();
|
|
|
747 }
|
|
|
748 }
|
|
346
|
749 if (c=='\n') {
|
|
|
750 *cheap->ptr = '\0';
|
|
|
751 }
|
|
|
752 cheap = increment_cheap(cheap,body);
|
|
327
|
753 // fprintf(stderr,"%s\n",(char *)car(nptr->dsp));
|
|
|
754 mode=i;
|
|
|
755 }
|
|
|
756
|
|
|
757 // create function macro argument list
|
|
|
758 // return list2((char*)arg,next)
|
|
625
|
759 // it can be sepearted by \ or comments
|
|
|
760 // no expansion
|
|
327
|
761
|
|
|
762 static int
|
|
346
|
763 macro_args(char **pchptr)
|
|
327
|
764 {
|
|
|
765 int c;
|
|
|
766 int in_quote = 0;
|
|
|
767 int in_wquote = 0;
|
|
|
768 int plevel = 0;
|
|
346
|
769 char **body;
|
|
327
|
770 char *chptr = *pchptr;
|
|
712
|
771 int args = glist3s(STRING,0,cheap->ptr);
|
|
|
772 body = (char **)&scaddr(args);
|
|
327
|
773 for(;;) {
|
|
346
|
774 *cheap->ptr = c = *chptr++;
|
|
|
775 cheap = increment_cheap(cheap,body);
|
|
539
|
776 if (c=='\\') {
|
|
|
777 if (*chptr=='\n') {
|
|
|
778 cheap->ptr--;
|
|
|
779 getline();
|
|
|
780 chptr = *pchptr;
|
|
|
781 continue;
|
|
|
782 }
|
|
|
783 }
|
|
327
|
784 if (!c) {
|
|
|
785 chptr--;
|
|
|
786 error(MCERR);
|
|
|
787 *pchptr = chptr;
|
|
|
788 return reverse0(args);
|
|
|
789 }
|
|
|
790 if (in_quote) {
|
|
|
791 if (c=='\\') {
|
|
|
792 if (*chptr != '\n') {
|
|
346
|
793 *cheap->ptr = *chptr++;
|
|
|
794 cheap = increment_cheap(cheap,body);
|
|
327
|
795 } else {
|
|
|
796 getline();
|
|
539
|
797 chptr = *pchptr;
|
|
327
|
798 }
|
|
|
799 } else if (c=='\'') {
|
|
|
800 in_quote = 0;
|
|
|
801 }
|
|
|
802 } else if (in_wquote) {
|
|
|
803 if (c=='\\') {
|
|
|
804 if (*chptr !='\n') {
|
|
346
|
805 *cheap->ptr = *chptr++;
|
|
|
806 cheap = increment_cheap(cheap,body);
|
|
327
|
807 } else {
|
|
346
|
808 *cheap->ptr = '\n';
|
|
327
|
809 getline();
|
|
539
|
810 chptr = *pchptr;
|
|
327
|
811 }
|
|
|
812 } else if (c=='"') {
|
|
|
813 in_wquote = 0;
|
|
|
814 }
|
|
|
815 } else if (c=='"') {
|
|
|
816 in_wquote = 1;
|
|
|
817 } else if (c=='\'') {
|
|
|
818 in_quote = 1;
|
|
|
819 } if (plevel==0) {
|
|
|
820 if (c==',') {
|
|
346
|
821 cheap->ptr[-1] = 0;
|
|
712
|
822 args = list3s(STRING,args,cheap->ptr);
|
|
|
823 body = (char **)&scaddr(args);
|
|
327
|
824 } else if (c==')') {
|
|
346
|
825 cheap->ptr[-1] = 0;
|
|
327
|
826 break;
|
|
|
827 } else if (c=='(') {
|
|
|
828 plevel++;
|
|
|
829 } else if (c=='\\') {
|
|
|
830 if (*chptr=='\n') {
|
|
346
|
831 cheap->ptr--;
|
|
327
|
832 getline();
|
|
539
|
833 chptr = *pchptr;
|
|
327
|
834 }
|
|
|
835 // } else if (c==' '||c=='\t') {
|
|
346
|
836 // cheap->ptr--;
|
|
327
|
837 } else if (c=='\n') {
|
|
346
|
838 cheap->ptr--;
|
|
327
|
839 getline();
|
|
|
840 chptr = *pchptr;
|
|
|
841 }
|
|
|
842 } else if (c==')') {
|
|
|
843 plevel--;
|
|
|
844 } else if (c=='(') {
|
|
|
845 plevel++;
|
|
|
846 } else if (c=='\n') {
|
|
346
|
847 cheap->ptr--;
|
|
327
|
848 getline();
|
|
|
849 chptr = *pchptr;
|
|
|
850 }
|
|
|
851 }
|
|
|
852 *pchptr = chptr;
|
|
|
853 return reverse0(args);
|
|
|
854 }
|
|
|
855
|
|
625
|
856 /* output macro expansion
|
|
|
857
|
|
|
858 This is a recursive interpreter.
|
|
|
859
|
|
|
860 result into macrobuf (macropp) */
|
|
327
|
861
|
|
|
862 static int
|
|
|
863 macro_function(int macrop,char **pchptr,NMTBL *nptr,int history)
|
|
|
864 {
|
|
|
865 int args,sargs,values,evalues;
|
|
|
866 char *macro;
|
|
|
867
|
|
561
|
868 // make argument list
|
|
327
|
869 sargs = args = cadr(nptr->dsp);
|
|
346
|
870 values = macro_args(pchptr);
|
|
327
|
871 if (pchptr==&chptr) {
|
|
|
872 ch = *chptr++;
|
|
|
873 }
|
|
561
|
874 // eval all argument list
|
|
327
|
875 evalues = 0;
|
|
|
876 while(values) {
|
|
712
|
877 evalues = list2(macro_eval(0,scaddr(values),history),evalues);
|
|
327
|
878 values = cadr(values);
|
|
|
879 }
|
|
561
|
880 // define all arguments locally
|
|
|
881 // #define arg0 arg0_value
|
|
|
882 // #define arg1 arg2_value ....
|
|
327
|
883 evalues = reverse0(evalues);
|
|
359
|
884 enter_scope();
|
|
327
|
885 while(args) {
|
|
553
|
886 mappend0(reverse0(car(evalues)),¯o);
|
|
712
|
887 local_define(scaddr(args),macro);
|
|
327
|
888 args = cadr(args);
|
|
|
889 evalues = cadr(evalues);
|
|
|
890 }
|
|
561
|
891 // process body replacement
|
|
712
|
892 macro = scaddr(nptr->dsp);
|
|
721
|
893 macrop = macro_eval(macrop,macro,glist3s(STRING,history,nptr->nm));
|
|
327
|
894 args = sargs;
|
|
561
|
895 // unbind arguments
|
|
359
|
896 leave_scope();
|
|
327
|
897 return macrop;
|
|
|
898 }
|
|
|
899
|
|
625
|
900 /*
|
|
|
901 define name in the local scope
|
|
|
902 */
|
|
|
903
|
|
327
|
904 static void
|
|
|
905 local_define(char *macro,char *value)
|
|
|
906 {
|
|
359
|
907 NMTBL *nptr0,*nlist;
|
|
327
|
908 while(*macro==' '||*macro=='\t') macro++;
|
|
359
|
909 nptr0 = name_space_search(nlist=get_name(macro,0,DEF),MACRO);
|
|
|
910 nptr0 = make_local_scope(nlist,nptr0,MACRO);
|
|
|
911 nptr0->nm = value;
|
|
327
|
912 }
|
|
|
913
|
|
363
|
914 /*
|
|
|
915 Evaluate macro string.
|
|
625
|
916
|
|
|
917 This is a recursive interpreter.
|
|
|
918
|
|
363
|
919 reuslt: list2("replaced string",next)
|
|
561
|
920 history is necessary to avoid recursion
|
|
363
|
921 */
|
|
|
922
|
|
327
|
923 static int
|
|
|
924 macro_eval(int macrop,char *body0,int history)
|
|
|
925 {
|
|
350
|
926 int c,len;
|
|
327
|
927 int in_quote = 0;
|
|
|
928 int in_wquote = 0;
|
|
623
|
929 int string_flag = 0;
|
|
327
|
930 char *macro;
|
|
|
931 char *body = body0;
|
|
346
|
932 char **expand;
|
|
327
|
933 NMTBL *nptrm;
|
|
721
|
934
|
|
|
935 macro_history = history;
|
|
712
|
936 macrop = list3s(STRING,macrop,cheap->ptr);
|
|
|
937 expand = (char **)&scaddr(macrop);
|
|
327
|
938 for(; (c = *body++) ;) {
|
|
|
939 if (in_quote) {
|
|
|
940 if (c=='\\') {
|
|
346
|
941 *cheap->ptr = c; c = *body++;
|
|
|
942 cheap = increment_cheap(cheap,expand);
|
|
327
|
943 } else if (c=='\'') {
|
|
|
944 in_quote = 0;
|
|
|
945 }
|
|
|
946 } else if (in_wquote) {
|
|
|
947 if (c=='\\') {
|
|
346
|
948 *cheap->ptr = c; c = *body++;
|
|
|
949 cheap = increment_cheap(cheap,expand);
|
|
327
|
950 } else if (c=='"') {
|
|
|
951 in_wquote = 0;
|
|
|
952 }
|
|
|
953 } else if (c=='"') {
|
|
|
954 in_wquote = 1;
|
|
|
955 } else if (c=='\'') {
|
|
|
956 in_quote = 1;
|
|
|
957 } else if (c=='#' && *body=='#') {
|
|
540
|
958 mconcat = 1;
|
|
561
|
959 // name concatenation. flag only. remove and re-evaluate
|
|
540
|
960 // in the top level. (and skip space)
|
|
623
|
961 } else if (!mconcat && c=='#' && alpha(*body)) {
|
|
|
962 // turn into string next macro literal
|
|
|
963 string_flag = 1;
|
|
|
964 *cheap->ptr = '"';
|
|
|
965 cheap = increment_cheap(cheap,expand);
|
|
|
966 goto names;
|
|
327
|
967 } else if (alpha(c)) {
|
|
561
|
968 // find a name
|
|
349
|
969 body--; // ungetc
|
|
623
|
970 names:
|
|
350
|
971 nptrm = get_name(body,&len,NONDEF);
|
|
|
972 if (!nptrm) {
|
|
|
973 while((*cheap->ptr = *body++) && len--)
|
|
|
974 cheap = increment_cheap(cheap,expand);
|
|
|
975 body--;
|
|
623
|
976 if (string_flag) {
|
|
|
977 string_flag = 0;
|
|
|
978 *cheap->ptr = '"';
|
|
|
979 cheap = increment_cheap(cheap,expand);
|
|
|
980 }
|
|
350
|
981 continue;
|
|
|
982 }
|
|
|
983 body += len;
|
|
349
|
984 c = *body;
|
|
347
|
985 nptrm = name_space_search(nptrm,MACRO);
|
|
660
|
986 if (nptrm->dsp)
|
|
712
|
987 macro = scaddr(nptrm->dsp);
|
|
660
|
988 else
|
|
|
989 macro="";
|
|
721
|
990 if (check_recurse(nptrm->nm,history))
|
|
|
991 goto skip;
|
|
347
|
992 switch(nptrm->sc) {
|
|
|
993 case FMACRO:
|
|
327
|
994 if (c==' '||c=='\t') {
|
|
|
995 while (c==' '||c=='\t') c=*body++;
|
|
|
996 body--;
|
|
|
997 }
|
|
721
|
998 if(c!='(') goto skip; // error(MCERR); this isn't error
|
|
349
|
999 *cheap->ptr = 0;
|
|
346
|
1000 cheap = increment_cheap(cheap,expand);
|
|
|
1001 body++;
|
|
327
|
1002 macrop = macro_function(macrop,&body,nptrm,
|
|
721
|
1003 glist3s(STRING,history,nptrm->nm));
|
|
712
|
1004 macrop = list3s(STRING,macrop,cheap->ptr);
|
|
|
1005 expand = (char **)&(scaddr(macrop));
|
|
347
|
1006 break;
|
|
|
1007 case MACRO:
|
|
|
1008 if (neqname(nptrm->nm,macro)) {
|
|
623
|
1009 if (macro[0]==0) {
|
|
|
1010 if (string_flag) {
|
|
|
1011 string_flag = 0;
|
|
|
1012 *cheap->ptr = '"';
|
|
|
1013 cheap = increment_cheap(cheap,expand);
|
|
|
1014 }
|
|
|
1015 continue;
|
|
|
1016 }
|
|
347
|
1017 *cheap->ptr = 0;
|
|
|
1018 cheap = increment_cheap(cheap,expand);
|
|
721
|
1019 macrop=macro_eval(macrop,macro,glist3s(STRING,history,nptrm->nm));
|
|
712
|
1020 macrop = list3s(STRING,macrop,cheap->ptr);
|
|
|
1021 expand = (char **)&(scaddr(macrop));
|
|
347
|
1022 break;
|
|
|
1023 }
|
|
|
1024 default:
|
|
721
|
1025 skip:
|
|
346
|
1026 macro = nptrm->nm;
|
|
347
|
1027 case LMACRO:
|
|
349
|
1028 while((*cheap->ptr = *macro++)/* && len-- */)
|
|
346
|
1029 cheap = increment_cheap(cheap,expand);
|
|
327
|
1030 }
|
|
623
|
1031 if (string_flag) {
|
|
|
1032 string_flag = 0;
|
|
|
1033 *cheap->ptr = '"';
|
|
|
1034 cheap = increment_cheap(cheap,expand);
|
|
|
1035 }
|
|
327
|
1036 continue;
|
|
|
1037 }
|
|
346
|
1038 *cheap->ptr = c;
|
|
|
1039 cheap = increment_cheap(cheap,expand);
|
|
327
|
1040 }
|
|
346
|
1041 *cheap->ptr = 0;
|
|
|
1042 cheap = increment_cheap(cheap,expand);
|
|
327
|
1043 return macrop;
|
|
|
1044 }
|
|
|
1045
|
|
363
|
1046 /*
|
|
|
1047 cancat list2("string",next) into cheap.
|
|
|
1048 result overwrited by next cheap allocation
|
|
|
1049 */
|
|
327
|
1050
|
|
553
|
1051 static char *
|
|
|
1052 mappend0(int lists,char **result)
|
|
327
|
1053 {
|
|
|
1054 char *p;
|
|
346
|
1055 *result = cheap->ptr;
|
|
348
|
1056 for(;lists;lists = cadr(lists)) {
|
|
712
|
1057 p = scaddr(lists);
|
|
609
|
1058 for(;(*cheap->ptr = *p++);cheap = increment_cheap(cheap,result)) {
|
|
346
|
1059 // in_quote + \n case ? should be \n.
|
|
350
|
1060 if (p[-1]=='\n') cheap->ptr[0]=' ';
|
|
346
|
1061 }
|
|
327
|
1062 }
|
|
609
|
1063 cheap = increment_cheap(cheap,result);
|
|
346
|
1064 return *result;
|
|
327
|
1065 }
|
|
|
1066
|
|
553
|
1067 // do not replace \n
|
|
|
1068 extern char *
|
|
|
1069 mappend(int lists,char **result)
|
|
|
1070 {
|
|
|
1071 char *p;
|
|
|
1072 *result = cheap->ptr;
|
|
|
1073 for(;lists;lists = cadr(lists)) {
|
|
712
|
1074 p = scaddr(lists);
|
|
609
|
1075 for(;(*cheap->ptr=*p++);cheap = increment_cheap(cheap,result)) {
|
|
553
|
1076 // in_quote + \n case ? should be \n.
|
|
|
1077 // if (p[-1]=='\n') cheap->ptr[0]=' ';
|
|
|
1078 }
|
|
|
1079 }
|
|
609
|
1080 cheap = increment_cheap(cheap,result);
|
|
553
|
1081 return *result;
|
|
|
1082 }
|
|
|
1083
|
|
721
|
1084 extern int
|
|
|
1085 check_recurse(char *macro,int history)
|
|
|
1086 {
|
|
|
1087 for(;history;history = cadr(history)) {
|
|
|
1088 if (macro==scaddr(history)) {
|
|
|
1089 // fprintf(stderr,"check_recurse: %s %s = ",macro,scaddr(history));
|
|
|
1090 // fprintf(stderr,"1\n");
|
|
|
1091 return 1;
|
|
|
1092 }
|
|
|
1093 }
|
|
|
1094 // fprintf(stderr,"0\n");
|
|
|
1095 return 0;
|
|
|
1096 }
|
|
|
1097
|
|
327
|
1098 /* end */
|
