1 /* 2 * Copyright (C) 2014 BlueKitchen GmbH 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, are permitted provided that the following conditions 6 * are met: 7 * 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. Neither the name of the copyright holders nor the names of 14 * contributors may be used to endorse or promote products derived 15 * from this software without specific prior written permission. 16 * 4. Any redistribution, use, or modification is done solely for 17 * personal benefit and not for any commercial purpose or for 18 * monetary gain. 19 * 20 * THIS SOFTWARE IS PROVIDED BY BLUEKITCHEN GMBH AND CONTRIBUTORS 21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MATTHIAS 24 * RINGWALD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 27 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 29 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF 30 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * Please inquire about commercial licensing options at 34 * [email protected] 35 * 36 */ 37 38 /* 39 * sdp_util.h 40 */ 41 42 #ifndef __SDP_UTIL_H 43 #define __SDP_UTIL_H 44 45 #include <stdint.h> 46 47 #if defined __cplusplus 48 extern "C" { 49 #endif 50 51 /* API_START */ 52 53 typedef enum { 54 DE_NIL = 0, 55 DE_UINT, 56 DE_INT, 57 DE_UUID, 58 DE_STRING, 59 DE_BOOL, 60 DE_DES, 61 DE_DEA, 62 DE_URL 63 } de_type_t; 64 65 typedef enum { 66 DE_SIZE_8 = 0, 67 DE_SIZE_16, 68 DE_SIZE_32, 69 DE_SIZE_64, 70 DE_SIZE_128, 71 DE_SIZE_VAR_8, 72 DE_SIZE_VAR_16, 73 DE_SIZE_VAR_32 74 } de_size_t; 75 76 // MARK: DateElement 77 void de_dump_data_element(const uint8_t * record); 78 int de_get_len(const uint8_t * header); 79 80 81 // @note returned "string" is not NULL terminated 82 const uint8_t * de_get_string(const uint8_t * element); 83 84 de_size_t de_get_size_type(const uint8_t * header); 85 de_type_t de_get_element_type(const uint8_t * header); 86 uint32_t de_get_header_size(const uint8_t * header); 87 int de_element_get_uint16(const uint8_t * element, uint16_t * value); 88 uint32_t de_get_data_size(const uint8_t * header); 89 uint32_t de_get_uuid32(const uint8_t * element); 90 int de_get_normalized_uuid(uint8_t *uuid128, const uint8_t *element); 91 void de_create_sequence(uint8_t * header); 92 void de_store_descriptor_with_len(uint8_t * header, de_type_t type, de_size_t size, uint32_t len); 93 uint8_t * de_push_sequence(uint8_t *header); 94 void de_pop_sequence(uint8_t * parent, uint8_t * child); 95 void de_add_number(uint8_t *seq, de_type_t type, de_size_t size, uint32_t value); 96 void de_add_data( uint8_t *seq, de_type_t type, uint16_t size, uint8_t *data); 97 98 void de_add_uuid128(uint8_t * seq, uint8_t * uuid); 99 100 // returns data element len if date element is smaller than size 101 uint32_t de_get_len_safe(const uint8_t * header, uint32_t size); 102 103 // MARK: DES iterator 104 typedef struct { 105 uint8_t * element; 106 uint16_t pos; 107 uint16_t length; 108 } des_iterator_t; 109 110 int des_iterator_init(des_iterator_t * it, uint8_t * element); 111 int des_iterator_has_more(des_iterator_t * it); 112 de_type_t des_iterator_get_type (des_iterator_t * it); 113 uint16_t des_iterator_get_size (des_iterator_t * it); 114 uint8_t * des_iterator_get_element(des_iterator_t * it); 115 void des_iterator_next(des_iterator_t * it); 116 117 // MARK: SDP 118 uint16_t sdp_append_attributes_in_attributeIDList(uint8_t *record, uint8_t *attributeIDList, uint16_t startOffset, uint16_t maxBytes, uint8_t *buffer); 119 uint8_t * sdp_get_attribute_value_for_attribute_id(uint8_t * record, uint16_t attributeID); 120 uint8_t sdp_set_attribute_value_for_attribute_id(uint8_t * record, uint16_t attributeID, uint32_t value); 121 int sdp_record_matches_service_search_pattern(uint8_t *record, uint8_t *serviceSearchPattern); 122 int spd_get_filtered_size(uint8_t *record, uint8_t *attributeIDList); 123 int sdp_filter_attributes_in_attributeIDList(uint8_t *record, uint8_t *attributeIDList, uint16_t startOffset, uint16_t maxBytes, uint16_t *usedBytes, uint8_t *buffer); 124 int sdp_attribute_list_constains_id(uint8_t *attributeIDList, uint16_t attributeID); 125 int sdp_traversal_match_pattern(uint8_t * element, de_type_t attributeType, de_size_t size, void *my_context); 126 127 /* 128 * @brief Returns service search pattern for given UUID-16 129 * @note Uses fixed buffer 130 */ 131 uint8_t* sdp_service_search_pattern_for_uuid16(uint16_t uuid16); 132 133 /* 134 * @brief Returns service search pattern for given UUID-128 135 * @note Uses fixed buffer 136 */ 137 uint8_t* sdp_service_search_pattern_for_uuid128(const uint8_t * uuid128); 138 139 /* API_END */ 140 141 #if defined __cplusplus 142 } 143 #endif 144 145 #endif // __SDP_UTIL_H 146