OpenDNSSEC-signer  2.0.3
fifoq.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2011 NLNet Labs. All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without
5  * modification, are permitted provided that the following conditions
6  * are met:
7  * 1. Redistributions of source code must retain the above copyright
8  * notice, this list of conditions and the following disclaimer.
9  * 2. Redistributions in binary form must reproduce the above copyright
10  * notice, this list of conditions and the following disclaimer in the
11  * documentation and/or other materials provided with the distribution.
12  *
13  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
14  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
15  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
16  * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
17  * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
18  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
19  * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
20  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
21  * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
22  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
23  * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24  *
25  */
26 
32 #ifndef SCHEDULER_FIFOQ_H
33 #define SCHEDULER_FIFOQ_H
34 
35 #include "config.h"
36 #include <stdio.h>
37 #include <time.h>
38 
39 #ifdef HAVE_SYS_TYPES_H
40 # include <sys/types.h>
41 #endif
42 #ifdef HAVE_UNISTD_H
43 # include <unistd.h>
44 #endif
45 
46 #include <ldns/ldns.h>
47 
48 typedef struct fifoq_struct fifoq_type;
49 
50 #include "daemon/worker.h"
51 #include "locks.h"
52 #include "status.h"
53 
54 #define FIFOQ_MAX_COUNT 1000
55 #define FIFOQ_TRIES_COUNT 10
56 
60 struct fifoq_struct {
63  size_t count;
64  lock_basic_type q_lock;
65  cond_basic_type q_threshold;
66  cond_basic_type q_nonfull;
67 };
68 
76 
82 void fifoq_wipe(fifoq_type* q);
83 
91 void* fifoq_pop(fifoq_type* q, worker_type** worker);
92 
102 ods_status fifoq_push(fifoq_type* q, void* item, worker_type* worker,
103  int* tries);
104 
110 void fifoq_cleanup(fifoq_type* q);
111 
112 #endif /* SCHEDULER_FIFOQ_H */
cond_basic_type q_threshold
Definition: fifoq.h:65
lock_basic_type q_lock
Definition: fifoq.h:64
#define FIFOQ_MAX_COUNT
Definition: fifoq.h:54
void fifoq_cleanup(fifoq_type *q)
Definition: fifoq.c:153
size_t count
Definition: fifoq.h:63
void fifoq_wipe(fifoq_type *q)
Definition: fifoq.c:68
void * blob[FIFOQ_MAX_COUNT]
Definition: fifoq.h:61
worker_type * owner[FIFOQ_MAX_COUNT]
Definition: fifoq.h:62
fifoq_type * fifoq_create(void)
Definition: fifoq.c:46
void * fifoq_pop(fifoq_type *q, worker_type **worker)
Definition: fifoq.c:84
cond_basic_type q_nonfull
Definition: fifoq.h:66
ods_status fifoq_push(fifoq_type *q, void *item, worker_type *worker, int *tries)
Definition: fifoq.c:114