mirror of https://github.com/BOINC/boinc.git
77 lines
2.2 KiB
C
77 lines
2.2 KiB
C
|
// This file is part of BOINC.
|
||
|
|
// http://boinc.berkeley.edu
|
||
|
|
// Copyright (C) 2008 University of California
|
||
|
|
//
|
||
|
|
// BOINC is free software; you can redistribute it and/or modify it
|
||
|
|
// under the terms of the GNU Lesser General Public License
|
||
|
|
// as published by the Free Software Foundation,
|
||
|
|
// either version 3 of the License, or (at your option) any later version.
|
||
|
|
//
|
||
|
|
// BOINC is distributed in the hope that it will be useful,
|
||
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
||
|
|
// See the GNU Lesser General Public License for more details.
|
||
|
|
//
|
||
|
|
// You should have received a copy of the GNU Lesser General Public License
|
||
|
|
// along with BOINC. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
|
||
|
|
#ifndef __RR_SIM__
|
||
|
|
#define __RR_SIM__
|
||
|
|
|
||
|
|
#include "client_types.h"
|
||
|
|
|
||
|
|
struct RESULT;
|
||
|
|
|
||
|
|
struct RR_SIM_PROJECT_STATUS {
|
||
|
|
/// jobs currently running (in simulation)
|
||
|
|
std::vector<RESULT*>active;
|
||
|
|
/// jobs runnable but not running yet
|
||
|
|
std::vector<RESULT*>pending;
|
||
|
|
int deadlines_missed;
|
||
|
|
/// fraction of each CPU this project will get
|
||
|
|
/// set in CLIENT_STATE::rr_misses_deadline();
|
||
|
|
double proc_rate;
|
||
|
|
double cpu_shortfall;
|
||
|
|
|
||
|
|
inline void clear() {
|
||
|
|
active.clear();
|
||
|
|
pending.clear();
|
||
|
|
deadlines_missed = 0;
|
||
|
|
proc_rate = 0;
|
||
|
|
cpu_shortfall = 0;
|
||
|
|
}
|
||
|
|
inline void activate(RESULT* rp) {
|
||
|
|
active.push_back(rp);
|
||
|
|
}
|
||
|
|
inline void add_pending(RESULT* rp) {
|
||
|
|
pending.push_back(rp);
|
||
|
|
}
|
||
|
|
inline bool none_active() {
|
||
|
|
return !active.size();
|
||
|
|
}
|
||
|
|
inline bool can_run(RESULT*, int ncpus) {
|
||
|
|
return (int)active.size() < ncpus;
|
||
|
|
}
|
||
|
|
inline void remove_active(RESULT* r) {
|
||
|
|
std::vector<RESULT*>::iterator it = active.begin();
|
||
|
|
while (it != active.end()) {
|
||
|
|
if (*it == r) {
|
||
|
|
it = active.erase(it);
|
||
|
|
} else {
|
||
|
|
it++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
inline RESULT* get_pending() {
|
||
|
|
if (!pending.size()) return NULL;
|
||
|
|
RESULT* rp = pending[0];
|
||
|
|
pending.erase(pending.begin());
|
||
|
|
return rp;
|
||
|
|
}
|
||
|
|
inline int cpus_used() {
|
||
|
|
return (int) active.size();
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
#endif
|