shaba/lvm2
1
0
Fork 0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-22 17:35:59 +03:00
Code Releases Activity
c737d34804
lvm2/old-tests/regex/parse_t.c

101 lines
1.8 KiB
C
Raw Normal View History

o First pass at the regex code. lib/regex/matcher takes an array of regex's and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
2001-10-19 18:36:57 +04:00
/*
Update copyright notices.
2004-03-30 23:35:44 +04:00
* Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved.
* Copyright (C) 2004 Red Hat, Inc. All rights reserved.
o First pass at the regex code. lib/regex/matcher takes an array of regex's and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
2001-10-19 18:36:57 +04:00
*
Update copyright notices.
2004-03-30 23:35:44 +04:00
* 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
o First pass at the regex code. lib/regex/matcher takes an array of regex's and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
2001-10-19 18:36:57 +04:00
*/
#include "log.h"
#include "../../lib/regex/parse_rx.h"
#include <stdio.h>
#include <ctype.h>
static void _pretty_print(struct rx_node *rx, int depth)
{
int i;
for (i = 0; i < depth; i++)
printf(" ");
/* display info about the node */
switch (rx->type) {
case CAT:
printf("Cat");
break;
case OR:
printf("Or");
break;
case STAR:
printf("Star");
break;
case PLUS:
printf("Plus");
break;
case QUEST:
printf("Quest");
break;
case CHARSET:
printf("Charset : ");
for (i = 0; i < 256; i++) {
if (bit(rx->charset, i) && isprint(i))
printf("%c", (char) i);
}
break;
default:
printf("Unknown type");
}
printf("\n");
if (rx->left)
_pretty_print(rx->left, depth + 1);
if (rx->right)
_pretty_print(rx->right, depth + 1);
}
int main(int argc, char **argv)
{
Use hash, bitset, malloc, pool from libdevmapper.
2005-10-17 03:03:59 +04:00
struct dm_pool *mem;
o First pass at the regex code. lib/regex/matcher takes an array of regex's and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
2001-10-19 18:36:57 +04:00
struct rx_node *rx;
if (argc != 2) {
fprintf(stderr, "Usage : %s <regex>\n", argv[0]);
exit(0);
}
init_log(stderr);
init_debug(_LOG_INFO);
Use hash, bitset, malloc, pool from libdevmapper.
2005-10-17 03:03:59 +04:00
if (!(mem = dm_pool_create(1024))) {
o First pass at the regex code. lib/regex/matcher takes an array of regex's and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
2001-10-19 18:36:57 +04:00
fprintf(stderr, "Couldn't create pool\n");
exit(1);
}
if (!(rx = rx_parse_str(mem, argv[1]))) {
fprintf(stderr, "Couldn't parse regex\n");
exit(1);
}
_pretty_print(rx, 0);
Use hash, bitset, malloc, pool from libdevmapper.
2005-10-17 03:03:59 +04:00
dm_pool_destroy(mem);
o First pass at the regex code. lib/regex/matcher takes an array of regex's and builds a *very* efficient engine that will tell you which regex a string matches with only a single pass through the string. To be used in the config file when specifying devices. o Anchor's aren't supported yet (^ and $) but that won't take long. o Also when we get some realistic config files we may want to consider adding an extra level of indirection to the dfa state in order to compress the table. It all depends on how large typical tables get.
2001-10-19 18:36:57 +04:00
dump_memory();
fin_log();
return 0;
}
Copy Permalink