Add in the 1st version of ECP.

[mirror_edk2.git] / EdkCompatibilityPkg / Other / Maintained / Tools / Pccts / h / SList.h

diff --git a/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/SList.h b/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/SList.h
new file mode 100644 (file)
index 0000000..8357878
--- /dev/null
+++ b/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/SList.h
@@ -0,0 +1,71 @@
+#ifndef SList_h\r
+#define SList_h\r
+\r
+/*\r
+ * SList.h\r
+ *\r
+ * SOFTWARE RIGHTS\r
+ *\r
+ * We reserve no LEGAL rights to SORCERER -- SORCERER is in the public\r
+ * domain.  An individual or company may do whatever they wish with\r
+ * source code distributed with SORCERER or the code generated by\r
+ * SORCERER, including the incorporation of SORCERER, or its output, into\r
+ * commerical software.\r
+ *\r
+ * We encourage users to develop software with SORCERER.  However, we do\r
+ * ask that credit is given to us for developing SORCERER.  By "credit",\r
+ * we mean that if you incorporate our source code into one of your\r
+ * programs (commercial product, research project, or otherwise) that you\r
+ * acknowledge this fact somewhere in the documentation, research report,\r
+ * etc...  If you like SORCERER and have developed a nice tool with the\r
+ * output, please mention that you developed it using SORCERER.  In\r
+ * addition, we ask that this header remain intact in our source code.\r
+ * As long as these guidelines are kept, we expect to continue enhancing\r
+ * this system and expect to make other tools available as they are\r
+ * completed.\r
+ *\r
+ * PCCTS 1.33\r
+ * Terence Parr\r
+ * Parr Research Corporation\r
+ * with Purdue University and AHPCRC, University of Minnesota\r
+ * 1992-1998\r
+ */\r
+\r
+#include "pcctscfg.h"\r
+\r
+#include "pccts_stdio.h"\r
+#include "pccts_stdlib.h"\r
+\r
+PCCTS_NAMESPACE_STD\r
+\r
+#include "PCCTSAST.h"\r
+\r
+class PCCTS_AST;\r
+\r
+class SListNode {\r
+protected:\r
+  void *_elem;      /* pointer to any kind of element */\r
+  SListNode *_next;\r
+public:\r
+  SListNode()        {_elem=_next=NULL;}\r
+  virtual ~SListNode()  {_elem=_next=NULL;}\r
+  void *elem()      { return _elem; }\r
+  void setElem(void *e)  { _elem = e; }\r
+  void setNext(SListNode *t)  { _next = t; }\r
+  SListNode *next()    { return _next; }\r
+};\r
+\r
+class SList {\r
+  SListNode *head, *tail;\r
+public:\r
+  SList() {head=tail=NULL;}\r
+  virtual ~SList() {head=tail=NULL;}\r
+  virtual void *iterate(SListNode **);\r
+  virtual void add(void *e);\r
+  virtual void lfree();\r
+  virtual PCCTS_AST *to_ast(SList list);\r
+  virtual void require(int e,char *err){ if ( !e ) panic(err); }\r
+  virtual void panic(char *err){ fprintf(stderr, "SList panic: %s\n", err); exit(PCCTS_EXIT_FAILURE); }\r
+};\r
+\r
+#endif\r