Ram Gandikota / Mbed OS ABCD

A metronome using the FRDM K64F board

mbed-client/source/m2mstringbufferbase.cpp@0:a7a43371b306, 2017-05-14 (annotated)

Committer:
ram54288
Date:
Sun May 14 18:40:18 2017 +0000
Revision:
0:a7a43371b306
Initial commit

Who changed what in which revision?

UserRevisionLine numberNew contents of line
ram54288 0:a7a43371b306 1 /*
ram54288 0:a7a43371b306 2 * Copyright (c) 2016 ARM Limited. All rights reserved.
ram54288 0:a7a43371b306 3 * SPDX-License-Identifier: Apache-2.0
ram54288 0:a7a43371b306 4 * Licensed under the Apache License, Version 2.0 (the License); you may
ram54288 0:a7a43371b306 5 * not use this file except in compliance with the License.
ram54288 0:a7a43371b306 6 * You may obtain a copy of the License at
ram54288 0:a7a43371b306 7 *
ram54288 0:a7a43371b306 8 * http://www.apache.org/licenses/LICENSE-2.0
ram54288 0:a7a43371b306 9 *
ram54288 0:a7a43371b306 10 * Unless required by applicable law or agreed to in writing, software
ram54288 0:a7a43371b306 11 * distributed under the License is distributed on an AS IS BASIS, WITHOUT
ram54288 0:a7a43371b306 12 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
ram54288 0:a7a43371b306 13 * See the License for the specific language governing permissions and
ram54288 0:a7a43371b306 14 * limitations under the License.
ram54288 0:a7a43371b306 15 */
ram54288 0:a7a43371b306 16
ram54288 0:a7a43371b306 17 #include "mbed-client/m2mstringbufferbase.h"
ram54288 0:a7a43371b306 18
ram54288 0:a7a43371b306 19 #include "mbed-client/m2mstring.h"
ram54288 0:a7a43371b306 20
ram54288 0:a7a43371b306 21 #include <assert.h>
ram54288 0:a7a43371b306 22 #include <string.h>
ram54288 0:a7a43371b306 23
ram54288 0:a7a43371b306 24
ram54288 0:a7a43371b306 25 bool StringBufferBase::ensure_space(size_t max_size, size_t required_size) const
ram54288 0:a7a43371b306 26 {
ram54288 0:a7a43371b306 27 const size_t space_left = max_size - _curr_size;
ram54288 0:a7a43371b306 28
ram54288 0:a7a43371b306 29 bool space_available = false;
ram54288 0:a7a43371b306 30
ram54288 0:a7a43371b306 31 if (required_size <= space_left) {
ram54288 0:a7a43371b306 32
ram54288 0:a7a43371b306 33 space_available = true;
ram54288 0:a7a43371b306 34 }
ram54288 0:a7a43371b306 35 return space_available;
ram54288 0:a7a43371b306 36 }
ram54288 0:a7a43371b306 37
ram54288 0:a7a43371b306 38 bool StringBufferBase::append(char *buff, size_t max_size, char data)
ram54288 0:a7a43371b306 39 {
ram54288 0:a7a43371b306 40 bool space_available = ensure_space(max_size, 1 + 1); // there must be space for trailing zero too
ram54288 0:a7a43371b306 41 if (space_available) {
ram54288 0:a7a43371b306 42 buff[_curr_size++] = data;
ram54288 0:a7a43371b306 43 buff[_curr_size] = '\0';
ram54288 0:a7a43371b306 44 assert(_curr_size < max_size);
ram54288 0:a7a43371b306 45 }
ram54288 0:a7a43371b306 46 return space_available;
ram54288 0:a7a43371b306 47 }
ram54288 0:a7a43371b306 48
ram54288 0:a7a43371b306 49 bool StringBufferBase::append(char *buff, size_t max_size, const char *data)
ram54288 0:a7a43371b306 50 {
ram54288 0:a7a43371b306 51
ram54288 0:a7a43371b306 52 const size_t string_len = strlen(data);
ram54288 0:a7a43371b306 53 bool space_available = ensure_space(max_size, string_len + 1);
ram54288 0:a7a43371b306 54 if (space_available) {
ram54288 0:a7a43371b306 55 memcpy(buff + _curr_size, data, string_len + 1); // copy the zero terminator too
ram54288 0:a7a43371b306 56 _curr_size += string_len;
ram54288 0:a7a43371b306 57 assert(_curr_size < max_size);
ram54288 0:a7a43371b306 58 }
ram54288 0:a7a43371b306 59 return space_available;
ram54288 0:a7a43371b306 60 }
ram54288 0:a7a43371b306 61
ram54288 0:a7a43371b306 62 bool StringBufferBase::append(char *buff, size_t max_size, const char *data, size_t data_len)
ram54288 0:a7a43371b306 63 {
ram54288 0:a7a43371b306 64 bool space_available = true;
ram54288 0:a7a43371b306 65 if (data_len > 0) {
ram54288 0:a7a43371b306 66 space_available = ensure_space(max_size, data_len + 1);
ram54288 0:a7a43371b306 67 if (space_available) {
ram54288 0:a7a43371b306 68 memcpy(buff + _curr_size, data, data_len);
ram54288 0:a7a43371b306 69 _curr_size += data_len;
ram54288 0:a7a43371b306 70 // Todo: should the code actually check, if the data already contained zero or not?
ram54288 0:a7a43371b306 71 buff[_curr_size] = '\0';
ram54288 0:a7a43371b306 72 assert(_curr_size < max_size);
ram54288 0:a7a43371b306 73 }
ram54288 0:a7a43371b306 74 }
ram54288 0:a7a43371b306 75 return space_available;
ram54288 0:a7a43371b306 76 }
ram54288 0:a7a43371b306 77
ram54288 0:a7a43371b306 78 bool StringBufferBase::append_int(char *buff, size_t max_size, uint16_t data)
ram54288 0:a7a43371b306 79 {
ram54288 0:a7a43371b306 80 // max len of "-9223372036854775808" plus zero termination
ram54288 0:a7a43371b306 81 char conv_buff[20+1];
ram54288 0:a7a43371b306 82
ram54288 0:a7a43371b306 83 // re-use the String's functionality, a more optimal version would use snprintf() or int size specific converter
ram54288 0:a7a43371b306 84 int len = m2m::itoa_c(data, conv_buff);
ram54288 0:a7a43371b306 85
ram54288 0:a7a43371b306 86 return append(buff, max_size, conv_buff, len);
ram54288 0:a7a43371b306 87 }
ram54288 0:a7a43371b306 88
ram54288 0:a7a43371b306 89 int StringBufferBase::find_last_of(const char *buff, char search_char) const
ram54288 0:a7a43371b306 90 {
ram54288 0:a7a43371b306 91 int last_index = -1;
ram54288 0:a7a43371b306 92 // search from the end of string, return upon first found matching char
ram54288 0:a7a43371b306 93 for (int index = _curr_size; index >= 0; index--) {
ram54288 0:a7a43371b306 94 if (buff[index] == search_char) {
ram54288 0:a7a43371b306 95 last_index = index;
ram54288 0:a7a43371b306 96 break;
ram54288 0:a7a43371b306 97 }
ram54288 0:a7a43371b306 98 }
ram54288 0:a7a43371b306 99
ram54288 0:a7a43371b306 100 return last_index;
ram54288 0:a7a43371b306 101 }