Commit 063eda14 authored by partain's avatar partain
Browse files

[project @ 1996-06-30 16:31:21 by partain]

partain changes through 960629
parent 9d4c0380
......@@ -346,7 +346,7 @@ GLOBAL_REG_DECL(P_,HeapLim,REG_HeapLim)
#if defined(__STG_GCC_REGS__)
/* Keep -Wmissing-prototypes from complaining */
void SAVE_REGS PROTO((RegisterTable *dump));
void SAVE_REGS PROTO((RegisterTable *dump));
void RESTORE_REGS PROTO((RegisterTable *dump));
extern STG_INLINE
......@@ -492,7 +492,7 @@ GLOBAL_REG_DECL(P_,LinkLim,REG_LinkLim)
#if defined(__STG_GCC_REGS__)
/* Keep -Wmissing-prototypes from complaining */
void SAVE_REGS PROTO((RegisterTable *dump));
void SAVE_REGS PROTO((RegisterTable *dump));
void RESTORE_REGS PROTO((RegisterTable *dump));
extern STG_INLINE
......@@ -655,7 +655,7 @@ GLOBAL_REG_DECL(P_,OldHp,REG_OldHp)
#if defined(__STG_GCC_REGS__)
/* Keep -Wmissing-prototypes from complaining */
void SAVE_REGS PROTO((RegisterTable *dump));
void SAVE_REGS PROTO((RegisterTable *dump));
void RESTORE_REGS PROTO((RegisterTable *dump));
extern STG_INLINE
......
......@@ -662,12 +662,12 @@ rtsBool cc_to_ignore PROTO((CostCentre));
I_ heap_profile_init PROTO((char *argv[]));
extern void heap_profile_finish(STG_NO_ARGS);
void heap_profile_finish(STG_NO_ARGS);
extern void heap_profile_setup(STG_NO_ARGS); /* called at start of heap profile */
extern void heap_profile_done(STG_NO_ARGS); /* called at end of heap profile */
void heap_profile_setup(STG_NO_ARGS); /* called at start of heap profile */
void heap_profile_done(STG_NO_ARGS); /* called at end of heap profile */
extern void (* heap_profile_fn) PROTO((P_ closure,I_ size));
void (* heap_profile_fn) PROTO((P_ closure,I_ size));
extern I_ earlier_ticks; /* no. of earlier ticks grouped */
extern hash_t time_intervals; /* no. of time intervals reported -- 18 */
......
......@@ -67,12 +67,12 @@
#define GetArgN(n,a) pvm_upklong(&(a),1,1)
#define GetArgs(b,n) pvm_upklong(b,n,1)
extern void SendOp PROTO((OPCODE,GLOBAL_TASK_ID)),
SendOp1 PROTO((OPCODE,GLOBAL_TASK_ID,StgWord)),
SendOp2 PROTO((OPCODE,GLOBAL_TASK_ID,StgWord,StgWord)),
SendOpV PROTO((OPCODE,GLOBAL_TASK_ID,int,...)),
SendOpN PROTO((OPCODE,GLOBAL_TASK_ID,int,StgWord *)),
SendOpNV PROTO((OPCODE,GLOBAL_TASK_ID,int,StgWord*,int,...));
void SendOp PROTO((OPCODE,GLOBAL_TASK_ID)),
SendOp1 PROTO((OPCODE,GLOBAL_TASK_ID,StgWord)),
SendOp2 PROTO((OPCODE,GLOBAL_TASK_ID,StgWord,StgWord)),
SendOpV PROTO((OPCODE,GLOBAL_TASK_ID,int,...)),
SendOpN PROTO((OPCODE,GLOBAL_TASK_ID,int,StgWord *)),
SendOpNV PROTO((OPCODE,GLOBAL_TASK_ID,int,StgWord*,int,...));
char *GetOpName PROTO((unsigned op));
void NullException(STG_NO_ARGS);
......@@ -84,7 +84,7 @@ void get_opcode_and_sender PROTO((PACKET p, OPCODE *popcode, GLOBAL_TASK_ID *pse
GLOBAL_TASK_ID *PEStartUp PROTO((unsigned nPEs));
void PEShutDown(STG_NO_ARGS);
extern void (*ExceptionHandler)();
void (*ExceptionHandler)(STG_NO_ARGS);
#endif /*PAR */
#endif /*defined __LLC_H */
......@@ -91,7 +91,6 @@ extern void myexit PROTO((I_));
# else
# define EXIT exit
# endif
\end{code}
%************************************************************************
......
......@@ -700,7 +700,7 @@ do { \
EXTDATA_RO(StablePointerTable_info);
EXTDATA_RO(EmptyStablePointerTable_info);
EXTDATA(EmptySPTable_closure);
extern int ValidateSPTable PROTO(( P_ SPTable ));
int ValidateSPTable PROTO(( P_ SPTable ));
# define CHECK_SPT_InfoTable( closure ) \
ASSERT( (*((PP_) (closure)) == EmptyStablePointerTable_info && (closure == EmptySPTable_closure) ) || \
......
......@@ -106,7 +106,7 @@ IF_RTS(rtsBool initThreadPools (STG_NO_ARGS);)
IF_RTS(void init_gr_profiling PROTO((int, char **, int, char **));)
#endif
I_ collectHeap PROTO((W_ reqsize, smInfo *sm, rtsBool do_full_collection));
I_ collectHeap PROTO((W_ reqsize, smInfo *sm, rtsBool do_full_collection));
IF_RTS(void unmapMiddleStackPage PROTO((char *, int));) /* char * == caddr_t ? */
......@@ -124,9 +124,8 @@ void end_init(STG_NO_ARGS);
#ifdef PAR
void EvacuateLocalGAs PROTO((rtsBool full));
void RebuildGAtables PROTO((rtsBool full));
void RebuildGAtables PROTO((rtsBool full));
#endif
\end{code}
@initSM@ finalizes any runtime parameters of the storage manager.
......
......@@ -348,9 +348,9 @@ EXTFUN(UpdatePAP);
(IS_MUTABLE(INFO_PTR(closure)) && MUT_LINK(closure) != MUT_NOT_LINKED)
# if defined(GRAN)
extern P_ AwakenBlockingQueue PROTO((P_));
P_ AwakenBlockingQueue PROTO((P_));
# else
extern void AwakenBlockingQueue PROTO((P_));
void AwakenBlockingQueue PROTO((P_));
# endif
# ifdef MAIN_REG_MAP
......
......@@ -187,7 +187,7 @@ words of A stack and @b@ words of B stack. If not, it calls
NB: args @a@ and @b@ are pre-direction-ified!
\begin{code}
extern I_ SqueezeUpdateFrames PROTO((P_, P_, P_));
I_ SqueezeUpdateFrames PROTO((P_, P_, P_));
int sanityChk_StkO (P_ stko); /* ToDo: move to a sane place */
#if ! defined(CONCURRENT)
......@@ -208,7 +208,7 @@ extern void StackOverflow(STG_NO_ARGS) STG_NORETURN;
#else /* threaded */
extern I_ StackOverflow PROTO((W_, W_));
I_ StackOverflow PROTO((W_, W_));
/*
* On a uniprocessor, we do *NOT* context switch on a stack overflow
......@@ -238,37 +238,6 @@ do { \
}while(0)
\end{code}
%************************************************************************
%* *
\subsubsection[StgMacros-arity-chks]{Arity checks (for debugging)}
%* *
%************************************************************************
This is a debugging feature. Each call to fast-entry-point code sets
@ExpectedArity@ to some value, and the callee then checks that the
value is as expected.
\begin{code}
#if defined(__DO_ARITY_CHKS__)
extern I_ ExpectedArity;
extern void ArityError PROTO((I_)) STG_NORETURN;
#define SET_ARITY(n) do { ExpectedArity = (n); } while(0)
#define CHK_ARITY(n) \
do { \
if (ExpectedArity != (n)) { \
ULTRASAFESTGCALL1(void,(void *, I_),ArityError,n); \
}}while(0)
#else /* ! __DO_ARITY_CHKS__: normal case */
#define SET_ARITY(n) /* nothing */
#define CHK_ARITY(n) /* nothing */
#endif /* ! __DO_ARITY_CHKS__ */
\end{code}
%************************************************************************
%* *
\subsubsection[StgMacros-heap-chks]{Heap-overflow checks}
......@@ -279,7 +248,7 @@ Please see the general discussion/commentary about ``what really
happens in a GC,'' in \tr{SMinterface.lh}.
\begin{code}
extern void PerformGC PROTO((W_));
void PerformGC PROTO((W_));
void RealPerformGC PROTO((W_ liveness, W_ reqsize, W_ always_reenter_node, rtsBool do_full_collection));
void checkInCCallGC(STG_NO_ARGS);
......@@ -303,7 +272,7 @@ void StgPerformGarbageCollection(STG_NO_ARGS);
#else /* CONCURRENT */
extern void ReallyPerformThreadGC PROTO((W_, rtsBool));
void ReallyPerformThreadGC PROTO((W_, rtsBool));
#define HEAP_OVERFLOW(liveness,n,reenter) \
do { \
......@@ -878,12 +847,12 @@ Encoding and decoding float-ish things is pretty Integer-ish. We use
these pretty magical support functions, essentially stolen from Lennart:
\begin{code}
StgFloat __encodeFloat PROTO((MP_INT *, I_));
void __decodeFloat PROTO((MP_INT * /*result1*/,
void __decodeFloat PROTO((MP_INT * /*result1*/,
I_ * /*result2*/,
StgFloat));
StgDouble __encodeDouble PROTO((MP_INT *, I_));
void __decodeDouble PROTO((MP_INT * /*result1*/,
void __decodeDouble PROTO((MP_INT * /*result1*/,
I_ * /*result2*/,
StgDouble));
\end{code}
......@@ -1136,20 +1105,6 @@ extern I_ genSymZh(STG_NO_ARGS);
extern I_ resetGenSymZh(STG_NO_ARGS);
extern I_ incSeqWorldZh(STG_NO_ARGS);
/* sigh again: without these some (notably "float") willnae work */
extern I_ long2bytes__ PROTO((long, unsigned char *));
extern I_ int2bytes__ PROTO((int, unsigned char *));
extern I_ short2bytes__ PROTO((short, unsigned char *));
extern I_ float2bytes__ PROTO((float, unsigned char *));
extern I_ double2bytes__ PROTO((double, unsigned char *));
/* these may not be necessary; and they create warnings (WDP) */
extern I_ bytes2long__ PROTO((P_, I_ *));
extern I_ bytes2int__ PROTO((P_, I_ *));
extern I_ bytes2short__ PROTO((P_, I_ *));
extern I_ bytes2float__ PROTO((P_, StgFloat *));
extern I_ bytes2double__ PROTO((P_, StgDouble *));
extern I_ byteArrayHasNUL__ PROTO((const char *, I_));
\end{code}
......@@ -1320,7 +1275,7 @@ ED_(Prelude_Z91Z93_closure);
\begin{code}
#ifdef CONCURRENT
extern void Yield PROTO((W_));
void Yield PROTO((W_));
#define takeMVarZh(r, liveness, node) \
{ \
......@@ -1719,12 +1674,12 @@ extern I_ sig_install PROTO((I_, I_));
StgInt getErrorHandler(STG_NO_ARGS);
#ifndef PAR
void raiseError PROTO((StgStablePtr handler));
void raiseError PROTO((StgStablePtr handler));
StgInt catchError PROTO((StgStablePtr newErrorHandler));
#endif
void decrementErrorCount(STG_NO_ARGS);
#define stg_catchError(sp) SAFESTGCALL1(I_,(void *, StgStablePtr),catchError,sp)
#define stg_catchError(sp) SAFESTGCALL1(I_,(void *, StgStablePtr),catchError,sp)
#define stg_decrementErrorCount() SAFESTGCALL0(void,(void *),decrementErrorCount)
\end{code}
......@@ -1764,7 +1719,6 @@ extern StgPtr _deRefStablePointer PROTO((StgInt, StgPtr));
#define deRefStablePtrZh(ri,sp) \
ri = SAFESTGCALL2(I_,(void *, I_, P_),_deRefStablePointer,sp,StorageMgrInfo.StablePointerTable);
\end{code}
Declarations for other stable pointer operations.
......@@ -1821,7 +1775,7 @@ consider context switching...)
any strictly increasing expression will do here */
#define CalcNewNoSPtrs( i ) ((i)*2 + 100)
extern void enlargeSPTable PROTO((P_, P_));
void enlargeSPTable PROTO((P_, P_));
#define makeStablePtrZh(stablePtr,liveness,unstablePtr) \
do { \
......
......@@ -90,6 +90,9 @@
/* Define if you have the <signal.h> header file. */
#undef HAVE_SIGNAL_H
/* Define if you have the <sys/socket.h> header file. */
#undef HAVE_SYS_SOCKET_H
/* Define if you have the <stdlib.h> header file. */
#undef HAVE_STDLIB_H
......
#ifndef GHC_READLINE_H
#define GHC_READLINE_H
#include <readline/readline.h>
/* For some reason the following 3 aren't defined in readline.h */
extern int rl_mark;
extern int rl_done;
extern int rl_pending_input;
/* Our C Hackery stuff for Callbacks */
typedef I_ KeyCode;
extern StgStablePtr cbackList;
extern I_ genericRlCback PROTO((I_, I_));
extern StgStablePtr haskellRlEntry;
extern I_ current_narg, rl_return;
extern KeyCode current_kc;
extern char* rl_prompt_hack;
#endif /* !GHC_READLINE_H */
/* Definitions for data structures and routines for the regular
expression library, version 0.12.
Copyright (C) 1985, 1989, 1990-1995 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifndef __REGEXP_LIBRARY_H__
#define __REGEXP_LIBRARY_H__
/* POSIX says that <sys/types.h> must be included (by the caller) before
<regex.h>. */
#ifdef VMS
/* VMS doesn't have `size_t' in <sys/types.h>, even though POSIX says it
should be there. */
#include <stddef.h>
#endif
/* The following two types have to be signed and unsigned integer type
wide enough to hold a value of a pointer. For most ANSI compilers
ptrdiff_t and size_t should be likely OK. Still size of these two
types is 2 for Microsoft C. Ugh... */
typedef long s_reg_t;
typedef unsigned long active_reg_t;
/* The following bits are used to determine the regexp syntax we
recognize. The set/not-set meanings are chosen so that Emacs syntax
remains the value 0. The bits are given in alphabetical order, and
the definitions shifted by one from the previous bit; thus, when we
add or remove a bit, only one other definition need change. */
typedef unsigned long reg_syntax_t;
/* If this bit is not set, then \ inside a bracket expression is literal.
If set, then such a \ quotes the following character. */
#define RE_BACKSLASH_ESCAPE_IN_LISTS (1L)
/* If this bit is not set, then + and ? are operators, and \+ and \? are
literals.
If set, then \+ and \? are operators and + and ? are literals. */
#define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1)
/* If this bit is set, then character classes are supported. They are:
[:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:],
[:space:], [:print:], [:punct:], [:graph:], and [:cntrl:].
If not set, then character classes are not supported. */
#define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1)
/* If this bit is set, then ^ and $ are always anchors (outside bracket
expressions, of course).
If this bit is not set, then it depends:
^ is an anchor if it is at the beginning of a regular
expression or after an open-group or an alternation operator;
$ is an anchor if it is at the end of a regular expression, or
before a close-group or an alternation operator.
This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because
POSIX draft 11.2 says that * etc. in leading positions is undefined.
We already implemented a previous draft which made those constructs
invalid, though, so we haven't changed the code back. */
#define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1)
/* If this bit is set, then special characters are always special
regardless of where they are in the pattern.
If this bit is not set, then special characters are special only in
some contexts; otherwise they are ordinary. Specifically,
* + ? and intervals are only special when not after the beginning,
open-group, or alternation operator. */
#define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1)
/* If this bit is set, then *, +, ?, and { cannot be first in an re or
immediately after an alternation or begin-group operator. */
#define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1)
/* If this bit is set, then . matches newline.
If not set, then it doesn't. */
#define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1)
/* If this bit is set, then . doesn't match NUL.
If not set, then it does. */
#define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1)
/* If this bit is set, nonmatching lists [^...] do not match newline.
If not set, they do. */
#define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1)
/* If this bit is set, either \{...\} or {...} defines an
interval, depending on RE_NO_BK_BRACES.
If not set, \{, \}, {, and } are literals. */
#define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1)
/* If this bit is set, +, ? and | aren't recognized as operators.
If not set, they are. */
#define RE_LIMITED_OPS (RE_INTERVALS << 1)
/* If this bit is set, newline is an alternation operator.
If not set, newline is literal. */
#define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1)
/* If this bit is set, then `{...}' defines an interval, and \{ and \}
are literals.
If not set, then `\{...\}' defines an interval. */
#define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1)
/* If this bit is set, (...) defines a group, and \( and \) are literals.
If not set, \(...\) defines a group, and ( and ) are literals. */
#define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1)
/* If this bit is set, then \<digit> matches <digit>.
If not set, then \<digit> is a back-reference. */
#define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1)
/* If this bit is set, then | is an alternation operator, and \| is literal.
If not set, then \| is an alternation operator, and | is literal. */
#define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1)
/* If this bit is set, then an ending range point collating higher
than the starting range point, as in [z-a], is invalid.
If not set, then when ending range point collates higher than the
starting range point, the range is ignored. */
#define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1)
/* If this bit is set, then an unmatched ) is ordinary.
If not set, then an unmatched ) is invalid. */
#define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1)
/* If this bit is set, do not process the GNU regex operators.
IF not set, then the GNU regex operators are recognized. */
#define RE_NO_GNU_OPS (RE_UNMATCHED_RIGHT_PAREN_ORD << 1)
/* This global variable defines the particular regexp syntax to use (for
some interfaces). When a regexp is compiled, the syntax used is
stored in the pattern buffer, so changing this does not affect
already-compiled regexps. */
extern reg_syntax_t re_syntax_options;
/* Define combinations of the above bits for the standard possibilities.
(The [[[ comments delimit what gets put into the Texinfo file, so
don't delete them!) */
/* [[[begin syntaxes]]] */
#define RE_SYNTAX_EMACS 0
#define RE_SYNTAX_AWK \
(RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \
| RE_NO_BK_PARENS | RE_NO_BK_REFS \
| RE_NO_BK_VBAR | RE_NO_EMPTY_RANGES \
| RE_DOT_NEWLINE \
| RE_UNMATCHED_RIGHT_PAREN_ORD | RE_NO_GNU_OPS)
#define RE_SYNTAX_GNU_AWK \
(RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS)
#define RE_SYNTAX_POSIX_AWK \
(RE_SYNTAX_GNU_AWK | RE_NO_GNU_OPS)
#define RE_SYNTAX_GREP \
(RE_BK_PLUS_QM | RE_CHAR_CLASSES \
| RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \
| RE_NEWLINE_ALT)
#define RE_SYNTAX_EGREP \
(RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \
| RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \
| RE_NEWLINE_ALT | RE_NO_BK_PARENS \
| RE_NO_BK_VBAR)
#define RE_SYNTAX_POSIX_EGREP \
(RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES)
/* P1003.2/D11.2, section 4.20.7.1, lines 5078ff. */
#define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC
#define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC
/* Syntax bits common to both basic and extended POSIX regex syntax. */
#define _RE_SYNTAX_POSIX_COMMON \
(RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \
| RE_INTERVALS | RE_NO_EMPTY_RANGES)
#define RE_SYNTAX_POSIX_BASIC \
(_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM)
/* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes
RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this
isn't minimal, since other operators, such as \`, aren't disabled. */
#define RE_SYNTAX_POSIX_MINIMAL_BASIC \
(_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS)
#define RE_SYNTAX_POSIX_EXTENDED \
(_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \
| RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \
| RE_NO_BK_PARENS | RE_NO_BK_VBAR \
| RE_UNMATCHED_RIGHT_PAREN_ORD)
/* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS
replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added. */
#define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \
(_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \
| RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \
| RE_NO_BK_PARENS | RE_NO_BK_REFS \
| RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD)
#define RE_PERL_MULTILINE_SYNTAX \
(RE_BACKSLASH_ESCAPE_IN_LISTS | RE_CONTEXT_INDEP_ANCHORS \
| RE_CONTEXT_INDEP_OPS \
| RE_INTERVALS | RE_NO_BK_BRACES \
| RE_NO_BK_PARENS | RE_NO_BK_VBAR)
#define RE_PERL_SINGLELINE_SYNTAX \
(RE_BACKSLASH_ESCAPE_IN_LISTS | RE_CONTEXT_INDEP_ANCHORS \
| RE_CONTEXT_INDEP_OPS | RE_DOT_NEWLINE \
| RE_INTERVALS | RE_NO_BK_BRACES \
| RE_NO_BK_PARENS | RE_NO_BK_VBAR)
/* [[[end syntaxes]]] */
/* Maximum number of duplicates an interval can allow. Some systems
(erroneously) define this in other header files, but we want our
value, so remove any previous define. */
#ifdef RE_DUP_MAX
#undef RE_DUP_MAX
#endif
/* if sizeof(int) == 2, then ((1 << 15) - 1) overflows */
#define RE_DUP_MAX (0x7fff)
/* POSIX `cflags' bits (i.e., information for `regcomp'). */
/* If this bit is set, then use extended regular expression syntax.
If not set, then use basic regular expression syntax. */
#define REG_EXTENDED 1
/* If this bit is set, then ignore case when matching.
If not set, then case is significant. */
#define REG_ICASE (REG_EXTENDED << 1)
/* If this bit is set, then anchors do not match at newline
characters in the string.
If not set, then anchors do match at newlines. */
#define REG_NEWLINE (REG_ICASE << 1)
/* If this bit is set, then report only success or fail in regexec.
If not set, then returns differ between not matching and errors. */
#define REG_NOSUB (REG_NEWLINE << 1)
/* POSIX `eflags' bits (i.e., information for regexec). */
/* If this bit is set, then the beginning-of-line operator doesn't match
the beginning of the string (presumably because it's not the
beginning of a line).
If not set, then the beginning-of-line operator does match the
beginning of the string. */
#define REG_NOTBOL 1
/* Like REG_NOTBOL, except for the end-of-line. */
#define REG_NOTEOL (1 << 1)
/* If any error codes are removed, changed, or added, update the
`re_error_msg' table in regex.c. */
typedef enum
{
REG_NOERROR = 0, /* Success. */
REG_NOMATCH, /* Didn't find a match (for regexec). */
/* POSIX regcomp return error codes. (In the order listed in the
standard.) */
REG_BADPAT, /* Invalid pattern. */
REG_ECOLLATE, /* Not implemented. */
REG_ECTYPE, /* Invalid character class name. */
REG_EESCAPE, /* Trailing backslash. */
REG_ESUBREG, /* Invalid back reference. */
REG_EBRACK, /* Unmatched left bracket. */
REG_EPAREN, /* Parenthesis imbalance. */
REG_EBRACE, /* Unmatched \{. */
REG_BADBR, /* Invalid contents of \{\}. */
REG_ERANGE, /* Invalid range end. */
REG_ESPACE, /* Ran out of memory. */
REG_BADRPT, /* No preceding re for repetition op. */
/* Error codes we've added. */
REG_EEND, /* Premature end. */
REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */
REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */
} reg_errcode_t;
/* This data structure represents a compiled pattern. Before calling
the pattern compiler, the fields `buffer', `allocated', `fastmap',
`translate', and `no_sub' can be set. After the pattern has been
compiled, the `re_nsub' field is available. All other fields are
private to the regex routines. */
struct re_pattern_buffer
{
/* [[[begin pattern_buffer]]] */
/* Space that holds the compiled pattern. It is declared as
`unsigned char *' because its elements are
sometimes used as array indexes. */
unsigned char *buffer;
/* Number of bytes to which `buffer' points. */
unsigned long allocated;
/* Number of bytes actually used in `buffer'. */
unsigned long used;
/* Syntax setting with which the pattern was compiled. */
reg_syntax_t syntax;
/* Pointer to a fastmap, if any, otherwise zero. re_search uses
the fastmap, if there is one, to skip over impossible
starting points for matches. */
char *fastmap;
/* Either a translate table to apply to all characters before
comparing them, or zero for no translation. The translation
is applied to a pattern when it is compiled and to a string
when it is matched. */
char *translate;
/* Number of subexpressions found by the compiler. */
size_t re_nsub;
/* Zero if this pattern cannot match the empty string, one else.