Bruce Hill
911827fac3
the patterns themselves. This simplifies memory management a lot and speeds up performance.
54 lines
1.6 KiB
C
54 lines
1.6 KiB
C
//
|
|
// match.h - Header file for BP virtual machine.
|
|
//
|
|
#ifndef MATCH__H
|
|
#define MATCH__H
|
|
|
|
#include <stdbool.h>
|
|
#include <stdio.h>
|
|
|
|
#include "pattern.h"
|
|
|
|
struct match_s; // forward declared to resolve circular struct defs
|
|
|
|
typedef struct {
|
|
struct match_s **home, *next;
|
|
} match_dll_t;
|
|
|
|
//
|
|
// Pattern matching result object
|
|
//
|
|
typedef struct match_s {
|
|
// Where the match starts and ends (end is after the last character)
|
|
const char *start, *end;
|
|
pat_t *pat;
|
|
// Intrusive linked list nodes for garbage collection and cache buckets:
|
|
match_dll_t gc, cache;
|
|
int refcount;
|
|
struct match_s **children;
|
|
struct match_s *_children[3];
|
|
} match_t;
|
|
|
|
typedef struct {
|
|
const char *normal_color, *match_color, *replace_color;
|
|
void (*fprint_between)(FILE *out, const char *start, const char *end, const char *normal_color);
|
|
void (*on_nl)(FILE *out);
|
|
} print_options_t;
|
|
|
|
__attribute__((nonnull))
|
|
void recycle_if_unused(match_t **at_m);
|
|
size_t free_all_matches(void);
|
|
size_t recycle_all_matches(void);
|
|
bool next_match(match_t **m, const char *start, const char *end, pat_t *pat, pat_t *skip, bool ignorecase);
|
|
#define stop_matching(m) next_match(m, NULL, NULL, NULL, NULL, 0)
|
|
__attribute__((nonnull))
|
|
match_t *get_numbered_capture(match_t *m, int n);
|
|
__attribute__((nonnull, pure))
|
|
match_t *get_named_capture(match_t *m, const char *name, size_t namelen);
|
|
__attribute__((nonnull(1,2,3)))
|
|
//void fprint_match(FILE *out, const char *file_start, match_t *m, const char *colors[3]);
|
|
void fprint_match(FILE *out, const char *file_start, match_t *m, print_options_t *opts);
|
|
|
|
#endif
|
|
// vim: ts=4 sw=0 et cino=L2,l1,(0,W4,m1,\:0
|