lvm2/lib/regex/ttree.h

/*
 * Copyright (C) 2001 Sistina Software (UK) Limited.
 *
 * This file is released under the GPL.
 */

#ifndef _LVM_TTREE_H
#define _LVM_TTREE_H

#include "pool.h"

struct ttree;

struct ttree *ttree_create(struct pool *mem, unsigned int klen);

void *ttree_lookup(struct ttree *tt, unsigned *key);
void *ttree_insert(struct ttree *tt, unsigned *key, void *data);

#endif
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			`/*`
			`* Copyright (C) 2001 Sistina Software (UK) Limited.`
			`*`
			`* This file is released under the GPL.`
			`*/`

			`#ifndef _LVM_TTREE_H`
			`#define _LVM_TTREE_H`

			`#include "pool.h"`

			`struct ttree;`

			`struct ttree ttree_create(struct pool mem, unsigned int klen);`

			`void ttree_lookup(struct ttree tt, unsigned *key);`
			`void ttree_insert(struct ttree tt, unsigned key, void data);`

			`#endif`