-
Notifications
You must be signed in to change notification settings - Fork 31
/
Copy pathcall_entry.h
158 lines (131 loc) · 4.02 KB
/
call_entry.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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
/*
* Copyright (c) 1993-1995, 1999-2008 Apple Inc. All rights reserved.
*
* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
*
* This file contains Original Code and/or Modifications of Original Code
* as defined in and that are subject to the Apple Public Source License
* Version 2.0 (the 'License'). You may not use this file except in
* compliance with the License. The rights granted to you under the License
* may not be used to create, or enable the creation or redistribution of,
* unlawful or unlicensed copies of an Apple operating system, or to
* circumvent, violate, or enable the circumvention or violation of, any
* terms of an Apple operating system software license agreement.
*
* Please obtain a copy of the License at
* http://www.opensource.apple.com/apsl/ and read it before using this file.
*
* The Original Code and all software distributed under the License are
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
* Please see the License for the specific language governing rights and
* limitations under the License.
*
* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
*/
/*
* Declarations for generic call outs.
*/
#ifndef _KERN_CALL_ENTRY_H_
#define _KERN_CALL_ENTRY_H_
#ifdef XNU_KERNEL_PRIVATE
#include <kern/queue.h>
#define TIMER_TRACE 1
typedef void *call_entry_param_t;
typedef void (*call_entry_func_t)(
call_entry_param_t param0,
call_entry_param_t param1);
typedef struct call_entry {
queue_chain_t q_link;
queue_head_t *queue;
call_entry_func_t func;
call_entry_param_t param0;
call_entry_param_t param1;
uint64_t deadline;
#if TIMER_TRACE
uint64_t entry_time;
#endif
} call_entry_data_t;
typedef struct call_entry *call_entry_t;
#ifdef MACH_KERNEL_PRIVATE
#define call_entry_setup(entry, pfun, p0) \
MACRO_BEGIN \
(entry)->func = (call_entry_func_t)(pfun); \
(entry)->param0 = (call_entry_param_t)(p0); \
(entry)->queue = NULL; \
(entry)->deadline = 0; \
MACRO_END
#define qe(x) ((queue_entry_t)(x))
#define CE(x) ((call_entry_t)(x))
static __inline__ queue_head_t *
call_entry_enqueue_tail(
call_entry_t entry,
queue_t queue)
{
queue_t old_queue = entry->queue;
if (old_queue != NULL)
(void)remque(qe(entry));
enqueue_tail(queue, qe(entry));
entry->queue = queue;
return (old_queue);
}
static __inline__ queue_head_t *
call_entry_dequeue(
call_entry_t entry)
{
queue_t old_queue = entry->queue;
if (old_queue != NULL) {
(void)remque(qe(entry));
entry->queue = NULL;
}
return (old_queue);
}
static __inline__ queue_head_t *
call_entry_enqueue_deadline(
call_entry_t entry,
queue_head_t *queue,
uint64_t deadline)
{
queue_t old_queue = entry->queue;
call_entry_t current;
if (old_queue != queue || entry->deadline < deadline) {
if (old_queue == NULL) {
current = CE(queue_first(queue));
} else if (old_queue != queue) {
(void)remque(qe(entry));
current = CE(queue_first(queue));
} else {
current = CE(queue_next(qe(entry)));
(void)remque(qe(entry));
}
while (TRUE) {
if (queue_end(queue, qe(current)) ||
deadline < current->deadline) {
current = CE(queue_prev(qe(current)));
break;
}
current = CE(queue_next(qe(current)));
}
insque(qe(entry), qe(current));
}
else if (deadline < entry->deadline) {
current = CE(queue_prev(qe(entry)));
(void)remque(qe(entry));
while (TRUE) {
if (queue_end(queue, qe(current)) ||
current->deadline <= deadline) {
break;
}
current = CE(queue_prev(qe(current)));
}
insque(qe(entry), qe(current));
}
entry->queue = queue;
entry->deadline = deadline;
return (old_queue);
}
#endif /* MACH_KERNEL_PRIVATE */
#endif /* XNU_KERNEL_PRIVATE */
#endif /* _KERN_CALL_ENTRY_H_ */