/usr/include/boinc/sched_limit.h is in boinc-dev 7.0.24+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // This file is part of BOINC.
// http://boinc.berkeley.edu
// Copyright (C) 2010 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 _SCHED_LIMIT_
#define _SCHED_LIMIT_
#include <vector>
#include "boinc_db.h"
#include "hostinfo.h"
#include "error_numbers.h"
#include "parse.h"
#include "sched_msgs.h"
using std::vector;
struct RSC_JOB_LIMIT {
int base_limit; // 0 means no limit
int scaled_limit; // the actual limit
int njobs;
bool per_proc; // if true, scaled limit is limit*nprocs
int parse(XML_PARSER&, const char* end_tag);
inline void reset(int nprocs) {
njobs = 0;
if (per_proc) {
scaled_limit = base_limit*nprocs;
} else {
scaled_limit = base_limit;
}
}
inline bool exceeded() {
return (scaled_limit && njobs >= scaled_limit);
}
inline void register_job() {
njobs++;
}
inline bool any_limit() {
return (base_limit != 0);
}
void print_log(const char*);
RSC_JOB_LIMIT() {
base_limit = 0;
scaled_limit = 0;
njobs = 0;
per_proc = false;
}
};
struct JOB_LIMIT {
char app_name[256];
RSC_JOB_LIMIT total;
RSC_JOB_LIMIT cpu;
RSC_JOB_LIMIT gpu;
int parse(XML_PARSER&, const char* end_tag);
inline void reset(int ncpus, int ngpus) {
total.reset(1);
cpu.reset(ncpus);
gpu.reset(ngpus);
}
inline bool exceeded(bool is_gpu) {
if (total.exceeded()) return true;
if (is_gpu) {
if (gpu.exceeded()) return true;
} else {
if (cpu.exceeded()) return true;
}
return false;
}
inline void register_job(bool is_gpu) {
total.register_job();
if (is_gpu) {
gpu.register_job();
} else {
cpu.register_job();
}
}
inline bool any_limit() {
return total.any_limit() || cpu.any_limit() || gpu.any_limit();
}
void print_log();
};
struct JOB_LIMITS {
JOB_LIMIT project_limits; // project-wide limits
vector<JOB_LIMIT> app_limits; // per-app limits
int parse(XML_PARSER&, const char* end_tag);
void print_log();
// called at start of each request
//
inline void reset(int ncpus, int ngpus) {
project_limits.reset(ncpus, ngpus);
for (unsigned int i=0; i<app_limits.size(); i++) {
app_limits[i].reset(ncpus, ngpus);
}
}
inline JOB_LIMIT* lookup_app(char* name) {
for (unsigned int i=0; i<app_limits.size(); i++) {
JOB_LIMIT* jlp = &app_limits[i];
if (!strcmp(name, jlp->app_name)) {
return jlp;
}
}
return NULL;
}
inline bool exceeded(APP* app, bool is_gpu) {
if (project_limits.exceeded(is_gpu)) return true;
if (app) {
JOB_LIMIT* jlp = lookup_app(app->name);
if (jlp) {
if (jlp->exceeded(is_gpu)) return true;
}
}
return false;
}
inline void register_job(APP* app, bool is_gpu) {
project_limits.register_job(is_gpu);
if (app) {
JOB_LIMIT* jlp = lookup_app(app->name);
if (jlp) {
jlp->register_job(is_gpu);
}
}
}
};
#endif
|