Repostiory containing DAPLink source code with Reset Pin workaround for HANI_IOT board.

Upstream: https://github.com/ARMmbed/DAPLink

source/daplink/circ_buf.c

Committer:
Pawel Zarembski
Date:
2020-04-07
Revision:
0:01f31e923fe2

File content as of revision 0:01f31e923fe2:

/**
 * @file    circular_buffer.c
 * @brief   Implementation of a circular buffer
 *
 * DAPLink Interface Firmware
 * Copyright (c) 2016-2016, ARM Limited, All Rights Reserved
 * SPDX-License-Identifier: Apache-2.0
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may
 * not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include "circ_buf.h"

#include "cortex_m.h"
#include "util.h"

void circ_buf_init(circ_buf_t *circ_buf, uint8_t *buffer, uint32_t size)
{
    cortex_int_state_t state;
    state = cortex_int_get_and_disable();

    circ_buf->buf = buffer;
    circ_buf->size = size;
    circ_buf->head = 0;
    circ_buf->tail = 0;

    cortex_int_restore(state);
}

void circ_buf_push(circ_buf_t *circ_buf, uint8_t data)
{
    cortex_int_state_t state;
    state = cortex_int_get_and_disable();

    circ_buf->buf[circ_buf->tail] = data;
    circ_buf->tail += 1;
    if (circ_buf->tail >= circ_buf->size) {
        util_assert(circ_buf->tail == circ_buf->size);
        circ_buf->tail = 0;
    }

    // Assert no overflow
    util_assert(circ_buf->head != circ_buf->tail);

    cortex_int_restore(state);
}

uint8_t circ_buf_pop(circ_buf_t *circ_buf)
{
    uint8_t data;
    cortex_int_state_t state;

    state = cortex_int_get_and_disable();

    // Assert buffer isn't empty
    util_assert(circ_buf->head != circ_buf->tail);

    data = circ_buf->buf[circ_buf->head];
    circ_buf->head += 1;
    if (circ_buf->head >= circ_buf->size) {
        util_assert(circ_buf->head == circ_buf->size);
        circ_buf->head = 0;
    }

    cortex_int_restore(state);

    return data;
}

uint32_t circ_buf_count_used(circ_buf_t *circ_buf)
{
    uint32_t cnt;
    cortex_int_state_t state;

    state = cortex_int_get_and_disable();

    if (circ_buf->tail >= circ_buf->head) {
        cnt = circ_buf->tail - circ_buf->head;
    } else {
        cnt = circ_buf->tail + circ_buf->size - circ_buf->head;
    }

    cortex_int_restore(state);
    return cnt;
}

uint32_t circ_buf_count_free(circ_buf_t *circ_buf)
{
    uint32_t cnt;
    cortex_int_state_t state;

    state = cortex_int_get_and_disable();

    cnt = circ_buf->size - circ_buf_count_used(circ_buf) - 1;

    cortex_int_restore(state);
    return cnt;
}

uint32_t circ_buf_read(circ_buf_t *circ_buf, uint8_t *data, uint32_t size)
{
    uint32_t cnt;
    uint32_t i;

    cnt = circ_buf_count_used(circ_buf);
    cnt = MIN(size, cnt);
    for (i = 0; i < cnt; i++) {
        data[i] = circ_buf_pop(circ_buf);
    }

    return cnt;
}

uint32_t circ_buf_write(circ_buf_t *circ_buf, const uint8_t *data, uint32_t size)
{
    uint32_t cnt;
    uint32_t i;

    cnt = circ_buf_count_free(circ_buf);
    cnt = MIN(size, cnt);
    for (i = 0; i < cnt; i++) {
        circ_buf_push(circ_buf, data[i]);
    }

    return cnt;
}