mirror of
https://salsa.debian.org/ha-team/libqb
synced 2025-12-30 18:22:35 +00:00
08e5a9004d
This is to try and get a better balance in the amount of processing between IPC and totem in corosync. Signed-off-by: Angus Salkeld <asalkeld@redhat.com>
97 lines
3.2 KiB
C
97 lines
3.2 KiB
C
/*
|
|
* Copyright (C) 2010 Red Hat, Inc.
|
|
*
|
|
* Author: Angus Salkeld <asalkeld@redhat.com>
|
|
*
|
|
* This file is part of libqb.
|
|
*
|
|
* libqb is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License as published by
|
|
* the Free Software Foundation, either version 2.1 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* libqb is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with libqb. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
#include "os_base.h"
|
|
#include <sys/poll.h>
|
|
|
|
#include <qb/qbloop.h>
|
|
|
|
static struct qb_loop *l;
|
|
static qb_loop_timer_handle th;
|
|
|
|
static void job_3_9(void *data) { printf("%s\n", __func__); }
|
|
static void job_1_2(void *data) { printf("%s\n", __func__); }
|
|
static void job_2_4(void *data) { printf("%s\n", __func__); }
|
|
static void job_3_5(void *data) { printf("%s\n", __func__); }
|
|
static void job_3_6(void *data) { printf("%s\n", __func__); }
|
|
static void job_1_1(void *data) { printf("%s\n", __func__); }
|
|
static void job_3_7(void *data) { printf("%s\n", __func__); }
|
|
static void job_2_3(void *data) { printf("%s\n", __func__); }
|
|
static void job_2_8(void *data) { printf("%s\n", __func__); }
|
|
static void job_1_9(void *data) { printf("%s\n", __func__); }
|
|
|
|
static void more_important_jobs(void *data)
|
|
{
|
|
printf("%s\n", __func__);
|
|
qb_loop_job_add(l, QB_LOOP_HIGH, NULL, job_1_2);
|
|
qb_loop_job_add(l, QB_LOOP_HIGH, NULL, job_1_9);
|
|
}
|
|
|
|
static void more_jobs(void *data)
|
|
{
|
|
printf("%s\n", __func__);
|
|
qb_loop_timer_add(l, QB_LOOP_HIGH, 3109, NULL, job_1_1, &th);
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_7);
|
|
qb_loop_timer_add(l, QB_LOOP_LOW, 1000, NULL, more_important_jobs, &th);
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_7);
|
|
qb_loop_timer_add(l, QB_LOOP_LOW, 2341, NULL, job_3_7, &th);
|
|
qb_loop_timer_add(l, QB_LOOP_LOW, 900, NULL, job_3_6, &th);
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_5);
|
|
qb_loop_timer_add(l, QB_LOOP_MED, 4000, NULL, more_jobs, &th);
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_9);
|
|
qb_loop_job_add(l, QB_LOOP_HIGH, NULL, job_1_9);
|
|
qb_loop_job_add(l, QB_LOOP_MED, NULL, job_2_3);
|
|
}
|
|
|
|
static int32_t read_stdin(int32_t fd, int32_t revents, void *data)
|
|
{
|
|
char buf[100];
|
|
ssize_t len = read(fd, buf, 100);
|
|
buf[len-1] = '\0';
|
|
printf("typed > \"%s\"\n", buf);
|
|
if (strcmp(buf, "more") == 0) {
|
|
more_jobs(NULL);
|
|
}
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_9);
|
|
return 0;
|
|
}
|
|
|
|
int main(int argc, char * argv[])
|
|
{
|
|
|
|
l = qb_loop_create();
|
|
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_9);
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_2_4);
|
|
qb_loop_job_add(l, QB_LOOP_HIGH, NULL, job_1_2);
|
|
qb_loop_job_add(l, QB_LOOP_MED, NULL, job_3_7);
|
|
// qb_loop_timer_add(l, QB_LOOP_HIGH, 40, NULL, more_jobs, &th);
|
|
qb_loop_job_add(l, QB_LOOP_MED, NULL, job_2_8);
|
|
qb_loop_job_add(l, QB_LOOP_LOW, NULL, job_3_6);
|
|
|
|
qb_loop_poll_add(l, QB_LOOP_LOW, 0, POLLIN | POLLPRI | POLLNVAL,
|
|
NULL, read_stdin);
|
|
|
|
qb_loop_run(l);
|
|
return 0;
|
|
}
|
|
|
|
|