mirror of
https://gitlab.eurecom.fr/oai/openairinterface5g.git
synced 2026-07-13 04:30:28 +00:00
8107939f08
- all RAN code, CI code, configuration files, dockerfiles, in CSSL v1.0
- all deployment code (openshift, charts, ancillary files like shell
scripts), in MIT
- documentation in CC-BY-4.0
- exceptions might apply and are listed in NOTICE
- there is a new LICENSES folder with all licenses
- CONTRIBUTIONS.md has been updated accordingly
For automated changes based on OAI PL v1.1:
perl -i~ -0pe 's/\/\*.*Licensed to the OpenAirInterface.*openairinterface.org\n#?/\/*\n * SPDX-License-Identifier: LicenseRef-CSSL-1.0\n/s' **/*.{c,h,cpp}
perl -i~ -0pe 's/\/\*.*Licensed to the OpenAirInterface.*openairinterface.org\n#?/\/*\n * SPDX-License-Identifier: LicenseRef-CSSL-1.0\n/s' **/*.ts
perl -i~ -0pe 's/<!--.*Licensed to the OpenAirInterface.*openairinterface.org\n.*-->/<!-- SPDX-License-Identifier: LicenseRef-CSSL-1.0 -->/s' **/*.xml
The rest (cmake, files with missing license, cmake) manually.
120 lines
2.5 KiB
C
120 lines
2.5 KiB
C
/*
|
|
* SPDX-License-Identifier: LicenseRef-CSSL-1.0
|
|
*/
|
|
|
|
#include "time_stat.h"
|
|
|
|
#include <time.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "common/utils/LOG/log.h"
|
|
|
|
time_average_t *time_average_new(int duration, int initial_size)
|
|
{
|
|
time_average_t *ret;
|
|
|
|
/* let's only accept power of two initial_size */
|
|
if (initial_size & (initial_size - 1)) {
|
|
LOG_E(UTIL, "time_average_new: illegal initial_size %d, use power of two\n", initial_size);
|
|
exit(1);
|
|
}
|
|
|
|
ret = calloc(1, sizeof(time_average_t));
|
|
if (ret == NULL) {
|
|
LOG_E(UTIL, "out of memory\n");
|
|
exit(1);
|
|
}
|
|
|
|
ret->duration = duration;
|
|
ret->r.head = initial_size - 1;
|
|
ret->r.maxsize = initial_size;
|
|
ret->r.buffer = calloc(initial_size, sizeof(time_value_t));
|
|
if (ret->r.buffer == NULL) {
|
|
LOG_E(UTIL, "out of memory\n");
|
|
exit(1);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
void time_average_free(time_average_t *t)
|
|
{
|
|
free(t->r.buffer);
|
|
free(t);
|
|
}
|
|
|
|
void time_average_reset(time_average_t *t)
|
|
{
|
|
t->r.head = t->r.maxsize - 1;
|
|
t->r.tail = 0;
|
|
t->r.size = 0;
|
|
t->accumulated_value = 0;
|
|
}
|
|
|
|
static void remove_old(time_average_t *t, uint64_t time)
|
|
{
|
|
/* remove old events */
|
|
while (t->r.size && t->r.buffer[t->r.tail].time < time - t->duration) {
|
|
t->accumulated_value -= t->r.buffer[t->r.tail].value;
|
|
t->r.size--;
|
|
t->r.tail++;
|
|
t->r.tail %= t->r.maxsize;
|
|
}
|
|
}
|
|
|
|
void time_average_add(time_average_t *t, uint64_t time, uint64_t value)
|
|
{
|
|
remove_old(t, time);
|
|
|
|
if (t->r.size == t->r.maxsize) {
|
|
t->r.maxsize *= 2;
|
|
t->r.buffer = realloc(t->r.buffer, t->r.maxsize * sizeof(time_value_t));
|
|
if (t->r.buffer == NULL) {
|
|
LOG_E(UTIL, "out of memory\n");
|
|
exit(1);
|
|
}
|
|
if (t->r.head < t->r.tail) {
|
|
memcpy(&t->r.buffer[t->r.size], &t->r.buffer[0], (t->r.head + 1) * sizeof(time_value_t));
|
|
t->r.head += t->r.size;
|
|
}
|
|
}
|
|
|
|
t->r.head++;
|
|
t->r.head %= t->r.maxsize;
|
|
t->r.buffer[t->r.head].time = time;
|
|
t->r.buffer[t->r.head].value = value;
|
|
|
|
t->r.size++;
|
|
|
|
t->accumulated_value += value;
|
|
}
|
|
|
|
double time_average_get_average(time_average_t *t, uint64_t time)
|
|
{
|
|
remove_old(t, time);
|
|
|
|
if (t->r.size == 0)
|
|
return 0;
|
|
|
|
return (double)t->accumulated_value / t->r.size;
|
|
}
|
|
|
|
uint64_t time_average_now(void)
|
|
{
|
|
struct timespec t;
|
|
uint64_t ret;
|
|
|
|
if (clock_gettime(CLOCK_REALTIME, &t)) {
|
|
LOG_E(UTIL, "clock_gettime failed\n");
|
|
exit(1);
|
|
}
|
|
|
|
ret = (uint64_t)t.tv_sec * (uint64_t)1000000 + t.tv_nsec / 1000;
|
|
/* round up if necessary */
|
|
if (t.tv_nsec % 1000 >= 500)
|
|
ret++;
|
|
|
|
return ret;
|
|
}
|