1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424
|
/*
//
// varstore.c
//
// Variable store functions (implemented with a simple hash table)
//
// Copyright (c) 1995-96 Jim Nelson. Permission to distribute
// granted by the author. No warranties are made on the fitness of this
// source code.
//
*/
#include "htp.h"
/* statistics for performance measurement */
#if DEBUG
uint variableLookups = 0;
uint variableCacheHits = 0;
uint variableStringCompares = 0;
uint variableMissedStringCompares = 0;
uint variableHashCalcs = 0;
#endif
/* !! dont primes contribute to a more evenly distributed hash table? */
/* need to check Knuth ... */
#define HASH_TABLE_SIZE (53)
/*
// generates an index into the hash table from the string
*/
uint StringToHashTableIndex(const char *name)
{
uint hash;
uint ctr;
if(name == NULL)
{
return 0;
}
#if DEBUG
variableHashCalcs++;
#endif
hash = 0;
ctr = 0;
while(*name != NUL)
{
/* uppercase the chars before hashing because names are case-insensitive */
/* shift left to give a broader distribution in the hash table */
hash += (uint) toupper(*name++) << (ctr++ & 0x03);
}
return (hash % HASH_TABLE_SIZE);
}
BOOL InitializeVariableStore(VARSTORE *varstore)
{
assert(varstore != NULL);
/* allocate the hash table */
varstore->variableHashTable = AllocMemory(sizeof(VARIABLE *) * HASH_TABLE_SIZE);
if(varstore->variableHashTable == NULL)
{
DEBUG_PRINT(("out of memory trying to allocate variable hash table"));
return FALSE;
}
memset(varstore->variableHashTable, 0, sizeof(VARIABLE *) * HASH_TABLE_SIZE);
/* initialize the rest of the store */
varstore->parent = NULL;
varstore->child = NULL;
varstore->lastVariable = NULL;
return TRUE;
}
void DestroyVariableStore(VARSTORE *varstore)
{
/* destroy all children as well ... this function doesn't simply "unlink" */
/* the current store from the linked list */
while(varstore != NULL)
{
/* unlink from parent */
if(varstore->parent != NULL)
{
varstore->parent->child = NULL;
varstore->parent = NULL;
}
/* destroy all variables in this store */
ClearVariableList(varstore);
/* free the hash table memory */
FreeMemory(varstore->variableHashTable);
varstore->variableHashTable = NULL;
/* destroy all child scopes as well */
varstore = varstore->child;
}
}
BOOL StoreVariable(VARSTORE *varstore, const char *name, const char *value,
uint type, uint flag, void *param, VAR_DESTRUCTOR destructor)
{
VARIABLE *variable;
VARIABLE *ptr;
uint index;
assert(varstore != NULL);
assert(name != NULL);
/* remove any variable with the same name in the store */
RemoveVariable(varstore, name);
/* allocate space for the variable structure */
if((variable = AllocMemory(sizeof(VARIABLE))) == NULL)
{
DEBUG_PRINT(("unable to allocate memory for new variable"));
return FALSE;
}
/* copy in the variable's name */
StringCopy(variable->name, name, MAX_VARNAME_LEN);
/* copy in the variable's value, if any */
if(value != NULL)
{
StringCopy(variable->value, value, MAX_VARVALUE_LEN);
}
/* set flags and destructor pointer */
variable->type = type;
variable->flag = flag;
variable->param = param;
variable->destructor = destructor;
variable->next = NULL;
/* insert into the hash table */
index = StringToHashTableIndex(name);
ptr = varstore->variableHashTable[index];
varstore->variableHashTable[index] = variable;
if(ptr != NULL)
{
/* the slot has been previously hashed to a different variable, */
/* inserted new item at beginning of list, add rest to end */
variable->next = ptr;
}
/* put this new variable into the last-used cache */
varstore->lastVariable = variable;
return TRUE;
}
static VARIABLE *FindVariable(VARSTORE *varstore, const char *name)
{
VARIABLE *ptr;
assert(varstore != NULL);
assert(name != NULL);
#if DEBUG
variableLookups++;
#endif
/* check the last referenced variable first */
if(varstore->lastVariable != NULL)
{
#if DEBUG
variableStringCompares++;
#endif
if(stricmp(varstore->lastVariable->name, name) == 0)
{
#if DEBUG
variableCacheHits++;
#endif
return varstore->lastVariable;
}
#if DEBUG
variableMissedStringCompares++;
#endif
}
ptr = varstore->variableHashTable[StringToHashTableIndex(name)];
while(ptr != NULL)
{
#if DEBUG
variableStringCompares++;
#endif
if(stricmp(ptr->name, name) == 0)
{
/* cache this variable for next time */
varstore->lastVariable = ptr;
return ptr;
}
#if DEBUG
variableMissedStringCompares++;
#endif
ptr = ptr->next;
}
/* check all parent stores as well */
if(varstore->parent != NULL)
{
return FindVariable(varstore->parent, name);
}
return NULL;
}
const char *GetVariableValue(VARSTORE *varstore, const char *name)
{
VARIABLE *variable;
if(name != NULL)
{
if((variable = FindVariable(varstore, name)) != NULL)
{
return variable->value;
}
}
return NULL;
}
uint GetVariableType(VARSTORE *varstore, const char *name)
{
VARIABLE *variable;
if(name != NULL)
{
if((variable = FindVariable(varstore, name)) != NULL)
{
return variable->type;
}
}
return VAR_TYPE_UNKNOWN;
}
uint GetVariableFlag(VARSTORE *varstore, const char *name)
{
VARIABLE *variable;
if(name != NULL)
{
if((variable = FindVariable(varstore, name)) != NULL)
{
return variable->flag;
}
}
return VAR_FLAG_UNKNOWN;
}
static void DestroyVariable(VARSTORE *varstore, VARIABLE *variable)
{
/* if the variable has a destructor callback, do it */
if(variable->destructor != NULL)
{
variable->destructor(variable->name, variable->value, variable->type,
variable->flag, variable->param);
}
/* if this is the last referenced variable, uncache it */
if(varstore->lastVariable == variable)
{
varstore->lastVariable = NULL;
}
/* free the structure */
FreeMemory(variable);
}
void ClearVariableList(VARSTORE *varstore)
{
VARIABLE *ptr;
VARIABLE *next;
uint ctr;
assert(varstore != NULL);
/* have to walk the entire hash table to destroy each item */
for(ctr = 0; ctr < HASH_TABLE_SIZE; ctr++)
{
ptr = varstore->variableHashTable[ctr];
while(ptr != NULL)
{
next = ptr->next;
DestroyVariable(varstore, ptr);
ptr = next;
}
varstore->variableHashTable[ctr] = NULL;
}
}
BOOL RemoveVariable(VARSTORE *varstore, const char *name)
{
VARIABLE *ptr;
VARIABLE *prev;
uint index;
assert(varstore != NULL);
if(name == NULL)
{
return FALSE;
}
index = StringToHashTableIndex(name);
prev = NULL;
ptr = varstore->variableHashTable[index];
while(ptr != NULL)
{
#if DEBUG
variableStringCompares++;
#endif
if(stricmp(ptr->name, name) == 0)
{
/* found the variable */
/* unlink from the list */
if(prev != NULL)
{
prev->next = ptr->next;
}
else
{
varstore->variableHashTable[index] = ptr->next;
}
/* destroy the variable structure */
DestroyVariable(varstore, ptr);
return TRUE;
}
prev = ptr;
ptr = ptr->next;
}
return FALSE;
}
BOOL VariableExists(VARSTORE *varstore, const char *name)
{
return (FindVariable(varstore, name) != NULL) ? TRUE : FALSE;
}
void *GetVariableParam(VARSTORE *varstore, const char *name)
{
VARIABLE *var;
if(name != NULL)
{
if((var = FindVariable(varstore, name)) != NULL)
{
return var->param;
}
}
return NULL;
}
static VARSTORE *FindTopmostContext(VARSTORE *varstore)
{
VARSTORE *ptr;
assert(varstore != NULL);
ptr = varstore;
while(ptr->child != NULL)
{
assert(ptr->child->parent == ptr);
ptr = ptr->child;
}
return ptr;
}
void PushVariableStoreContext(VARSTORE *parent, VARSTORE *varstore)
{
VARSTORE *ptr;
assert(parent != NULL);
assert(varstore != NULL);
assert(varstore->parent == NULL);
ptr = FindTopmostContext(parent);
ptr->child = varstore;
varstore->parent = ptr;
varstore->child = NULL;
}
VARSTORE *PopVariableStoreContext(VARSTORE *varstore)
{
VARSTORE *ptr;
assert(varstore != NULL);
ptr = FindTopmostContext(varstore);
/* unlink from parent and return current context */
ptr->parent->child = NULL;
ptr->parent = NULL;
return ptr;
}
VARSTORE *PeekVariableStoreContext(VARSTORE *varstore)
{
return FindTopmostContext(varstore);
}
|