cpython/Parser/node.c

81 lines
1.4 KiB
C
Raw Normal View History

1991-02-19 08:39:46 -04:00
/* Parse tree node implementation */
#include "pgenheaders.h"
#include "node.h"
#include "errcode.h"
#ifdef HAVE_LIMITS_H
#include <limits.h>
#endif
#ifndef INT_MAX
#define INT_MAX 2147483647
#endif
1990-10-14 09:07:46 -03:00
node *
PyNode_New(int type)
1990-10-14 09:07:46 -03:00
{
1997-04-29 18:03:06 -03:00
node *n = PyMem_NEW(node, 1);
1990-10-14 09:07:46 -03:00
if (n == NULL)
return NULL;
n->n_type = type;
n->n_str = NULL;
1990-12-20 11:06:42 -04:00
n->n_lineno = 0;
1990-10-14 09:07:46 -03:00
n->n_nchildren = 0;
n->n_child = NULL;
return n;
}
#define XXX 3 /* Node alignment factor to speed up realloc */
#define XXXROUNDUP(n) ((n) == 1 ? 1 : ((n) + XXX - 1) / XXX * XXX)
int
PyNode_AddChild(register node *n1, int type, char *str, int lineno)
1990-10-14 09:07:46 -03:00
{
register int nch = n1->n_nchildren;
register int nch1 = nch+1;
register node *n;
if (nch == INT_MAX || nch < 0)
return E_OVERFLOW;
1990-10-14 09:07:46 -03:00
if (XXXROUNDUP(nch) < nch1) {
n = n1->n_child;
nch1 = XXXROUNDUP(nch1);
1997-04-29 18:03:06 -03:00
PyMem_RESIZE(n, node, nch1);
1990-10-14 09:07:46 -03:00
if (n == NULL)
return E_NOMEM;
1990-10-14 09:07:46 -03:00
n1->n_child = n;
}
n = &n1->n_child[n1->n_nchildren++];
n->n_type = type;
n->n_str = str;
1990-12-20 11:06:42 -04:00
n->n_lineno = lineno;
1990-10-14 09:07:46 -03:00
n->n_nchildren = 0;
n->n_child = NULL;
return 0;
1990-10-14 09:07:46 -03:00
}
1990-12-20 11:06:42 -04:00
/* Forward */
static void freechildren(node *);
1990-12-20 11:06:42 -04:00
void
PyNode_Free(node *n)
1990-12-20 11:06:42 -04:00
{
if (n != NULL) {
freechildren(n);
1997-04-29 18:03:06 -03:00
PyMem_DEL(n);
1990-12-20 11:06:42 -04:00
}
}
static void
freechildren(node *n)
{
int i;
for (i = NCH(n); --i >= 0; )
freechildren(CHILD(n, i));
if (n->n_child != NULL)
1997-04-29 18:03:06 -03:00
PyMem_DEL(n->n_child);
if (STR(n) != NULL)
1997-04-29 18:03:06 -03:00
PyMem_DEL(STR(n));
}