assign.cc 35.8 KB
Newer Older
Robert Ricci's avatar
Robert Ricci committed
1 2
/*
 * EMULAB-COPYRIGHT
3
 * Copyright (c) 2000-2009 University of Utah and the Flux Group.
Robert Ricci's avatar
Robert Ricci committed
4 5 6
 * All rights reserved.
 */

7 8 9 10 11 12 13 14
#include "port.h"

#include <boost/config.hpp>
#include <boost/utility.hpp>
#include <boost/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
15
#ifdef GRAPHVIZ_SUPPORT
16
#include <boost/graph/graphviz.hpp>
17
#endif
18

19 20
#include <fstream>
#include <iostream>
21
#include <time.h>
Mac Newbold's avatar
Mac Newbold committed
22
#include <stdlib.h>
23
#include <math.h>
Mac Newbold's avatar
Mac Newbold committed
24 25
#include <sys/types.h>
#include <sys/time.h>
26
#include <sys/resource.h>
27 28
#include <signal.h>
#include <sys/signal.h>
29
#include <queue>
30
#include <algorithm>
31 32

using namespace boost;
Mac Newbold's avatar
Mac Newbold committed
33

34 35
#include <stdio.h>

Mac Newbold's avatar
Mac Newbold committed
36
#include "common.h"
37
#include "delay.h"
Mac Newbold's avatar
Mac Newbold committed
38
#include "physical.h"
39
#include "virtual.h"
40
#include "vclass.h"
41
#include "pclass.h"
42
#include "score.h"
43 44 45
#include "solution.h"
#include "maps.h"
#include "anneal.h"
46 47
#include "config.h"

48 49
#ifdef WITH_XML
#include "parse_ptop_xml.h"
50 51 52
#include "parse_vtop_xml.h"
#include "parse_advertisement_rspec.h"
#include "parse_request_rspec.h"
53
#endif
54 55 56

// Here we set up all our graphs.  Need to create the graphs
// themselves and then setup the property maps.
57
tb_pgraph PG;
58 59 60 61 62 63 64 65 66 67
tb_pgraph_vertex_pmap pvertex_pmap = get(vertex_data, PG);
tb_pgraph_edge_pmap pedge_pmap = get(edge_data, PG);
tb_sgraph SG;
tb_sgraph_vertex_pmap svertex_pmap = get(vertex_data, SG);
tb_sgraph_edge_pmap sedge_pmap = get(edge_data, SG);
tb_vgraph VG;
tb_vgraph_vertex_pmap vvertex_pmap = get(vertex_data, VG);
tb_vgraph_edge_pmap vedge_pmap = get(edge_data, VG);

// List of virtual types by name.
68
name_count_map vtypes;
69
name_list_map vclasses;
70 71

// A list of all pclasses.
72
pclass_list pclasses;
73 74 75
 	
// Map from a pnode* to the the corresponding pvertex.
pnode_pvertex_map pnode2vertex;
76 77 78

// Map of a type to a tt_entry, a vector of pclasses and the size of
// the vector.
79
pclass_types type_table;
80 81 82
#ifdef PER_VNODE_TT
pclass_types vnode_type_table;
#endif
83

84 85 86 87 88
// This datastructure contains all the information needed to calculate
// the shortest path between any two switches.  Indexed by svertex,
// the value will be a predicate map (indexed by svertex as well) of
// the shortest paths for the given vertex.
switch_pred_map_map switch_preds;
89

90 91
// Same, but for distances 
switch_dist_map_map switch_dist;
92

93 94
// Time started, finished, and the time limit
double timestart, timeend, timelimit, timetarget;
95

96 97 98
// An amount to scale the neighborhood size by
double scale_neighborhood = 1.0;

99 100 101 102 103
#ifdef GNUPLOT_OUTPUT
FILE *scoresout, *tempout, *deltaout;
#endif
// Whether or not assign is allowed to generate trivial links
bool allow_trivial_links = true;
104

105
// Whether or not assign should use pclasses
106
bool disable_pclasses = false;
107

Robert Ricci's avatar
Robert Ricci committed
108 109 110
// Whether or not assign should prune out pclasses that it knows can
// never be used
bool prune_pclasses = false;
111 112 113

// Whether or not we should use the experimental support for dynamic pclasses
bool dynamic_pclasses = false;
114 115 116

// Whether or not to allow assign to temporarily over-subscribe pnodes
bool allow_overload = false;
Robert Ricci's avatar
Robert Ricci committed
117 118 119 120

// Forces assign to do greedy link assignment, by chosing the first link in its
// list, which is usually the lowest-cost
bool greedy_link_assignment = false;
121 122 123 124 125

// Forces assign to skip melting, and, instead, use the temperature given as
// the initial temperature
bool no_melting = false;
double initial_temperature = 0.0f;
126 127 128 129 130 131

// Print out a summary of the solution in addition to the solution itself
bool print_summary = false;

// Use the 'connected' find algorithm
double use_connected_pnode_find = 0.0f;
132

133 134 135
// Whether or not to perform all checks on fixed nodes
bool check_fixed_nodes = false;

136 137 138
// If true, dump a bunch of configrution information
bool dump_config = false;

139
// Use XML for file input
140 141 142 143 144 145
// bool xml_input = false;
#ifdef WITH_XML
bool ptop_xml_input = false;
bool vtop_xml_input = false;
bool ptop_rspec_input = false;
bool vtop_rspec_input = false;
146
#endif
147

148 149 150
// XXX - shouldn't be in this file
double absbest;
int absbestviolated, iters, iters_to_best;
Robert Ricci's avatar
Robert Ricci committed
151

152 153 154
// Map of all physical types in use in the system
tb_ptype_map ptypes;

155 156 157
/*
 * Internal functions
 */
Mac Newbold's avatar
Mac Newbold committed
158

Robert Ricci's avatar
Robert Ricci committed
159
// Return the CPU time (in seconds) used by this process
160
float used_time() {
161 162 163 164 165 166
  struct rusage ru;
  getrusage(RUSAGE_SELF,&ru);
  return ru.ru_utime.tv_sec+ru.ru_utime.tv_usec/1000000.0+
    ru.ru_stime.tv_sec+ru.ru_stime.tv_usec/1000000.0;
}

167 168 169 170 171 172 173 174 175 176 177 178
// Constructs the output file name for the annotated rspec
string annotated_filename (const char* filepath)
{
	string input_filepath = string(filepath);
	int pos_last_backslash = input_filepath.find_last_of("/");
	string input_filename = input_filepath.substr(pos_last_backslash+1, input_filepath.length()-pos_last_backslash-1);
	string output_filepath = input_filepath.substr(0, pos_last_backslash+1);
	output_filepath.append("annotated-");
	output_filepath.append(input_filename);
	return (output_filepath);
}

Robert Ricci's avatar
Robert Ricci committed
179
// Read in the .ptop file
180
void read_physical_topology(char *filename) {
181 182
  ifstream ptopfile;
  ptopfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
183
  if (!ptopfile.is_open()) {
184
      cout << "*** Unable to open ptop file " << filename << endl;
185
      exit(EXIT_FATAL);
Robert Ricci's avatar
Robert Ricci committed
186
  }
187 188
  
#ifdef WITH_XML
189 190 191 192 193 194
  if (ptop_xml_input) {
		cout << "Physical Graph: " << parse_ptop_xml(PG,SG,filename) << endl;
  } else if (ptop_rspec_input) {
	  cout << "Physical Graph: " << parse_ptop_rspec (PG, SG, filename) << endl;
	}
	else {
195 196 197
      cout << "Physical Graph: " << parse_ptop(PG,SG,ptopfile) << endl;
  }
#else
198
	cout << "Physical Graph: " << parse_ptop(PG,SG,ptopfile) << endl;
199
#endif
200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221

#ifdef DUMP_GRAPH
  {
    cout << "Physical Graph:" << endl;
    
    pvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(PG);
    
    for (;vit != vendit;vit++) {
      tb_pnode *p = get(pvertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    pedge_iterator eit,eendit;
    tie(eit,eendit) = edges(PG);

    for (;eit != eendit;eit++) {
      tb_plink *p = get(pedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,PG) << " <-> " <<
	target(*eit,PG) << ")\t" << *p;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
222
#endif // DUMP_GRAPH
223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245

#ifdef GRAPH_DEBUG
  {
    cout << "Switch Graph:" << endl;
    

    svertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(SG);
    
    for (;vit != vendit;vit++) {
      tb_switch *p = get(svertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    sedge_iterator eit,eendit;
    tie(eit,eendit) = edges(SG);

    for (;eit != eendit;eit++) {
      tb_slink *p = get(sedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,SG) << " <-> " <<
	target(*eit,SG) << ")\t" << *p;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
246
#endif // GRAPH_DEBUG
247

Robert Ricci's avatar
Robert Ricci committed
248 249
  // Set up pnode2vertex - a mapping between vertices in the physical graph and
  // the pnodes that we just read in from the ptop file
250 251 252 253 254 255 256 257
  pvertex_iterator pvit,pvendit;
  tie(pvit,pvendit) = vertices(PG);
  for (;pvit != pvendit;pvit++) {
    pnode2vertex[get(pvertex_pmap,*pvit)]=*pvit;
  }

}

Robert Ricci's avatar
Robert Ricci committed
258 259
// Calculate the minimum spanning tree for the switches - we only consider one
// potential path between each pair of switches.
260
// XXX: Should soon be replaced by calculate_shortest_routes()
261
void calculate_switch_MST() {
262
  cout << "Calculating shortest paths on switch fabric." << endl;
Robert Ricci's avatar
Robert Ricci committed
263 264

  // Set up the weight map for Dijkstra's
265 266 267 268 269 270 271 272 273 274
  tb_sgraph_weight_pmap sweight_pmap = get(edge_weight, SG);
  sedge_iterator seit,seendit;
  tie(seit,seendit) = edges(SG);
  for (;seit != seendit;seit++) {
    tb_slink *slink = get(sedge_pmap,*seit);
    // XXX should we make this more complicated depending on
    // latency/loss as well?
    put(sweight_pmap,*seit,
	100000000-get(pedge_pmap,slink->mate)->delay_info.bandwidth);
  }
275

Robert Ricci's avatar
Robert Ricci committed
276
  // Let boost do the Disjktra's for us, from each switch
277 278 279 280 281 282 283 284
  svertex_iterator svit,svendit;
  tie(svit,svendit) = vertices(SG);
  for (;svit != svendit;svit++) {
    switch_preds[*svit] = new switch_pred_map(num_vertices(SG));
    switch_dist[*svit] = new switch_dist_map(num_vertices(SG));
    dijkstra_shortest_paths(SG,*svit,
    			    predecessor_map(&((*switch_preds[*svit])[0])).
			    distance_map(&((*switch_dist[*svit])[0])));
285 286
  }

287 288 289 290 291 292 293 294 295
#ifdef GRAPH_DEBUG
  cout << "Shortest paths" << endl;
  tie(svit,svendit) = vertices(SG);
  for (;svit != svendit;svit++) {
    cout << *svit << ":" << endl;
    for (unsigned int i = 0;i<num_vertices(SG);++i) {
      cout << i << " " << (*switch_dist[*svit])[i] << endl;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
296
#endif // GRAPH_DEBUG
297 298
}

Robert Ricci's avatar
Robert Ricci committed
299
// Read in the .top file
300
void read_virtual_topology(char *filename) {
301 302
  ifstream topfile;
  topfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
303
  if (!topfile.is_open()) {
304
      cout << "*** Unable to open top file " << filename << endl;
305
      exit(EXIT_FATAL);
Robert Ricci's avatar
Robert Ricci committed
306
  }
307
  
308 309 310 311 312 313 314 315
#ifdef WITH_XML  
  if (vtop_xml_input) {
	cout << "Virtual Graph: " << parse_vtop_xml(VG,filename) << endl;
  }
  else if (vtop_rspec_input){
  	  cout << "Virtual Graph: " << parse_vtop_rspec (VG, filename) << endl ;
  }
  else {
316 317 318
      cout << "Virtual Graph: " << parse_top(VG,topfile) << endl;
  }
#else
319
	cout << "Virtual Graph: " << parse_top(VG,topfile) << endl;
320
#endif
321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345

#ifdef DUMP_GRAPH
  {
    cout << "Virtual Graph:" << endl;
    

    vvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(VG);
    
    for (;vit != vendit;vit++) {
      tb_vnode *p = get(vvertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    vedge_iterator eit,eendit;
    tie(eit,eendit) = edges(VG);

    for (;eit != eendit;eit++) {
      tb_vlink *p = get(vedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,VG) << " <-> " <<
	target(*eit,VG) << ")\t" << *p;
    }
  }  
#endif
}
Robert Ricci's avatar
Robert Ricci committed
346 347 348 349 350 351 352 353 354 355
/*
 * Make a pass through the pclasses, looking for ones that no node can use, and
 * nuking them.
 */
void prune_unusable_pclasses() {
    cout << "Pruning pclasses." << endl;
    int pruned = 0;
    pclass_list::iterator pclass_iterator = pclasses.begin();
    while (pclass_iterator != pclasses.end()) {
	if ((*pclass_iterator)->refcount == 0) {
356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373
            /*
             * Remove the nodes in the pclass we're removing from the slot
             * counts for their ptypes
             */
            tb_pclass::pclass_members_map::iterator ptype_iterator;
            ptype_iterator = (*pclass_iterator)->members.begin();
            while (ptype_iterator != (*pclass_iterator)->members.end()) {
                /*
                 * Find the recort for this type in the ptypes structure
                 */
                fstring this_type = ptype_iterator->first;
                tb_ptype_map::iterator ptype = ptypes.find(this_type);
                assert(ptype != ptypes.end());
                tb_ptype *this_type_p = ptype->second;

                /*
                 * For every node with this type, we want to remove its slot
                 * count from the total slot count for the type, since we know
374 375 376
                 * we will never use this particular node.
                 * Note: We only have to do this for pclasses that are "real",
                 * not dynamic ones.
377
                 */
378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
                if (!(*pclass_iterator)->is_dynamic) {
                    tb_pnodelist::list_iter pnode_iterator =
                        ptype_iterator->second->L.begin();
                    while (pnode_iterator != ptype_iterator->second->L.end()) {
                        /*
                         * Get the slotcount for this ptype
                         */
                        tb_pnode::types_map::iterator tm_iterator;
                        tm_iterator = (*pnode_iterator)->types.find(this_type);
                        assert(tm_iterator != (*pnode_iterator)->types.end());

                        /*
                         * Remove it from the current ptype
                         */
                        this_type_p->remove_slots(
                                tm_iterator->second->get_max_load());

                        /*
                         * Move on to the next node
                         */
                        pnode_iterator++;
                    }
400 401 402 403
                }
                ptype_iterator++;
            }

Robert Ricci's avatar
Robert Ricci committed
404 405 406 407 408 409
	    pclass_list::iterator nukeme = pclass_iterator;
	    pclass_iterator++;
#ifdef PCLASS_DEBUG
	    cout << "Pruning " << (*nukeme)->name << endl;
#endif
	    pruned++;
410

Robert Ricci's avatar
Robert Ricci committed
411 412 413 414 415 416 417 418 419 420
	    delete *nukeme;
	    pclasses.erase(nukeme);
	} else {
	    pclass_iterator++;
	}
    }
    cout << "pclass pruning complete: removed " << pruned << " pclasses, " <<
	pclasses.size() << " remain." << endl;
}

421
void print_help() {
422
  cout << "assign [options] ptopfile topfile [cparams]" << endl;
423
  cout << "Options: " << endl;
424
#ifdef TIME_TERMINATE
425
  cout << "  -l <time>   - Limit runtime." << endl;
Mac Newbold's avatar
Mac Newbold committed
426
#endif
427
  cout << "  -s <seed>   - Set the seed." << endl;
428
#ifdef GRAPHVIZ_SUPPORT
429
  cout << "  -v <viz>    - Produce graphviz files with given prefix." <<
430
    endl;
431
#endif
432 433 434
  cout << "  -r          - Don't allow trivial links." << endl;
  cout << "  -p          - Disable pclasses." << endl;
  cout << "  -d          - Enable dynamic pclasses." << endl;
435
#ifdef PER_VNODE_TT
436
  cout << "  -P          - Prune unusable pclasses." << endl;
437
#endif
438 439 440
  cout << "  -T          - Doing some scoring self-testing." << endl;
  cout << "  -H <float>  - Try <float> times harder." << endl;
  cout << "  -o          - Allow overloaded pnodes to be considered." << endl;
441 442
  cout << "  -t <float>  - Start the temperature at <float> instead of melting."
      << endl;
443 444
  cout << "  -u          - Print a summary of the solution." << endl;
  cout << "  -c <float>  - Use the 'connected' pnode finding algorithm " <<
445
      "<float>*100%" << endl << "                of the time." << endl;
446
  cout << "  -n          - Don't anneal - just do the prechecks." << endl;
447 448 449 450 451 452

  cout << "  -x <file>   - Specify a text ptop file" << endl;
#ifdef WITH_XML
  cout << "  -X <file>   - Specify a XML ptop file" << endl;
#endif
  cout << "  -y <file>   - Specify a text top file" << endl;
453
#ifdef WITH_XML
454
  cout << "  -Y <file>   - Specify a XML vtop file" << endl;
455
#endif
456 457 458
#ifdef WITH_XML
  cout << "  -q <file>   - Specify a rspec ptop file" << endl;
  cout << "  -w <file>   - Specify a rspec vtop file" << endl;
459
  cout << "  -W <file>   - Specify the output rspec file" << endl;
460
#endif
461 462 463 464 465
  cout << "  -F          - Apply additional checking to fixed nodes" << endl;
  cout << "  -D          - Dump configuration options" << endl;
  cout << "  cparams     - You probably don't want to touch these!" << endl;
  cout << "                If you must, see config.h in the source for a list"
       << endl;
466
  exit(EXIT_FATAL);
467 468 469 470 471
}
 
// Perfrom a pre-cehck to make sure that there are enough free nodes of the
// proper types. Returns 1 if the proper types exist, 0 if they do not.
// TODO - move away from using global variables
472
int type_precheck(int round) {
473
    cout << "Type precheck:" << endl;
474

475
    bool ok = true;
Mac Newbold's avatar
Mac Newbold committed
476

477 478 479 480 481 482 483 484 485 486 487
    /*
     * Tailor our error messages, depending on the round - the first round of
     * the precheck is looking for available pnodes, the second is looking for
     * sutiable nodes (ie. at least one vnode could map to it)
     */
    char *round_str;
    if (round == 1) {
        round_str = "available";
    } else {
        round_str = "suitable";
    }
488
    // First, check the regular types
489 490
    for (name_count_map::iterator vtype_it=vtypes.begin();
	    vtype_it != vtypes.end();++vtype_it) {
491

492
	// Check to see if there were any pnodes of the type at all
493
	tb_ptype_map::iterator ptype_it = ptypes.find(vtype_it->first);
494
	if (ptype_it == ptypes.end()) {
495
	    cout << "  *** No " << round_str << " physical nodes of type "
496 497
                << vtype_it->first << " found (" << vtype_it->second
                << " requested)" << endl;
498
	    ok = false;
499
	} else {
500
	    // Okay, there are some - are there enough?
501
	    if (ptype_it->second->pnode_slots() < vtype_it->second) {
502
		cout << "  *** " << vtype_it->second << " nodes of type " <<
503 504 505
                    vtype_it->first << " requested, but only " <<
                    ptype_it->second->pnode_slots() << " " << round_str <<
                    " nodes of type " << vtype_it->first<< " found" << endl;
506 507 508 509 510 511 512 513
		ok = false;
	    }
	    // Okay, there are enough - but are we allowed to use them?
	    if (ptype_it->second->maxusers() &&
		    (ptype_it->second->maxusers() < vtype_it->second)) {
		cout << "  *** " << vtype_it->second << " nodes of type " <<
		    vtype_it->first << " requested, but you are only " <<
		    "allowed to use " << ptype_it->second->maxusers() << endl;
514 515
		ok = false;
	    }
516
	}
517
    }
518 519 520 521

    // Check the vclasses, too
    for (name_list_map::iterator vclass_it = vclasses.begin();
	    vclass_it != vclasses.end(); ++vclass_it) {
522
	bool found_match = false;
523
        // Make sure we actually use this vclass
524
        name_vclass_map::iterator dit = vclass_map.find(vclass_it->first);
525 526 527 528 529 530 531 532 533 534 535
        if (dit == vclass_map.end()) {
            cout << "***: Internal error - unable to find vtype " <<
                vclass_it->first << endl;
            exit(EXIT_FATAL);
        } else {
            if (dit->second->empty()) {
                // Nobody uses it, don't check
                continue;
            }
        }

536
	for (vector<fstring>::iterator vtype_it = vclass_it->second.begin();
537
		vtype_it != vclass_it->second.end(); vtype_it++) {
538 539
	    tb_ptype_map::iterator mit = ptypes.find(*vtype_it);
	    if ((mit != ptypes.end()) && (mit->second->pnode_slots() != 0)) {
540 541 542 543 544 545
		found_match = true;
		break;
	    }
	}

	if (!found_match) {
546 547
	    cout << "  *** No " << round_str <<
                " physical nodes can satisfy vclass " << vclass_it->first << endl;
548 549 550 551
	    ok = false;
	}
    }

552
    if (ok) {
553
      cout << "Type precheck passed." << endl;
554 555
      return 1;
    } else {
556
      cout << "*** Type precheck failed!" << endl;
557 558 559
      return 0;
    }
}
560

561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
// Perfrom a pre-cehck to make sure that every vnode has at least one possible
// mapping.  Returns 1 if this is the case, 0 if not.
// TODO - move away from using global variables
int mapping_precheck() {
#ifdef PER_VNODE_TT
    cout << "Node mapping precheck:" << endl;
    /*
     * Build up an entry in the type table for each vnode, by first looking at
     * the type table entry for the vnode's type, then checking each entry to
     * make sure that it:
     * (1) Has enough interfaces
     * (2) Has enough total bandwidth (for emulated links)
     * (3) Meets any 1.0-weight features and/or desires
     */
    vvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(VG);
577

578 579 580 581
    /*
     * Indicates whether all nodes have potential matches or not
     */
    bool ok = true;
582

583 584
    for (;vit != vendit;vit++) {
	tb_vnode *v = get(vvertex_pmap,*vit);
585

586 587 588 589 590 591 592 593
	pclass_vector *vec = new pclass_vector();
	vnode_type_table[v->name] = tt_entry(0,vec);

	// This constitutes a list of the number of ptypes that matched the
	// criteria. We use to guess what's wrong with the vnode.
	int matched_bw = 0;
	// Keep track of desires had how many 'hits', so that we can tell
	// if any simply were not matched
594
	map<fstring,int> matched_desires;
595

596 597 598
	// Keep track of which link types had how many 'hits', so that we can
	// tell which type(s) caused this node to fail
	tb_vnode::link_counts_map matched_link_counts;
599 600
        hash_map<fstring,int> max_links;
        hash_map<fstring,int> desired_links;
601
	map<fstring,bool> matched_links;
602

603
	tb_vclass *vclass = v->vclass;
604
	tb_vclass::members_map::const_iterator mit;
605
	if (vclass) {
606
	    mit = vclass->get_members().begin();
607
	}
608 609 610
	for (;;) {
	    // Loop over all types this node can take on, which might be only
	    // one, if it's not part of a vclass
611
	    fstring this_type;
612 613 614 615 616
	    if (vclass) {
		this_type = mit->first;
	    } else {
		this_type = v->type;
	    }
617

618 619 620 621 622 623 624 625
            // Check to make sure there are actually nodes of this type in the
            // physical topology
            if (type_table.find(this_type) == type_table.end()) {
                // Yes, I know, goto is evil. But I'm not gonna indent the next
                // 100 lines of code for this error case
                goto nosuchtype;
            }

626 627
	    for (pclass_vector::iterator it = type_table[this_type].second->begin();
		    it != type_table[this_type].second->end(); it++) {
628

629 630
		bool potential_match = true;
		// Grab the first node of the pclass as a representative sample
631
	 	tb_pnode *pnode = *((*it)->members[this_type]->L.begin());
632 633 634

		// Check to see if any of the link that this pnode has are of
		// the correct type for the virtual node
Mac Newbold's avatar
Mac Newbold committed
635

636 637 638 639
		// Check bandwidth on emulated links
		if (pnode->total_bandwidth >= v->total_bandwidth) {
		    matched_bw++;
		} else {
640
			potential_match = false;
641
		}
Mac Newbold's avatar
Mac Newbold committed
642

643 644
		// Check to see if if the pnode has enough slots of the
		// appropriate type available
645 646 647
		tb_pnode::types_map::iterator type_iterator =
		    pnode->types.find(v->type);
		if (type_iterator == pnode->types.end()) {
648 649
		    // Must have been a vtype to get here - ignore it
		} else {
650
		    if (v->typecount > type_iterator->second->get_max_load()) {
651 652 653 654 655
			// Nope, this vnode is too demanding
			potential_match = false;
		    }
		}

656 657 658 659 660 661 662
		/*
		 * Check features and desires
		*/
		tb_featuredesire_set_iterator
		    fdit(v->desires.begin(),v->desires.end(),
			 pnode->features.begin(),pnode->features.end());
		for (;!fdit.done();fdit++) {
663
		    // Skip 'local' and 'global' features
664
		    if (fdit->is_global() || fdit->is_local()) {
665 666
			continue;
		    }
667 668 669
		    // Only check for FDs that would result in a violation if
		    // unmatched.
		    if (fdit.either_violateable()) {
670 671 672 673 674
			if (fdit.membership() !=
				tb_featuredesire_set_iterator::BOTH) {
			    potential_match = false;
			}

675 676
			// We look for violateable desires on vnodes so that we
			// can report them to the user
677 678 679 680 681 682 683 684 685
			if ((fdit.membership() ==
				tb_featuredesire_set_iterator::FIRST_ONLY ||
			    fdit.membership() ==
				 tb_featuredesire_set_iterator::BOTH)
				&& fdit.first_iterator()->is_violateable()) {
			    if (matched_desires.find(fdit->name()) ==
				    matched_desires.end()) {
				matched_desires[fdit->name()] = 0;
			    }
686 687 688 689
			}
			if (fdit.membership() ==
				tb_featuredesire_set_iterator::BOTH) {
			    matched_desires[fdit->name()]++;
690 691 692
			}
		    }
		}
693
		
694 695 696 697 698 699
		// Check link types - right now, we treat LANs specially, which
                // I am not happy about, but it seems to be necessary.
                // Otherwise, we can get a false negative when there are few
                // ports on a switch available, but we could map by using
                // the trunk links
                if (this_type != "lan") {
700 701 702 703 704 705
                  tb_vnode::link_counts_map::iterator link_it;
                  for (link_it = v->link_counts.begin();
		       link_it != v->link_counts.end();
                       link_it++) {
                    fstring type = link_it->first;
                    int count = link_it->second;
706
                    desired_links[type] = count;
707 708 709 710
                    if (pnode->link_counts.find(type) !=
                          pnode->link_counts.end()) {
                      // Found at least one link of this type
                      matched_links[type] = true;
711 712 713
                      if (pnode->link_counts[type] > max_links[type]) {
                        max_links[type] = pnode->link_counts[type];
                      }
714 715 716 717 718 719 720 721 722 723 724
                      if (pnode->link_counts[type] >= count) {
                        // Great, there are enough, too
                        matched_link_counts[type]++;
                      } else {
                        potential_match = false;
                      }
                    } else {
                      potential_match = false;
                    }
                  }
                }
Mac Newbold's avatar
Mac Newbold committed
725

726 727 728 729 730 731
		if (potential_match) {
		    vec->push_back(*it);
		    vnode_type_table[v->name].first++;
		    (*it)->refcount++;
#ifdef PCLASS_DEBUG
		    cerr << v->name << " can map to " << (*it)->name << endl;
732
#endif
733 734
		}
	    }
735

736
nosuchtype:
737 738
	    if (vclass) { 
		mit++;
739
		if (mit == vclass->get_members().end()) {
740 741 742 743 744 745
		    break;
		}
	    } else {
		// If not a vtype, we only had to do this once
		break;
	    }
746
	}
747

748
	if (vnode_type_table[v->name].first == 0) {
749
	    cout << "  *** No possible mapping for " << v->name << endl;
750
	    // Make an attempt to figure out why it didn't match
751 752 753 754 755
	    
	    // Check all of its link types
	    tb_vnode::link_counts_map::iterator lit;
	    for (lit = v->link_counts.begin(); lit != v->link_counts.end();
		lit++) {
756
	      fstring type = lit->first;
757
	      if (!matched_links[type]) {
758 759
		cout << "      No links of type " << type << " found! (" <<
                  desired_links[type] << " requested)" << endl;
760 761
	      } else {
		if (!matched_link_counts[type]) {
762 763 764
		  cout << "      Too many links of type " << type << "! (" <<
                    desired_links[type] << " requested, " << max_links[type] <<
                    " found)" << endl;
765 766
		}
	      }
767
	    }
768

769
	    if (!matched_bw) {
770
		cout << "      Too much bandwidth on emulated links!" << endl;
771
	    }
772

773
	    for (map<fstring,int>::iterator dit = matched_desires.begin();
774 775 776
		    dit != matched_desires.end();
		    dit++) {
		if (dit->second == 0) {
777
		    cout << "      No physical nodes have feature " << dit->first
778 779
			<< "!" << endl;
		}
780
	    }
781
	    ok = false;
782
	}
783 784 785
#ifdef PCLASS_DEBUG
	cerr << v->name << " can map to " << vnode_type_table[v->name].first << " pclasses"
	    << endl;
786
#endif
787

788
    }
789

790 791 792
    if (ok) {
	cout << "Node mapping precheck succeeded" << endl;
	return 1;
793
    } else {
794
	cout << "*** Node mapping precheck failed!" << endl;
795
	return 0;
796 797
    }

798 799 800
#else // PER_VNODE_TT
    // PER_VNODE_TT is required for this check, just pretend it's OK.
    return 1;
Robert Ricci's avatar
Robert Ricci committed
801
#endif
802
}
803

804 805 806 807 808 809 810 811 812 813 814 815 816 817
// Perfrom a pre-cehck to make sure that polices that are checkable at precheck
// time are not violated. Returns 1 if everything is A-OK, 0 otherwise
// TODO - move away from using global variables
int policy_precheck() {
  cout << "Policy precheck:" << endl;
  if (tb_featuredesire::check_desire_policies()) {
    cout << "Policy precheck succeeded" << endl;
    return 1;
  } else {
    cout << "*** Policy precheck failed!" << endl;
    return 0;
  }
}  

818 819 820
// Signal handler - add a convneint way to kill assign and make it return an
// unretryable error
void exit_unretryable(int signal) {
821
  cout << "*** Killed with signal " << signal << " - exiting!" << endl;
822 823 824 825 826 827 828 829 830
  _exit(EXIT_UNRETRYABLE);
}

// Singal handler - add a way for a user to get some status information
extern double temp;
void status_report(int signal) {
  cout << "I: " << iters << " T: " << temp << " S: " << get_score() << " V: "
    << violated << " (Best S: " << absbest << " V:" << absbestviolated << ")"
    << endl;
831
  cout.flush();
832 833
}

834 835 836 837
// From anneal.cc - the best solution found
extern solution best_solution;

int main(int argc,char **argv) {
838
  int seed = 0;
839
#ifdef GRAPHVIZ_SUPPORT
840
  fstring viz_prefix;
841
#endif
842
  bool scoring_selftest = false;
843
  bool prechecks_only = false;
844 845 846 847 848
  
  // Handle command line
  char ch;
  timelimit = 0.0;
  timetarget = 0.0;
849 850 851
  
  char* ptopFilename = "";
  char* vtopFilename = "";
852 853 854
  char* vtopOutputFilename = 0;

  while ((ch = getopt(argc,argv,"s:v:l:t:rpPTdH:oguc:nx:X:y:Y:q:w:W:FD")) != -1) {
855 856 857
    switch (ch) {
    case 's':
      if (sscanf(optarg,"%d",&seed) != 1) {
858
		print_help();
859
      }
860
      break;
861
#ifdef GRAPHVIZ_SUPPORT
862 863 864
    case 'v':
      viz_prefix = optarg;
      break;
865
#endif
866 867 868 869 870 871 872 873 874 875 876 877 878
#ifdef TIME_TERMINATE
    case 'l':
      if (sscanf(optarg,"%lf",&timelimit) != 1) {
	print_help();
      }
      break;
#endif
#ifdef TIME_TARGET
    case 't':
      if (sscanf(optarg,"%lf",&timetarget) != 1) {
	print_help();
      }
      break;
879
#endif
880 881 882
    case 'r':
      allow_trivial_links = false; break;
    case 'p':
883
      disable_pclasses = true; break;
Robert Ricci's avatar
Robert Ricci committed
884 885 886 887
#ifdef PER_VNODE_TT
    case 'P':
      prune_pclasses = true; break;
#endif
888 889
    case 'T':
      scoring_selftest = true; break;
890 891
    case 'd':
      dynamic_pclasses = true; break;
892 893 894 895 896
    case 'H':
      if (sscanf(optarg,"%lf",&scale_neighborhood) != 1) {
	print_help();
      }
      break;
897 898
    case 'o':
      allow_overload = true; break;
Robert Ricci's avatar
Robert Ricci committed
899 900
    case 'g':
      greedy_link_assignment = true; break;
901 902 903 904 905
    case 't':
      if (sscanf(optarg,"%lf",&initial_temperature) != 1) {
	print_help();
      }
      no_melting = true; break;
906 907 908 909 910 911 912
    case 'u':
      print_summary = true; break;
    case 'c':
      if (sscanf(optarg,"%lf",&use_connected_pnode_find) != 1) {
	print_help();
      }
      break;
913 914 915 916
    case 'n':
      prechecks_only = true;
      cout << "Doing only prechecks, exiting early" << endl;
      break;
917 918 919
    case 'D':
      dump_config = true;
      break;
920
    case 'x':
921 922 923 924 925 926 927
#ifdef WITH_XML
      ptop_xml_input = false;
#endif
      if (strcmp(optarg, "") == 0) {
      	print_help();
	  }
	  ptopFilename = optarg;
928
      break;
929 930 931 932 933 934 935 936 937 938 939 940
#ifdef WITH_XML      
    case 'X':
      ptop_xml_input = true;
      if (strcmp(optarg, "") == 0) {
      	print_help();
	  }
	  ptopFilename = optarg;
    break;
#endif
    case 'y':
#ifdef WITH_XML
      vtop_xml_input = false;
941
#endif
942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971
      if (strcmp(optarg, "") == 0) {
      	print_help();
	  }
	  vtopFilename = optarg;
    break;
#ifdef WITH_XML
    case 'Y':
      vtop_xml_input = true;
      if (strcmp(optarg, "") == 0) {
      	print_help();
	  }
	  vtopFilename = optarg;
    break;
#endif
#ifdef WITH_XML
	case 'q':
	  ptop_rspec_input = true;
	  if (strcmp(optarg, "") == 0) {
	  	print_help();
	  }
	  ptopFilename = optarg;
    break;

	case 'w':
	  vtop_rspec_input = true;
	  if (strcmp(optarg, "") == 0) {
	  	print_help();
	  }
	  vtopFilename = optarg;
    break;
972 973 974 975 976 977 978

	case 'W':
	  if (strcmp(optarg, "") == 0) {
	  	print_help();
	  }
	  vtopOutputFilename = optarg;
    break;
979 980 981 982 983
#endif
        case 'F':
          check_fixed_nodes = true;
    break;

984 985
    default:
      print_help();
986
    }
987
  }
988 989 990 991

  // Save argv and argc, and advance past the initial options
  char **oldargv = argv;
  int oldargc = argc;
992 993
  argc -= optind;
  argv += optind;
994 995 996 997 998 999 1000 1001 1002 1003 1004 1005

  if (strcmp(ptopFilename, "") == 0 && argc >= 1) {
      ptopFilename = argv[0];
      argc -= 1;
      argv += 1;
  }

  if (strcmp(vtopFilename, "") == 0 && argc >= 1) {
      vtopFilename = argv[0];
      argc -= 1;
      argv += 1;
  }
1006
  
1007
  if (argc > 0)
1008
  {
1009 1010 1011
      // If there are still more options, they must be from the common.h
      // parameters.
      parse_options(argv, options, noptions);
1012 1013 1014 1015 1016 1017 1018 1019
  }
  
  if (strcmp(ptopFilename, "") == 0)
	  print_help();
  	
  if (strcmp(vtopFilename, "") == 0)
	  print_help();	
  
1020 1021 1022 1023 1024 1025
  if (seed == 0) {
    if (getenv("ASSIGN_SEED") != NULL) {
      sscanf(getenv("ASSIGN_SEED"),"%d",&seed);
    } else {
      seed = time(NULL)+getpid();
    }
1026
  }
1027

1028
#ifdef GRAPHVIZ_SUPPORT
1029 1030 1031
  if (viz_prefix.size() == 0) {
    if (getenv("ASSIGN_GRAPHVIZ") != NULL) {
      viz_prefix = getenv("ASSIGN_GRAPHVIZ");
1032
    }
1033
  }
1034
#endif
Mac Newbold's avatar
Mac Newbold committed
1035

1036 1037 1038
//   if (argc == 0) {
//       print_help();
//   }
1039 1040 1041 1042 1043 1044 1045

  // Set up a signal handler for USR1 that exits with an unretryable error
  struct sigaction action;
  action.sa_handler = exit_unretryable;
  sigemptyset(&action.sa_mask);
  action.sa_flags = 0;
  sigaction(SIGUSR1,&action,NULL);
1046
  sigaction(SIGINT,&action,NULL);
1047

1048 1049 1050 1051 1052
  // Set up a signal handler for control+T
  struct sigaction action2;
  action2.sa_handler = status_report;
  sigemptyset(&action2.sa_mask);
  action2.sa_flags = 0;
1053
#ifdef __FreeBSD__
1054
  sigaction(SIGINFO,&action2,NULL);
1055 1056
#endif 
  
1057 1058 1059 1060 1061 1062 1063
#ifdef GNUPLOT_OUTPUT
  scoresout = fopen("scores.out","w");
  tempout = fopen("temp.out","w");
  deltaout = fopen("delta.out","w");
#endif

  cout << "seed = " << seed << endl;
1064
  srandom(seed);
1065

1066 1067 1068 1069 1070 1071 1072 1073 1074 1075
  // Print out information about how we were called
  if (dump_config) {
      cout << "Command line:";
      for (int i = 0; i < oldargc; i++) {
          cout << " " << oldargv[i];
      }
      cout << endl;
      dump_options("Config parameters", options, noptions);
  }

1076
  read_physical_topology(ptopFilename);
1077
  calculate_switch_MST();
1078

1079
  read_virtual_topology(vtopFilename);
1080 1081 1082

  // Time while we make pclasses and do the type prechecks
  timestart = used_time();
1083 1084
  
  cout << "Generating physical equivalence classes:";
1085
  generate_pclasses(PG,disable_pclasses,dynamic_pclasses);
1086
  cout << pclasses.size() << endl;
1087

1088 1089 1090
#ifdef PCLASS_DEBUG
  pclass_debug();
#endif
1091

1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113
#ifdef NODE_DUMP_DEBUG
  cerr << "========== Physical nodes" << endl;
  pvertex_iterator vit,vendit;
  tie(vit,vendit) = vertices(PG);
  for (;vit != vendit;++vit) {
      pvertex cur = *vit;
      tb_pnode *curP = get(pvertex_pmap,cur);
      cerr << *curP;
  }
  cerr << "========== End physical nodes" << endl;

  cerr << "========== Virtual nodes" << endl;
  vvertex_iterator vvit,vvendit;
  tie(vvit,vvendit) = vertices(VG);
  for (;vvit != vvendit;++vvit) {
      vvertex cur = *vvit;
      tb_vnode *curV = get(vvertex_pmap,cur);
      cerr << *curV;
  }
  cerr << "========== End virtual nodes" << endl;
#endif

1114 1115 1116 1117 1118 1119
  /*
   * There is a reason for the ordering of the prechecks. The mapping precheck
   * basically assumes that the type precheck has already run, so it doesn't
   * have to worry about nodes which cannot map due to type.
   */
  
1120
  // Run the type precheck
1121
  if (!type_precheck(1)) {
1122
      exit(EXIT_UNRETRYABLE);
1123
  }
1124

1125 1126
  // Run the mapping precheck
  if (!mapping_precheck()) {
1127
      exit(EXIT_UNRETRYABLE);
1128
  }
Robert Ricci's avatar
Robert Ricci committed
1129

1130
#ifdef PER_VNODE_TT
Robert Ricci's avatar
Robert Ricci committed
1131 1132
  if (prune_pclasses) {
      prune_unusable_pclasses();
1133 1134 1135 1136 1137 1138
      /*
       * Run the type precheck again, this time without the pclasses we just
       * pruned. Yes, it's a bit redundant, but for the reasons stated above,
       * we mave to run the type precheck before the mapping precheck. And,
       * the type precheck is very fast.
       */
1139
      if (!type_precheck(2)) {
1140 1141
          exit(EXIT_UNRETRYABLE);
      }
Robert Ricci's avatar
Robert Ricci committed
1142
  }
1143
#endif
1144 1145 1146 1147 1148 1149 1150
    
  // Run the policy precheck - the idea behind running this last is that some
  // policy violations might become more clear after doing pruning
    if (!policy_precheck()) {
	exit(EXIT_UNRETRYABLE);
    }
    
1151 1152 1153 1154 1155
  // Bomb out early if we're only doing the prechecks
  if (prechecks_only) {
      exit(EXIT_SUCCESS);
  }

1156
  // Output graphviz if necessary
1157
#ifdef GRAPHVIZ_SUPPORT
1158
  if (viz_prefix.size() != 0) {
1159 1160 1161
    fstring vviz = viz_prefix + "_virtual.viz";
    fstring pviz = viz_prefix + "_physical.viz";
    fstring sviz = viz_prefix + "_switch.viz";
1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
    ofstream vfile,pfile,sfile;
    vfile.open(vviz.c_str());
    write_graphviz(vfile,VG,vvertex_writer(),vedge_writer(),graph_writer());
    vfile.close();
    pfile.open(pviz.c_str());
    write_graphviz(pfile,PG,pvertex_writer(),pedge_writer(),graph_writer());
    pfile.close();
    sfile.open(sviz.c_str());
    write_graphviz(sfile,SG,svertex_writer(),sedge_writer(),graph_writer());
    sfile.close();
  }
1173
#endif
1174 1175 1176 1177 1178 1179 1180 1181 1182

  // Handle the initial temperature, if one was given - a NULL initial temp.
  // means that we should start with the normal melting procedure
  double *initial_temperature_pointer;
  if (no_melting) {
    initial_temperature_pointer = &initial_temperature;
  } else {
    initial_temperature_pointer = NULL;
  }
1183
 
1184
  // Note, time is started earlier now, up by where we make pclasses
1185 1186
  anneal(scoring_selftest, check_fixed_nodes, scale_neighborhood,
          initial_temperature_pointer, use_connected_pnode_find);
1187
  timeend = used_time();
1188

1189 1190 1191 1192 1193 1194
#ifdef GNUPLOT_OUTPUT
  fclose(scoresout);
  fclose(tempout);
  fclose(deltaout);
#endif

1195
  if ((!compare_scores(get_score(),absbest)) || (violated > absbestviolated)) {
1196
    cout << "WARNING: Internal scoring inconsistency." << endl;