GitLab

Looks like we are going to want the ability to tweak vnode placement per
run rather than by building new assign binaries. So, add new '-S
balance' and '-S pack' options. I suspect it would also be useful to add
'-S spread' to try to spread vnodes out across as many hosts as
possible, some people want this when using shared hosts.

This commit is intended to makes the license status of Emulab and
ProtoGENI source files more clear.  It replaces license symbols like
"EMULAB-COPYRIGHT" and "GENIPUBLIC-COPYRIGHT" with {{{ }}}-delimited
blocks that contain actual license statements.

This change was driven by the fact that today, most people acquire and
track Emulab and ProtoGENI sources via git.

Before the Emulab source code was kept in git, the Flux Research Group
at the University of Utah would roll distributions by making tar
files.  As part of that process, the Flux Group would replace the
license symbols in the source files with actual license statements.

When the Flux Group moved to git, people outside of the group started
to see the source files with the "unexpanded" symbols.  This meant
that people acquired source files without actual license statements in
them.  All the relevant files had Utah *copyright* statements in them,
but without the expanded *license* statements, the licensing status of
the source files was unclear.

This commit is intended to clear up that confusion.

Most Utah-copyrighted files in the Emulab source tree are distributed
under the terms of the Affero GNU General Public License, version 3
(AGPLv3).

Most Utah-copyrighted files related to ProtoGENI are distributed under
the terms of the GENI Public License, which is a BSD-like open-source
license.

Some Utah-copyrighted files in the Emulab source tree are distributed
under the terms of the GNU Lesser General Public License, version 2.1
(LGPL).

When set, randomizes the order of nodes before making pclasses. This
has the effect of putting different nodes at the 'front' of the pclass,
The idea is to avoid 'hot spots' of nodes that get over-used simply
because they happen to appear earlier in the .ptop file.

NB: because STL seems to use a different source of randomness, using
this with '-s' to set a seed does *not* make assign deterministic.

Have I mentioned that I hate it when library developers move their
headers around? Change the location of the property_list.hpp header
to a macro and add a new -DNEWER_BOOT define that swtiches this to
the newer location.

Not automatically detected yet; should be checked in configure.
(cherry picked from commit 2403b264)

Have I mentioned that I hate it when library developers move their
headers around? Change the location of the property_list.hpp header
to a macro and add a new -DNEWER_BOOT define that swtiches this to
the newer location.

Not automatically detected yet; should be checked in configure.

The 'best' variable didn't really store the best score seen so far,
so rename it to prev_score. Likewise for the bestviolated variable.

If a request was made for a node type that was not present in the physical
topology, then the error message was, "Too much bandwidth on emulated links."
This change adds a flag in mapping_precheck() that remembers whether the
requested node type was found.  If not, then a new error message is printed
instead of the bandwidth one.

Removing unnecessary debug statements which weren't removed earlier in excessive eagerness to commit and push code.

Fixed a bug dealing with exclusive nodes. Modified the parser to check for both an element exclusive and an attribute exclusive (did I mention that I am starting to detest v1?).

An unrelated bug which would have caused some nasty type-precheck failures also got fixed in the process.

to be buggy and support for extensions needs to tested and in some cases,
there's more stuff that needs to go in as extensions.

This reverts commit df603900.

Breaks the build

This reverts commit 99b48da8.

Breaks the build.

files. The rspec version  passed from the command line isn't being used right
now and the schema is validated against that provided in the schemaLocation tag in
the XML document. This is a bad idea and we should figure out a clean way of e
nsuring that we don't get passed nasty XMLs.

of info on virtual and physical nodes after parsing.

values for configuration parameters, such as some of the cooling
parameters, scoring values, etc.

Also add a -D option to dump these parametrs, as well as the command
line, for posterity.

Refresh the dependency list at the end of the makefile

type counts for dynamic pclasses, which (correctly) never got added to
those counts in the first place.

Explicitly mark dynamically-created pclasses as such, so that we can
treat them specially in a few circumstances.

if there are no physical nodes of the type available.

not all nodes have to be on the same switch.

between the given type not having enough _available_ nodes and not
having enough _suitable_ nodes.

Also, fix a silly bug in which I was running the type precheck one too
many times. This didn't hurt anything, just took a little bit of time.

it removes, and decrements the available slot count for every node
in a pclass that is being removed.

After running prune_unusable_pclasses(), we now do another type check,
minus the pruned pclasses.

This should enable us to detect more free node problems up front -
let's say there are 8 vnodes that all want 2 interfaces, but only
a couple pnodes that have 2: most have 1. The second type check will
now catch this, since all of the 1-interface pnodes have been pruned.

Ripping out crope and replacing (almost) all cropes, char*s and
strings with fstring

Beginnings of XML parser support (not built by default yet).

Significant re-org of code.

Should now compile with the latest gcc.

Putting link information in stored solutions.

Support for fixing interfaces.

are using this class.

Skip the vclass precheck for any pclasses that no one is actually
using.

is to avoid scaring users.

Also, remove the 'contact calfeld' text - I thought I had done this a
long time ago!

that we include this and the prechecks into the reported time.

(Though, we still exclude file parsing time)

are available, and some that are not.

table, but also that there are any nodes of that type. The entry could
have been put into the table because of a set-type-limit line in the
ptop file.

It looks like this:
set-type-limit <type> <count>

This can be placed anywhere in the ptop file.  It limits the number of
physical nodes of a given type that an experimenter is allowed to use.

For example, we may limit a user to 10 PCs, or 5 pc850s. In the latter
case, if the experimenter had simply asked for 10 generic PCs, then we
will try to find them some mapping of nodes that uses types of PCs
other than pc850s.

Added a precheck to tell the user up-front if they asked for more
nodes than they are allowed to use of a given type.

borken the code that helps assign figure out which desire was not
matched.

Also remove some old dead code while I'm in here.

branch.