| [21580dd] | 1 | /*
|
|---|
| 2 | * Copyright (c) 2009 Lukas 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
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 |
|
|---|
| 33 | /** @file
|
|---|
| 34 | * Character string to generic type map.
|
|---|
| 35 | */
|
|---|
| 36 |
|
|---|
| 37 | #ifndef __GENERIC_CHAR_MAP_H__
|
|---|
| 38 | #define __GENERIC_CHAR_MAP_H__
|
|---|
| 39 |
|
|---|
| 40 | #include <errno.h>
|
|---|
| 41 | #include <unistd.h>
|
|---|
| 42 |
|
|---|
| 43 | #include "../err.h"
|
|---|
| 44 |
|
|---|
| 45 | #include "char_map.h"
|
|---|
| 46 | #include "generic_field.h"
|
|---|
| 47 |
|
|---|
| 48 | /** Internal magic value for a map consistency check.
|
|---|
| 49 | */
|
|---|
| 50 | #define GENERIC_CHAR_MAP_MAGIC_VALUE 0x12345622
|
|---|
| 51 |
|
|---|
| 52 | /** Character string to generic type map declaration.
|
|---|
| 53 | * @param[in] name Name of the map.
|
|---|
| 54 | * @param[in] type Inner object type.
|
|---|
| 55 | */
|
|---|
| [aadf01e] | 56 | #define GENERIC_CHAR_MAP_DECLARE(name, type) \
|
|---|
| [21580dd] | 57 | \
|
|---|
| [aadf01e] | 58 | GENERIC_FIELD_DECLARE(name##_items, type) \
|
|---|
| [21580dd] | 59 | \
|
|---|
| 60 | typedef struct name name##_t; \
|
|---|
| 61 | typedef name##_t * name##_ref; \
|
|---|
| 62 | \
|
|---|
| 63 | struct name{ \
|
|---|
| [aadf01e] | 64 | char_map_t names; \
|
|---|
| 65 | name##_items_t values; \
|
|---|
| 66 | int magic; \
|
|---|
| [21580dd] | 67 | }; \
|
|---|
| 68 | \
|
|---|
| [aadf01e] | 69 | int name##_add(name##_ref map, const char * name, const size_t length, type * value); \
|
|---|
| 70 | int name##_count(name##_ref map); \
|
|---|
| 71 | void name##_destroy(name##_ref map); \
|
|---|
| 72 | void name##_exclude(name##_ref map, const char * name, const size_t length); \
|
|---|
| 73 | type * name##_find(name##_ref map, const char * name, const size_t length); \
|
|---|
| 74 | int name##_initialize(name##_ref map); \
|
|---|
| 75 | int name##_is_valid(name##_ref map);
|
|---|
| [21580dd] | 76 |
|
|---|
| 77 | /** Character string to generic type map implementation.
|
|---|
| 78 | * Should follow declaration with the same parameters.
|
|---|
| 79 | * @param[in] name Name of the map.
|
|---|
| 80 | * @param[in] type Inner object type.
|
|---|
| 81 | */
|
|---|
| [aadf01e] | 82 | #define GENERIC_CHAR_MAP_IMPLEMENT(name, type) \
|
|---|
| [21580dd] | 83 | \
|
|---|
| [aadf01e] | 84 | GENERIC_FIELD_IMPLEMENT(name##_items, type) \
|
|---|
| [21580dd] | 85 | \
|
|---|
| [aadf01e] | 86 | int name##_add(name##_ref map, const char * name, const size_t length, type * value){ \
|
|---|
| [21580dd] | 87 | ERROR_DECLARE; \
|
|---|
| 88 | \
|
|---|
| [aadf01e] | 89 | int index; \
|
|---|
| [21580dd] | 90 | \
|
|---|
| [aadf01e] | 91 | if(! name##_is_valid(map)){ \
|
|---|
| 92 | return EINVAL; \
|
|---|
| 93 | } \
|
|---|
| 94 | index = name##_items_add(&map->values, value); \
|
|---|
| 95 | if(index < 0){ \
|
|---|
| 96 | return index; \
|
|---|
| 97 | } \
|
|---|
| 98 | if(ERROR_OCCURRED(char_map_add(&map->names, name, length, index))){ \
|
|---|
| 99 | name##_items_exclude_index(&map->values, index); \
|
|---|
| [21580dd] | 100 | return ERROR_CODE; \
|
|---|
| 101 | } \
|
|---|
| 102 | return EOK; \
|
|---|
| 103 | } \
|
|---|
| 104 | \
|
|---|
| [aadf01e] | 105 | int name##_count(name##_ref map){ \
|
|---|
| 106 | return name##_is_valid(map) ? name##_items_count(&map->values) : -1; \
|
|---|
| [21580dd] | 107 | } \
|
|---|
| 108 | \
|
|---|
| [aadf01e] | 109 | void name##_destroy(name##_ref map){ \
|
|---|
| 110 | if(name##_is_valid(map)){ \
|
|---|
| 111 | char_map_destroy(&map->names); \
|
|---|
| 112 | name##_items_destroy(&map->values); \
|
|---|
| [21580dd] | 113 | } \
|
|---|
| 114 | } \
|
|---|
| 115 | \
|
|---|
| [aadf01e] | 116 | void name##_exclude(name##_ref map, const char * name, const size_t length){ \
|
|---|
| 117 | if(name##_is_valid(map)){ \
|
|---|
| 118 | int index; \
|
|---|
| [21580dd] | 119 | \
|
|---|
| [aadf01e] | 120 | index = char_map_exclude(&map->names, name, length); \
|
|---|
| 121 | if(index != CHAR_MAP_NULL){ \
|
|---|
| 122 | name##_items_exclude_index(&map->values, index); \
|
|---|
| [21580dd] | 123 | } \
|
|---|
| 124 | } \
|
|---|
| 125 | } \
|
|---|
| 126 | \
|
|---|
| [aadf01e] | 127 | type * name##_find(name##_ref map, const char * name, const size_t length){ \
|
|---|
| 128 | if(name##_is_valid(map)){ \
|
|---|
| 129 | int index; \
|
|---|
| [21580dd] | 130 | \
|
|---|
| [aadf01e] | 131 | index = char_map_find(&map->names, name, length); \
|
|---|
| 132 | if(index != CHAR_MAP_NULL){ \
|
|---|
| 133 | return name##_items_get_index(&map->values, index); \
|
|---|
| [21580dd] | 134 | } \
|
|---|
| 135 | } \
|
|---|
| 136 | return NULL; \
|
|---|
| 137 | } \
|
|---|
| 138 | \
|
|---|
| [aadf01e] | 139 | int name##_initialize(name##_ref map){ \
|
|---|
| [21580dd] | 140 | ERROR_DECLARE; \
|
|---|
| 141 | \
|
|---|
| [aadf01e] | 142 | if(! map){ \
|
|---|
| 143 | return EINVAL; \
|
|---|
| 144 | } \
|
|---|
| 145 | ERROR_PROPAGATE(char_map_initialize(&map->names)); \
|
|---|
| 146 | if(ERROR_OCCURRED(name##_items_initialize(&map->values))){ \
|
|---|
| 147 | char_map_destroy(&map->names); \
|
|---|
| [21580dd] | 148 | return ERROR_CODE; \
|
|---|
| 149 | } \
|
|---|
| 150 | map->magic = GENERIC_CHAR_MAP_MAGIC_VALUE; \
|
|---|
| 151 | return EOK; \
|
|---|
| 152 | } \
|
|---|
| 153 | \
|
|---|
| [aadf01e] | 154 | int name##_is_valid(name##_ref map){ \
|
|---|
| 155 | return map && (map->magic == GENERIC_CHAR_MAP_MAGIC_VALUE); \
|
|---|
| [21580dd] | 156 | }
|
|---|
| 157 |
|
|---|
| 158 | #endif
|
|---|
| 159 |
|
|---|
| 160 | /** @}
|
|---|
| 161 | */
|
|---|
