[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
26-fyi-memory-macros.patch
From: |
Akim Demaille |
Subject: |
26-fyi-memory-macros.patch |
Date: |
Mon, 19 Nov 2001 10:03:48 +0100 |
Index: ChangeLog
from Akim Demaille <address@hidden>
* src/state.h (CORE_ALLOC, SHIFTS_ALLOC, ERRS_ALLOC)
(REDUCTIONS_ALLOC): New.
* src/LR0.c, src/conflicts.c: Use them to de-obfuscate memory
allocation.
Index: src/LR0.c
--- src/LR0.c Sat, 17 Nov 2001 16:00:37 +0100 akim
+++ src/LR0.c Sat, 17 Nov 2001 16:18:21 +0100 akim
@@ -151,7 +151,8 @@
int symbol;
#if TRACE
- fprintf (stderr, "Entering new_itemsets\n");
+ fprintf (stderr, "Entering new_itemsets, state = %d\n",
+ this_state->number);
#endif
for (i = 0; i < nsyms; i++)
@@ -211,8 +212,7 @@
iend = kernel_end[symbol];
n = iend - isp1;
- p =
- (core *) xcalloc ((unsigned) (sizeof (core) + (n - 1) * sizeof (short)),
1);
+ p = CORE_ALLOC (n);
p->accessing_symbol = symbol;
p->number = nstates;
p->nitems = n;
@@ -350,7 +350,7 @@
{
core *p;
- p = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
+ p = CORE_ALLOC (0);
first_state = last_state = this_state = p;
nstates = 1;
}
@@ -364,8 +364,7 @@
short *sp2;
short *send;
- p = (shifts *) xcalloc ((unsigned) (sizeof (shifts) +
- (nshifts - 1) * sizeof (short)), 1);
+ p = SHIFTS_ALLOC (nshifts);
p->number = this_state->number;
p->nshifts = nshifts;
@@ -401,7 +400,7 @@
core *statep;
shifts *sp;
- statep = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
+ statep = CORE_ALLOC (0);
statep->number = nstates;
statep->accessing_symbol = start_symbol;
@@ -409,7 +408,7 @@
last_state = statep;
/* Make a shift from this state to (what will be) the final state. */
- sp = XCALLOC (shifts, 1);
+ sp = SHIFTS_ALLOC (1);
sp->number = nstates++;
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -466,10 +465,7 @@
if (sp && sp->number == k)
{
- sp2 = (shifts *) xcalloc ((unsigned) (sizeof (shifts)
- +
- sp->nshifts *
- sizeof (short)), 1);
+ sp2 = SHIFTS_ALLOC (sp->nshifts + 1);
sp2->number = k;
sp2->nshifts = sp->nshifts + 1;
sp2->shifts[0] = nstates;
@@ -486,7 +482,7 @@
}
else
{
- sp2 = XCALLOC (shifts, 1);
+ sp2 = SHIFTS_ALLOC (1);
sp2->number = k;
sp2->nshifts = 1;
sp2->shifts[0] = nstates;
@@ -505,8 +501,7 @@
going to the next-to-final state (yet to be made). */
sp = first_shift;
- sp2 = (shifts *) xcalloc (sizeof (shifts)
- + sp->nshifts * sizeof (short), 1);
+ sp2 = SHIFTS_ALLOC (sp->nshifts + 1);
sp2->nshifts = sp->nshifts + 1;
/* Stick this shift into the vector at the proper place. */
@@ -535,7 +530,7 @@
{
/* The initial state didn't even have any shifts.
Give it one shift, to the next-to-final state. */
- sp = XCALLOC (shifts, 1);
+ sp = SHIFTS_ALLOC (1);
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -549,7 +544,7 @@
/* There are no shifts for any state.
Make one shift, from the initial state to the next-to-final state. */
- sp = XCALLOC (shifts, 1);
+ sp = SHIFTS_ALLOC (1);
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -565,13 +560,13 @@
/* Make the final state--the one that follows a shift from the
next-to-final state.
The symbol for that shift is 0 (end-of-file). */
- statep = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
+ statep = CORE_ALLOC (0);
statep->number = nstates;
last_state->next = statep;
last_state = statep;
/* Make the shift from the final state to the termination state. */
- sp = XCALLOC (shifts, 1);
+ sp = SHIFTS_ALLOC (1);
sp->number = nstates++;
sp->nshifts = 1;
sp->shifts[0] = nstates;
@@ -583,7 +578,7 @@
final_state = nstates;
/* Make the termination state. */
- statep = (core *) xcalloc ((unsigned) (sizeof (core) - sizeof (short)), 1);
+ statep = CORE_ALLOC (0);
statep->number = nstates++;
last_state->next = statep;
last_state = statep;
@@ -622,8 +617,7 @@
if (count)
{
- p = (reductions *) xcalloc ((unsigned) (sizeof (reductions) +
- (count - 1) * sizeof (short)), 1);
+ p = REDUCTIONS_ALLOC (count);
p->number = this_state->number;
p->nreds = count;
Index: src/conflicts.c
--- src/conflicts.c Fri, 16 Nov 2001 01:10:56 +0100 akim
+++ src/conflicts.c Sat, 17 Nov 2001 16:16:09 +0100 akim
@@ -90,7 +90,7 @@
unsigned *fp1;
unsigned *fp2;
int redprec;
- errs *errp = (errs *) xcalloc (sizeof (errs) + ntokens * sizeof (short), 1);
+ errs *errp = ERRS_ALLOC (ntokens + 1);
short *errtokens = errp->errs;
/* find the rule to reduce by to get precedence of reduction */
@@ -170,7 +170,7 @@
/* Some tokens have been explicitly made errors. Allocate
a permanent errs structure for this state, to record them. */
i = (char *) errtokens - (char *) errp;
- err_table[state] = (errs *) xcalloc ((unsigned int) i, 1);
+ err_table[state] = ERRS_ALLOC (i + 1);
bcopy (errp, err_table[state], i);
}
else
Index: src/state.h
--- src/state.h Sat, 11 Nov 2000 16:04:34 +0100 akim
+++ src/state.h Sat, 17 Nov 2001 16:18:29 +0100 akim
@@ -99,7 +99,9 @@
}
core;
-
+#define CORE_ALLOC(Nitems) \
+ (core *) xcalloc ((unsigned) (sizeof (core) \
+ + (Nitems - 1) * sizeof (short)), 1)
typedef struct shifts
{
@@ -110,6 +112,9 @@
}
shifts;
+#define SHIFTS_ALLOC(Nshifts) \
+ (shifts *) xcalloc ((unsigned) (sizeof (shifts) \
+ + (Nshifts - 1) * sizeof (short)), 1)
typedef struct errs
@@ -119,6 +124,10 @@
}
errs;
+#define ERRS_ALLOC(Nerrs) \
+ (errs *) xcalloc ((unsigned) (sizeof (errs) \
+ + (Nerrs - 1) * sizeof (short)), 1)
+
typedef struct reductions
@@ -129,5 +138,9 @@
short rules[1];
}
reductions;
+
+#define REDUCTIONS_ALLOC(Nreductions) \
+ (reductions *) xcalloc ((unsigned) (sizeof (reductions) \
+ + (Nreductions - 1) * sizeof (short)), 1)
#endif /* !STATE_H_ */
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- 26-fyi-memory-macros.patch,
Akim Demaille <=