queue_memcpy.cc

Go to the documentation of this file.

/*
# Software License Agreement (MIT License)
#
# Copyright (c) 2020, UFACTORY, Inc.
# All rights reserved.
#
# Author: Vinman <vinman.wen@ufactory.cc> <vinman.cub@gmail.com>
*/
#include <string.h>
#include "xarm/core/common/queue_memcpy.h"

QueueMemcpy::QueueMemcpy(long n, long n_size) {
        total_ = n;
        annode_size_ = n_size;
        buf_ = new char[total_ * annode_size_];
        flush();
}

QueueMemcpy::~QueueMemcpy(void) { delete[] buf_; }

char QueueMemcpy::flush(void) {
        cnt_ = 0;
        head_ = 0;
        tail_ = 0;
        memset(buf_, 0, annode_size_ * total_);

        return 0;
}

long QueueMemcpy::size(void) { return cnt_; }

int QueueMemcpy::is_full(void) {
        if (total_ <= cnt_)
                return 1;
        else
                return 0;
}

long QueueMemcpy::node_size(void) { return annode_size_; }

char QueueMemcpy::pop(void *data) {
        std::lock_guard<std::mutex> locker(mutex_);
        if (0 >= cnt_) {
                return -1;
        }
        if (total_ <= tail_) tail_ = 0;

        memcpy(data, &buf_[tail_ * annode_size_], annode_size_);
        tail_++;
        cnt_--;
        return 0;
}

char QueueMemcpy::get(void *data) {
        std::lock_guard<std::mutex> locker(mutex_);
        if (0 >= cnt_) {
                return -1;
        }
        if (total_ <= tail_) tail_ = 0;

        memcpy(data, &buf_[tail_ * annode_size_], annode_size_);

        return 0;
}

char QueueMemcpy::push(void *data) {
        std::lock_guard<std::mutex> locker(mutex_);
        if (total_ <= cnt_) {
                return -1;
        }
        if (total_ <= head_) head_ = 0;

        memcpy(&buf_[head_ * annode_size_], data, annode_size_);
        head_++;
        cnt_++;
        return 0;
}