mirror of https://github.com/Cisco-Talos/clamav
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
107 lines
3.0 KiB
107 lines
3.0 KiB
/*
|
|
* HTML Entity & Encoding normalization.
|
|
*
|
|
* Copyright (C) 2007-2008 Sourcefire, Inc.
|
|
*
|
|
* Authors: Török Edvin
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* 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., 51 Franklin Street, Fifth Floor, Boston,
|
|
* MA 02110-1301, USA.
|
|
*/
|
|
|
|
#ifndef _HASHTAB_H
|
|
#define _HASHTAB_H
|
|
#include <stdio.h>
|
|
#include <stddef.h>
|
|
#include "cltypes.h"
|
|
typedef long cli_element_data;
|
|
|
|
/* define this for debugging/profiling purposes only, NOT in production/release code */
|
|
#ifdef PROFILE_HASHTABLE
|
|
|
|
|
|
typedef struct {
|
|
size_t calc_hash;
|
|
size_t found;
|
|
size_t find_req;
|
|
size_t found_tries;
|
|
size_t not_found;
|
|
size_t not_found_tries;
|
|
size_t grow_found;
|
|
size_t grow_found_tries;
|
|
size_t grow;
|
|
size_t update;
|
|
size_t update_tries;
|
|
size_t inserts;
|
|
size_t insert_tries;
|
|
size_t deleted_reuse;
|
|
size_t deleted_tries;
|
|
size_t deletes;
|
|
size_t clear;
|
|
size_t hash_exhausted;
|
|
} PROFILE_STRUCT_;
|
|
|
|
#define STRUCT_PROFILE PROFILE_STRUCT_ PROFILE_STRUCT;
|
|
#else
|
|
|
|
#define STRUCT_PROFILE
|
|
|
|
#endif
|
|
struct cli_element
|
|
{
|
|
const char* key;
|
|
cli_element_data data;
|
|
size_t len;
|
|
};
|
|
|
|
struct cli_hashtable {
|
|
struct cli_element* htable;
|
|
size_t capacity;
|
|
size_t used;
|
|
size_t maxfill;/* 80% */
|
|
|
|
STRUCT_PROFILE
|
|
};
|
|
|
|
|
|
|
|
int cli_hashtab_generate_c(const struct cli_hashtable *s,const char* name);
|
|
struct cli_element* cli_hashtab_find(const struct cli_hashtable *s, const char* key, const size_t len);
|
|
int cli_hashtab_init(struct cli_hashtable *s,size_t capacity);
|
|
const struct cli_element* cli_hashtab_insert(struct cli_hashtable *s, const char* key, const size_t len, const cli_element_data data);
|
|
void cli_hashtab_delete(struct cli_hashtable *s,const char* key,const size_t len);
|
|
void cli_hashtab_clear(struct cli_hashtable *s);
|
|
void cli_hashtab_free(struct cli_hashtable *s);
|
|
int cli_hashtab_load(FILE* in, struct cli_hashtable *s);
|
|
int cli_hashtab_store(const struct cli_hashtable *s,FILE* out);
|
|
|
|
/* A set of unique keys. */
|
|
struct cli_hashset {
|
|
uint32_t* keys;
|
|
uint32_t* bitmap;
|
|
uint32_t capacity;
|
|
uint32_t mask;
|
|
uint32_t count;
|
|
uint32_t limit;
|
|
};
|
|
|
|
int cli_hashset_init(struct cli_hashset* hs, size_t initial_capacity, uint8_t load_factor);
|
|
int cli_hashset_addkey(struct cli_hashset* hs, const uint32_t key);
|
|
int cli_hashset_removekey(struct cli_hashset* hs, const uint32_t key);
|
|
int cli_hashset_contains(const struct cli_hashset* hs, const uint32_t key);
|
|
int cli_hashset_clear(struct cli_hashset* hs);
|
|
void cli_hashset_destroy(struct cli_hashset* hs);
|
|
ssize_t cli_hashset_toarray(const struct cli_hashset* hs, uint32_t** array);
|
|
#endif
|
|
|
|
|