Add toolchain and mbtk source
Change-Id: Ie12546301367ea59240bf23d5e184ad7e36e40b3
diff --git a/mbtk/mbtk_lib/src/ringbuffer.c b/mbtk/mbtk_lib/src/ringbuffer.c
new file mode 100755
index 0000000..d5225cc
--- /dev/null
+++ b/mbtk/mbtk_lib/src/ringbuffer.c
@@ -0,0 +1,90 @@
+#include "ringbuffer.h"
+
+/**
+ * @file
+ * Implementation of ring buffer functions.
+ */
+
+void ring_buffer_init(ring_buffer_t *buffer, char *buf, size_t buf_size) {
+ RING_BUFFER_ASSERT(RING_BUFFER_IS_POWER_OF_TWO(buf_size) == 1);
+ buffer->buffer = buf;
+ buffer->buffer_mask = buf_size - 1;
+ buffer->tail_index = 0;
+ buffer->head_index = 0;
+}
+
+void ring_buffer_queue(ring_buffer_t *buffer, char data) {
+ /* Is buffer full? */
+ if(ring_buffer_is_full(buffer)) {
+ /* Is going to overwrite the oldest byte */
+ /* Increase tail index */
+ buffer->tail_index = ((buffer->tail_index + 1) & RING_BUFFER_MASK(buffer));
+ }
+
+ /* Place data in buffer */
+ buffer->buffer[buffer->head_index] = data;
+ buffer->head_index = ((buffer->head_index + 1) & RING_BUFFER_MASK(buffer));
+}
+
+void ring_buffer_queue_arr(ring_buffer_t *buffer, const char *data, ring_buffer_size_t size) {
+ /* Add bytes; one by one */
+ ring_buffer_size_t i;
+ for(i = 0; i < size; i++) {
+ ring_buffer_queue(buffer, data[i]);
+ }
+}
+
+uint8_t ring_buffer_dequeue(ring_buffer_t *buffer, char *data) {
+ if(ring_buffer_is_empty(buffer)) {
+ /* No items */
+ return 0;
+ }
+
+ *data = buffer->buffer[buffer->tail_index];
+ buffer->tail_index = ((buffer->tail_index + 1) & RING_BUFFER_MASK(buffer));
+ return 1;
+}
+
+ring_buffer_size_t ring_buffer_dequeue_arr(ring_buffer_t *buffer, char *data, ring_buffer_size_t len) {
+ if(ring_buffer_is_empty(buffer)) {
+ /* No items */
+ return 0;
+ }
+
+ char *data_ptr = data;
+ ring_buffer_size_t cnt = 0;
+ while((cnt < len) && ring_buffer_dequeue(buffer, data_ptr)) {
+ cnt++;
+ data_ptr++;
+ }
+ return cnt;
+}
+
+uint8_t ring_buffer_peek(ring_buffer_t *buffer, char *data, ring_buffer_size_t index) {
+ if(index >= ring_buffer_num_items(buffer)) {
+ /* No items at index */
+ return 0;
+ }
+
+ /* Add index to pointer */
+ ring_buffer_size_t data_index = ((buffer->tail_index + index) & RING_BUFFER_MASK(buffer));
+ *data = buffer->buffer[data_index];
+ return 1;
+}
+
+uint8_t ring_buffer_is_empty(ring_buffer_t *buffer) {
+ return (buffer->head_index == buffer->tail_index);
+}
+
+uint8_t ring_buffer_is_full(ring_buffer_t *buffer) {
+ return ((buffer->head_index - buffer->tail_index) & RING_BUFFER_MASK(buffer)) == RING_BUFFER_MASK(buffer);
+}
+
+ring_buffer_size_t ring_buffer_num_items(ring_buffer_t *buffer) {
+ return ((buffer->head_index - buffer->tail_index) & RING_BUFFER_MASK(buffer));
+}
+
+void ring_buffer_clean(ring_buffer_t *buffer) {
+ buffer->tail_index = 0;
+ buffer->head_index = 0;
+}