Robert Schmidt
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.
130 lines
3.4 KiB
C
130 lines
3.4 KiB
C
/*
|
|
* SPDX-License-Identifier: LicenseRef-CSSL-1.0
|
|
*/
|
|
|
|
#include <sched.h>
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <fcntl.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include <ctype.h>
|
|
#include <sys/sysinfo.h>
|
|
#include "thread-pool.h"
|
|
#include "log.h"
|
|
#include "task_ans.h"
|
|
#include "notified_fifo.h"
|
|
|
|
void displayList(notifiedFIFO_t *nf)
|
|
{
|
|
int n = 0;
|
|
notifiedFIFO_elt_t *ptr = nf->outF;
|
|
|
|
while (ptr) {
|
|
printf("element: %d, key: %lu\n", ++n, ptr->key);
|
|
ptr = ptr->next;
|
|
}
|
|
|
|
printf("End of list: %d elements\n", n);
|
|
}
|
|
|
|
struct testData {
|
|
int id;
|
|
int sleepTime;
|
|
char txt[50];
|
|
task_ans_t* task_ans;
|
|
};
|
|
|
|
void processing(void *arg)
|
|
{
|
|
struct testData *in = (struct testData *)arg;
|
|
// printf("doing: %d, %s, in thr %ld\n",in->id, in->txt,pthread_self() );
|
|
sprintf(in->txt, "Done by %ld, job %d", pthread_self(), in->id);
|
|
in->sleepTime = rand() % 1000;
|
|
usleep(in->sleepTime);
|
|
// printf("done: %d, %s, in thr %ld\n",in->id, in->txt,pthread_self() );
|
|
completed_task_ans(in->task_ans);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
logInit();
|
|
notifiedFIFO_t myFifo;
|
|
initNotifiedFIFO(&myFifo);
|
|
int num_elements_on_queue = 0;
|
|
pushNotifiedFIFO(&myFifo, newNotifiedFIFO_elt(sizeof(struct testData), 1234, NULL, NULL));
|
|
num_elements_on_queue++;
|
|
|
|
for (int i = 10; i > 1; i--) {
|
|
pushNotifiedFIFO(&myFifo, newNotifiedFIFO_elt(sizeof(struct testData), 1000 + i, NULL, NULL));
|
|
num_elements_on_queue++;
|
|
}
|
|
|
|
displayList(&myFifo);
|
|
notifiedFIFO_elt_t *tmp = pullNotifiedFIFO(&myFifo);
|
|
printf("pulled: %lu\n", tmp->key);
|
|
displayList(&myFifo);
|
|
delNotifiedFIFO_elt(tmp);
|
|
tmp = pullNotifiedFIFO(&myFifo);
|
|
num_elements_on_queue--;
|
|
printf("pulled: %lu\n", tmp->key);
|
|
displayList(&myFifo);
|
|
pushNotifiedFIFO(&myFifo, newNotifiedFIFO_elt(sizeof(struct testData), 12345678, NULL, NULL));
|
|
displayList(&myFifo);
|
|
delNotifiedFIFO_elt(tmp);
|
|
|
|
do {
|
|
tmp = pollNotifiedFIFO(&myFifo);
|
|
|
|
if (tmp) {
|
|
printf("pulled: %lu\n", tmp->key);
|
|
displayList(&myFifo);
|
|
delNotifiedFIFO_elt(tmp);
|
|
num_elements_on_queue--;
|
|
} else
|
|
printf("Empty list \n");
|
|
} while (num_elements_on_queue > 0);
|
|
AssertFatal(pollNotifiedFIFO(&myFifo) == NULL, "Unexpected extra element on queue\n");
|
|
|
|
tpool_t pool;
|
|
char params[] = "1,2,3,4,5";
|
|
initTpool(params, &pool, true);
|
|
|
|
//sleep(1);
|
|
int cumulProcessTime = 0;
|
|
struct timespec st, end;
|
|
clock_gettime(CLOCK_MONOTONIC, &st);
|
|
int nb_jobs = 4;
|
|
for (int i = 0; i < 1000; i++) {
|
|
int parall = nb_jobs;
|
|
task_ans_t task_ans;
|
|
init_task_ans(&task_ans, parall);
|
|
struct testData test_data[parall];
|
|
memset(test_data, 0, sizeof(test_data));
|
|
for (int j = 0; j < parall; j++) {
|
|
task_t task = {.args = &test_data[j], .func = processing};
|
|
struct testData *x = (struct testData *)task.args;
|
|
x->id = i;
|
|
x->task_ans = &task_ans;
|
|
pushTpool(&pool, task);
|
|
}
|
|
join_task_ans(&task_ans);
|
|
int sleepmax = 0;
|
|
for (int j = 0; j < parall; j++) {
|
|
if (test_data[j].sleepTime > sleepmax) {
|
|
sleepmax = test_data[j].sleepTime;
|
|
}
|
|
}
|
|
cumulProcessTime += sleepmax;
|
|
}
|
|
clock_gettime(CLOCK_MONOTONIC, &end);
|
|
long long dur = (end.tv_sec - st.tv_sec) * 1000 * 1000 + (end.tv_nsec - st.tv_nsec) / 1000;
|
|
printf("In µs, Total time per group of %d job:%lld, work time per job %d, overhead per job %lld\n",
|
|
nb_jobs,
|
|
dur / 1000,
|
|
cumulProcessTime / 1000,
|
|
(dur - cumulProcessTime) / (1000 * nb_jobs));
|
|
abortTpool(&pool);
|
|
return 0;
|
|
}
|