]> git.proxmox.com Git - mirror_edk2.git/blame - EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/h/sintstack.h
Add in the 1st version of ECP.
[mirror_edk2.git] / EdkCompatibilityPkg / Other / Maintained / Tools / Pccts / sorcerer / h / sintstack.h
CommitLineData
3eb9473e 1#ifndef SINTSTACK_H\r
2#define SINTSTACK_H\r
3\r
4/*\r
5 * SIntStack.h\r
6 *\r
7 * SOFTWARE RIGHTS\r
8 *\r
9 * We reserve no LEGAL rights to SORCERER -- SORCERER is in the public\r
10 * domain. An individual or company may do whatever they wish with\r
11 * source code distributed with SORCERER or the code generated by\r
12 * SORCERER, including the incorporation of SORCERER, or its output, into\r
13 * commerical software.\r
14 *\r
15 * We encourage users to develop software with SORCERER. However, we do\r
16 * ask that credit is given to us for developing SORCERER. By "credit",\r
17 * we mean that if you incorporate our source code into one of your\r
18 * programs (commercial product, research project, or otherwise) that you\r
19 * acknowledge this fact somewhere in the documentation, research report,\r
20 * etc... If you like SORCERER and have developed a nice tool with the\r
21 * output, please mention that you developed it using SORCERER. In\r
22 * addition, we ask that this header remain intact in our source code.\r
23 * As long as these guidelines are kept, we expect to continue enhancing\r
24 * this system and expect to make other tools available as they are\r
25 * completed.\r
26 *\r
27 * SORCERER 1.00B\r
28 * Terence Parr\r
29 * AHPCRC, University of Minnesota\r
30 * 1992-1994\r
31 */\r
32\r
33#include "sorcerer.h"\r
34\r
35typedef struct _istack {\r
36 int *data;\r
37 int sp;\r
38 int size;\r
39 } SIntStack;\r
40\r
41#ifdef __USE_PROTOS\r
42extern SIntStack *sint_newstack(int size);\r
43extern void sint_freestack(SIntStack *st);\r
44extern void sint_push(SIntStack *st, int i);\r
45extern int sint_pop(SIntStack *st);\r
46extern int sint_stacksize(SIntStack *st);\r
47extern void sint_stackreset(SIntStack *st);\r
48extern int sint_stackempty(SIntStack *st);\r
49extern int sint_top(SIntStack *st);\r
50#else\r
51extern SIntStack *sint_newstack();\r
52extern void sint_freestack();\r
53extern void sint_push();\r
54extern int sint_pop();\r
55extern int sint_stacksize();\r
56extern void sint_stackreset();\r
57extern int sint_stackempty();\r
58extern int sint_top();\r
59#endif\r
60\r
61#endif\r