/* * Allocation.cpp - TaskJuggler * * SPDX-FileCopyrightText: 2001, 2002, 2003, 2004 Chris Schlaeger * SPDX-FileCopyrightText: 2011 Dag Andersen * * This program is free software; you can redistribute it and/or modify * it under the terms of version 2 of the GNU General Public License as * published by the Free Software Foundation. * * $Id$ */ // clazy:excludeall=qstring-arg #include "Allocation.h" #include "tjlib-internal.h" #include "Resource.h" #include "ResourceTreeIterator.h" // #include "ReportXML.h" #include "UsageLimits.h" /* -- DTD -- /-- DTD --/ */ namespace TJ { Allocation::Allocation() : limits(nullptr), shifts(), persistent(false), mandatory(false), lockedResource(nullptr), conflictStart(0), candidates(), selectionMode(minAllocationProbability) { // shifts.setAutoDelete(true); } Allocation::~Allocation() { while(!shifts.isEmpty()) delete shifts.takeFirst(); delete limits; } Allocation::Allocation(const Allocation& a) : limits(a.limits ? new UsageLimits(*a.limits) : nullptr), shifts(), persistent(a.persistent), mandatory(a.mandatory), lockedResource(a.lockedResource), conflictStart(0), candidates(a.candidates), selectionMode(a.selectionMode) { // shifts.setAutoDelete(true); for (QListIterator sli(a.shifts); sli.hasNext();) shifts.append(new ShiftSelection(*(sli.next()))); } void Allocation::setLimits(UsageLimits* l) { delete limits; limits = l; } bool Allocation::isWorker() const { /* For an allocation to be a worker, all allocated resources must have an * non zero efficiency. */ for (QListIterator cli(candidates); cli.hasNext();) if (!cli.next()->isWorker()) return false; return true; } /* Creation of the XML Representation of the Allocation */ QDomElement Allocation::xmlElement(QDomDocument& doc) { Q_UNUSED(doc); QDomElement elem;/* = doc.createElement("Allocation"); elem.appendChild(ReportXML::createXMLElem(doc, "Persistent", isPersistent() ? "Yes":"No")); elem.setAttribute("ResourceID", candidates.first()->getId());*/ /* candidates are missing TODO */ return elem; } bool Allocation::setSelectionMode(const QString& smt) { if (smt == KW("order")) selectionMode = order; else if (smt == KW("minallocated")) selectionMode = minAllocationProbability; else if (smt == KW("minloaded")) selectionMode = minLoaded; else if (smt == KW("maxloaded")) selectionMode = maxLoaded; else if (smt == KW("random")) selectionMode = random; else return false; return true; } } // namespace TJ