[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 |
|
---|
[2544442] | 29 | /** @addtogroup libc
|
---|
[21580dd] | 30 | * @{
|
---|
| 31 | */
|
---|
| 32 |
|
---|
| 33 | /** @file
|
---|
[edba2b6f] | 34 | * Character string with measured length implementation.
|
---|
| 35 | * @see measured_strings.h
|
---|
[21580dd] | 36 | */
|
---|
| 37 |
|
---|
[7390870] | 38 | #include <adt/measured_strings.h>
|
---|
[21580dd] | 39 | #include <malloc.h>
|
---|
| 40 | #include <mem.h>
|
---|
| 41 | #include <unistd.h>
|
---|
[c5b59ce] | 42 | #include <errno.h>
|
---|
| 43 | #include <err.h>
|
---|
[7390870] | 44 | #include <async.h>
|
---|
[21580dd] | 45 |
|
---|
[edba2b6f] | 46 | /** Creates a new measured string bundled with a copy of the given string
|
---|
| 47 | * itself as one memory block.
|
---|
| 48 | *
|
---|
| 49 | * If the measured string is being freed, whole memory block is freed.
|
---|
| 50 | * The measured string should be used only as a constant.
|
---|
| 51 | *
|
---|
| 52 | * @param[in] string The initial character string to be stored.
|
---|
| 53 | * @param[in] length The length of the given string without the terminating
|
---|
[d2b1040] | 54 | * zero ('\0') character. If the length is zero, the actual
|
---|
| 55 | * length is computed. The given length is used and
|
---|
| 56 | * appended with the terminating zero ('\0') character
|
---|
[edba2b6f] | 57 | * otherwise.
|
---|
| 58 | * @returns The new bundled character string with measured length.
|
---|
| 59 | * @returns NULL if there is not enough memory left.
|
---|
| 60 | */
|
---|
| 61 | measured_string_ref
|
---|
[d2b1040] | 62 | measured_string_create_bulk(const char *string, size_t length)
|
---|
[edba2b6f] | 63 | {
|
---|
[aadf01e] | 64 | measured_string_ref new;
|
---|
[21580dd] | 65 |
|
---|
[edba2b6f] | 66 | if (length == 0) {
|
---|
| 67 | while (string[length])
|
---|
[d2b1040] | 68 | length++;
|
---|
[aadf01e] | 69 | }
|
---|
[edba2b6f] | 70 | new = (measured_string_ref) malloc(sizeof(measured_string_t) +
|
---|
| 71 | (sizeof(char) * (length + 1)));
|
---|
| 72 | if (!new)
|
---|
[aadf01e] | 73 | return NULL;
|
---|
[edba2b6f] | 74 |
|
---|
[21580dd] | 75 | new->length = length;
|
---|
[aadf01e] | 76 | new->value = ((char *) new) + sizeof(measured_string_t);
|
---|
[21580dd] | 77 | // append terminating zero explicitly - to be safe
|
---|
[aadf01e] | 78 | memcpy(new->value, string, new->length);
|
---|
| 79 | new->value[new->length] = '\0';
|
---|
[edba2b6f] | 80 |
|
---|
[21580dd] | 81 | return new;
|
---|
| 82 | }
|
---|
| 83 |
|
---|
[edba2b6f] | 84 | /** Copies the given measured string with separated header and data parts.
|
---|
| 85 | *
|
---|
| 86 | * @param[in] source The source measured string to be copied.
|
---|
| 87 | * @returns The copy of the given measured string.
|
---|
| 88 | * @returns NULL if the source parameter is NULL.
|
---|
| 89 | * @returns NULL if there is not enough memory left.
|
---|
| 90 | */
|
---|
| 91 | measured_string_ref measured_string_copy(measured_string_ref source)
|
---|
| 92 | {
|
---|
[aadf01e] | 93 | measured_string_ref new;
|
---|
[21580dd] | 94 |
|
---|
[edba2b6f] | 95 | if (!source)
|
---|
[aadf01e] | 96 | return NULL;
|
---|
[edba2b6f] | 97 |
|
---|
[aadf01e] | 98 | new = (measured_string_ref) malloc(sizeof(measured_string_t));
|
---|
[edba2b6f] | 99 | if (new) {
|
---|
[aadf01e] | 100 | new->value = (char *) malloc(source->length + 1);
|
---|
[edba2b6f] | 101 | if (new->value) {
|
---|
[21580dd] | 102 | new->length = source->length;
|
---|
[aadf01e] | 103 | memcpy(new->value, source->value, new->length);
|
---|
| 104 | new->value[new->length] = '\0';
|
---|
[21580dd] | 105 | return new;
|
---|
| 106 | }
|
---|
[d2b1040] | 107 | free(new);
|
---|
[21580dd] | 108 | }
|
---|
[edba2b6f] | 109 |
|
---|
[21580dd] | 110 | return NULL;
|
---|
| 111 | }
|
---|
| 112 |
|
---|
[edba2b6f] | 113 | /** Receives a measured strings array from a calling module.
|
---|
| 114 | *
|
---|
| 115 | * Creates the array and the data memory blocks.
|
---|
| 116 | * This method should be used only while processing IPC messages as the array
|
---|
| 117 | * size has to be negotiated in advance.
|
---|
| 118 | *
|
---|
| 119 | * @param[out] strings The received measured strings array.
|
---|
| 120 | * @param[out] data The measured strings data. This memory block stores the
|
---|
| 121 | * actual character strings.
|
---|
| 122 | * @param[in] count The size of the measured strings array.
|
---|
| 123 | * @returns EOK on success.
|
---|
| 124 | * @returns EINVAL if the strings or data parameter is NULL.
|
---|
| 125 | * @returns EINVAL if the count parameter is zero (0).
|
---|
| 126 | * @returns EINVAL if the sent array differs in size.
|
---|
| 127 | * @returns EINVAL if there is inconsistency in sent measured
|
---|
| 128 | * strings' lengths (should not occur).
|
---|
| 129 | * @returns ENOMEM if there is not enough memory left.
|
---|
| 130 | * @returns Other error codes as defined for the
|
---|
| 131 | * async_data_write_finalize() function.
|
---|
| 132 | */
|
---|
| 133 | int
|
---|
| 134 | measured_strings_receive(measured_string_ref *strings, char **data,
|
---|
| 135 | size_t count)
|
---|
| 136 | {
|
---|
[21580dd] | 137 | ERROR_DECLARE;
|
---|
| 138 |
|
---|
[edba2b6f] | 139 | size_t *lengths;
|
---|
[aadf01e] | 140 | size_t index;
|
---|
| 141 | size_t length;
|
---|
[edba2b6f] | 142 | char *next;
|
---|
[aadf01e] | 143 | ipc_callid_t callid;
|
---|
[21580dd] | 144 |
|
---|
[edba2b6f] | 145 | if ((!strings) || (!data) || (count <= 0))
|
---|
[21580dd] | 146 | return EINVAL;
|
---|
[edba2b6f] | 147 |
|
---|
[aadf01e] | 148 | lengths = (size_t *) malloc(sizeof(size_t) * (count + 1));
|
---|
[edba2b6f] | 149 | if (!lengths)
|
---|
[aadf01e] | 150 | return ENOMEM;
|
---|
[edba2b6f] | 151 |
|
---|
| 152 | if ((!async_data_write_receive(&callid, &length)) ||
|
---|
| 153 | (length != sizeof(size_t) * (count + 1))) {
|
---|
[aadf01e] | 154 | free(lengths);
|
---|
[21580dd] | 155 | return EINVAL;
|
---|
| 156 | }
|
---|
[d2b1040] | 157 | if (ERROR_OCCURRED(async_data_write_finalize(callid, lengths,
|
---|
| 158 | length))) {
|
---|
[aadf01e] | 159 | free(lengths);
|
---|
[21580dd] | 160 | return ERROR_CODE;
|
---|
| 161 | }
|
---|
[0402bda5] | 162 |
|
---|
[aadf01e] | 163 | *data = malloc(lengths[count]);
|
---|
[d2b1040] | 164 | if (!*data) {
|
---|
[0402bda5] | 165 | free(lengths);
|
---|
[aadf01e] | 166 | return ENOMEM;
|
---|
| 167 | }
|
---|
| 168 | (*data)[lengths[count] - 1] = '\0';
|
---|
[edba2b6f] | 169 |
|
---|
| 170 | *strings = (measured_string_ref) malloc(sizeof(measured_string_t) *
|
---|
| 171 | count);
|
---|
[d2b1040] | 172 | if (!*strings) {
|
---|
[aadf01e] | 173 | free(lengths);
|
---|
| 174 | free(*data);
|
---|
[21580dd] | 175 | return ENOMEM;
|
---|
| 176 | }
|
---|
[edba2b6f] | 177 |
|
---|
| 178 | next = *data;
|
---|
[d2b1040] | 179 | for (index = 0; index < count; index++) {
|
---|
[aadf01e] | 180 | (*strings)[index].length = lengths[index];
|
---|
[edba2b6f] | 181 | if (lengths[index] > 0) {
|
---|
[d2b1040] | 182 | if (!async_data_write_receive(&callid, &length) ||
|
---|
[edba2b6f] | 183 | (length != lengths[index])) {
|
---|
[aadf01e] | 184 | free(*data);
|
---|
| 185 | free(*strings);
|
---|
| 186 | free(lengths);
|
---|
[21580dd] | 187 | return EINVAL;
|
---|
| 188 | }
|
---|
[edba2b6f] | 189 | ERROR_PROPAGATE(async_data_write_finalize(callid, next,
|
---|
| 190 | lengths[index]));
|
---|
[aadf01e] | 191 | (*strings)[index].value = next;
|
---|
| 192 | next += lengths[index];
|
---|
[d2b1040] | 193 | *next++ = '\0';
|
---|
[edba2b6f] | 194 | } else {
|
---|
[aadf01e] | 195 | (*strings)[index].value = NULL;
|
---|
[21580dd] | 196 | }
|
---|
| 197 | }
|
---|
[edba2b6f] | 198 |
|
---|
[aadf01e] | 199 | free(lengths);
|
---|
[21580dd] | 200 | return EOK;
|
---|
| 201 | }
|
---|
| 202 |
|
---|
[849ed54] | 203 | /** Computes the lengths of the measured strings in the given array.
|
---|
[edba2b6f] | 204 | *
|
---|
| 205 | * @param[in] strings The measured strings array to be processed.
|
---|
| 206 | * @param[in] count The measured strings array size.
|
---|
| 207 | * @returns The computed sizes array.
|
---|
| 208 | * @returns NULL if there is not enough memory left.
|
---|
[849ed54] | 209 | */
|
---|
[edba2b6f] | 210 | static size_t *prepare_lengths(const measured_string_ref strings, size_t count)
|
---|
| 211 | {
|
---|
| 212 | size_t *lengths;
|
---|
[849ed54] | 213 | size_t index;
|
---|
| 214 | size_t length;
|
---|
| 215 |
|
---|
| 216 | lengths = (size_t *) malloc(sizeof(size_t) * (count + 1));
|
---|
[edba2b6f] | 217 | if (!lengths)
|
---|
[849ed54] | 218 | return NULL;
|
---|
[edba2b6f] | 219 |
|
---|
[849ed54] | 220 | length = 0;
|
---|
[d2b1040] | 221 | for (index = 0; index < count; index++) {
|
---|
[849ed54] | 222 | lengths[index] = strings[index].length;
|
---|
| 223 | length += lengths[index] + 1;
|
---|
| 224 | }
|
---|
| 225 | lengths[count] = length;
|
---|
| 226 | return lengths;
|
---|
| 227 | }
|
---|
| 228 |
|
---|
[edba2b6f] | 229 | /** Replies the given measured strings array to a calling module.
|
---|
| 230 | *
|
---|
| 231 | * This method should be used only while processing IPC messages as the array
|
---|
| 232 | * size has to be negotiated in advance.
|
---|
| 233 | *
|
---|
| 234 | * @param[in] strings The measured strings array to be transferred.
|
---|
| 235 | * @param[in] count The measured strings array size.
|
---|
| 236 | * @returns EOK on success.
|
---|
| 237 | * @returns EINVAL if the strings parameter is NULL.
|
---|
| 238 | * @returns EINVAL if the count parameter is zero (0).
|
---|
| 239 | * @returns EINVAL if the calling module does not accept the given
|
---|
| 240 | * array size.
|
---|
| 241 | * @returns EINVAL if there is inconsistency in sent measured
|
---|
| 242 | * strings' lengths (should not occur).
|
---|
| 243 | * @returns Other error codes as defined for the
|
---|
| 244 | * async_data_read_finalize() function.
|
---|
| 245 | */
|
---|
| 246 | int measured_strings_reply(const measured_string_ref strings, size_t count)
|
---|
| 247 | {
|
---|
[21580dd] | 248 | ERROR_DECLARE;
|
---|
| 249 |
|
---|
[edba2b6f] | 250 | size_t *lengths;
|
---|
[aadf01e] | 251 | size_t index;
|
---|
| 252 | size_t length;
|
---|
| 253 | ipc_callid_t callid;
|
---|
[21580dd] | 254 |
|
---|
[edba2b6f] | 255 | if ((!strings) || (count <= 0))
|
---|
[21580dd] | 256 | return EINVAL;
|
---|
[edba2b6f] | 257 |
|
---|
[aadf01e] | 258 | lengths = prepare_lengths(strings, count);
|
---|
[edba2b6f] | 259 | if (!lengths)
|
---|
[aadf01e] | 260 | return ENOMEM;
|
---|
[edba2b6f] | 261 |
|
---|
[d2b1040] | 262 | if (!async_data_read_receive(&callid, &length) ||
|
---|
[edba2b6f] | 263 | (length != sizeof(size_t) * (count + 1))) {
|
---|
[aadf01e] | 264 | free(lengths);
|
---|
[21580dd] | 265 | return EINVAL;
|
---|
| 266 | }
|
---|
[d2b1040] | 267 | if (ERROR_OCCURRED(async_data_read_finalize(callid, lengths, length))) {
|
---|
[aadf01e] | 268 | free(lengths);
|
---|
[21580dd] | 269 | return ERROR_CODE;
|
---|
| 270 | }
|
---|
[aadf01e] | 271 | free(lengths);
|
---|
[edba2b6f] | 272 |
|
---|
[d2b1040] | 273 | for (index = 0; index < count; index++) {
|
---|
[edba2b6f] | 274 | if (strings[index].length > 0) {
|
---|
[d2b1040] | 275 | if (!async_data_read_receive(&callid, &length) ||
|
---|
[edba2b6f] | 276 | (length != strings[index].length)) {
|
---|
[21580dd] | 277 | return EINVAL;
|
---|
| 278 | }
|
---|
[edba2b6f] | 279 | ERROR_PROPAGATE(async_data_read_finalize(callid,
|
---|
| 280 | strings[index].value, strings[index].length));
|
---|
[21580dd] | 281 | }
|
---|
| 282 | }
|
---|
[edba2b6f] | 283 |
|
---|
[21580dd] | 284 | return EOK;
|
---|
| 285 | }
|
---|
| 286 |
|
---|
[edba2b6f] | 287 | /** Receives a measured strings array from another module.
|
---|
| 288 | *
|
---|
| 289 | * Creates the array and the data memory blocks.
|
---|
| 290 | * This method should be used only following other IPC messages as the array
|
---|
| 291 | * size has to be negotiated in advance.
|
---|
| 292 | *
|
---|
| 293 | * @param[in] phone The other module phone.
|
---|
| 294 | * @param[out] strings The returned measured strings array.
|
---|
| 295 | * @param[out] data The measured strings data. This memory block stores the
|
---|
| 296 | * actual character strings.
|
---|
| 297 | * @param[in] count The size of the measured strings array.
|
---|
| 298 | * @returns EOK on success.
|
---|
| 299 | * @returns EINVAL if the strings or data parameter is NULL.
|
---|
| 300 | * @returns EINVAL if the phone or count parameter is not positive.
|
---|
| 301 | * @returns EINVAL if the sent array differs in size.
|
---|
| 302 | * @returns ENOMEM if there is not enough memory left.
|
---|
| 303 | * @returns Other error codes as defined for the
|
---|
| 304 | * async_data_read_start() function.
|
---|
| 305 | */
|
---|
| 306 | int
|
---|
| 307 | measured_strings_return(int phone, measured_string_ref *strings, char **data,
|
---|
| 308 | size_t count)
|
---|
| 309 | {
|
---|
[21580dd] | 310 | ERROR_DECLARE;
|
---|
| 311 |
|
---|
[edba2b6f] | 312 | size_t *lengths;
|
---|
[aadf01e] | 313 | size_t index;
|
---|
[edba2b6f] | 314 | char *next;
|
---|
[21580dd] | 315 |
|
---|
[d2b1040] | 316 | if ((phone < 0) || (!strings) || (!data) || (count <= 0))
|
---|
[21580dd] | 317 | return EINVAL;
|
---|
[edba2b6f] | 318 |
|
---|
[aadf01e] | 319 | lengths = (size_t *) malloc(sizeof(size_t) * (count + 1));
|
---|
[edba2b6f] | 320 | if (!lengths)
|
---|
[aadf01e] | 321 | return ENOMEM;
|
---|
[edba2b6f] | 322 |
|
---|
| 323 | if (ERROR_OCCURRED(async_data_read_start(phone, lengths,
|
---|
| 324 | sizeof(size_t) * (count + 1)))) {
|
---|
[aadf01e] | 325 | free(lengths);
|
---|
[21580dd] | 326 | return ERROR_CODE;
|
---|
| 327 | }
|
---|
[edba2b6f] | 328 |
|
---|
[aadf01e] | 329 | *data = malloc(lengths[count]);
|
---|
[d2b1040] | 330 | if (!*data) {
|
---|
[0402bda5] | 331 | free(lengths);
|
---|
[aadf01e] | 332 | return ENOMEM;
|
---|
| 333 | }
|
---|
[edba2b6f] | 334 |
|
---|
| 335 | *strings = (measured_string_ref) malloc(sizeof(measured_string_t) *
|
---|
| 336 | count);
|
---|
[d2b1040] | 337 | if (!*strings) {
|
---|
[aadf01e] | 338 | free(lengths);
|
---|
| 339 | free(*data);
|
---|
[21580dd] | 340 | return ENOMEM;
|
---|
| 341 | }
|
---|
[edba2b6f] | 342 |
|
---|
| 343 | next = *data;
|
---|
[d2b1040] | 344 | for (index = 0; index < count; index++) {
|
---|
[aadf01e] | 345 | (*strings)[index].length = lengths[index];
|
---|
[edba2b6f] | 346 | if (lengths[index] > 0) {
|
---|
| 347 | ERROR_PROPAGATE(async_data_read_start(phone, next,
|
---|
| 348 | lengths[index]));
|
---|
[aadf01e] | 349 | (*strings)[index].value = next;
|
---|
| 350 | next += lengths[index];
|
---|
[d2b1040] | 351 | *next++ = '\0';
|
---|
[edba2b6f] | 352 | } else {
|
---|
[aadf01e] | 353 | (*strings)[index].value = NULL;
|
---|
[21580dd] | 354 | }
|
---|
| 355 | }
|
---|
[edba2b6f] | 356 |
|
---|
[aadf01e] | 357 | free(lengths);
|
---|
[21580dd] | 358 | return EOK;
|
---|
| 359 | }
|
---|
| 360 |
|
---|
[edba2b6f] | 361 | /** Sends the given measured strings array to another module.
|
---|
| 362 | *
|
---|
| 363 | * This method should be used only following other IPC messages as the array
|
---|
| 364 | * size has to be negotiated in advance.
|
---|
| 365 | *
|
---|
| 366 | * @param[in] phone The other module phone.
|
---|
| 367 | * @param[in] strings The measured strings array to be transferred.
|
---|
| 368 | * @param[in] count The measured strings array size.
|
---|
| 369 | * @returns EOK on success.
|
---|
| 370 | * @returns EINVAL if the strings parameter is NULL.
|
---|
| 371 | * @returns EINVAL if the phone or count parameter is not positive.
|
---|
| 372 | * @returns Other error codes as defined for the
|
---|
| 373 | * async_data_write_start() function.
|
---|
| 374 | */
|
---|
| 375 | int
|
---|
| 376 | measured_strings_send(int phone, const measured_string_ref strings,
|
---|
| 377 | size_t count)
|
---|
| 378 | {
|
---|
[21580dd] | 379 | ERROR_DECLARE;
|
---|
| 380 |
|
---|
[edba2b6f] | 381 | size_t *lengths;
|
---|
[aadf01e] | 382 | size_t index;
|
---|
[21580dd] | 383 |
|
---|
[d2b1040] | 384 | if ((phone < 0) || (!strings) || (count <= 0))
|
---|
[21580dd] | 385 | return EINVAL;
|
---|
[edba2b6f] | 386 |
|
---|
[aadf01e] | 387 | lengths = prepare_lengths(strings, count);
|
---|
[edba2b6f] | 388 | if (!lengths)
|
---|
[aadf01e] | 389 | return ENOMEM;
|
---|
[edba2b6f] | 390 |
|
---|
| 391 | if (ERROR_OCCURRED(async_data_write_start(phone, lengths,
|
---|
| 392 | sizeof(size_t) * (count + 1)))) {
|
---|
[aadf01e] | 393 | free(lengths);
|
---|
[21580dd] | 394 | return ERROR_CODE;
|
---|
| 395 | }
|
---|
[edba2b6f] | 396 |
|
---|
[aadf01e] | 397 | free(lengths);
|
---|
[edba2b6f] | 398 |
|
---|
[d2b1040] | 399 | for (index = 0; index < count; index++) {
|
---|
[edba2b6f] | 400 | if (strings[index].length > 0) {
|
---|
| 401 | ERROR_PROPAGATE(async_data_write_start(phone,
|
---|
| 402 | strings[index].value, strings[index].length));
|
---|
[21580dd] | 403 | }
|
---|
| 404 | }
|
---|
[edba2b6f] | 405 |
|
---|
[21580dd] | 406 | return EOK;
|
---|
| 407 | }
|
---|
| 408 |
|
---|
| 409 | /** @}
|
---|
| 410 | */
|
---|
| 411 |
|
---|