Rev 4197 | Rev 4704 | 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 |
||
3912 | mejdrech | 30 | * @{ |
3666 | mejdrech | 31 | */ |
32 | |||
3912 | mejdrech | 33 | /** @file |
3666 | mejdrech | 34 | */ |
35 | |||
36 | #ifndef __GENERIC_FIELD_H__ |
||
37 | #define __GENERIC_FIELD_H__ |
||
38 | |||
39 | #include <errno.h> |
||
40 | #include <malloc.h> |
||
4192 | mejdrech | 41 | #include <mem.h> |
3666 | mejdrech | 42 | #include <unistd.h> |
43 | |||
44 | #define GENERIC_FIELD_MAGIC_VALUE 0x55667788 |
||
45 | |||
46 | #define GENERIC_FIELD_DECLARE( name, type ) \ |
||
47 | \ |
||
48 | typedef struct name name##_t; \ |
||
49 | typedef name##_t * name##_ref; \ |
||
50 | \ |
||
51 | struct name{ \ |
||
4243 | mejdrech | 52 | size_t size; \ |
3666 | mejdrech | 53 | int next; \ |
54 | type ** items; \ |
||
55 | int magic; \ |
||
56 | }; \ |
||
57 | \ |
||
58 | int name##_add( name##_ref field, type * value ); \ |
||
59 | int name##_count( name##_ref field ); \ |
||
60 | void name##_destroy( name##_ref field ); \ |
||
61 | void name##_exclude_index( name##_ref field, int index ); \ |
||
62 | type ** name##_get_field( name##_ref field ); \ |
||
63 | type * name##_get_index( name##_ref field, int index ); \ |
||
64 | int name##_initialize( name##_ref field ); \ |
||
65 | int name##_is_valid( name##_ref field ); |
||
66 | |||
67 | #define GENERIC_FIELD_IMPLEMENT( name, type ) \ |
||
68 | \ |
||
69 | int name##_add( name##_ref field, type * value ){ \ |
||
70 | if( name##_is_valid( field )){ \ |
||
71 | if( field->next == ( field->size - 1 )){ \ |
||
72 | type ** tmp; \ |
||
73 | \ |
||
4197 | mejdrech | 74 | tmp = ( type ** ) realloc( field->items, sizeof( type * ) * 2 * field->size ); \ |
3666 | mejdrech | 75 | if( ! tmp ) return ENOMEM; \ |
76 | field->size *= 2; \ |
||
77 | field->items = tmp; \ |
||
78 | } \ |
||
79 | field->items[ field->next ] = value; \ |
||
80 | ++ field->next; \ |
||
81 | field->items[ field->next ] = NULL; \ |
||
82 | return field->next - 1; \ |
||
83 | } \ |
||
84 | return EINVAL; \ |
||
85 | } \ |
||
86 | \ |
||
87 | int name##_count( name##_ref field ){ \ |
||
88 | return name##_is_valid( field ) ? field->next : -1; \ |
||
89 | } \ |
||
90 | \ |
||
91 | void name##_destroy( name##_ref field ){ \ |
||
92 | if( name##_is_valid( field )){ \ |
||
93 | int index; \ |
||
94 | \ |
||
95 | field->magic = 0; \ |
||
96 | for( index = 0; index < field->next; ++ index ){ \ |
||
97 | free( field->items[ index ] ); \ |
||
98 | } \ |
||
99 | free( field->items ); \ |
||
100 | } \ |
||
101 | } \ |
||
102 | \ |
||
103 | void name##_exclude_index( name##_ref field, int index ){ \ |
||
104 | if( name##_is_valid( field ) && ( index >= 0 ) && ( index < field->next ) && ( field->items[ index ] )){ \ |
||
105 | free( field->items[ index ] ); \ |
||
106 | field->items[ index ] = NULL; \ |
||
107 | } \ |
||
108 | } \ |
||
109 | \ |
||
110 | type * name##_get_index( name##_ref field, int index ){ \ |
||
111 | if( name##_is_valid( field ) && ( index >= 0 ) && ( index < field->next ) && ( field->items[ index ] )){ \ |
||
112 | return field->items[ index ]; \ |
||
113 | } \ |
||
114 | return NULL; \ |
||
115 | } \ |
||
116 | \ |
||
117 | type ** name##_get_field( name##_ref field ){ \ |
||
118 | return name##_is_valid( field ) ? field->items : NULL; \ |
||
119 | } \ |
||
120 | \ |
||
121 | int name##_initialize( name##_ref field ){ \ |
||
122 | if( ! field ) return EINVAL; \ |
||
123 | field->size = 2; \ |
||
124 | field->next = 0; \ |
||
125 | field->items = ( type ** ) malloc( sizeof( type * ) * field->size ); \ |
||
126 | if( ! field->items ) return ENOMEM; \ |
||
127 | field->items[ field->next ] = NULL; \ |
||
3901 | mejdrech | 128 | field->magic = GENERIC_FIELD_MAGIC_VALUE; \ |
3666 | mejdrech | 129 | return EOK; \ |
130 | } \ |
||
131 | \ |
||
132 | int name##_is_valid( name##_ref field ){ \ |
||
3901 | mejdrech | 133 | return field && ( field->magic == GENERIC_FIELD_MAGIC_VALUE ); \ |
3666 | mejdrech | 134 | } |
135 | |||
136 | #endif |
||
137 | |||
138 | /** @} |
||
139 | */ |
||
140 |