Subversion Repositories HelenOS

Rev

Rev 3912 | Rev 4197 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
3666 mejdrech 1
/*
3912 mejdrech 2
 * Copyright (c) 2009 Lukas Mejdrech
3666 mejdrech 3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 * - The name of the author may not be used to endorse or promote products
15
 *   derived from this software without specific prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
29
/** @addtogroup net
3846 mejdrech 30
 *  @{
3666 mejdrech 31
 */
32
 
33
/** @file
3912 mejdrech 34
 *  Character string to integer map implementation.
35
 *  @see char_map.h
3666 mejdrech 36
 */
37
 
38
#include <errno.h>
39
#include <malloc.h>
4192 mejdrech 40
#include <mem.h>
3666 mejdrech 41
#include <unistd.h>
42
 
43
#include "char_map.h"
44
 
3912 mejdrech 45
/** Internal magic value for a&nbsp;consistency check.
3846 mejdrech 46
 */
3666 mejdrech 47
#define CHAR_MAP_MAGIC_VALUE    0x12345611
48
 
3846 mejdrech 49
/** Adds the value with the key to the map.
50
 *  Creates new nodes to map the key.
51
 *  @param map The character string to integer map. Input/output parameter.
3912 mejdrech 52
 *  @param identifier The key zero ('\\0') terminated character string. The key character string is processed until the first terminating zero ('\\0') character after the given length is found. Input parameter.
53
 *  @param length The key character string length. The parameter may be zero (0) which means that the string is processed until the terminating zero ('\\0') character is found. Input parameter.
3846 mejdrech 54
 *  @param value The integral value to be stored for the key character string. Input parameter.
55
 *  @returns EOK on success.
3912 mejdrech 56
 *  @returns ENOMEM if there is not enough memory left.
3846 mejdrech 57
 *  @returns EEXIST if the key character string is already used.
58
 */
59
int char_map_add_item( char_map_ref map, const char * identifier, size_t length, const int value );
3666 mejdrech 60
 
3846 mejdrech 61
/** Returns the node assigned to the key from the map.
62
 *  @param map The character string to integer map. Input parameter.
3912 mejdrech 63
 *  @param identifier The key zero ('\\0') terminated character string. The key character string is processed until the first terminating zero ('\\0') character after the given length is found. Input parameter.
64
 *  @param length The key character string length. The parameter may be zero (0) which means that the string is processed until the terminating zero ('\\0') character is found. Input parameter.
3846 mejdrech 65
 *  @returns The node holding the integral value assigned to the key character string.
66
 *  @returns NULL if the key is not assigned a&nbsp;node.
67
 */
68
char_map_ref    char_map_find_node( const char_map_ref map, const char * identifier, const size_t length );
69
 
70
/** Checks if the map is valid.
71
 *  @param map The character string to integer map. Input parameter.
72
 *  @returns TRUE if the map is valid.
73
 *  @returns FALSE otherwise.
74
 */
75
int char_map_is_valid( const char_map_ref map );
76
 
77
int char_map_add( char_map_ref map, const char * identifier, size_t length, const int value ){
78
    if( char_map_is_valid( map ) && ( identifier ) && (( length ) || ( * identifier ))){
3666 mejdrech 79
        int index;
80
 
81
        for( index = 0; index < map->next; ++ index ){
82
            if( map->items[ index ]->c == * identifier ){
83
                ++ identifier;
3846 mejdrech 84
                if( length ) -- length;
85
                if( length || ( * identifier )){
86
                    return char_map_add( map->items[ index ], identifier, length, value );
3666 mejdrech 87
                }else{
88
                    if( map->items[ index ]->value != CHAR_MAP_NULL ) return EEXISTS;
89
                    map->items[ index ]->value = value;
90
                    return EOK;
91
                }
92
            }
93
        }
3846 mejdrech 94
        return char_map_add_item( map, identifier, length, value );
3666 mejdrech 95
    }
96
    return EINVAL;
97
}
98
 
3846 mejdrech 99
int char_map_add_item( char_map_ref map, const char * identifier, size_t length, const int value ){
3666 mejdrech 100
    if( map->next == ( map->size - 1 )){
101
        char_map_ref    * tmp;
102
 
103
        tmp = ( char_map_ref * ) malloc( sizeof( char_map_ref ) * 2 * map->size );
104
        if( ! tmp ) return ENOMEM;
105
        map->size *= 2;
106
        memcpy( tmp, map->items, sizeof( char_map_ref ) * map->next );
107
        free( map->items );
108
        map->items = tmp;
109
    }
110
    map->items[ map->next ] = ( char_map_ref ) malloc( sizeof( char_map_t ));
111
    if( ! map->items[ map->next ] ) return ENOMEM;
112
    char_map_initialize( map->items[ map->next ] );
113
    map->items[ map->next ]->c = * identifier;
114
    ++ identifier;
3846 mejdrech 115
    if( length ) -- length;
116
    ++ map->next;
117
    if( length || ( * identifier )){
118
        map->items[ map->next - 1 ]->value = CHAR_MAP_NULL;
119
        return char_map_add_item( map->items[ map->next - 1 ], identifier, length, value );
3666 mejdrech 120
    }else{
3846 mejdrech 121
        map->items[ map->next - 1 ]->value = value;
3666 mejdrech 122
    }
123
    return EOK;
124
}
125
 
126
void char_map_destroy( char_map_ref map ){
127
    if( char_map_is_valid( map )){
128
        int index;
129
 
130
        map->magic = 0;
131
        for( index = 0; index < map->next; ++ index ){
132
            char_map_destroy( map->items[ index ] );
133
        }
134
        free( map->items );
135
    }
136
}
137
 
3846 mejdrech 138
int char_map_exclude( char_map_ref map, const char * identifier, size_t length ){
3666 mejdrech 139
    char_map_ref    node;
140
 
3846 mejdrech 141
    node = char_map_find_node( map, identifier, length );
3666 mejdrech 142
    if( node ){
143
        int value;
144
 
145
        value = node->value;
146
        node->value = CHAR_MAP_NULL;
147
        return value;
148
    }
149
    return CHAR_MAP_NULL;
150
}
151
 
3846 mejdrech 152
int char_map_find( const char_map_ref map, const char * identifier, size_t length ){
3666 mejdrech 153
    char_map_ref    node;
154
 
3846 mejdrech 155
    node = char_map_find_node( map, identifier, length );
3666 mejdrech 156
    return node ? node->value : CHAR_MAP_NULL;
157
}
158
 
3846 mejdrech 159
char_map_ref char_map_find_node( const char_map_ref map, const char * identifier, size_t length ){
3666 mejdrech 160
    if( ! char_map_is_valid( map )) return NULL;
3846 mejdrech 161
    if( length ) -- length;
162
    if( length || ( * identifier )){
3666 mejdrech 163
        int index;
164
 
165
        for( index = 0; index < map->next; ++ index ){
166
            if( map->items[ index ]->c == * identifier ){
167
                ++ identifier;
3846 mejdrech 168
                return char_map_find_node( map->items[ index ], identifier, length );
3666 mejdrech 169
            }
170
        }
171
        return NULL;
172
    }
173
    return map;
174
}
175
 
3846 mejdrech 176
int char_map_get_value( const char_map_ref map ){
3666 mejdrech 177
    return char_map_is_valid( map ) ? map->value : CHAR_MAP_NULL;
178
}
179
 
180
int char_map_initialize( char_map_ref map ){
181
    if( ! map ) return EINVAL;
182
    map->c = 0;
183
    map->value = CHAR_MAP_NULL;
184
    map->size = 2;
185
    map->next = 0;
186
    map->items = malloc( sizeof( char_map_ref ) * map->size );
187
    if( ! map->items ) return ENOMEM;
188
    map->items[ map->next ] = NULL;
189
    map->magic = CHAR_MAP_MAGIC_VALUE;
190
    return EOK;
191
}
192
 
3846 mejdrech 193
int char_map_is_valid( const char_map_ref map ){
3666 mejdrech 194
    return map && ( map->magic == CHAR_MAP_MAGIC_VALUE );
195
}
196
 
3846 mejdrech 197
int char_map_update( char_map_ref map, const char * identifier, const size_t length, const int value ){
3666 mejdrech 198
    char_map_ref    node;
199
 
200
//  if( ! char_map_is_valid( map )) return EINVAL;
3846 mejdrech 201
    node = char_map_find_node( map, identifier, length );
3666 mejdrech 202
    if( node ){
203
        node->value = value;
204
        return EOK;
205
    }else{
3846 mejdrech 206
        return char_map_add( map, identifier, length, value );
3666 mejdrech 207
    }
208
}
209
 
210
/** @}
211
 */