| 1 | /* |
| 2 | * librdkafka - The Apache Kafka C/C++ library |
| 3 | * |
| 4 | * Copyright (c) 2017 Magnus Edenhill |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions are met: |
| 9 | * |
| 10 | * 1. Redistributions of source code must retain the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 13 | * this list of conditions and the following disclaimer in the documentation |
| 14 | * and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 26 | * POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | |
| 30 | #ifndef _RDSTRING_H_ |
| 31 | #define _RDSTRING_H_ |
| 32 | |
| 33 | |
| 34 | |
| 35 | char *rd_string_render (const char *templ, |
| 36 | char *errstr, size_t errstr_size, |
| 37 | ssize_t (*callback) (const char *key, |
| 38 | char *buf, size_t size, |
| 39 | void *opaque), |
| 40 | void *opaque); |
| 41 | |
| 42 | |
| 43 | |
| 44 | /** |
| 45 | * @brief An immutable string tuple (name, value) in a single allocation. |
| 46 | * \p value may be NULL. |
| 47 | */ |
| 48 | typedef struct rd_strtup_s { |
| 49 | char *value; |
| 50 | char name[1]; /* Actual allocation of name + val here */ |
| 51 | } rd_strtup_t; |
| 52 | |
| 53 | void rd_strtup_destroy (rd_strtup_t *strtup); |
| 54 | void rd_strtup_free (void *strtup); |
| 55 | rd_strtup_t *rd_strtup_new0 (const char *name, ssize_t name_len, |
| 56 | const char *value, ssize_t value_len); |
| 57 | rd_strtup_t *rd_strtup_new (const char *name, const char *value); |
| 58 | rd_strtup_t *rd_strtup_dup (const rd_strtup_t *strtup); |
| 59 | void *rd_strtup_list_copy (const void *elem, void *opaque); |
| 60 | |
| 61 | char *rd_flags2str (char *dst, size_t size, |
| 62 | const char **desc, int flags); |
| 63 | |
| 64 | #endif /* _RDSTRING_H_ */ |
| 65 | |