I don't know where the notion expressed in the Linux man page came from.
I'm pretty sure it's never been true of GNU compilers. I don't think there
is any actual problem of the sort you have in mind with the existing code.
The generally issue of unbounded stack allocation is of course separate and
* utils.c: Generate code using uint32_t.
---
utils.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/utils.c b/utils.c
index 4c2a87b..ccde966 100644
--- a/utils.c
+++ b/utils.c
@@ -77,7 +77,7 @@ WriteBogusDefines(FILE *file)
fprintf(file, "#define BAD_TYPECHECK(type, che
Richard Braun, on Tue 15 Mar 2016 00:40:40 +0100, wrote:
> On Tue, Mar 15, 2016 at 12:32:43AM +0100, Samuel Thibault wrote:
> > Richard Braun, on Mon 14 Mar 2016 23:37:33 +0100, wrote:
> > > On Mon, Mar 14, 2016 at 06:27:24PM -0400, David Michael wrote:
> > > > After poking around a bit more, it se
This has been tested by cross-compiling a base Hurd system to make sure
these kinds of routines are no longer used.
* lexxer.l: Remove tokens.
* parser.y: Remove token types and production rules.
* routine.c: Remove rtMakeProcedure, rtMakeSimpleProcedure,
rtMakeFunction.
* routine.h: Remove enum v