mirror of
git://sourceware.org/git/lvm2.git
synced 2024-12-22 17:35:59 +03:00
55 lines
1.3 KiB
C
55 lines
1.3 KiB
C
/*
|
|
* Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved.
|
|
* Copyright (C) 2004 Red Hat, Inc. All rights reserved.
|
|
*
|
|
* This file is part of LVM2.
|
|
*
|
|
* This copyrighted material is made available to anyone wishing to use,
|
|
* modify, copy, or redistribute it subject to the terms and conditions
|
|
* of the GNU General Public License v.2.
|
|
*
|
|
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*/
|
|
|
|
#ifndef _LVM_PARSE_REGEX_H
|
|
#define _LVM_PARSE_REGEX_H
|
|
|
|
#include "bitset.h"
|
|
|
|
enum {
|
|
CAT,
|
|
STAR,
|
|
PLUS,
|
|
OR,
|
|
QUEST,
|
|
CHARSET
|
|
};
|
|
|
|
/*
|
|
* We're never going to be running the regex on non-printable
|
|
* chars, so we can use a couple of these chars to represent the
|
|
* start and end of a string.
|
|
*/
|
|
#define HAT_CHAR 0x2
|
|
#define DOLLAR_CHAR 0x3
|
|
|
|
struct rx_node {
|
|
int type;
|
|
bitset_t charset;
|
|
struct rx_node *left, *right;
|
|
|
|
/* used to build the dfa for the toker */
|
|
int nullable, final;
|
|
bitset_t firstpos;
|
|
bitset_t lastpos;
|
|
bitset_t followpos;
|
|
};
|
|
|
|
struct rx_node *rx_parse_str(struct pool *mem, const char *str);
|
|
struct rx_node *rx_parse_tok(struct pool *mem,
|
|
const char *begin, const char *end);
|
|
|
|
#endif
|