| 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/randomgen.hpp" | ||
| 30 | #include "gate/results.hpp" | ||
| 31 | #include "gate/exceptions.hpp" | ||
| 32 | |||
| 33 | namespace gate | ||
| 34 | { | ||
| 35 | 3 | RandomGenerator::RandomGenerator() | |
| 36 | { | ||
| 37 | 3 | result_t const result = gate_randomgenerator_create(&this->impl); | |
| 38 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
|
3 | GATEXX_CHECK_EXCEPTION(result); |
| 39 | 3 | } | |
| 40 | 6 | RandomGenerator::~RandomGenerator() noexcept | |
| 41 | { | ||
| 42 | 3 | gate_randomgenerator_destroy(&this->impl); | |
| 43 | 3 | } | |
| 44 | |||
| 45 | 1003 | uint64_t RandomGenerator::getNumber() | |
| 46 | { | ||
| 47 | uint64_t ret; | ||
| 48 |
1/2✓ Branch 1 taken 1003 times.
✗ Branch 2 not taken.
|
1003 | result_t const result = gate_randomgenerator_get_num(&this->impl, &ret); |
| 49 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 1003 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
|
1003 | GATEXX_CHECK_EXCEPTION(result); |
| 50 | 1003 | return ret; | |
| 51 | } | ||
| 52 | 1000 | void RandomGenerator::fillBuffer(void* buffer, size_t bufferlen) | |
| 53 | { | ||
| 54 | 1000 | result_t const result = gate_randomgenerator_get_buffer(&this->impl, buffer, bufferlen); | |
| 55 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1000 times.
|
1000 | GATEXX_CHECK_EXCEPTION(result); |
| 56 | 1000 | } | |
| 57 | |||
| 58 | ✗ | real32_t RandomGenerator::getFloat() | |
| 59 | { | ||
| 60 | ✗ | uint64_t const num = this->getNumber(); | |
| 61 | ✗ | return (real32_t)num / (real32_t)0xffffffffffffffffULL; | |
| 62 | } | ||
| 63 | |||
| 64 | 1 | uint32_t RandomGenerator::getRange(uint32_t minvalue, uint32_t maxvalue) | |
| 65 | { | ||
| 66 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
1 | if((minvalue == 0) && (maxvalue >= 0xffffffff)) |
| 67 | { | ||
| 68 | ✗ | return (uint32_t)this->getNumber() & 0xffffffff; | |
| 69 | } | ||
| 70 | else | ||
| 71 | { | ||
| 72 | 1 | uint32_t const range = maxvalue - minvalue + 1; | |
| 73 | 1 | uint32_t const num = (uint32_t)this->getNumber() & 0xffffffff; | |
| 74 | 1 | uint32_t const value = num % range; | |
| 75 | 1 | return minvalue + value; | |
| 76 | } | ||
| 77 | } | ||
| 78 | |||
| 79 | |||
| 80 | } // end of namespace gate | ||
| 81 |