25047c7606
* include/30-test.i: Remove. * scaffold/tests/30-strlen.c: Remove 30-test.i indirection. * scaffold/tests/31-eputs.c: Likewise. * scaffold/tests/32-compare.c: Likewise. * scaffold/tests/33-and-or.c: Likewise. * scaffold/tests/34-pre-post.c: Likewise. * scaffold/tests/35-compare-char.c: Likewise. * scaffold/tests/36-compare-arithmetic.c: Likewise. * scaffold/tests/37-compare-assign.c: Likewise. * scaffold/tests/38-compare-call.c: Likewise. * scaffold/tests/40-if-else.c: Likewise. * scaffold/tests/41-?.c: Likewise. * scaffold/tests/42-goto-label.c: Likewise. * scaffold/tests/43-for-do-while.c: Likewise. * scaffold/tests/44-switch.c: Likewise. * scaffold/tests/45-void-call.c: Likewise. * scaffold/tests/46-function-static.c: Likewise. * scaffold/tests/50-assert.c: Likewise. * scaffold/tests/51-strcmp.c: Likewise. * scaffold/tests/52-itoa.c: Likewise. * scaffold/tests/53-strcpy.c: Likewise. * scaffold/tests/60-math.c: Likewise. * scaffold/tests/63-struct-cell.c: Likewise. * scaffold/tests/64-make-cell.c: Likewise. * scaffold/tests/65-read.c: Likewise. * scaffold/tests/66-local-char-array.c: Likewise. * scaffold/tests/70-printf.c: Likewise. * scaffold/tests/71-struct-array.c: Likewise. * scaffold/tests/72-typedef-struct-def.c: Likewise. * scaffold/tests/73-union.c: Likewise. * scaffold/tests/74-multi-line-string.c: Likewise. * scaffold/tests/75-struct-union.c: Likewise. * scaffold/tests/76-pointer-arithmetic.c: Likewise. * scaffold/tests/77-pointer-assign.c: Likewise. * scaffold/tests/78-union-struct.c: Likewise. * scaffold/tests/79-int-array.c: Likewise. * scaffold/tests/7a-struct-char-array.c: Likewise. * scaffold/tests/7b-struct-int-array.c: Likewise. * scaffold/tests/7c-dynarray.c: Likewise. * scaffold/tests/7d-cast-char.c: Likewise. * scaffold/tests/7e-struct-array-access.c: Likewise. * scaffold/tests/7f-struct-pointer-arithmetic.c: Likewise. * scaffold/tests/7g-struct-byte-word-field.c: Likewise. * scaffold/tests/7h-struct-assign.c: Likewise. * scaffold/tests/7i-struct-struct.c: Likewise. * scaffold/tests/7j-strtoull.c: Likewise. * scaffold/tests/7k-for-each-elem.c: Likewise. * scaffold/tests/7l-struct-any-size-array.c: Likewise. * scaffold/tests/7m-struct-char-array-assign.c: Likewise. * scaffold/tests/7n-struct-struct-array.c: Likewise. * scaffold/tests/80-setjmp.c: Likewise. * scaffold/tests/81-qsort.c: Likewise. * scaffold/tests/86-strncpy.c: Likewise. * scaffold/tests/87-sscanf.c: Likewise.
105 lines
2.5 KiB
C
105 lines
2.5 KiB
C
/* -*-comment-start: "//";comment-end:""-*-
|
|
* GNU Mes --- Maxwell Equations of Software
|
|
* Copyright © 2017 Jan (janneke) Nieuwenhuizen <janneke@gnu.org>
|
|
*
|
|
* This file is part of GNU Mes.
|
|
*
|
|
* GNU Mes 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 3 of the License, or (at
|
|
* your option) any later version.
|
|
*
|
|
* GNU Mes 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 GNU Mes. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <libmes.h>
|
|
|
|
#include <libmes.h>
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
typedef struct file {
|
|
char name[10];
|
|
} file_struct;
|
|
|
|
#define STACK_SIZE 2
|
|
struct state {
|
|
int bla;
|
|
file_struct *stack[STACK_SIZE];
|
|
char buf[100];
|
|
file_struct **stack_ptr;
|
|
char buf1[100];
|
|
};
|
|
|
|
int
|
|
main ()
|
|
{
|
|
struct state s;
|
|
struct state *ps;
|
|
ps = &s;
|
|
eputs ("0\n");
|
|
|
|
s.stack_ptr = s.stack;
|
|
ps->stack_ptr = ps->stack;
|
|
eputs ("ps->stack="); eputs (itoa (ps->stack)); eputs ("\n");
|
|
|
|
eputs ("1\n");
|
|
if (ps->stack_ptr >= ps->stack + STACK_SIZE) return 1;
|
|
eputs ("2\n");
|
|
|
|
struct file f = {"first.h"};
|
|
#if 0 //__MESC__
|
|
strcpy (f.name, "first.h");
|
|
#endif
|
|
eputs (f.name); eputs ("\n");
|
|
|
|
*ps->stack_ptr = &f;
|
|
|
|
eputs ("3\n");
|
|
++ps->stack_ptr;
|
|
eputs ("s.stack_ptr -stack ="); eputs (itoa (ps->stack_ptr - ps->stack)); eputs ("\n");
|
|
eputs ("4\n");
|
|
|
|
for (file_struct **p = ps->stack; p < ps->stack_ptr; p++)
|
|
{
|
|
eputs ((*p)->name); eputs ("\n");
|
|
}
|
|
|
|
eputs ("5\n");
|
|
|
|
int i;
|
|
i = ps->stack_ptr - ps->stack + STACK_SIZE;
|
|
eputs ("i="); eputs (itoa (i)); eputs ("\n");
|
|
|
|
if (ps->stack_ptr >= ps->stack + STACK_SIZE) return 2;
|
|
|
|
eputs ("6\n");
|
|
struct file f2 = {"second.h"};
|
|
#if 0//__MESC__
|
|
strcpy (f2.name, "second.h");
|
|
#endif
|
|
|
|
*ps->stack_ptr = &f2;
|
|
eputs ("7\n");
|
|
++ps->stack_ptr;
|
|
eputs ("s.stack_ptr -stack ="); eputs (itoa (ps->stack_ptr - ps->stack)); eputs ("\n");
|
|
|
|
for (file_struct **p = ps->stack; p < ps->stack_ptr; p++)
|
|
{
|
|
eputs ((*p)->name); eputs ("\n");
|
|
}
|
|
|
|
if (ps->stack_ptr >= ps->stack + STACK_SIZE) return 0;
|
|
struct file f3 = {"third.h"};
|
|
*ps->stack_ptr = &f3;
|
|
++ps->stack_ptr;
|
|
return 3;
|
|
}
|