stored in the pattern buffer, so changing this does not affect
already-compiled regexps. */
extern reg_syntax_t re_syntax_options;
-\f
+
/* 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!) */
| RE_NO_BK_PARENS | RE_NO_BK_REFS \
| RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD)
/* [[[end syntaxes]]] */
-\f
+
/* 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. */
REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */
REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */
} reg_errcode_t;
-\f
+
/* 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
};
typedef struct re_pattern_buffer regex_t;
-\f
+
/* Type for byte offsets within the string. POSIX mandates this. */
typedef int regoff_t;
regoff_t rm_so; /* Byte offset from string's start to substring's start. */
regoff_t rm_eo; /* Byte offset from string's start to substring's end. */
} regmatch_t;
-\f
+
/* Declarations for routines. */
/* To avoid duplicating every routine declaration -- once with a
#endif /* C++ */
#endif /* not __REGEXP_LIBRARY_H__ */
-\f
+
/*
Local variables:
make-backup-files: t
want its recipients to know that what they have is not the original
version, so that any problems introduced by others will not reflect on
the original authors' reputations.
-\f
+
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that companies distributing free
software will individually obtain patent licenses, thus in effect
Note that it is possible for a library to be covered by the ordinary
General Public License rather than by this special one.
-\f
+
GNU LIBRARY GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.
-\f
+
2. You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
-\f
+
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
-\f
+
6. As an exception to the Sections above, you may also compile or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
-\f
+
7. You may place library facilities that are a work based on the
Library side-by-side in a single library together with other library
facilities not covered by this License, and distribute such a combined
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
-\f
+
11. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
the Free Software Foundation. If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
-\f
+
14. If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission. For software which is
DAMAGES.
END OF TERMS AND CONDITIONS
-\f
+
Appendix: How to Apply These Terms to Your New Libraries
If you develop a new library, and you want it to be of the greatest
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
-\f
+
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
"work based on the library" and a "work that uses the library". The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.
-\f
+
GNU LESSER GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.
-\f
+
2. You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
-\f
+
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
-\f
+
6. As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
-\f
+
7. You may place library facilities that are a work based on the
Library side-by-side in a single library together with other library
facilities not covered by this License, and distribute such a combined
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties with
this License.
-\f
+
11. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
the Free Software Foundation. If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
-\f
+
14. If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission. For software which is
DAMAGES.
END OF TERMS AND CONDITIONS
-\f
+
How to Apply These Terms to Your New Libraries
If you develop a new library, and you want it to be of the greatest
return x;
}
-\f
+
struct loaded_l10nfile *
_nl_make_l10nflist (l10nfile_list, dirlist, dirlist_len, mask, language,
territory, codeset, normalized_codeset, modifier, special,
return retval;
}
-\f
+
/* Normalize codeset name. There is no standard for the codeset
names. Normalization allows the user to use any of the common
names. The return value is dynamically allocated and has to be
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
-\f
+
/* Define __yy_memcpy. Note that the size argument
should be passed with type unsigned int, because that is what the non-GCC
definitions require. With GCC, __builtin_memcpy takes an arg
#endif
#endif
-\f
+
#line 217 "/home/haible/gnu/arch/linuxlibc6/share/bison.simple"
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
}
/* the action file gets copied in in place of this dollarsign */
#line 543 "/home/haible/gnu/arch/linuxlibc6/share/bison.simple"
-\f
+
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
}
else
{
- mutt_debug(2, " * _lua_mutt_get(%s) → error\n", param);
+ mutt_debug(2, " * _lua_mutt_get(%s) -> error\n", param);
luaL_error(l, "Mutt parameter not found %s", param);
rv = -1;
}
luaL_error(l, "Mutt parameter type %d unknown for %s", opt->type, param);
return -1;
}
- mutt_debug(2, " * _lua_mutt_get() → error");
+ mutt_debug(2, " * _lua_mutt_get() -> error");
luaL_error(l, "Mutt parameter not found %s", param);
return -1;
}
if (luaL_dostring(Lua, s->dptr))
{
- mutt_debug(2, " * mutt_lua_parse(%s) → failure\n", s->dptr);
+ mutt_debug(2, " * mutt_lua_parse(%s) -> failure\n", s->dptr);
snprintf(err->data, err->dsize, _("%s: %s"), s->dptr, lua_tostring(Lua, -1));
/* pop error message from the stack */
lua_pop(Lua, 1);
return -1;
}
- mutt_debug(2, " * mutt_lua_parse(%s) → success\n", s->dptr);
+ mutt_debug(2, " * mutt_lua_parse(%s) -> success\n", s->dptr);
return 2;
}
}
-\f
+
/**
**
** The bounce function, from the attachment menu
}
-\f
+
/**
**
** resend-message, from the attachment menu
}
}
-\f
+
/**
**
** forward-message, from the attachment menu
}
-\f
+
/**
**
** the various reply functions, from the attachment menu
#define SYNTAX(c) re_syntax_table[c]
#endif /* not emacs */
-\f
+
/* Get the interface, including the syntax bits. */
/* Changed to fit into mutt - tlr, 1999-01-06 */
/* As in Harbison and Steele. */
#define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
#endif
-\f
+
/* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we
use `alloca' instead of `malloc'. This is because using malloc in
re_search* or re_match* could cause memory leaks when C-g is used in
static int re_match_2_internal (struct re_pattern_buffer *bufp,
const char *string1, int size1, const char *string2, int size2, int pos,
struct re_registers *regs, int stop);
-\f
+
/* These are the command codes that appear in compiled regular
expressions. Some opcodes are followed by argument bytes. A
command code can specify any interpretation whatsoever for its
notsyntaxspec
#endif /* emacs */
} re_opcode_t;
-\f
+
/* Common operations on the compiled pattern. */
/* Store NUMBER in two contiguous bytes starting at DESTINATION. */
#endif /* not EXTRACT_MACROS */
#endif /* DEBUG */
-\f
+
/* If DEBUG is defined, Regex prints many voluminous messages about what
it is doing (if the variable `debug' is nonzero). If linked with the
main program in `iregex.c', you can enter patterns and strings
#define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
#endif /* not DEBUG */
-\f
+
/* Set by `re_set_syntax' to the current regexp syntax to recognize. Can
also be assigned to arbitrarily: each pattern buffer stores its own
syntax, so it can be changed between regex compilations. */
#endif /* DEBUG */
return ret;
}
-\f
+
/* This table gives an error message for each of the error codes listed
in regex.h. Obviously the order here has to be same as there.
POSIX doesn't require that we do anything for REG_NOERROR,
gettext_noop ("Regular expression too big"), /* REG_ESIZE */
gettext_noop ("Unmatched ) or \\)"), /* REG_ERPAREN */
};
-\f
+
/* Avoiding alloca during matching, to placate r_alloc. */
/* Define MATCH_MAY_ALLOCATE unless we need to make sure that the
#undef MATCH_MAY_ALLOCATE
#endif
-\f
+
/* Failure stack declarations and macros; both re_compile_fastmap and
re_match_2 use a failure stack. These have to be macros because of
REGEX_ALLOCATE_STACK. */
} /* POP_FAILURE_POINT */
-\f
+
/* Structure for per-register (a.k.a. per-group) information.
Other register information, such as the
starting and ending positions (which are addresses), and the list of
static char reg_unset_dummy;
#define REG_UNSET_VALUE (®_unset_dummy)
#define REG_UNSET(e) ((e) == REG_UNSET_VALUE)
-\f
+
/* Subroutine declarations and macros for regex_compile. */
static reg_errcode_t regex_compile _RE_ARGS ((const char *pattern, size_t size,
|| STREQ (string, "punct") || STREQ (string, "graph") \
|| STREQ (string, "cntrl") || STREQ (string, "blank"))
#endif
-\f
+
#ifndef MATCH_MAY_ALLOCATE
/* If we cannot allocate large objects within re_match_2_internal,
}
#endif /* not MATCH_MAY_ALLOCATE */
-\f
+
static boolean group_in_compile_stack _RE_ARGS ((compile_stack_type
compile_stack,
regnum_t regnum));
return REG_NOERROR;
} /* regex_compile */
-\f
+
/* Subroutines for `regex_compile'. */
/* Store OP at LOC followed by two-byte integer parameter ARG. */
return REG_NOERROR;
}
-\f
+
/* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible
characters can start a string that matches the pattern. This fastmap
RESET_FAIL_STACK ();
return 0;
} /* re_compile_fastmap */
-\f
+
/* Set REGS to hold NUM_REGS registers, storing them in STARTS and
ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use
this memory for recording register information. STARTS and ENDS
regs->start = regs->end = (regoff_t *) 0;
}
}
-\f
+
/* Searching routines. */
/* Like re_search_2, below, but only one string is specified, and
}
return -1;
} /* re_search_2 */
-\f
+
/* This converts PTR, a pointer into one of the search strings `string1'
and `string2' into an offset from the beginning of that string. */
#define POINTER_TO_OFFSET(ptr) \
to actually save any registers when none are active. */
#define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
#define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1)
-\f
+
/* Matching routines. */
#ifndef emacs /* Emacs never uses this. */
return -1; /* Failure to match. */
} /* re_match_2 */
-\f
+
/* Subroutine definitions for re_match_2. */
}
return 0;
}
-\f
+
/* Entry points for GNU code. */
/* re_compile_pattern is the GNU regular expression compiler: it
return NULL;
return gettext (re_error_msgid[(int) ret]);
}
-\f
+
/* Entry points compatible with 4.2 BSD regex library. We don't define
them unless specifically requested. */
}
#endif /* _REGEX_RE_COMP */
-\f
+
/* POSIX.2 functions. Don't define these for Emacs. */
#ifndef emacs
projects / neomutt / commitdiff