1*437bfbebSnyanmisaka 2*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 3*437bfbebSnyanmisaka /** 4*437bfbebSnyanmisaka @file dictionary.h 5*437bfbebSnyanmisaka @author N. Devillard 6*437bfbebSnyanmisaka @brief Implements a dictionary for string variables. 7*437bfbebSnyanmisaka 8*437bfbebSnyanmisaka This module implements a simple dictionary object, i.e. a list 9*437bfbebSnyanmisaka of string/string associations. This object is useful to store e.g. 10*437bfbebSnyanmisaka informations retrieved from a configuration file (ini files). 11*437bfbebSnyanmisaka */ 12*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 13*437bfbebSnyanmisaka 14*437bfbebSnyanmisaka #ifndef _DICTIONARY_H_ 15*437bfbebSnyanmisaka #define _DICTIONARY_H_ 16*437bfbebSnyanmisaka 17*437bfbebSnyanmisaka /*--------------------------------------------------------------------------- 18*437bfbebSnyanmisaka Includes 19*437bfbebSnyanmisaka ---------------------------------------------------------------------------*/ 20*437bfbebSnyanmisaka 21*437bfbebSnyanmisaka #include <stdio.h> 22*437bfbebSnyanmisaka #include <stdlib.h> 23*437bfbebSnyanmisaka #include <string.h> 24*437bfbebSnyanmisaka #include <unistd.h> 25*437bfbebSnyanmisaka 26*437bfbebSnyanmisaka #ifdef __cplusplus 27*437bfbebSnyanmisaka extern "C" { 28*437bfbebSnyanmisaka #endif 29*437bfbebSnyanmisaka 30*437bfbebSnyanmisaka /*--------------------------------------------------------------------------- 31*437bfbebSnyanmisaka New types 32*437bfbebSnyanmisaka ---------------------------------------------------------------------------*/ 33*437bfbebSnyanmisaka 34*437bfbebSnyanmisaka 35*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 36*437bfbebSnyanmisaka /** 37*437bfbebSnyanmisaka @brief Dictionary object 38*437bfbebSnyanmisaka 39*437bfbebSnyanmisaka This object contains a list of string/string associations. Each 40*437bfbebSnyanmisaka association is identified by a unique string key. Looking up values 41*437bfbebSnyanmisaka in the dictionary is speeded up by the use of a (hopefully collision-free) 42*437bfbebSnyanmisaka hash function. 43*437bfbebSnyanmisaka */ 44*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 45*437bfbebSnyanmisaka typedef struct _dictionary_ { 46*437bfbebSnyanmisaka int n ; /** Number of entries in dictionary */ 47*437bfbebSnyanmisaka ssize_t size ; /** Storage size */ 48*437bfbebSnyanmisaka char ** val ; /** List of string values */ 49*437bfbebSnyanmisaka char ** key ; /** List of string keys */ 50*437bfbebSnyanmisaka unsigned * hash ; /** List of hash values for keys */ 51*437bfbebSnyanmisaka } dictionary ; 52*437bfbebSnyanmisaka 53*437bfbebSnyanmisaka 54*437bfbebSnyanmisaka /*--------------------------------------------------------------------------- 55*437bfbebSnyanmisaka Function prototypes 56*437bfbebSnyanmisaka ---------------------------------------------------------------------------*/ 57*437bfbebSnyanmisaka 58*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 59*437bfbebSnyanmisaka /** 60*437bfbebSnyanmisaka @brief Compute the hash key for a string. 61*437bfbebSnyanmisaka @param key Character string to use for key. 62*437bfbebSnyanmisaka @return 1 unsigned int on at least 32 bits. 63*437bfbebSnyanmisaka 64*437bfbebSnyanmisaka This hash function has been taken from an Article in Dr Dobbs Journal. 65*437bfbebSnyanmisaka This is normally a collision-free function, distributing keys evenly. 66*437bfbebSnyanmisaka The key is stored anyway in the struct so that collision can be avoided 67*437bfbebSnyanmisaka by comparing the key itself in last resort. 68*437bfbebSnyanmisaka */ 69*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 70*437bfbebSnyanmisaka unsigned dictionary_hash(const char * key); 71*437bfbebSnyanmisaka 72*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 73*437bfbebSnyanmisaka /** 74*437bfbebSnyanmisaka @brief Create a new dictionary object. 75*437bfbebSnyanmisaka @param size Optional initial size of the dictionary. 76*437bfbebSnyanmisaka @return 1 newly allocated dictionary objet. 77*437bfbebSnyanmisaka 78*437bfbebSnyanmisaka This function allocates a new dictionary object of given size and returns 79*437bfbebSnyanmisaka it. If you do not know in advance (roughly) the number of entries in the 80*437bfbebSnyanmisaka dictionary, give size=0. 81*437bfbebSnyanmisaka */ 82*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 83*437bfbebSnyanmisaka dictionary * dictionary_new(size_t size); 84*437bfbebSnyanmisaka 85*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 86*437bfbebSnyanmisaka /** 87*437bfbebSnyanmisaka @brief Delete a dictionary object 88*437bfbebSnyanmisaka @param d dictionary object to deallocate. 89*437bfbebSnyanmisaka @return void 90*437bfbebSnyanmisaka 91*437bfbebSnyanmisaka Deallocate a dictionary object and all memory associated to it. 92*437bfbebSnyanmisaka */ 93*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 94*437bfbebSnyanmisaka void dictionary_del(dictionary * vd); 95*437bfbebSnyanmisaka 96*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 97*437bfbebSnyanmisaka /** 98*437bfbebSnyanmisaka @brief Get a value from a dictionary. 99*437bfbebSnyanmisaka @param d dictionary object to search. 100*437bfbebSnyanmisaka @param key Key to look for in the dictionary. 101*437bfbebSnyanmisaka @param def Default value to return if key not found. 102*437bfbebSnyanmisaka @return 1 pointer to internally allocated character string. 103*437bfbebSnyanmisaka 104*437bfbebSnyanmisaka This function locates a key in a dictionary and returns a pointer to its 105*437bfbebSnyanmisaka value, or the passed 'def' pointer if no such key can be found in 106*437bfbebSnyanmisaka dictionary. The returned character pointer points to data internal to the 107*437bfbebSnyanmisaka dictionary object, you should not try to free it or modify it. 108*437bfbebSnyanmisaka */ 109*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 110*437bfbebSnyanmisaka const char * dictionary_get(const dictionary * d, const char * key, const char * def); 111*437bfbebSnyanmisaka 112*437bfbebSnyanmisaka 113*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 114*437bfbebSnyanmisaka /** 115*437bfbebSnyanmisaka @brief Set a value in a dictionary. 116*437bfbebSnyanmisaka @param d dictionary object to modify. 117*437bfbebSnyanmisaka @param key Key to modify or add. 118*437bfbebSnyanmisaka @param val Value to add. 119*437bfbebSnyanmisaka @return int 0 if Ok, anything else otherwise 120*437bfbebSnyanmisaka 121*437bfbebSnyanmisaka If the given key is found in the dictionary, the associated value is 122*437bfbebSnyanmisaka replaced by the provided one. If the key cannot be found in the 123*437bfbebSnyanmisaka dictionary, it is added to it. 124*437bfbebSnyanmisaka 125*437bfbebSnyanmisaka It is Ok to provide a NULL value for val, but NULL values for the dictionary 126*437bfbebSnyanmisaka or the key are considered as errors: the function will return immediately 127*437bfbebSnyanmisaka in such a case. 128*437bfbebSnyanmisaka 129*437bfbebSnyanmisaka Notice that if you dictionary_set a variable to NULL, a call to 130*437bfbebSnyanmisaka dictionary_get will return a NULL value: the variable will be found, and 131*437bfbebSnyanmisaka its value (NULL) is returned. In other words, setting the variable 132*437bfbebSnyanmisaka content to NULL is equivalent to deleting the variable from the 133*437bfbebSnyanmisaka dictionary. It is not possible (in this implementation) to have a key in 134*437bfbebSnyanmisaka the dictionary without value. 135*437bfbebSnyanmisaka 136*437bfbebSnyanmisaka This function returns non-zero in case of failure. 137*437bfbebSnyanmisaka */ 138*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 139*437bfbebSnyanmisaka int dictionary_set(dictionary * vd, const char * key, const char * val); 140*437bfbebSnyanmisaka 141*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 142*437bfbebSnyanmisaka /** 143*437bfbebSnyanmisaka @brief Delete a key in a dictionary 144*437bfbebSnyanmisaka @param d dictionary object to modify. 145*437bfbebSnyanmisaka @param key Key to remove. 146*437bfbebSnyanmisaka @return void 147*437bfbebSnyanmisaka 148*437bfbebSnyanmisaka This function deletes a key in a dictionary. Nothing is done if the 149*437bfbebSnyanmisaka key cannot be found. 150*437bfbebSnyanmisaka */ 151*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 152*437bfbebSnyanmisaka void dictionary_unset(dictionary * d, const char * key); 153*437bfbebSnyanmisaka 154*437bfbebSnyanmisaka 155*437bfbebSnyanmisaka /*-------------------------------------------------------------------------*/ 156*437bfbebSnyanmisaka /** 157*437bfbebSnyanmisaka @brief Dump a dictionary to an opened file pointer. 158*437bfbebSnyanmisaka @param d Dictionary to dump 159*437bfbebSnyanmisaka @param f Opened file pointer. 160*437bfbebSnyanmisaka @return void 161*437bfbebSnyanmisaka 162*437bfbebSnyanmisaka Dumps a dictionary onto an opened file pointer. Key pairs are printed out 163*437bfbebSnyanmisaka as @c [Key]=[Value], one per line. It is Ok to provide stdout or stderr as 164*437bfbebSnyanmisaka output file pointers. 165*437bfbebSnyanmisaka */ 166*437bfbebSnyanmisaka /*--------------------------------------------------------------------------*/ 167*437bfbebSnyanmisaka void dictionary_dump(const dictionary * d, FILE * out); 168*437bfbebSnyanmisaka 169*437bfbebSnyanmisaka #ifdef __cplusplus 170*437bfbebSnyanmisaka } 171*437bfbebSnyanmisaka #endif 172*437bfbebSnyanmisaka 173*437bfbebSnyanmisaka #endif 174