Mercurial > cpython-lru_cache-weakref
annotate Include/node.h @ 892:11ea669c231e legacy-trunk
Documented new contents of lib5.tex
| author | Guido van Rossum <guido@python.org> |
|---|---|
| date | Wed, 03 Jun 1992 17:56:44 +0000 |
| parents | 164849f56105 |
| children | 1cabc2b6c970 |
| rev | line source |
|---|---|
| 145 | 1 /*********************************************************** |
|
790
164849f56105
Copyright for 1992 added
Guido van Rossum <guido@python.org>
parents:
145
diff
changeset
|
2 Copyright 1991, 1992 by Stichting Mathematisch Centrum, Amsterdam, The |
| 145 | 3 Netherlands. |
| 4 | |
| 5 All Rights Reserved | |
| 6 | |
| 7 Permission to use, copy, modify, and distribute this software and its | |
| 8 documentation for any purpose and without fee is hereby granted, | |
| 9 provided that the above copyright notice appear in all copies and that | |
| 10 both that copyright notice and this permission notice appear in | |
| 11 supporting documentation, and that the names of Stichting Mathematisch | |
| 12 Centrum or CWI not be used in advertising or publicity pertaining to | |
| 13 distribution of the software without specific, written prior permission. | |
| 14 | |
| 15 STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO | |
| 16 THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND | |
| 17 FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE | |
| 18 FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES | |
| 19 WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN | |
| 20 ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT | |
| 21 OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. | |
| 22 | |
| 23 ******************************************************************/ | |
| 24 | |
| 6 | 25 /* Parse tree node interface */ |
| 26 | |
| 27 typedef struct _node { | |
| 28 int n_type; | |
| 29 char *n_str; | |
| 86 | 30 int n_lineno; |
| 6 | 31 int n_nchildren; |
| 32 struct _node *n_child; | |
| 33 } node; | |
| 34 | |
| 86 | 35 extern node *newtree PROTO((int type)); |
| 36 extern node *addchild PROTO((node *n, int type, char *str, int lineno)); | |
| 37 extern void freetree PROTO((node *n)); | |
| 6 | 38 |
| 39 /* Node access functions */ | |
| 40 #define NCH(n) ((n)->n_nchildren) | |
| 41 #define CHILD(n, i) (&(n)->n_child[i]) | |
| 42 #define TYPE(n) ((n)->n_type) | |
| 43 #define STR(n) ((n)->n_str) | |
| 44 | |
| 45 /* Assert that the type of a node is what we expect */ | |
| 46 #ifndef DEBUG | |
| 47 #define REQ(n, type) { /*pass*/ ; } | |
| 48 #else | |
| 49 #define REQ(n, type) \ | |
| 50 { if (TYPE(n) != (type)) { \ | |
| 51 fprintf(stderr, "FATAL: node type %d, required %d\n", \ | |
| 52 TYPE(n), type); \ | |
| 53 abort(); \ | |
| 54 } } | |
| 55 #endif | |
| 86 | 56 |
| 57 extern void listtree PROTO((node *)); | |
| 58 extern void listnode PROTO((FILE *, node *)); |