* the pattern buffer.
*
* Returns 0 if we succeed, -2 if an internal error. */
-#ifdef STDC_HEADERS
int
re_compile_fastmap(struct re_pattern_buffer *bufp)
-#else
-int re_compile_fastmap(struct re_pattern_buffer *bufp)
-#endif
{
int j, k;
fail_stack_type fail_stack;
* failure stack overflowing). Otherwise, we return the length of the
* matched substring. */
-int re_match_2(struct re_pattern_buffer *bufp, const char *string1, int size1, const char *string2, int size2, int pos, struct re_registers *regs, int stop)
+int
+re_match_2(struct re_pattern_buffer *bufp, const char *string1, int size1, const char *string2, int size2, int pos, struct re_registers *regs, int stop)
{
/* General temporaries. */
int mcnt;
* It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for
* the return codes and their meanings.) */
-int regcomp(regex_t *preg, const char *pattern, int cflags)
+int
+regcomp(regex_t *preg, const char *pattern, int cflags)
{
reg_errcode_t ret;
unsigned syntax
*
* We return 0 if we find a match and REG_NOMATCH if not. */
-int regexec(const regex_t *preg, const char *string, size_t nmatch, regmatch_t pmatch[], int eflags)
+int
+regexec(const regex_t *preg, const char *string, size_t nmatch, regmatch_t pmatch[], int eflags)
{
int ret;
struct re_registers regs;
/* Free dynamically allocated space used by PREG. */
-void regfree(regex_t * preg)
+void
+regfree(regex_t * preg)
{
if (preg->buffer != NULL)
free(preg->buffer);