-
Notifications
You must be signed in to change notification settings - Fork 0
/
sp_events.h
106 lines (88 loc) · 2.98 KB
/
sp_events.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/*
* The Spread Toolkit.
*
* The contents of this file are subject to the Spread Open-Source
* License, Version 1.0 (the ``License''); you may not use
* this file except in compliance with the License. You may obtain a
* copy of the License at:
*
* http://www.spread.org/license/
*
* or in the file ``license.txt'' found in this distribution.
*
* Software distributed under the License is distributed on an AS IS basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Creators of Spread are:
* Yair Amir, Michal Miskin-Amir, Jonathan Stanton, John Schultz.
*
* Copyright (C) 1993-2014 Spread Concepts LLC <info@spreadconcepts.com>
*
* All Rights Reserved.
*
* Major Contributor(s):
* ---------------
* Amy Babay babay@cs.jhu.edu - accelerated ring protocol.
* Ryan Caudy rcaudy@gmail.com - contributions to process groups.
* Claudiu Danilov claudiu@acm.org - scalable wide area support.
* Cristina Nita-Rotaru crisn@cs.purdue.edu - group communication security.
* Theo Schlossnagle jesus@omniti.com - Perl, autoconf, old skiplist.
* Dan Schoenblum dansch@cnds.jhu.edu - Java interface.
*
*/
#ifndef INC_SP_EVENTS
#define INC_SP_EVENTS
/*
User level code should NOT include this file directly.
Include sp.h instead.
Spread daemon level code should include this file directly and NOT include sp.h
*/
/* Raise this number AND RECOMPILE events.c to handle more active FD's.
* This number limits the number of connections that
* can be handled.
*/
#define MAX_FD_EVENTS 2000
#define NUM_PRIORITY 3
#define LOW_PRIORITY 0
#define MEDIUM_PRIORITY 1
#define HIGH_PRIORITY 2
#define NUM_FDTYPES 3
#define READ_FD 0
#define WRITE_FD 1
#define EXCEPT_FD 2
typedef struct dummy_time {
long sec;
long usec;
} sp_time;
#ifndef NULL
#define NULL (void *)0
#endif
/* Event routines */
int E_init(void);
sp_time E_get_time(void);
sp_time E_sub_time( sp_time t, sp_time delta_t );
sp_time E_add_time( sp_time t, sp_time delta_t );
/* if t1 > t2 then returns 1;
if t1 < t2 then returns -1;
if t1 == t2 then returns 0; */
int E_compare_time( sp_time t1, sp_time t2 );
int E_queue( void (* func)( int code, void *data ), int code, void *data,
sp_time delta_time );
/* Note: This does not dispose/free the data pointed at by the void
*data pointer */
int E_dequeue( void (* func)( int code, void *data ), int code,
void *data );
void E_delay( sp_time t );
int E_attach_fd( int fd, int fd_type,
void (* func)( int fd, int code, void *data), int code,
void *data, int priority );
int E_detach_fd( int fd, int fd_type );
int E_set_active_threshold( int priority );
int E_activate_fd( int fd, int fd_type );
int E_deactivate_fd( int fd, int fd_type );
int E_num_active( int priority );
void E_handle_events(void);
void E_exit_events(void);
#endif /* INC_SP_EVENTS */