Rev 3886 | Rev 4505 | 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 |
||
34 | */ |
||
35 | |||
36 | #ifndef __GENERIC_CHAR_MAP_H__ |
||
37 | #define __GENERIC_CHAR_MAP_H__ |
||
38 | |||
39 | #include <unistd.h> |
||
40 | |||
3886 | mejdrech | 41 | #include "../err.h" |
42 | |||
3666 | mejdrech | 43 | #include "char_map.h" |
44 | #include "generic_field.h" |
||
45 | |||
46 | #define GENERIC_CHAR_MAP_MAGIC_VALUE 0x12345622 |
||
47 | |||
3846 | mejdrech | 48 | #define GENERIC_CHAR_MAP_DECLARE( name, type ) \ |
49 | \ |
||
50 | GENERIC_FIELD_DECLARE( name##_items, type ) \ |
||
51 | \ |
||
52 | typedef struct name name##_t; \ |
||
53 | typedef name##_t * name##_ref; \ |
||
54 | \ |
||
55 | struct name{ \ |
||
56 | char_map_t names; \ |
||
57 | name##_items_t values; \ |
||
58 | int magic; \ |
||
59 | }; \ |
||
60 | \ |
||
61 | int name##_add( name##_ref map, const char * name, const size_t length, type * value ); \ |
||
62 | int name##_count( name##_ref map ); \ |
||
63 | void name##_destroy( name##_ref map ); \ |
||
64 | void name##_exclude( name##_ref map, const char * name, const size_t length ); \ |
||
65 | type * name##_find( name##_ref map, const char * name, const size_t length ); \ |
||
66 | type * name##_get_index( name##_ref map, int index ); \ |
||
67 | int name##_initialize( name##_ref map ); \ |
||
3666 | mejdrech | 68 | int name##_is_valid( name##_ref map ); |
69 | |||
3846 | mejdrech | 70 | #define GENERIC_CHAR_MAP_IMPLEMENT( name, type ) \ |
71 | \ |
||
72 | GENERIC_FIELD_IMPLEMENT( name##_items, type ) \ |
||
73 | \ |
||
74 | int name##_add( name##_ref map, const char * name, const size_t length, type * value ){ \ |
||
75 | ERROR_DECLARE; \ |
||
76 | \ |
||
77 | int index; \ |
||
78 | \ |
||
79 | if( ! name##_is_valid( map )) return EINVAL; \ |
||
80 | index = name##_items_add( & map->values, value ); \ |
||
81 | if( index < 0 ) return index; \ |
||
3912 | mejdrech | 82 | if( ERROR_OCCURRED( char_map_add( & map->names, name, length, index ))){ \ |
3846 | mejdrech | 83 | name##_items_exclude_index( & map->values, index ); \ |
84 | return ERROR_CODE; \ |
||
85 | } \ |
||
86 | return EOK; \ |
||
87 | } \ |
||
88 | \ |
||
89 | int name##_count( name##_ref map ){ \ |
||
3666 | mejdrech | 90 | return name##_is_valid( map ) ? name##_items_count( & map->values ) : -1; \ |
3846 | mejdrech | 91 | } \ |
92 | \ |
||
93 | void name##_destroy( name##_ref map ){ \ |
||
94 | if( name##_is_valid( map )){ \ |
||
95 | char_map_destroy( & map->names ); \ |
||
96 | name##_items_destroy( & map->values ); \ |
||
97 | } \ |
||
98 | } \ |
||
99 | \ |
||
100 | void name##_exclude( name##_ref map, const char * name, const size_t length ){ \ |
||
101 | if( name##_is_valid( map )){ \ |
||
102 | int index; \ |
||
103 | \ |
||
104 | index = char_map_exclude( & map->names, name, length ); \ |
||
105 | if( index != CHAR_MAP_NULL ){ \ |
||
106 | name##_items_exclude_index( & map->values, index ); \ |
||
107 | } \ |
||
108 | } \ |
||
109 | } \ |
||
110 | \ |
||
111 | type * name##_find( name##_ref map, const char * name, const size_t length ){ \ |
||
112 | if( name##_is_valid( map )){ \ |
||
113 | int index; \ |
||
114 | \ |
||
115 | index = char_map_find( & map->names, name, length ); \ |
||
116 | if( index != CHAR_MAP_NULL ){ \ |
||
117 | return name##_items_get_index( & map->values, index ); \ |
||
118 | } \ |
||
119 | } \ |
||
120 | return NULL; \ |
||
121 | } \ |
||
122 | \ |
||
123 | int name##_initialize( name##_ref map ){ \ |
||
3912 | mejdrech | 124 | ERROR_DECLARE; \ |
125 | \ |
||
3846 | mejdrech | 126 | if( ! map ) return EINVAL; \ |
3912 | mejdrech | 127 | ERROR_PROPAGATE( char_map_initialize( & map->names )); \ |
128 | if( ERROR_OCCURRED( name##_items_initialize( & map->values ))){ \ |
||
129 | char_map_destroy( & map->names ); \ |
||
130 | return ERROR_CODE; \ |
||
131 | } \ |
||
3846 | mejdrech | 132 | map->magic = GENERIC_CHAR_MAP_MAGIC_VALUE; \ |
133 | return EOK; \ |
||
134 | } \ |
||
135 | \ |
||
136 | int name##_is_valid( name##_ref map ){ \ |
||
137 | return map && ( map->magic == GENERIC_CHAR_MAP_MAGIC_VALUE ); \ |
||
3666 | mejdrech | 138 | } |
139 | |||
140 | #endif |
||
141 | |||
142 | /** @} |
||
143 | */ |