diff options
| author | wlemb <wlemb> | 2002-09-22 14:26:41 +0000 |
|---|---|---|
| committer | wlemb <wlemb> | 2002-09-22 14:26:41 +0000 |
| commit | 63b859ad972d8cae7c4b25edb749f3c67346d65a (patch) | |
| tree | b1364095b3097820915a581225300d1d8866a22f /src | |
| parent | 917130ef058341c64d1baccb9aa3f9838c518a44 (diff) | |
| download | groff-63b859ad972d8cae7c4b25edb749f3c67346d65a.tar.gz | |
Some Debian patches.
* src/roff/groff/pipeline.h (MAX_COMMANDS): Increase to 12.
* src/roff/troff/node.cc (bracket_node::copy): Initialize
`list->last'.
Diffstat (limited to 'src')
| -rw-r--r-- | src/roff/groff/groff.cc | 1 | ||||
| -rw-r--r-- | src/roff/groff/pipeline.h | 5 | ||||
| -rw-r--r-- | src/roff/troff/node.cc | 1 |
3 files changed, 5 insertions, 2 deletions
diff --git a/src/roff/groff/groff.cc b/src/roff/groff/groff.cc index 25cea346..49104b2f 100644 --- a/src/roff/groff/groff.cc +++ b/src/roff/groff/groff.cc @@ -49,6 +49,7 @@ extern "C" { } #endif /* NEED_DECLARATION_PUTENV */ +// The number of commands must be in sync with MAX_COMMANDS in pipeline.h const int SOELIM_INDEX = 0; const int REFER_INDEX = SOELIM_INDEX + 1; const int GRAP_INDEX = REFER_INDEX + 1; diff --git a/src/roff/groff/pipeline.h b/src/roff/groff/pipeline.h index abb4b0ca..52bff850 100644 --- a/src/roff/groff/pipeline.h +++ b/src/roff/groff/pipeline.h @@ -1,4 +1,5 @@ -/* Copyright (C) 1989, 1990, 1991, 1992, 2000 Free Software Foundation, Inc. +/* Copyright (C) 1989, 1990, 1991, 1992, 2000, 2002 + Free Software Foundation, Inc. Written by James Clark (jjc@jclark.com) This file is part of groff. @@ -24,7 +25,7 @@ extern "C" { #endif /* run_pipeline can handle at most this many commands */ -#define MAX_COMMANDS 10 +#define MAX_COMMANDS 12 /* Children exit with this status if execvp fails. */ #define EXEC_FAILED_EXIT_STATUS 0xff diff --git a/src/roff/troff/node.cc b/src/roff/troff/node.cc index d616c2d9..d31619e6 100644 --- a/src/roff/troff/node.cc +++ b/src/roff/troff/node.cc @@ -2818,6 +2818,7 @@ node *bracket_node::copy() bracket_node *on = new bracket_node; node *last = 0; node *tem; + list->last = 0; for (tem = list; tem; tem = tem->next) { if (tem->next) tem->next->last = tem; |