forked from BOINC/boinc
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfeeder.C
220 lines (202 loc) · 6.62 KB
/
feeder.C
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
// The contents of this file are subject to the BOINC Public 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://boinc.berkeley.edu/license_1.0.txt
//
// 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 Original Code is the Berkeley Open Infrastructure for Network Computing.
//
// The Initial Developer of the Original Code is the SETI@home project.
// Portions created by the SETI@home project are Copyright (C) 2002
// University of California at Berkeley. All Rights Reserved.
//
// Contributor(s):
//
// feeder.C [-asynch]
//
// Creates a shared memory segment containing DB info,
// including results/workunits to send.
// This means that the scheduler CGI program doesn't have to
// access the DB to get this info.
//
// -asynch fork and run in a separate process
// TODO:
// - check for wu/results that don't get sent for a long time;
// generate a warning message
// - mechanism for rereading static tables (trigger file? signal?)
// Trigger file mechanism:
// The feeder program periodically checks for a file "feeder_trigger".
// It this file exists it contains a command to the feeder:
//
// <quit/> destroy shmem and exit
// <reread_db/> reread DB contents into existing shmem
//
// The feeder deletes the trigger file to indicate that it
// has completed the request.
#include <stdio.h>
#if HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef _USING_FCGI_
#include "/usr/local/include/fcgi_stdio.h"
#endif
#include "db.h"
#include "shmem.h"
#include "sched_shmem.h"
#define RESULTS_PER_ENUM 100
#define TRIGGER_FILENAME "feeder_trigger"
int check_trigger(SCHED_SHMEM* ssp) {
FILE* f;
char buf[256];
f = fopen(TRIGGER_FILENAME, "r");
if (!f) return 0;
fread(buf, 1, 256, f);
fclose(f);
if (!strcmp(buf, "<quit/>\n")) {
detach_shmem((void*)ssp);
destroy_shmem(BOINC_KEY);
unlink(TRIGGER_FILENAME);
exit(0);
} else if (!strcmp(buf, "<reread_db/>\n")) {
ssp->init();
ssp->scan_tables();
} else {
fprintf(stderr, "feeder: unknown command in trigger file: %s\n", buf);
}
unlink(TRIGGER_FILENAME);
return 0;
}
// Try keep the wu_results array filled.
// This is actually a little tricky.
// We use an enumerator.
// The inner loop scans the wu_result table,
// looking for empty slots and trying to fill them in.
// When the enumerator reaches the end, it is restarted;
// hopefully there will be some new workunits.
// There are two complications:
// - An enumeration may return results already in the array.
// So, for each result, we scan the entire array to make sure
// it's not there already. Can this be streamlined?
// - We must avoid excessive re-enumeration,
// especially when the number of results is less than the array size.
// Crude approach: if a "collision" (as above) occurred on
// a pass through the array, wait a long time (60 sec)
//
void feeder_loop(SCHED_SHMEM* ssp) {
int i, j, nadditions, ncollisions, retval;
RESULT result;
WORKUNIT wu;
bool no_wus, collision, restarted_enum;
while (1) {
nadditions = 0;
ncollisions = 0;
no_wus = false;
restarted_enum = false;
for (i=0; i<ssp->nwu_results; i++) {
if (!ssp->wu_results[i].present) {
retval = db_result_enum_to_send(result, RESULTS_PER_ENUM);
if (retval) {
// if we already restarted the enum on this pass,
// there's no point in doing it again.
//
if (restarted_enum) {
printf("feeder: already restarted enum\n");
break;
}
// restart the enumeration
//
restarted_enum = true;
retval = db_result_enum_to_send(result, RESULTS_PER_ENUM);
printf("feeder: restarting enumeration: %d\n", retval);
if (retval) {
no_wus = true;
break;
}
}
collision = false;
for (j=0; j<ssp->nwu_results; j++) {
if (ssp->wu_results[j].present
&& ssp->wu_results[j].result.id == result.id
) {
ncollisions++;
collision = true;
break;
}
}
if (!collision) {
printf("feeder: adding result %d\n", result.id);
retval = db_workunit(result.workunitid, wu);
if (retval) continue;
ssp->wu_results[i].result = result;
ssp->wu_results[i].workunit = wu;
ssp->wu_results[i].present = true;
nadditions++;
}
}
}
if (nadditions == 0) {
sleep(1);
} else {
printf("feeder: added %d results to array\n", nadditions);
}
if (no_wus) {
printf("feeder: no results available\n");
sleep(5);
}
if (ncollisions) {
printf("feeder: some results already in array - sleeping\n");
sleep(5);
}
check_trigger(ssp);
ssp->ready = true;
}
}
int main(int argc, char** argv) {
SCHED_SHMEM* ssp;
int i, retval;
bool asynch = false;
void* p;
for (i=1; i<argc; i++) {
if (!strcmp(argv[i], "-asynch")) {
asynch = true;
}
}
retval = destroy_shmem(BOINC_KEY);
if (retval) {
fprintf(stderr, "feeder: can't destroy shmem\n");
exit(1);
}
retval = create_shmem(BOINC_KEY, sizeof(SCHED_SHMEM), &p);
if (retval) {
fprintf(stderr, "feeder: can't create shmem\n");
exit(1);
}
ssp = (SCHED_SHMEM*)p;
ssp->init();
retval = db_open("boinc");
if (retval) {
fprintf(stderr, "feeder: db_open: %d\n", retval);
exit(1);
}
ssp->scan_tables();
printf(
"feeder: read\n"
"%d platforms\n"
"%d apps\n"
"%d app_versions\n",
ssp->nplatforms,
ssp->napps,
ssp->napp_versions
);
if (asynch) {
if (fork()==0) {
feeder_loop(ssp);
}
} else {
feeder_loop(ssp);
}
}