GCC Code Coverage Report


Directory: src/gate/
File: src/gate/cxx_queueitems.cpp
Date: 2025-12-12 23:40:09
Exec Total Coverage
Lines: 23 29 79.3%
Functions: 5 6 83.3%
Branches: 6 11 54.5%

Line Branch Exec Source
1 /* GATE PROJECT LICENSE:
2 +----------------------------------------------------------------------------+
3 | Copyright(c) 2018-2025, Stefan Meislinger <sm@opengate.at> |
4 | All rights reserved. |
5 | |
6 | Redistribution and use in source and binary forms, with or without |
7 | modification, are permitted provided that the following conditions are met:|
8 | |
9 | 1. Redistributions of source code must retain the above copyright notice, |
10 | this list of conditions and the following disclaimer. |
11 | 2. Redistributions in binary form must reproduce the above copyright |
12 | notice, this list of conditions and the following disclaimer in the |
13 | documentation and/or other materials provided with the distribution. |
14 | |
15 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"|
16 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
18 | ARE DISCLAIMED.IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
19 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
20 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
21 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
22 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
23 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
24 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
25 | THE POSSIBILITY OF SUCH DAMAGE. |
26 +----------------------------------------------------------------------------+
27 */
28
29 #include "gate/queueitems.hpp"
30 #include "gate/exceptions.hpp"
31
32 namespace gate
33 {
34
35 ////////////////////////////////////////////////
36 // //
37 // class QueueItemBufferBase implementation //
38 // //
39 ////////////////////////////////////////////////
40
41 gate_queueitembuffer_t QueueItemBufferBase::c_impl() const noexcept
42 {
43 return this->impl;
44 }
45
46 1 QueueItemBufferBase::QueueItemBufferBase(size_t maxlength, size_t workitemSize, gate_mem_copyctor_t cctor, gate_mem_dtor_t dtor)
47 1 : impl(gate_queueitembuffer_create(maxlength, workitemSize, cctor, dtor))
48 {
49
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
1 if (!this->impl)
50 {
51 GATEXX_RAISE_ERROR(results::OutOfMemory);
52 }
53 1 }
54
55 2 QueueItemBufferBase::~QueueItemBufferBase() noexcept
56 {
57 1 gate_queueitembuffer_destroy(this->impl);
58 1 }
59
60 3 size_t QueueItemBufferBase::length() const noexcept
61 {
62 3 return gate_queueitembuffer_length(this->impl);
63 }
64
65 3 bool_t QueueItemBufferBase::pushItem(void const* ptrItem)
66 {
67 3 result_t res = gate_queueitembuffer_push(this->impl, ptrItem);
68
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 2 times.
3 if (res == GATE_RESULT_BUFFERTOOSMALL)
69 {
70 1 return false;
71 }
72
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2 times.
2 GATEXX_CHECK_ERROR(res);
73 2 return true;
74 }
75 4 bool_t QueueItemBufferBase::popItem(void* ptrStorage, size_t storageSize, uint32_t timeoutMs)
76 {
77 4 result_t res = gate_queueitembuffer_pop(this->impl, timeoutMs, ptrStorage, storageSize);
78
2/3
✓ Branch 0 taken 2 times.
✓ Branch 1 taken 2 times.
✗ Branch 2 not taken.
4 switch (res)
79 {
80 2 case GATE_RESULT_OK:
81 2 return true;
82 2 case GATE_RESULT_TIMEOUT:
83 2 break;
84 default:
85 GATEXX_CHECK_ERROR(res);
86 break;
87 }
88 2 return false;
89 }
90
91
92 } // end of namespace gate
93