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

7 8 9 10
#include "port.h"

#include <boost/config.hpp>
#include <boost/utility.hpp>
11
#include BOOST_PMAP_HEADER
12 13 14
#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>
22
#include <stdlib.h>
23
#include <math.h>
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;
33

34 35
#include <stdio.h>

36
#include "common.h"
37
#include "delay.h"
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

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

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

Robert Ricci's avatar
Robert Ricci committed
121 122 123
// 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;
124 125 126 127 128

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

// 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;
135

136 137 138
// Whether or not to perform all checks on fixed nodes
bool check_fixed_nodes = false;

139 140 141
// If true, dump a bunch of configrution information
bool dump_config = false;

142
// Use XML for file input
143 144 145 146 147 148
// 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;
149
#endif
150

151 152 153 154 155 156 157 158 159 160 161 162 163
/*
 * Score and violations for the best score found so far
 * XXX - shouldn't be in this file
 */
double best_score;
int best_violated;

/*
 * Number of iterations executed so far, and how many it took us to find the
 * best solution
 * XXX - shouldn't be in this file
 */
int iters, iters_to_best;
164

165 166 167
// Map of all physical types in use in the system
tb_ptype_map ptypes;

168 169 170
/*
 * Internal functions
 */
171

172
// Return the CPU time (in seconds) used by this process
173
float used_time() {
174 175 176 177 178 179
  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;
}

180 181 182 183 184 185 186 187 188 189 190 191
// 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);
}

192
// Read in the .ptop file
193
void read_physical_topology(char *filename) {
194 195
  ifstream ptopfile;
  ptopfile.open(filename);
196
  if (!ptopfile.is_open()) {
197
      cout << "*** Unable to open ptop file " << filename << endl;
198
      exit(EXIT_FATAL);
199
  }
200 201
  
#ifdef WITH_XML
202
  if (ptop_xml_input) {
203 204 205 206
	cout << "Physical Graph: " << parse_ptop_xml(PG,SG,filename) << endl;
  } 
  else if (ptop_rspec_input) {
	cout << "Physical Graph: " << parse_advertisement(PG, SG, filename) << endl;
207 208
	}
	else {
209 210 211
      cout << "Physical Graph: " << parse_ptop(PG,SG,ptopfile) << endl;
  }
#else
212
	cout << "Physical Graph: " << parse_ptop(PG,SG,ptopfile) << endl;
213
#endif
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235

#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;
    }
  }
236
#endif // DUMP_GRAPH
237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259

#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;
    }
  }
260
#endif // GRAPH_DEBUG
261

262 263
  // Set up pnode2vertex - a mapping between vertices in the physical graph and
  // the pnodes that we just read in from the ptop file
264 265 266 267 268 269 270 271
  pvertex_iterator pvit,pvendit;
  tie(pvit,pvendit) = vertices(PG);
  for (;pvit != pvendit;pvit++) {
    pnode2vertex[get(pvertex_pmap,*pvit)]=*pvit;
  }

}

272 273
// Calculate the minimum spanning tree for the switches - we only consider one
// potential path between each pair of switches.
274
// XXX: Should soon be replaced by calculate_shortest_routes()
275
void calculate_switch_MST() {
276
  cout << "Calculating shortest paths on switch fabric." << endl;
277 278

  // Set up the weight map for Dijkstra's
279 280 281 282 283 284 285 286 287 288
  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);
  }
289

290
  // Let boost do the Disjktra's for us, from each switch
291 292 293 294 295 296 297 298
  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])));
299 300
  }

301 302 303 304 305 306 307 308 309
#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;
    }
  }
310
#endif // GRAPH_DEBUG
311 312
}

313
// Read in the .top file
314
void read_virtual_topology(char *filename) {
315 316
  ifstream topfile;
  topfile.open(filename);
317
  if (!topfile.is_open()) {
318
      cout << "*** Unable to open top file " << filename << endl;
319
      exit(EXIT_FATAL);
320
  }
321
  
322 323 324 325 326
#ifdef WITH_XML  
  if (vtop_xml_input) {
	cout << "Virtual Graph: " << parse_vtop_xml(VG,filename) << endl;
  }
  else if (vtop_rspec_input){
327
  	  cout << "Virtual Graph: " << parse_request (VG, filename) << endl;
328 329
  }
  else {
330 331 332
      cout << "Virtual Graph: " << parse_top(VG,topfile) << endl;
  }
#else
333
	cout << "Virtual Graph: " << parse_top(VG,topfile) << endl;
334
#endif
335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359

#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
}
360 361 362 363 364 365 366 367 368 369
/*
 * 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) {
370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387
            /*
             * 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
388 389 390
                 * we will never use this particular node.
                 * Note: We only have to do this for pclasses that are "real",
                 * not dynamic ones.
391
                 */
392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413
                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++;
                    }
414 415 416 417
                }
                ptype_iterator++;
            }

418 419 420 421 422 423
	    pclass_list::iterator nukeme = pclass_iterator;
	    pclass_iterator++;
#ifdef PCLASS_DEBUG
	    cout << "Pruning " << (*nukeme)->name << endl;
#endif
	    pruned++;
424

425 426 427 428 429 430 431 432 433 434
	    delete *nukeme;
	    pclasses.erase(nukeme);
	} else {
	    pclass_iterator++;
	}
    }
    cout << "pclass pruning complete: removed " << pruned << " pclasses, " <<
	pclasses.size() << " remain." << endl;
}

435
void print_help() {
436
  cout << "assign [options] ptopfile topfile [cparams]" << endl;
437
  cout << "Options: " << endl;
438
#ifdef TIME_TERMINATE
439
  cout << "  -l <time>   - Limit runtime." << endl;
440
#endif
441
  cout << "  -s <seed>   - Set the seed." << endl;
442
#ifdef GRAPHVIZ_SUPPORT
443
  cout << "  -v <viz>    - Produce graphviz files with given prefix." <<
444
    endl;
445
#endif
446 447 448
  cout << "  -r          - Don't allow trivial links." << endl;
  cout << "  -p          - Disable pclasses." << endl;
  cout << "  -d          - Enable dynamic pclasses." << endl;
449
#ifdef PER_VNODE_TT
450
  cout << "  -P          - Prune unusable pclasses." << endl;
451
#endif
452 453 454
  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;
455 456
  cout << "  -t <float>  - Start the temperature at <float> instead of melting."
      << endl;
457 458
  cout << "  -u           - Print a summary of the solution." << endl;
  cout << "  -c <float>   - Use the 'connected' pnode finding algorithm ";
459 460
  cout <<                   "<float>*100%" << endl;
  cout << "                 of the time." << endl;
461 462 463 464
  cout << "  -n           - Don't anneal - just do the prechecks." << endl;

  cout << "  -x <file>    - Specify a text ptop file" << endl;
  cout << "  -y <file>    - Specify a text top file" << endl;
465
#ifdef WITH_XML
466
  cout << "  -W <file>    - Specify the output rspec file" << endl;
467 468 469
  cout << "  -f <T>[/<T>] - Specify the ptop/vtop file formats " << endl;
  cout << "                 T should be one of (text|xml|rspec)" << endl;
  cout << "                 Specifying only one T is equivalent to -f T/T"<<endl;
470
#endif
471 472
  cout << "  -F          - Apply additional checking to fixed nodes" << endl;
  cout << "  -D          - Dump configuration options" << endl;
Robert Ricci's avatar
Robert Ricci committed
473
  cout << "  -R          - Randomize order of nodes in pclasses" << endl;
474 475 476
  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;
477
  exit(EXIT_FATAL);
478 479 480 481 482
}
 
// 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
483
int type_precheck(int round) {
484
    cout << "Type precheck:" << endl;
485

486
    bool ok = true;
487

488 489 490 491 492 493 494 495 496 497 498
    /*
     * 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";
    }
499
    // First, check the regular types
500 501
    for (name_count_map::iterator vtype_it=vtypes.begin();
	    vtype_it != vtypes.end();++vtype_it) {
502

503
	// Check to see if there were any pnodes of the type at all
504
	tb_ptype_map::iterator ptype_it = ptypes.find(vtype_it->first);
505
	if (ptype_it == ptypes.end()) {
506
	    cout << "  *** No " << round_str << " physical nodes of type "
507 508
                << vtype_it->first << " found (" << vtype_it->second
                << " requested)" << endl;
509
	    ok = false;
510
	} else {
511
	    // Okay, there are some - are there enough?
512
	    if (ptype_it->second->pnode_slots() < vtype_it->second) {
513
		cout << "  *** " << vtype_it->second << " nodes of type " <<
514 515 516
                    vtype_it->first << " requested, but only " <<
                    ptype_it->second->pnode_slots() << " " << round_str <<
                    " nodes of type " << vtype_it->first<< " found" << endl;
517 518 519 520 521 522 523 524
		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;
525 526
		ok = false;
	    }
527
	}
528
    }
529 530 531 532

    // Check the vclasses, too
    for (name_list_map::iterator vclass_it = vclasses.begin();
	    vclass_it != vclasses.end(); ++vclass_it) {
533
	bool found_match = false;
534
        // Make sure we actually use this vclass
535
        name_vclass_map::iterator dit = vclass_map.find(vclass_it->first);
536 537 538 539 540 541 542 543 544 545 546
        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;
            }
        }

547
	for (vector<fstring>::iterator vtype_it = vclass_it->second.begin();
548
		vtype_it != vclass_it->second.end(); vtype_it++) {
549 550
	    tb_ptype_map::iterator mit = ptypes.find(*vtype_it);
	    if ((mit != ptypes.end()) && (mit->second->pnode_slots() != 0)) {
551 552 553 554 555 556
		found_match = true;
		break;
	    }
	}

	if (!found_match) {
557 558
	    cout << "  *** No " << round_str <<
                " physical nodes can satisfy vclass " << vclass_it->first << endl;
559 560 561 562
	    ok = false;
	}
    }

563
    if (ok) {
564
      cout << "Type precheck passed." << endl;
565 566
      return 1;
    } else {
567
      cout << "*** Type precheck failed!" << endl;
568 569 570
      return 0;
    }
}
571

572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587
// 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);
588

589 590 591 592
    /*
     * Indicates whether all nodes have potential matches or not
     */
    bool ok = true;
593

594 595
    for (;vit != vendit;vit++) {
	tb_vnode *v = get(vvertex_pmap,*vit);
596

597 598 599
	pclass_vector *vec = new pclass_vector();
	vnode_type_table[v->name] = tt_entry(0,vec);

600 601 602 603
	// Remember if there are no nodes of the requested type in the physical
	// topology. Without this diagnostic, our "guess what's wrong with
	// the vnode" code concludes that there was not enough bandwidth.
	bool matched_node_type = true;
604 605 606 607 608
	// 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
609
	map<fstring,int> matched_desires;
610

611 612 613
	// 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;
614 615
        hash_map<fstring,int> max_links;
        hash_map<fstring,int> desired_links;
616
	map<fstring,bool> matched_links;
617

618
	tb_vclass *vclass = v->vclass;
619
	tb_vclass::members_map::const_iterator mit;
620
	if (vclass) {
621
	    mit = vclass->get_members().begin();
622
	}
623 624 625
	for (;;) {
	    // Loop over all types this node can take on, which might be only
	    // one, if it's not part of a vclass
626
	    fstring this_type;
627 628 629 630 631
	    if (vclass) {
		this_type = mit->first;
	    } else {
		this_type = v->type;
	    }
632

633 634 635
            // Check to make sure there are actually nodes of this type in the
            // physical topology
            if (type_table.find(this_type) == type_table.end()) {
636
                matched_node_type = false;
637 638 639 640 641
                // Yes, I know, goto is evil. But I'm not gonna indent the next
                // 100 lines of code for this error case
                goto nosuchtype;
            }

642 643
	    for (pclass_vector::iterator it = type_table[this_type].second->begin();
		    it != type_table[this_type].second->end(); it++) {
644

645 646
		bool potential_match = true;
		// Grab the first node of the pclass as a representative sample
647
	 	tb_pnode *pnode = *((*it)->members[this_type]->L.begin());
648 649 650

		// Check to see if any of the link that this pnode has are of
		// the correct type for the virtual node
651

652 653 654 655
		// Check bandwidth on emulated links
		if (pnode->total_bandwidth >= v->total_bandwidth) {
		    matched_bw++;
		} else {
656
			potential_match = false;
657
		}
658

659 660
		// Check to see if if the pnode has enough slots of the
		// appropriate type available
661 662 663
		tb_pnode::types_map::iterator type_iterator =
		    pnode->types.find(v->type);
		if (type_iterator == pnode->types.end()) {
664 665
		    // Must have been a vtype to get here - ignore it
		} else {
666
		    if (v->typecount > type_iterator->second->get_max_load()) {
667 668 669 670 671
			// Nope, this vnode is too demanding
			potential_match = false;
		    }
		}

672 673 674 675 676 677 678
		/*
		 * 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++) {
679
		    // Skip 'local' and 'global' features
680
		    if (fdit->is_global() || fdit->is_local()) {
681 682
			continue;
		    }
683 684 685
		    // Only check for FDs that would result in a violation if
		    // unmatched.
		    if (fdit.either_violateable()) {
686 687 688 689 690
			if (fdit.membership() !=
				tb_featuredesire_set_iterator::BOTH) {
			    potential_match = false;
			}

691 692
			// We look for violateable desires on vnodes so that we
			// can report them to the user
693 694 695 696 697 698 699 700 701
			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;
			    }
702 703 704 705
			}
			if (fdit.membership() ==
				tb_featuredesire_set_iterator::BOTH) {
			    matched_desires[fdit->name()]++;
706 707 708
			}
		    }
		}
709
		
710 711 712 713 714 715
		// 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") {
716 717 718 719 720 721
                  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;
722
                    desired_links[type] = count;
723 724 725 726
                    if (pnode->link_counts.find(type) !=
                          pnode->link_counts.end()) {
                      // Found at least one link of this type
                      matched_links[type] = true;
727 728 729
                      if (pnode->link_counts[type] > max_links[type]) {
                        max_links[type] = pnode->link_counts[type];
                      }
730 731 732 733 734 735 736 737 738 739 740
                      if (pnode->link_counts[type] >= count) {
                        // Great, there are enough, too
                        matched_link_counts[type]++;
                      } else {
                        potential_match = false;
                      }
                    } else {
                      potential_match = false;
                    }
                  }
                }
741

742 743 744 745 746 747
		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;
748
#endif
749 750
		}
	    }
751

752
nosuchtype:
753 754
	    if (vclass) { 
		mit++;
755
		if (mit == vclass->get_members().end()) {
756 757 758 759 760 761
		    break;
		}
	    } else {
		// If not a vtype, we only had to do this once
		break;
	    }
762
	}
763

764
	if (vnode_type_table[v->name].first == 0) {
765
	    cout << "  *** No possible mapping for " << v->name << endl;
766
	    // Make an attempt to figure out why it didn't match
767 768 769 770 771
	    
	    // 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++) {
772
	      fstring type = lit->first;
773
	      if (!matched_links[type]) {
774 775
		cout << "      No links of type " << type << " found! (" <<
                  desired_links[type] << " requested)" << endl;
776 777
	      } else {
		if (!matched_link_counts[type]) {
778 779 780
		  cout << "      Too many links of type " << type << "! (" <<
                    desired_links[type] << " requested, " << max_links[type] <<
                    " found)" << endl;
781 782
		}
	      }
783
	    }
784

785 786 787 788
	    if (!matched_node_type) {
		cout << "      No physical nodes of requested type '"
		     << v->type << "'!\n";
	    } else if (!matched_bw) {
789
		cout << "      Too much bandwidth on emulated links!" << endl;
790
	    }
791

792
	    for (map<fstring,int>::iterator dit = matched_desires.begin();
793 794 795
		    dit != matched_desires.end();
		    dit++) {
		if (dit->second == 0) {
796
		    cout << "      No physical nodes have feature " << dit->first
797 798
			<< "!" << endl;
		}
799
	    }
800
	    ok = false;
801
	}
802 803 804
#ifdef PCLASS_DEBUG
	cerr << v->name << " can map to " << vnode_type_table[v->name].first << " pclasses"
	    << endl;
805
#endif
806

807
    }
808

809 810 811
    if (ok) {
	cout << "Node mapping precheck succeeded" << endl;
	return 1;
812
    } else {
813
	cout << "*** Node mapping precheck failed!" << endl;
814
	return 0;
815 816
    }

817 818 819
#else // PER_VNODE_TT
    // PER_VNODE_TT is required for this check, just pretend it's OK.
    return 1;
820
#endif
821
}
822

823 824 825 826 827 828 829 830 831 832 833 834 835 836
// 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;
  }
}  

837 838 839
// Signal handler - add a convneint way to kill assign and make it return an
// unretryable error
void exit_unretryable(int signal) {
840
  cout << "*** Killed with signal " << signal << " - exiting!" << endl;
841 842 843 844 845 846 847
  _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: "
848
    << violated << " (Best S: " << best_score << " V:" << best_violated << ")"
849
    << endl;
850
  cout.flush();
851 852
}

853 854 855 856
// From anneal.cc - the best solution found
extern solution best_solution;

int main(int argc,char **argv) {
857
  int seed = 0;
858
#ifdef GRAPHVIZ_SUPPORT
859
  fstring viz_prefix;
860
#endif
861
  bool scoring_selftest = false;
862
  bool prechecks_only = false;
863 864 865 866 867
  
  // Handle command line
  char ch;
  timelimit = 0.0;
  timetarget = 0.0;
868 869 870
  
  char* ptopFilename = "";
  char* vtopFilename = "";
871 872
  char* vtopOutputFilename = 0;

873 874 875 876
#ifdef WITH_XML
	char* ptopFileFormat;
	char* vtopFileFormat;
	char* delims = "/";
Robert Ricci's avatar
Robert Ricci committed
877
	char* flags = "s:v:l:t:rpPTdH:oguc:nx:y:W:FDf:R";
878
#else
Robert Ricci's avatar
Robert Ricci committed
879
	char* flags = "s:v:l:t:rpPTdH:oguc:nx:y:FDR";
880 881 882
#endif	
	
  while ((ch = getopt(argc,argv,flags)) != -1) {
883 884 885
    switch (ch) {
    case 's':
      if (sscanf(optarg,"%d",&seed) != 1) {
886
		print_help();
887
      }
888
      break;
889
#ifdef GRAPHVIZ_SUPPORT
890 891 892
    case 'v':
      viz_prefix = optarg;
      break;
893
#endif
894 895 896 897 898 899 900 901 902 903 904 905 906
#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;
907
#endif
908 909 910
    case 'r':
      allow_trivial_links = false; break;
    case 'p':
911
      disable_pclasses = true; break;
912 913 914 915
#ifdef PER_VNODE_TT
    case 'P':
      prune_pclasses = true; break;
#endif
916 917
    case 'T':
      scoring_selftest = true; break;
918 919
    case 'd':
      dynamic_pclasses = true; break;
920 921 922 923 924
    case 'H':
      if (sscanf(optarg,"%lf",&scale_neighborhood) != 1) {
	print_help();
      }
      break;
925 926
    case 'o':
      allow_overload = true; break;
Robert Ricci's avatar
Robert Ricci committed
927 928
    case 'g':
      greedy_link_assignment = true; break;
929 930 931 932 933
    case 't':
      if (sscanf(optarg,"%lf",&initial_temperature) != 1) {
	print_help();
      }
      no_melting = true; break;
934 935 936 937 938 939 940
    case 'u':
      print_summary = true; break;
    case 'c':
      if (sscanf(optarg,"%lf",&use_connected_pnode_find) != 1) {
	print_help();
      }
      break;
941 942 943 944
    case 'n':
      prechecks_only = true;
      cout << "Doing only prechecks, exiting early" << endl;
      break;
945 946 947
    case 'D':
      dump_config = true;
      break;
948
    case 'x':
949 950 951 952 953 954 955
#ifdef WITH_XML
      ptop_xml_input = false;
#endif
      if (strcmp(optarg, "") == 0) {
      	print_help();
	  }
	  ptopFilename = optarg;
956
      break;
957 958
    
		case 'y':
959 960
#ifdef WITH_XML
      vtop_xml_input = false;
961
#endif
962 963 964 965 966
      if (strcmp(optarg, "") == 0) {
      	print_help();
	  }
	  vtopFilename = optarg;
    break;
967
	  case 'F':
968 969 970 971 972
          check_fixed_nodes = true;
    break;

#ifdef WITH_XML

973 974 975 976 977
    case 'W':
    if (strcmp(optarg, "") == 0) {
      print_help();
    }
    vtopOutputFilename = optarg;
978
    break;
979

980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021
	case 'f':
		if (strcmp(optarg, "") == 0) {
			print_help();
		}
		
		ptopFileFormat = strtok(optarg, delims);
		vtopFileFormat = strtok(NULL, delims);
		if (strcmp(ptopFileFormat, "text") == 0) {
			ptop_xml_input = false;
		}
		else if (strstr(ptopFileFormat, "rspec") != NULL) {
			ptop_rspec_input = true;
		}
		else if (strstr(ptopFileFormat, "xml") != NULL){
			ptop_xml_input = true;
		}
		else {
			print_help();
		}
		
		if (vtopFileFormat == NULL)
		{
			vtop_xml_input = ptop_xml_input;
			vtop_rspec_input = ptop_rspec_input;
		}
		else 
		{
			if (strcmp(vtopFileFormat, "text") == 0) {
				vtop_xml_input = false;
			}
			else if (strstr(vtopFileFormat, "rspec") != NULL) {
				vtop_rspec_input = true;
			}
			else if (strstr(vtopFileFormat, "xml") != NULL){
				vtop_xml_input = true;
			}
			else {
				print_help();
			}
		}
		
		break;
1022
#endif
Robert Ricci's avatar
Robert Ricci committed
1023 1024 1025
	case 'R':
	  randomize_order = true;
	  break;
1026 1027
		
	default:
1028
      print_help();
1029
    }
1030
  }
1031 1032 1033 1034

  // Save argv and argc, and advance past the initial options
  char **oldargv = argv;
  int oldargc = argc;
1035 1036
  argc -= optind;
  argv += optind;
1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048

  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;
  }
1049
  
1050
  if (argc > 0)
1051
  {
1052 1053 1054
      // If there are still more options, they must be from the common.h
      // parameters.
      parse_options(argv, options, noptions);
1055 1056 1057 1058 1059 1060 1061 1062
  }
  
  if (strcmp(ptopFilename, "") == 0)
	  print_help();
  	
  if (strcmp(vtopFilename, "") == 0)
	  print_help();	
  
1063 1064 1065 1066 1067 1068
  if (seed == 0) {
    if (getenv("ASSIGN_SEED") != NULL) {
      sscanf(getenv("ASSIGN_SEED"),"%d",&seed);
    } else {
      seed = time(NULL)+getpid();
    }
1069
  }
1070

1071
#ifdef GRAPHVIZ_SUPPORT
1072 1073 1074
  if (viz_prefix.size() == 0) {
    if (getenv("ASSIGN_GRAPHVIZ") != NULL) {
      viz_prefix = getenv("ASSIGN_GRAPHVIZ");
1075
    }
1076
  }
1077
#endif
1078

1079 1080 1081
//   if (argc == 0) {
//       print_help();
//   }
1082 1083 1084 1085 1086 1087 1088

  // 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);
1089
  sigaction(SIGINT,&action,NULL);
1090

1091 1092 1093 1094 1095
  // Set up a signal handler for control+T
  struct sigaction action2;
  action2.sa_handler = status_report;
  sigemptyset(&action2.sa_mask);
  action2.sa_flags = 0;
1096
#ifdef __FreeBSD__
1097
  sigaction(SIGINFO,&action2,NULL);
1098 1099
#endif 
  
1100 1101 1102 1103 1104 1105 1106
#ifdef GNUPLOT_OUTPUT
  scoresout = fopen("scores.out","w");
  tempout = fopen("temp.out","w");
  deltaout = fopen("delta.out","w");
#endif

  cout << "seed = " << seed << endl;
1107
  srandom(seed);
1108

1109 1110 1111 1112 1113 1114 1115 1116 1117 1118
  // 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);
  }

1119
  read_physical_topology(ptopFilename);
1120
  calculate_switch_MST();
1121

1122
  read_virtual_topology(vtopFilename);
1123 1124 1125

  // Time while we make pclasses and do the type prechecks
  timestart = used_time();
1126 1127
  
  cout << "Generating physical equivalence classes:";
Robert Ricci's avatar
Robert Ricci committed
1128
  generate_pclasses(PG,disable_pclasses,dynamic_pclasses,randomize_order);
1129
  cout << pclasses.size() << endl;
1130

1131 1132 1133
#ifdef PCLASS_DEBUG
  pclass_debug();
#endif
1134

1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156
#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

1157 1158 1159 1160 1161 1162
  /*
   * 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.
   */
  
1163
  // Run the type precheck
1164
  if (!type_precheck(1)) {
1165
      exit(EXIT_UNRETRYABLE);
1166
  }
1167

1168 1169
  // Run the mapping precheck
  if (!mapping_precheck()) {
1170
      exit(EXIT_UNRETRYABLE);
1171
  }
1172

1173
#ifdef PER_VNODE_TT
1174 1175
  if (prune_pclasses) {
      prune_unusable_pclasses();
1176 1177 1178 1179 1180 1181
      /*
       * 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.
       */
1182
      if (!type_precheck(2)) {
1183 1184
          exit(EXIT_UNRETRYABLE);
      }
1185
  }
1186
#endif
1187 1188 1189 1190 1191 1192 1193
    
  // 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);
    }
    
1194 1195 1196 1197 1198
  // Bomb out early if we're only doing the prechecks
  if (prechecks_only) {
      exit(EXIT_SUCCESS);
  }

1199
  // Output graphviz if necessary
1200
#ifdef GRAPHVIZ_SUPPORT
1201
  if (viz_prefix.size() != 0) {
1202 1203 1204
    fstring vviz = viz_prefix + "_virtual.viz";
    fstring pviz = viz_prefix + "_physical.viz";
    fstring sviz = viz_prefix + "_switch.viz";
1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215
    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();
  }
1216
#endif
1217 1218 1219 1220 1221 1222 1223 1224 1225

  // 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;
  }
1226
 
1227
  // Note, time is started earlier now, up by where we make pclasses
1228 1229
  anneal(scoring_selftest, check_fixed_nodes, scale_neighborhood,
          initial_temperature_pointer, use_connected_pnode_find);
1230
  timeend = used_time();
1231

1232 1233 1234 1235 1236 1237
#ifdef GNUPLOT_OUTPUT
  fclose(scoresout);
  fclose(tempout);
  fclose(deltaout);
#endif

1238
  if ((!compare_scores(get_score(),best_score)) || (violated > best_violated)) {
1239
    cout << "WARNING: Internal scoring inconsistency." << endl;
1240 1241 1242
    cout << "score:" << get_score() << " best_score:" << best_score <<
      " violated:" << violated << " best_violated:" <<
      best_violated << endl;
1243
  }
1244
  
1245
  cout << "   BEST SCORE:  " << get_score() << " in " << iters <<
1246 1247 1248 1249
    " iters and " << timeend-timestart << " seconds" << endl;
  cout << "With " << violated << " violations" << endl;
  cout << "Iters to find best score:  " << iters_to_best << endl;
  cout << "Violations: " << violated << endl;
1250
  cout << vinfo;
1251

1252 1253 1254
#ifdef WITH_XML
  if (vtop_rspec_input || vtop_xml_input)
  {
1255 1256 1257
      // For now, only produce annotated file if we succeeded - print the
      // text version regardless
      if (violated == 0) {
1258
	  print_solution(best_solution, vtopOutputFilename ? vtopOutputFilename : annotated_filename(vtopFilename).c_str());
1259 1260 1261
      } else {
	  print_solution(best_solution);
      }
1262 1263 1264 1265
  }
  else
	  print_solution(best_solution);
#else
1266
  print_solution(best_solution);
1267
#endif
1268

1269
  if (print_summary) {
1270
    print_solution_summary(best_solution);
1271 1272
  }

1273
#ifdef GRAPHVIZ_SUPPORT
1274
  if (viz_prefix.size() != 0) {
1275
    fstring aviz = viz_prefix + "_solution.viz";
1276 1277 1278 1279 1280 1281
    ofstream afile;
    afile.open(aviz.c_str());
    write_graphviz(afile,VG,solution_vertex_writer(),
		   solution_edge_writer(),graph_writer());
    afile.close();
  }
1282
#endif
1283
  
Robert Ricci's avatar
Robert Ricci committed
1284
  if (violated != 0) {
1285
      exit(EXIT_RETRYABLE);
1286
  } else {
1287
      exit(EXIT_SUCCESS);
1288
  }
1289
}