// 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 .
// logic for handling limits on numbers of jobs in progress per client.
// See https://github.com/BOINC/boinc/wiki/ProjectOptions#job-limits
#include "sched_main.h"
#include "sched_limit.h"
int RSC_JOB_LIMIT::parse(XML_PARSER& xp, const char* end_tag) {
per_proc = false;
while (!xp.get_tag()) {
if (!xp.is_tag) {
continue;
}
if (xp.match_tag(end_tag)) {
return 0;
}
if (xp.parse_int("jobs", base_limit)) {
continue;
}
if (xp.parse_bool("per_proc", per_proc)) {
continue;
}
}
return ERR_XML_PARSE;
}
int JOB_LIMIT::parse(XML_PARSER& xp, const char* end_tag) {
while (!xp.get_tag()) {
if (!xp.is_tag) {
continue;
}
if (xp.match_tag(end_tag)) {
return 0;
}
if (xp.parse_str("app_name", app_name, sizeof(app_name))) {
continue;
}
if (xp.match_tag("total_limit")) {
total.parse(xp, "/total_limit");
continue;
}
if (xp.match_tag("cpu_limit")) {
proc_type_limits[0].parse(xp, "/cpu_limit");
continue;
}
if (xp.match_tag("gpu_limit")) {
proc_type_limits[1].parse(xp, "/gpu_limit");
for (int i=2; i