2002-09-26 18:11:06 +00:00
|
|
|
// The contents of this file are subject to the Mozilla 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://www.mozilla.org/MPL/
|
|
|
|
//
|
|
|
|
// 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):
|
|
|
|
|
|
|
|
|
|
|
|
//
|
2002-09-26 05:57:10 +00:00
|
|
|
// validate - check and validate new results, and grant credit
|
2002-09-02 17:25:55 +00:00
|
|
|
//
|
2002-10-19 17:14:08 +00:00
|
|
|
// validate -app appname -quorum n [-asynch]
|
2002-09-02 17:25:55 +00:00
|
|
|
//
|
|
|
|
// This program must be linked with two project-specific functions:
|
|
|
|
//
|
2002-09-25 19:40:19 +00:00
|
|
|
// int check_set(vector<RESULT>, int& canonical, double& credit)
|
|
|
|
// Compare a set of results.
|
|
|
|
// If a canonical result is found, return its ID,
|
|
|
|
// and set the "validate_state" field of all the results
|
2002-09-02 17:25:55 +00:00
|
|
|
// according to whether they match the canonical result.
|
2002-09-25 19:40:19 +00:00
|
|
|
// Also return the "canonical credit" (e.g. the average or median)
|
2002-09-02 17:25:55 +00:00
|
|
|
//
|
|
|
|
// int pair_check(RESULT& new_result, RESULT& canonical, bool& valid);
|
|
|
|
// return valid=true iff the new result matches the canonical one
|
|
|
|
//
|
|
|
|
// Both functions return nonzero if an error occurred,
|
|
|
|
// in which case other outputs are undefined
|
|
|
|
|
2002-10-09 18:48:26 +00:00
|
|
|
using namespace std;
|
|
|
|
|
2002-09-25 19:40:19 +00:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <math.h>
|
2002-09-02 17:25:55 +00:00
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include "db.h"
|
2002-10-03 18:33:46 +00:00
|
|
|
#include "config.h"
|
2002-09-02 17:25:55 +00:00
|
|
|
|
2002-10-19 17:14:08 +00:00
|
|
|
extern int check_set(vector<RESULT>&, int& canonical, double& credit);
|
2002-09-25 19:40:19 +00:00
|
|
|
extern int check_pair(RESULT&, RESULT&, bool&);
|
|
|
|
|
2002-10-03 18:33:46 +00:00
|
|
|
CONFIG config;
|
2002-10-19 17:14:08 +00:00
|
|
|
char app_name[256];
|
|
|
|
int min_quorum;
|
2002-10-03 18:33:46 +00:00
|
|
|
|
2002-09-25 19:40:19 +00:00
|
|
|
#define SECONDS_IN_DAY (3600*24)
|
|
|
|
#define EXP_DECAY_RATE (1./(SECONDS_IN_DAY*7))
|
|
|
|
|
|
|
|
// update an exponential average of credit per second
|
|
|
|
//
|
2002-09-26 05:57:10 +00:00
|
|
|
void update_average(double credit, double& avg, double& avg_time) {
|
2002-09-25 19:40:19 +00:00
|
|
|
time_t now = time(0);
|
|
|
|
|
|
|
|
if (avg_time) {
|
|
|
|
double deltat = now - avg_time;
|
|
|
|
avg *= exp(-deltat*EXP_DECAY_RATE);
|
|
|
|
}
|
2002-10-19 17:14:08 +00:00
|
|
|
avg += credit*EXP_DECAY_RATE;
|
2002-09-25 19:40:19 +00:00
|
|
|
avg_time = now;
|
|
|
|
}
|
|
|
|
|
|
|
|
// here when a result has been validated;
|
|
|
|
// grant credit to host and user
|
|
|
|
//
|
|
|
|
int grant_credit(RESULT& result, double credit) {
|
|
|
|
USER user;
|
|
|
|
HOST host;
|
|
|
|
int retval;
|
|
|
|
|
|
|
|
retval = db_host(result.hostid, host);
|
|
|
|
if (retval) return retval;
|
|
|
|
retval = db_user(host.userid, user);
|
|
|
|
if (retval) return retval;
|
|
|
|
|
|
|
|
user.total_credit += credit;
|
|
|
|
update_average(credit, user.expavg_credit, user.expavg_time);
|
|
|
|
retval = db_user_update(user);
|
|
|
|
if (retval) return retval;
|
|
|
|
|
|
|
|
host.total_credit += credit;
|
|
|
|
update_average(credit, host.expavg_credit, host.expavg_time);
|
|
|
|
retval = db_host_update(host);
|
|
|
|
if (retval) return retval;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2002-09-02 17:25:55 +00:00
|
|
|
|
|
|
|
// make one pass through the workunits with need_validate set.
|
|
|
|
// return true if there were any
|
|
|
|
//
|
2002-09-25 19:40:19 +00:00
|
|
|
bool do_validate_scan(APP& app, int min_quorum) {
|
2002-09-02 17:25:55 +00:00
|
|
|
WORKUNIT wu;
|
|
|
|
RESULT result, canonical_result;
|
|
|
|
bool found=false, match;
|
2002-09-25 19:40:19 +00:00
|
|
|
int retval, canonicalid;
|
|
|
|
double credit;
|
|
|
|
unsigned int i;
|
2002-09-02 17:25:55 +00:00
|
|
|
|
|
|
|
wu.appid = app.id;
|
|
|
|
while(!db_workunit_enum_app_need_validate(wu)) {
|
2002-10-19 17:14:08 +00:00
|
|
|
printf("validating WU %s\n", wu.name);
|
2002-09-02 17:25:55 +00:00
|
|
|
found = true;
|
|
|
|
if (wu.canonical_resultid) {
|
|
|
|
|
|
|
|
// Here if WU already has a canonical result.
|
|
|
|
// Get unchecked results and see if they match the canonical result
|
|
|
|
//
|
|
|
|
retval = db_result(wu.canonical_resultid, canonical_result);
|
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr, "validate: can't read canonical result\n");
|
|
|
|
continue;
|
|
|
|
}
|
2002-09-25 19:40:19 +00:00
|
|
|
|
|
|
|
// scan this WU's results, and check any that need checking
|
|
|
|
//
|
|
|
|
result.workunitid = wu.id;
|
|
|
|
while (!db_result_enum_wuid(result)) {
|
|
|
|
if (result.validate_state != VALIDATE_STATE_NEED_CHECK) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
retval = check_pair(result, canonical_result, match);
|
2002-09-02 17:25:55 +00:00
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"validate: pair_check failed for result %d\n",
|
|
|
|
result.id
|
|
|
|
);
|
|
|
|
continue;
|
|
|
|
} else {
|
|
|
|
if (match) {
|
2002-09-25 19:40:19 +00:00
|
|
|
result.validate_state = VALIDATE_STATE_VALID;
|
2002-09-02 17:25:55 +00:00
|
|
|
} else {
|
2002-09-25 19:40:19 +00:00
|
|
|
result.validate_state = VALIDATE_STATE_INVALID;
|
2002-09-02 17:25:55 +00:00
|
|
|
}
|
|
|
|
}
|
2002-10-19 17:14:08 +00:00
|
|
|
printf("setting result %d to %d\n", result.id, result.validate_state);
|
2002-09-25 19:40:19 +00:00
|
|
|
retval = db_result_update(result);
|
|
|
|
retval = grant_credit(result, wu.canonical_credit);
|
2002-09-02 17:25:55 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Here if WU doesn't have a canonical result yet.
|
|
|
|
// Try to get one
|
|
|
|
|
|
|
|
vector<RESULT> results;
|
|
|
|
result.workunitid = wu.id;
|
2002-09-25 19:40:19 +00:00
|
|
|
while (!db_result_enum_wuid(result)) {
|
2002-09-02 17:25:55 +00:00
|
|
|
if (result.state == RESULT_STATE_DONE) {
|
|
|
|
results.push_back(result);
|
|
|
|
}
|
|
|
|
}
|
2002-10-19 17:14:08 +00:00
|
|
|
printf("found %d results\n", results.size());
|
2002-09-25 19:40:19 +00:00
|
|
|
if (results.size() >= (unsigned int)min_quorum) {
|
|
|
|
retval = check_set(results, canonicalid, credit);
|
|
|
|
if (!retval && canonicalid) {
|
|
|
|
wu.canonical_resultid = canonicalid;
|
|
|
|
wu.canonical_credit = credit;
|
|
|
|
for (i=0; i<results.size(); i++) {
|
|
|
|
if (results[i].validate_state == VALIDATE_STATE_VALID) {
|
|
|
|
retval = grant_credit(results[i], credit);
|
2002-10-19 17:14:08 +00:00
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"validate: grant_credit %d\n", retval
|
|
|
|
);
|
|
|
|
}
|
|
|
|
results[i].granted_credit = credit;
|
2002-09-25 19:40:19 +00:00
|
|
|
}
|
2002-10-19 17:14:08 +00:00
|
|
|
printf("updating result %d to %d\n", results[i].id, results[i].validate_state);
|
2002-09-25 19:40:19 +00:00
|
|
|
retval = db_result_update(results[i]);
|
2002-10-19 17:14:08 +00:00
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"validate: db_result_update %d\n", retval
|
|
|
|
);
|
|
|
|
}
|
2002-09-25 19:40:19 +00:00
|
|
|
}
|
|
|
|
}
|
2002-09-02 17:25:55 +00:00
|
|
|
}
|
|
|
|
}
|
2002-09-25 19:40:19 +00:00
|
|
|
|
|
|
|
// we've checked all results for this WU, so turn off flag
|
|
|
|
//
|
|
|
|
wu.need_validate = 0;
|
|
|
|
retval = db_workunit_update(wu);
|
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr, "db_workunit_update: %d\n", retval);
|
|
|
|
}
|
2002-09-02 17:25:55 +00:00
|
|
|
}
|
2002-09-25 19:40:19 +00:00
|
|
|
return found;
|
2002-09-02 17:25:55 +00:00
|
|
|
}
|
|
|
|
|
2002-10-19 17:14:08 +00:00
|
|
|
int main_loop() {
|
|
|
|
int retval;
|
2002-09-02 17:25:55 +00:00
|
|
|
APP app;
|
|
|
|
bool did_something;
|
|
|
|
|
2002-10-03 18:33:46 +00:00
|
|
|
retval = db_open(config.db_name, config.db_passwd);
|
2002-09-02 17:25:55 +00:00
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr, "validate: db_open: %d\n", retval);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2002-10-19 17:14:08 +00:00
|
|
|
strcpy(app.name, app_name);
|
2002-09-02 17:25:55 +00:00
|
|
|
retval = db_app_lookup_name(app);
|
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr, "can't find app %s\n", app.name);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2002-10-19 17:14:08 +00:00
|
|
|
while (1) {
|
|
|
|
did_something = do_validate_scan(app, min_quorum);
|
|
|
|
if (!did_something) {
|
|
|
|
printf("sleeping\n");
|
|
|
|
sleep(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int main(int argc, char** argv) {
|
|
|
|
int i, retval;
|
|
|
|
bool asynch = false;
|
|
|
|
|
|
|
|
for (i=1; i<argc; i++) {
|
|
|
|
if (!strcmp(argv[i], "-asynch")) {
|
|
|
|
asynch = true;
|
|
|
|
} else if (!strcmp(argv[i], "-app")) {
|
|
|
|
strcpy(app_name, argv[++i]);
|
|
|
|
} else if (!strcmp(argv[i], "-quorum")) {
|
|
|
|
min_quorum = atoi(argv[++i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-09-02 17:25:55 +00:00
|
|
|
if (min_quorum < 1 || min_quorum > 10) {
|
|
|
|
fprintf(stderr, "bad min_quorum: %d\n", min_quorum);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2002-10-19 17:14:08 +00:00
|
|
|
retval = config.parse_file();
|
|
|
|
if (retval) {
|
|
|
|
fprintf(stderr, "Can't parse config file\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (asynch) {
|
|
|
|
if (!fork()) {
|
|
|
|
main_loop();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
main_loop();
|
2002-09-02 17:25:55 +00:00
|
|
|
}
|
|
|
|
}
|