mirror of
https://github.com/openharmony/graphic_utils.git
synced 2026-07-01 21:44:51 -04:00
mamingshuai
91 lines
2.3 KiB
C
Executable File
91 lines
2.3 KiB
C
Executable File
/*
|
|
* Copyright (c) 2020-2021 Huawei Device Co., Ltd.
|
|
* 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 "queue.h"
|
|
|
|
#ifdef __cplusplus
|
|
#if __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
#endif
|
|
|
|
#define IS_POWER_OF_2(x) ((((x) - 1) & (x)) == 0)
|
|
#define QUEUE_HEADER_MAGIC 0xccddddcc
|
|
#define QUEUE_SIZE_MAX 8192
|
|
#define CACHE_LINE_SIZE 64
|
|
|
|
int32_t QueueInit(LockFreeQueue* queue, uint32_t unitNum)
|
|
{
|
|
if (queue == NULL) {
|
|
return QUEUE_INVAL;
|
|
}
|
|
if (!IS_POWER_OF_2(unitNum)) {
|
|
return QUEUE_INVAL;
|
|
}
|
|
|
|
(void)memset_s(queue, sizeof(LockFreeQueue), 0, sizeof(LockFreeQueue));
|
|
|
|
queue->magic = QUEUE_HEADER_MAGIC;
|
|
queue->producer.size = unitNum;
|
|
queue->consumer.size = unitNum;
|
|
queue->producer.mask = unitNum - 1;
|
|
queue->consumer.mask = unitNum - 1;
|
|
queue->producer.head = 0;
|
|
queue->consumer.head = 0;
|
|
queue->producer.tail = 0;
|
|
queue->consumer.tail = 0;
|
|
queue->unitNum = unitNum;
|
|
|
|
return 0;
|
|
}
|
|
|
|
int32_t QueueSizeCalc(uint32_t unitNum, uint32_t* queueSize)
|
|
{
|
|
uint32_t size;
|
|
|
|
if (queueSize == NULL) {
|
|
return QUEUE_INVAL;
|
|
}
|
|
if (unitNum > QUEUE_SIZE_MAX) {
|
|
return QUEUE_INVAL;
|
|
}
|
|
|
|
size = sizeof(uintptr_t) * unitNum + sizeof(LockFreeQueue);
|
|
*queueSize = ((size + CACHE_LINE_SIZE - 1) & (~(CACHE_LINE_SIZE - 1)));
|
|
return 0;
|
|
}
|
|
|
|
int32_t QueueCountGet(const LockFreeQueue* queue, uint32_t* count)
|
|
{
|
|
uint32_t producerTail;
|
|
uint32_t consumerTail;
|
|
uint32_t mask;
|
|
|
|
if (queue == NULL || count == NULL) {
|
|
return QUEUE_INVAL;
|
|
}
|
|
producerTail = queue->producer.tail;
|
|
consumerTail = queue->consumer.tail;
|
|
mask = queue->producer.mask;
|
|
|
|
*count = ((producerTail - consumerTail) & mask);
|
|
return 0;
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
#if __cplusplus
|
|
}
|
|
#endif /* __cpluscplus */
|
|
#endif /* __cpluscplus */ |