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

7
static const char rcsid[] = "$Id: score.cc,v 1.67 2009-05-20 18:06:08 tarunp Exp $";
8

9
#include "port.h"
10

11
#include <iostream>
12 13
#include <float.h>

14 15 16 17
/*
 * We have to do these includes differently depending on which version of gcc
 * we're compiling with
 */
18
#ifdef NEW_GCC
19 20 21 22
#include <ext/hash_map>
#include <ext/hash_set>
using namespace __gnu_cxx;
#else
23 24
#include <hash_map>
#include <hash_set>
25
#endif
26 27 28 29 30 31 32 33

#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>

using namespace boost;
Mac Newbold's avatar
Mac Newbold committed
34 35

#include "common.h"
36
#include "vclass.h"
37
#include "delay.h"
38
#include "physical.h"
39
#include "virtual.h"
40 41
#include "pclass.h"
#include "score.h"
42
#include "featuredesire.h"
43

44
#include "math.h"
Mac Newbold's avatar
Mac Newbold committed
45

46
extern switch_pred_map_map switch_preds;
47

48
extern bool disable_pclasses;
49

50
double score;			// The score of the current mapping
Mac Newbold's avatar
Mac Newbold committed
51 52 53 54 55
int violated;			// How many times the restrictions
				// have been violated.

violated_info vinfo;		// specific info on violations

56
extern tb_vgraph VG;		// virtual graph
Mac Newbold's avatar
Mac Newbold committed
57
extern tb_pgraph PG;		// physical grpaph
58
extern tb_sgraph SG;		// switch fabric
Mac Newbold's avatar
Mac Newbold committed
59

60 61
void score_link(pedge pe,vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode);
void unscore_link(pedge pe,vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode);
62
bool find_best_link(pvertex pv,pvertex switch_pv,tb_vlink *vlink,
63
                    pedge &out_edge);
64 65 66
int find_interswitch_path(pvertex src_pv,pvertex dest_pv,
			  int bandwidth,pedge_path &out_path,
			  pvertex_list &out_switches);
67 68
score_and_violations score_fds(tb_vnode *vnode, tb_pnode *pnode, bool add);

69 70 71 72
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode,
	tb_vnode *src_vnode, tb_vnode *dst_vnode);
void unscore_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode,
	tb_vnode *src_vnode, tb_vnode *dst_vnode);
73 74 75 76

#ifdef FIX_PLINK_ENDPOINTS
void score_link_endpoints(pedge pe);
#endif
Mac Newbold's avatar
Mac Newbold committed
77 78

#ifdef SCORE_DEBUG_MORE
79 80
#define SADD(amount) cerr << "SADD: " << #amount << "=" << amount << " from " << score;score+=amount;cerr << " to " << score << endl
#define SSUB(amount)  cerr << "SSUB: " << #amount << "=" << amount << " from " << score;score-=amount;cerr << " to " << score << endl
Mac Newbold's avatar
Mac Newbold committed
81 82 83 84 85
#else
#define SADD(amount) score += amount
#define SSUB(amount) score -= amount
#endif

86 87 88 89
// For convenience, so we can easily turn on or off one statement
#define SDEBADD(amount) cerr << "SADD: " << #amount << "=" << amount << " from " << score;score+=amount;cerr << " to " << score << endl
#define SDEBSUB(amount)  cerr << "SSUB: " << #amount << "=" << amount << " from " << score;score-=amount;cerr << " to " << score << endl

90 91 92
#ifdef SCORE_DEBUG
#define SDEBUG(a) a
#else
Robert Ricci's avatar
Robert Ricci committed
93
#define SDEBUG(a) 
94 95
#endif

96 97 98
#define MIN(a,b) (((a) < (b))? (a) : (b))
#define MAX(a,b) (((a) > (b))? (a) : (b))

99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
/*
 * 'Constants' used in scoring. These can be changed, but it MUST be
 * done BEFORE any actual scoring is done.
 */
#ifdef PENALIZE_BANDWIDTH
float SCORE_DIRECT_LINK = 0.0;
float SCORE_INTRASWITCH_LINK = 0.0;
float SCORE_INTERSWITCH_LINK = 0.0;
#else
float SCORE_DIRECT_LINK = 0.01;
float SCORE_INTRASWITCH_LINK = 0.02;
float SCORE_INTERSWITCH_LINK = 0.2;
#endif
float SCORE_DIRECT_LINK_PENALTY = 0.5;
float SCORE_NO_CONNECTION = 0.5;
float SCORE_PNODE = 0.2;
float SCORE_PNODE_PENALTY = 0.5;
float SCORE_SWITCH = 0.5;
float SCORE_UNASSIGNED = 1.0;
float SCORE_MISSING_LOCAL_FEATURE = 1.0;
float SCORE_OVERUSED_LOCAL_FEATURE = 0.5;
#ifdef NO_PCLASS_PENALTY
float SCORE_PCLASS = 0.0;
#else
float SCORE_PCLASS = 0.5;
#endif
float SCORE_VCLASS = 1.0;
float SCORE_EMULATED_LINK = 0.01;
float SCORE_OUTSIDE_DELAY = 0.5;
#ifdef PENALIZE_UNUSED_INTERFACES
float SCORE_UNUSED_INTERFACE = 0.04;
#endif
float SCORE_TRIVIAL_PENALTY = 0.5;

float SCORE_TRIVIAL_MIX = 0.5;

float SCORE_SUBNODE = 0.5;
float SCORE_MAX_TYPES = 0.15;
float LINK_RESOLVE_TRIVIAL = 8.0;
float LINK_RESOLVE_DIRECT = 4.0;
float LINK_RESOLVE_INTRASWITCH = 2.0;
float LINK_RESOLVE_INTERSWITCH = 1.0;
float VIOLATION_SCORE = 1.0;

float opt_nodes_per_sw = 5.0;

Mac Newbold's avatar
Mac Newbold committed
145 146 147 148
/*
 * score()
 * Returns the score.
 */
149
double get_score() {return score;}
Mac Newbold's avatar
Mac Newbold committed
150 151 152 153 154 155 156 157

/*
 * init_score()
 * This initialized the scoring system.  It also clears all
 * assignments.
 */
void init_score()
{
158
  SDEBUG(cerr << "SCORE: Initializing" << endl);
Mac Newbold's avatar
Mac Newbold committed
159 160 161
  score=0;
  violated=0;

162 163 164 165 166
  vvertex_iterator vvertex_it,end_vvertex_it;
  tie(vvertex_it,end_vvertex_it) = vertices(VG);
  for (;vvertex_it!=end_vvertex_it;++vvertex_it) {
    tb_vnode *vnode=get(vvertex_pmap,*vvertex_it);
    vnode->assigned = false;
Mac Newbold's avatar
Mac Newbold committed
167 168 169 170
    SADD(SCORE_UNASSIGNED);
    vinfo.unassigned++;
    violated++;
  }
171 172 173 174
  vedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = edges(VG);
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    tb_vlink *vlink=get(vedge_pmap,*vedge_it);
175
    vlink->link_info.type_used=tb_link_info::LINK_UNMAPPED;
176
    vlink->no_connection=false;
Mac Newbold's avatar
Mac Newbold committed
177
  }
178 179
  pvertex_iterator pvertex_it,end_pvertex_it;
  tie(pvertex_it,end_pvertex_it) = vertices(PG);
180
  /*
181 182 183 184 185 186
  for (;pvertex_it!=end_pvertex_it;++pvertex_it) {
    tb_pnode *pn=get(pvertex_pmap,*pvertex_it);
    pn->typed=false;
    pn->current_load=0;
    pn->pnodes_used=0;
    pn->switch_used_links=0;
Mac Newbold's avatar
Mac Newbold committed
187
  }
188
  */
189 190 191 192 193 194 195
  pedge_iterator pedge_it,end_pedge_it;
  tie(pedge_it,end_pedge_it) = edges(PG);
  for (;pedge_it!=end_pedge_it;++pedge_it) {
    tb_plink *plink=get(pedge_pmap,*pedge_it);
    plink->bw_used=0;
    plink->emulated=0;
    plink->nonemulated=0;
Mac Newbold's avatar
Mac Newbold committed
196 197
  }

198
  SDEBUG(cerr << "  score=" << score << " violated=" << violated << endl);
199
}
200

201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
/*
 * Find all possbile resolutions for a link. The possible resolutions are placed
 * into the resolutions parameter, and the total weight of all resolutions are
 * returned.
 */
float find_link_resolutions(resolution_vector &resolutions, pvertex pv,
    pvertex dest_pv, tb_vlink *vlink, tb_pnode *pnode, tb_pnode *dest_pnode,
    bool flipped) {
  SDEBUG(cerr << "   finding link resolutions" << endl);
  /* We need to calculate all possible link resolutions, stick
   * them in a nice datastructure along with their weights, and
   * then select one randomly.
   */
  typedef vector<pvertex_list> switchlist_vector;

  float total_weight = 0;

  // Trivial link
  if (dest_pv == pv) {
    SDEBUG(cerr << "  trivial link" << endl);

    /*
     * Sometimes, we might not want to let a vlink be resolved as a
     * trivial link
     */
    if (allow_trivial_links && vlink->allow_trivial) {
      tb_link_info info(tb_link_info::LINK_TRIVIAL);
      resolutions.push_back(info);
      total_weight += LINK_RESOLVE_TRIVIAL;
    }

    /*
     * This is to preserve some old behaviour - if we see a trivial link, that's
     * the only one we consider using. Need to revisit this to see if it's always
     * desirable.
     */
    return total_weight;
  }

  pedge pe;
  // Direct link
242
  if (find_best_link(dest_pv,pv,vlink,pe)) {
243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280
    tb_link_info info(tb_link_info::LINK_DIRECT);
    info.plinks.push_back(pe);
    resolutions.push_back(info);
    total_weight += LINK_RESOLVE_DIRECT;
    SDEBUG(cerr << "    direct_link " << pe << endl);
  }
  // Intraswitch link
  pedge first,second;
  for (pvertex_set::iterator switch_it = pnode->switches.begin();
      switch_it != pnode->switches.end();++switch_it) {
    if (dest_pnode->switches.find(*switch_it) !=
        dest_pnode->switches.end()) {
      bool first_link, second_link;
      /*
       * Check to see if either, or both, pnodes are actually
       * the switch we are looking for
       */
      if (pv == *switch_it) {
        first_link = false;
      } else {
        first_link = true;
      }
      if (dest_pv == *switch_it) {
        second_link = false;
      } else {
        second_link = true;
      }

      /*
       * Intraswitch links to switches are not allowed - they
       * will be caught as direct links above
       */
      if (pnode->is_switch || dest_pnode->is_switch) {
        SDEBUG(cerr << "    intraswitch failed - switch" << endl;)
          continue;
      }

      if (first_link) {
281
        if (!find_best_link(pv,*switch_it,vlink,first)) {
282 283 284 285 286 287 288 289
          SDEBUG(cerr << "    intraswitch failed - no link first" <<
              endl;)
            // No link to this switch
            continue;
        }
      }

      if (second_link) {
290
        if (!find_best_link(dest_pv,*switch_it,vlink,second)) {
291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 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 346 347 348 349 350 351 352 353 354
          // No link to this switch
          SDEBUG(cerr << "    intraswitch failed - no link second" <<
              endl;)
            continue;
        }
      }

      tb_link_info info(tb_link_info::LINK_INTRASWITCH);
      /*
       * Order these need to go in depends on flipped bit
       */
      if (flipped) {
        if (second_link) {
          info.plinks.push_back(second);
        }
        if (first_link) {
          info.plinks.push_back(first);
        }
      } else {
        if (first_link) {
          info.plinks.push_back(first);
        }
        if (second_link) {
          info.plinks.push_back(second);
        }
      }
      info.switches.push_front(*switch_it);
      resolutions.push_back(info);
      
      total_weight += LINK_RESOLVE_INTRASWITCH;
      SDEBUG(cerr << "    intraswitch " << first << " and " << second
          <<                     endl);
    }
  }
  for (pvertex_set::iterator source_switch_it = pnode->switches.begin();
      source_switch_it != pnode->switches.end();
      ++source_switch_it) {
    for (pvertex_set::iterator dest_switch_it =
        dest_pnode->switches.begin();
        dest_switch_it != dest_pnode->switches.end();
        ++dest_switch_it) {
      if (*source_switch_it == *dest_switch_it) continue;
      tb_link_info info(tb_link_info::LINK_INTERSWITCH);
      if (find_interswitch_path(*source_switch_it,*dest_switch_it,vlink->delay_info.bandwidth,
            info.plinks, info.switches) != 0) {
        bool first_link, second_link;
        /*
         * Check to see if either, or both, pnodes are actually the
         * switches we are looking for
         */
        if ((pv == *source_switch_it) || (pv ==
              *dest_switch_it)) {
          first_link = false;
        } else {
          first_link = true;
        }
        if ((dest_pv == *source_switch_it) ||
            (dest_pv == *dest_switch_it)) {
          second_link = false;
        } else {
          second_link = true;
        }

        if (first_link) {
355 356
          if
            (!find_best_link(pv,*source_switch_it,vlink,first)) {
357 358 359 360 361 362 363 364
              // No link to this switch
              SDEBUG(cerr << "    interswitch failed - no first link"
                  << endl;)
                continue;
            }
        }

        if (second_link) {
365
          if (!find_best_link(dest_pv,*dest_switch_it,vlink,second)) {
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417
            // No link to tshis switch
            SDEBUG(cerr << "    interswitch failed - no second link" <<                                          endl;)
              continue;
          }
        }

        if (flipped) { // Order these need to go in depends on flipped bit
          if (second_link) {
            info.plinks.push_front(second);
          }
          if (first_link) {
            info.plinks.push_back(first);
          }
        } else {
          if (first_link) {
           info.plinks.push_front(first);
          }
          if (second_link) {
            info.plinks.push_back(second);
          }
        }
        resolutions.push_back(info);
        total_weight += LINK_RESOLVE_INTERSWITCH;
        SDEBUG(cerr << "    interswitch " <<
            get(pvertex_pmap,*source_switch_it)->name
            << " and " <<
            get(pvertex_pmap,*dest_switch_it)->name <<
            endl);
      } else {
        SDEBUG(cerr << "    interswitch failed - no switch path";)
      }
    }
  }
      
  return total_weight;

}


/*
 * Return the cost of a resolution
 */
inline float resolution_cost(tb_link_info::linkType res_type) {
    switch (res_type) {
	case tb_link_info::LINK_DIRECT:
	    return LINK_RESOLVE_DIRECT; break;
	case tb_link_info::LINK_INTRASWITCH:
	    return LINK_RESOLVE_INTRASWITCH; break;
	case tb_link_info::LINK_INTERSWITCH:
	    return LINK_RESOLVE_INTERSWITCH; break;
	case tb_link_info::LINK_UNMAPPED:
	case tb_link_info::LINK_TRIVIAL:
418 419
	default:
	    // These shouldn't be passed in: fall through to below and die
420 421
	break;
    }
422 423 424
    
    cerr << "*** Internal error: Should not be here. (resolution_cost)" << endl;
    exit(EXIT_FATAL);
425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497
}

/*
 * Mark a vlink as unassigned
 */
void mark_vlink_unassigned(tb_vlink *vlink) {
    SADD(SCORE_NO_CONNECTION);
    vlink->no_connection=true;
    vinfo.no_connection++;
    vlink->link_info.type_used = tb_link_info::LINK_UNMAPPED;
    violated++;
}

/*
 * Resolve an individual vlink
 */
void resolve_link(vvertex vv, pvertex pv, tb_vnode *vnode, tb_pnode *pnode,
    bool deterministic, vedge edge) {
  tb_vlink *vlink = get(vedge_pmap,edge);
  vvertex dest_vv = target(edge,VG);

  if (dest_vv == vv) {
    dest_vv = source(edge,VG);
  }

  /*
   * Indicates that we've assigned the nodes in reverse order compared to
   * what's in the vlink, so we need to reverse the ordering in the
   * pedge_path
   */
  bool flipped = false;
  if (vlink->src != vv) {
    flipped = true;
  }

  /*
   * Find the link's destination
   */
  tb_vnode *dest_vnode = get(vvertex_pmap,dest_vv);
  SDEBUG(cerr << "  edge to " << dest_vnode->name << endl);

  /*
   * If the other end of the link is assigned, we can go ahead and try to
   * find a mapping for the link
   */
  if (dest_vnode->assigned) {
    pvertex dest_pv = dest_vnode->assignment;
    tb_pnode *dest_pnode = get(pvertex_pmap,dest_pv);

    SDEBUG(cerr << "   goes to " << dest_pnode->name << endl);

    if (dest_pv == pv) {
      SDEBUG(cerr << "  trivial link" << endl);
      
      if (allow_trivial_links && vlink->allow_trivial) {
        vlink->link_info.type_used = tb_link_info::LINK_TRIVIAL;
        /*
         * XXX - okay, this is really bad, but score_link_info
         * doesn't usually get called for trivial links, and
         * letting them fall through into the 'normal' link code
         * below is disatrous!
         */
        score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
      } else {
	  mark_vlink_unassigned(vlink);
      }
    } else {
      //assert(resolution_index <= 1)
      resolution_vector resolutions;
      float total_weight = find_link_resolutions(resolutions, pv, dest_pv,
          vlink,pnode,dest_pnode,flipped);
      
      /*
498 499
       * If they have asked for a specific interface, filter out any
       * resolutions that don't have it
500
       */
501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
      if (vlink->fix_src_iface) {
	  resolution_vector::iterator rit;
	  for (rit = resolutions.begin(); rit != resolutions.end();) {
	      pedge link = (*rit).plinks.front();
	      tb_plink *plink = get(pedge_pmap,link);
	      if (plink->srciface != vlink->src_iface) {
		  // Doesn't match, remove it!
		   total_weight -= resolution_cost(rit->type_used);
		   rit = resolutions.erase(rit);
	       } else {
		   rit++;
	       }
	  }
      }
      
      if (vlink->fix_dst_iface) {
	  resolution_vector::iterator rit;
	  for (rit = resolutions.begin(); rit != resolutions.end();) {
	      pedge link = (*rit).plinks.back();
	      tb_plink *plink = get(pedge_pmap,link);
	      // Yes, this really is srciface
	      // XXX: This only works because we always have the node as the 'source'
	      // of a plink! Shouldn't depend on this!
	      if (plink->srciface != vlink->dst_iface) {
		  // Doesn't match, remove it!
		  total_weight -= resolution_cost(rit->type_used);
		  rit = resolutions.erase(rit);
	      } else {
		  rit++;
	      }
	  }
      }
533 534
      
      int n_resolutions = resolutions.size();
535
      //int resolution_index = n_resolutions - 1;
536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575
      int resolution_index = n_resolutions;
      
      /*
       * check for no link
       */
      if (resolution_index == 0) {
        SDEBUG(cerr << "  Could not find any resolutions" << endl;)
        mark_vlink_unassigned(vlink);
      } else {
        /*
         * Check to see if we are fixing a violation
         */
        if (vlink->no_connection) {
          SDEBUG(cerr << "  Fixing previous violations." << endl);
          SSUB(SCORE_NO_CONNECTION);
          vlink->no_connection=false;
          vinfo.no_connection--;
          violated--;
        }
        /*
         * Choose a link
         */
        int index;
        if (!deterministic && !greedy_link_assignment) {
          /*
           * Not deterministic - randomly pick between the possibilities
           * we've found.
           */
          float choice;
          choice = RANDOM()%(int)total_weight;
          for (index = 0;index < resolution_index;++index) {
            switch (resolutions[index].type_used) {
              case tb_link_info::LINK_DIRECT:
                choice -= LINK_RESOLVE_DIRECT; break;
              case tb_link_info::LINK_INTRASWITCH:
                choice -= LINK_RESOLVE_INTRASWITCH; break;
              case tb_link_info::LINK_INTERSWITCH:
                choice -= LINK_RESOLVE_INTERSWITCH; break;
              case tb_link_info::LINK_UNMAPPED:
              case tb_link_info::LINK_TRIVIAL:
576
	      case tb_link_info::LINK_DELAYED:
577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649
                cerr << "*** Internal error: Should not be here." <<
                  endl;
                exit(EXIT_FATAL);
                break;
            }
            if (choice < 0) break;
          }
        } else {
          /*
           * Deterministic - try all possibilities, and go with the best one
           * (the one with the best score)
           */
          cerr << "Doing deterministic link resolution" << endl;
          cerr << "total_weight: " << total_weight << ", resolution_index: "
            << resolution_index << endl;
          int bestindex;
          int bestviolated = 10000;
          double bestscore=10000.0;
          int i;
          for (i=0;i<resolution_index;++i) {
            vlink->link_info = resolutions[i];
            score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
            if ((score <= bestscore) &&
                (violated <= bestviolated)) {
              bestscore = score;
              bestviolated = violated;
              bestindex = i;
            }
            unscore_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
          }
          index = bestindex;
        }
#ifdef PENALIZE_UNUSED_INTERFACES
        pnode->used_interfaces++;
#endif
        vlink->link_info = resolutions[index];
        SDEBUG(cerr << "  choice:" << vlink->link_info);
        score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
      }
    }
  }
}

/*
 * Assign any links on the vnode that can now be assigned (due to the other
 * end of the link also being assigned)
 */
void resolve_links(vvertex vv, pvertex pv, tb_vnode *vnode, tb_pnode *pnode,
    bool deterministic) {
  /*
   * Loop through all vlinks connected to this vnode
   */
  voedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = out_edges(vv,VG);
  hash_set<const tb_vlink*, hashptr<const tb_vlink*> > seen_links;
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    /*
     * We have to be careful, because we can see loopback links twice, since
     * both endpoints are on the same vnode and the same pnode. If we've seen
     * this link before, just go onto the next
     */
    // XXX: Seems silly to do this here, then again at the top of resolve_link
    tb_vlink *vlink = get(vedge_pmap,*vedge_it);
    if (seen_links.find(vlink) != seen_links.end()) {
      SDEBUG(cerr << "    seen before - skipping" << endl);
      continue;
    } else {
      seen_links.insert(vlink);      
      resolve_link(vv,pv,vnode,pnode,deterministic,*vedge_it);
    }
  }
}

650 651 652 653
/* unscore_link_info(vedge ve)
 * This routine is the highest level link scorer.  It handles all
 * scoring that depends on the link_info of vlink.
 */
654 655
void unscore_link_info(vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode, tb_vnode *src_vnode,
	tb_vnode *dst_vnode)
656 657
{
  tb_vlink *vlink = get(vedge_pmap,ve);
658 659 660

  // Handle vnodes that are not allowed to have a mix of trivial and
  // non-trivial links
661
  if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
662 663 664 665 666 667
      src_vnode->trivial_links--;
      dst_vnode->trivial_links--;
      if (src_vnode->disallow_trivial_mix &&
	      (src_vnode->trivial_links == 0) &&
	      (src_vnode->nontrivial_links != 0)) {
	  // We just removed the last trivial link
668
	  SSUB(SCORE_TRIVIAL_MIX);
669 670 671 672 673 674 675
	  violated--;
	  vinfo.trivial_mix--;
      }
      if (dst_vnode->disallow_trivial_mix &&
	      (dst_vnode->trivial_links == 0) &&
	      (dst_vnode->nontrivial_links != 0)) {
	  // We just removed the last trivial link
676
	  SSUB(SCORE_TRIVIAL_MIX);
677 678 679
	  violated--;
	  vinfo.trivial_mix--;
      }
680
  } else if (vlink->link_info.type_used != tb_link_info::LINK_UNMAPPED) {
681 682 683 684 685 686
      src_vnode->nontrivial_links--;
      dst_vnode->nontrivial_links--;
      if (src_vnode->disallow_trivial_mix &&
	      (src_vnode->nontrivial_links == 0) &&
	      (src_vnode->trivial_links != 0)) {
	  // We just removed the last nontrivial link
687
	  SSUB(SCORE_TRIVIAL_MIX);
688 689 690 691 692 693 694
	  violated--;
	  vinfo.trivial_mix--;
      }
      if (dst_vnode->disallow_trivial_mix &&
	      (dst_vnode->nontrivial_links == 0) &&
	      (dst_vnode->trivial_links != 0)) {
	  // We just removed the last nontrivial link
695
	  SSUB(SCORE_TRIVIAL_MIX);
696 697 698 699 700 701
	  violated--;
	  vinfo.trivial_mix--;
      }
  }

  // Unscore the link itself
702
  if (vlink->link_info.type_used == tb_link_info::LINK_DIRECT) {
703 704
    // DIRECT LINK
    SDEBUG(cerr << "   direct link" << endl);
705 706 707
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;

708
    SSUB(SCORE_DIRECT_LINK);
709 710
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    vlink->link_info.plinks.clear();
711
  } else if (vlink->link_info.type_used == tb_link_info::LINK_INTERSWITCH) {
712 713
    // INTERSWITCH LINK
    SDEBUG(cerr << "  interswitch link" << endl);
714 715
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
716 717 718 719
    
#ifndef INTERSWITCH_LENGTH
    SSUB(SCORE_INTERSWITCH_LINK);
#endif
720 721

    pedge_path &path = vlink->link_info.plinks;
722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743
    // XXX: Potentially bogus;
    int numinterlinks;
    numinterlinks = -2;
    for (pedge_path::iterator it=path.begin();
	 it != path.end();++it) {
      unscore_link(*it,ve,src_pnode,dst_pnode);
      numinterlinks++;
    }
#ifdef INTERSWITCH_LENGTH
    for (int i = 1; i <= numinterlinks; i++) {
      SSUB(SCORE_INTERSWITCH_LINK);
    }
#endif

    path.clear();
    for (pvertex_list::iterator it = vlink->link_info.switches.begin();
	 it != vlink->link_info.switches.end();++it) {
      tb_pnode *the_switch = get(pvertex_pmap,*it);
      if (--the_switch->switch_used_links == 0) {
	SDEBUG(cerr << "  releasing switch" << endl);
	SSUB(SCORE_SWITCH);
      }
744 745
      // We count the bandwidth into and out of the switch
      the_switch->nontrivial_bw_used -= vlink->delay_info.bandwidth * 2;
746 747
    }
    vlink->link_info.switches.clear();
748
  } else if (vlink->link_info.type_used == tb_link_info::LINK_INTRASWITCH) {
749 750
    // INTRASWITCH LINK
    SDEBUG(cerr << "   intraswitch link" << endl);
751 752 753
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;

754 755 756 757 758 759 760
    SSUB(SCORE_INTRASWITCH_LINK);
    
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    unscore_link(vlink->link_info.plinks.back(),ve,src_pnode,dst_pnode);
    vlink->link_info.plinks.clear();
    tb_pnode *the_switch = get(pvertex_pmap,
			       vlink->link_info.switches.front());
761 762
    // We count the bandwidth into and out of the switch
    the_switch->nontrivial_bw_used -= vlink->delay_info.bandwidth * 2;
763 764 765 766 767 768
    if (--the_switch->switch_used_links == 0) {
      SDEBUG(cerr << "  releasing switch" << endl);
      SSUB(SCORE_SWITCH);
    }
    vlink->link_info.switches.clear();
  }
769 770

#ifdef TRIVIAL_LINK_BW
771
  else if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
772
      // Trivial link - we may get to remove violations
Robert Ricci's avatar
Robert Ricci committed
773 774 775 776 777 778
      SDEBUG(cerr << "  trivial bandwidth used " <<
	      src_pnode->trivial_bw_used << " max is " <<
	      src_pnode->trivial_bw << " subtracting " <<
	      vlink->delay_info.bandwidth << endl);
      if (src_pnode->trivial_bw) {
	int old_over_bw;
779
	int old_bw = src_pnode->trivial_bw_used;
Robert Ricci's avatar
Robert Ricci committed
780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795
	if (src_pnode->trivial_bw_used > src_pnode->trivial_bw) {
	  old_over_bw = src_pnode->trivial_bw_used - src_pnode->trivial_bw;
	} else {
	  old_over_bw = 0;
	}

	src_pnode->trivial_bw_used -= vlink->delay_info.bandwidth;

	int new_over_bw;
	if (src_pnode->trivial_bw_used > src_pnode->trivial_bw) {
	  new_over_bw = src_pnode->trivial_bw_used - src_pnode->trivial_bw;
	} else {
	  new_over_bw = 0;
	}

	if (old_over_bw) {
796
	  // Count how many multiples of the maximum bandwidth we're at
797 798 799 800
	  int num_violations = (int)(
	      floor((double)(old_bw -1)/src_pnode->trivial_bw)
	      - floor((double)(src_pnode->trivial_bw_used -1) /
		src_pnode->trivial_bw));
801 802
	  violated -= num_violations;
	  vinfo.bandwidth -= num_violations;
Robert Ricci's avatar
Robert Ricci committed
803 804 805 806
	  double removed_bandwidth_percent = (old_over_bw - new_over_bw) * 1.0 /
	    src_pnode->trivial_bw;
	  SSUB(SCORE_TRIVIAL_PENALTY * removed_bandwidth_percent);
	}
807
      }
Robert Ricci's avatar
Robert Ricci committed
808

809 810 811
      unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
  }
#endif
812

813
}
814

Mac Newbold's avatar
Mac Newbold committed
815 816
/*
 * This removes a virtual node from the assignments, adjusting
817 818
 * the score appropriately.
 */
819
void remove_node(vvertex vv)
Mac Newbold's avatar
Mac Newbold committed
820
{
821
  // Find the vnode associated with the vvertex, and the pnode it's assigned to
822 823 824 825 826 827 828 829 830 831
  tb_vnode *vnode = get(vvertex_pmap,vv);
  assert(vnode->assigned);
  pvertex pv = vnode->assignment;
  tb_pnode *pnode = get(pvertex_pmap,pv);

  SDEBUG(cerr <<  "SCORE: remove_node(" << vnode->name << ")" << endl);
  SDEBUG(cerr <<  "  assignment=" << pnode->name << endl);
#ifdef SCORE_DEBUG_LOTS
  cerr << *vnode;
  cerr << *pnode;
Mac Newbold's avatar
Mac Newbold committed
832 833 834 835
#endif

  assert(pnode != NULL);

836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854
  /* 
   * Find the type on the pnode that this vnode is associated with
   */
  tb_pnode::types_map::iterator mit = pnode->types.find(vnode->type);
  tb_pnode::type_record *tr;
  if (mit == pnode->types.end()) {
      // This is kind of a hack - if we don't find the type, then the vnode
      // must have a vtype. So, we assume it must have been assigned to this
      // node's dynamic type at some point.
      // A consequence of this hack is that vtypes can't map to static types,
      // for now.
      RDEBUG(cerr << "Failed to find type " << vnode->type << " (for vnode " <<
	  vnode->name << ") on pnode " << pnode->name << endl;)
      tr = pnode->current_type_record;
  } else {
      tr = mit->second;
  }
 

855 856 857
  /*
   * Clean up the pnode's state
   */
858
  if (!tr->is_static()) {
859 860 861
    if (pnode->my_class) {
      pclass_unset(pnode);
    }
862
  }
863

864 865
#ifdef SMART_UNMAP
  pnode->assigned_nodes.erase(vnode);
866
#endif
867 868

  // pclass
869
  if ((!disable_pclasses) && !(tr->is_static()) && pnode->my_class
870
	  && (pnode->my_class->used_members == 0)) {
871
    SDEBUG(cerr << "  freeing pclass" << endl);
872 873
    SSUB(SCORE_PCLASS);
  }
874 875

  // vclass
876 877 878
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->unassign_node(vnode->type);
    SDEBUG(cerr << "  vclass unassign " << score_delta << endl);
879 880 881 882 883 884 885
    
    if (score_delta <= -1) {
      violated--;
      vinfo.vclass--;
    }
    SSUB(-score_delta*SCORE_VCLASS);
  }
886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918

  /*
   * Handle subnodes
   */
  if (vnode->subnode_of) {
      // First handle our parent
      if (vnode->subnode_of->assigned) {
	  tb_pnode *assignment = get(pvertex_pmap,
		  vnode->subnode_of->assignment);
	  if ((!pnode->subnode_of) ||
		 (pnode->subnode_of != assignment)) {
	      SSUB(SCORE_SUBNODE);
	      violated--;
	      vinfo.subnodes--;
	  }
      }
  }
  if (!vnode->subnodes.empty()) {
      // Then any children we might have
      tb_vnode::subnode_list::iterator sit;
      for (sit = vnode->subnodes.begin(); sit != vnode->subnodes.end(); sit++) {
	  if ((*sit)->assigned) {
	      tb_pnode *assignment = get(pvertex_pmap,(*sit)->assignment);
	  if ((!assignment->subnode_of) ||
		 (assignment->subnode_of != pnode)) {
		  SSUB(SCORE_SUBNODE);
		  violated--;
		  vinfo.subnodes--;
	      }
	  }
      }
  }

919 920 921
  /*
   * Now, take care of the virtual links that are attached to the vnode
   */
922 923
  voedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = out_edges(vv,VG);
924
  hash_set<const tb_vlink*, hashptr<const tb_vlink*> > seen_loopback_links;
925 926
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    tb_vlink *vlink = get(vedge_pmap,*vedge_it);
927 928 929

    // Find the other end of the vlink - we might be either its source or
    // destination (target)
930 931 932 933 934 935
    vvertex dest_vv = target(*vedge_it,VG);
    if (dest_vv == vv)
      dest_vv = source(*vedge_it,VG);
    tb_vnode *dest_vnode = get(vvertex_pmap,dest_vv);
    SDEBUG(cerr << "  edge to " << dest_vnode->name << endl);

936 937 938 939 940 941 942 943 944 945 946
    if (dest_vv == vv) {
      // We have to be careful with 'loopback' links, because we can see them
      // twice - bail out if this is the second time
      if (seen_loopback_links.find(vlink) != seen_loopback_links.end()) {
	SDEBUG(cerr << "    seen before - skipping" << endl);
	continue;
      } else {
	seen_loopback_links.insert(vlink);
      }
    }

947 948
    // A 'not-connected' vlink only counts as a violation if both of its
    // endpoints are assigned
949 950 951 952 953 954
    if (vlink->no_connection) {
      SDEBUG(cerr << "  link no longer in violation.\n";)
      SSUB(SCORE_NO_CONNECTION);
      vlink->no_connection=false;
      vinfo.no_connection--;
      violated--;
955
    }
956
    
957 958
    // Only unscore the link if the vnode on the other end is assigned - this
    // way, only the first end to be unmapped causes unscoring
959 960 961
    if (! dest_vnode->assigned) {
      continue;
    }
962
    
963
    // Find the pnode on the ther end of the link, and unscore it!
964 965
    pvertex dest_pv = dest_vnode->assignment;
    tb_pnode *dest_pnode = get(pvertex_pmap,dest_pv);
966
    unscore_link_info(*vedge_it,pnode,dest_pnode,vnode,dest_vnode);
967
  }
968 969
 
#ifdef PENALIZE_UNUSED_INTERFACES
970
  // Keep track of the number of interfaces that the pnode is using
971 972 973 974
  SSUB((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
  pnode->used_interfaces = 0;
#endif
 
975 976 977
  /*
   * Adjust scores for the pnode
   */
978 979
  int old_load = tr->get_current_load();
  tr->remove_load(vnode->typecount);
980
  pnode->total_load -= vnode->typecount;
981
#ifdef LOAD_BALANCE
982 983
  // Use this tricky formula to score based on how 'full' the pnode is, so that
  // we prefer to equally fill the minimum number of pnodes
984 985
  SSUB(SCORE_PNODE * (powf(1+ ((pnode->current_load+1) * 1.0)/pnode->max_load,2)));
  SADD(SCORE_PNODE * (powf(1+ pnode->current_load * 1.0/pnode->max_load,2)));
986
#endif
987
  if (pnode->total_load == 0) {
988
    // If the pnode is now free, we need to do some cleanup
989
    SDEBUG(cerr << "  releasing pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
990
    SSUB(SCORE_PNODE);
991
    pnode->remove_current_type();
992 993 994
    // ptypes
    tb_pnode::types_list::iterator lit = pnode->type_list.begin();
    while (lit != pnode->type_list.end()) {
995 996
	int removed_violations =
	    (*lit)->get_ptype()->remove_users((*lit)->get_max_load());
997 998 999 1000 1001 1002 1003
	if (removed_violations) {
	    SSUB(SCORE_MAX_TYPES * removed_violations);
	    violated -= removed_violations;
	    vinfo.max_types -= removed_violations;
	}
	lit++;
    }
1004
  } else if (old_load > tr->get_max_load()) {
1005 1006 1007
    // If the pnode was over its load, remove the penalties for the nodes we
    // just removed, down to the max_load.
    SDEBUG(cerr << "  reducing penalty, old load was " << old_load <<
1008 1009 1010 1011 1012
	    ", new load = " << tr->get_current_load() << ", max load = " <<
	    tr->get_max_load() << endl);
    for (int i = old_load;
	 i > MAX(tr->get_current_load(),tr->get_max_load());
	 i--) {
1013 1014 1015 1016
      SSUB(SCORE_PNODE_PENALTY);
      vinfo.pnode_load--;
      violated--;
    }
Mac Newbold's avatar
Mac Newbold committed
1017
  }
1018

Robert Ricci's avatar
Robert Ricci committed
1019 1020 1021 1022 1023 1024 1025 1026 1027
  /*
   * Score the fact that we now have one more unassigned vnode
   */
  vnode->assigned = false;
  SADD(SCORE_UNASSIGNED);
  vinfo.unassigned++;
  violated++;
  

1028 1029 1030
  /*
   * Scoring for features and desires
   */
1031 1032 1033 1034
  score_and_violations sv = score_fds(vnode,pnode,false);
  SSUB(sv.first);
  violated -= sv.second;
  vinfo.desires -= sv.second;
1035 1036

  SDEBUG(cerr << "  new score = " << score << " new violated = " << violated << endl);
1037 1038
}

1039 1040 1041
/* score_link_info(vedge ve)
 * This routine is the highest level link scorer.  It handles all
 * scoring that depends on the link_info of vlink.
1042
 */
1043 1044
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode, tb_vnode *src_vnode,
	tb_vnode *dst_vnode)
1045
{
1046 1047
  tb_vlink *vlink = get(vedge_pmap,ve);
  tb_pnode *the_switch;
1048
  switch (vlink->link_info.type_used) {
1049 1050
  case tb_link_info::LINK_DIRECT:
    SADD(SCORE_DIRECT_LINK);
1051 1052
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1053 1054 1055 1056
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    break;
  case tb_link_info::LINK_INTRASWITCH:
    SADD(SCORE_INTRASWITCH_LINK);
1057 1058
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1059 1060 1061 1062 1063 1064 1065 1066
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    score_link(vlink->link_info.plinks.back(),ve,src_pnode,dst_pnode);
    the_switch = get(pvertex_pmap,
		     vlink->link_info.switches.front());
    if (++the_switch->switch_used_links == 1) {
      SDEBUG(cerr << "  new switch" << endl);
      SADD(SCORE_SWITCH);
    }
1067 1068
    // We count the bandwidth into and out of the switch
    the_switch->nontrivial_bw_used += vlink->delay_info.bandwidth * 2;
1069 1070
    break;
  case tb_link_info::LINK_INTERSWITCH:
1071 1072
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
#ifndef INTERSWITCH_LENGTH
    SADD(SCORE_INTERSWITCH_LINK);
#endif
    // XXX: Potentially bogus!
    int numinterlinks;
    numinterlinks = -2;
    for (pedge_path::iterator plink_It = vlink->link_info.plinks.begin();
	 plink_It != vlink->link_info.plinks.end();
	 ++plink_It) {
	score_link(*plink_It,ve,src_pnode,dst_pnode);
	numinterlinks++;
    }
#ifdef INTERSWITCH_LENGTH
    for (int i = 1; i <= numinterlinks; i++) {
	SADD(SCORE_INTERSWITCH_LINK);
    }
#endif
1090

1091 1092 1093 1094 1095 1096 1097
    for (pvertex_list::iterator switch_it = vlink->link_info.switches.begin();
	 switch_it != vlink->link_info.switches.end();++switch_it) {
      the_switch = get(pvertex_pmap,*switch_it);
      if (++the_switch->switch_used_links == 1) {
	SDEBUG(cerr << "  new switch" << endl);
	SADD(SCORE_SWITCH);
      }
1098 1099
      // We count the bandwidth into and out of the switch
      the_switch->nontrivial_bw_used += vlink->delay_info.bandwidth * 2;
1100 1101 1102
    }
    break;
  case tb_link_info::LINK_TRIVIAL:
1103
  #ifdef TRIVIAL_LINK_BW
Robert Ricci's avatar
Robert Ricci committed
1104 1105 1106 1107 1108 1109
    SDEBUG(cerr << "  trivial bandwidth used " <<
	    src_pnode->trivial_bw_used << " max is " <<
	    src_pnode->trivial_bw << " adding " << vlink->delay_info.bandwidth
	    << endl);
    if (src_pnode->trivial_bw) {
      int old_over_bw;
1110
      int old_bw = src_pnode->trivial_bw_used;
Robert Ricci's avatar
Robert Ricci committed
1111 1112 1113 1114 1115 1116
      if (src_pnode->trivial_bw_used > src_pnode->trivial_bw) {
	old_over_bw = src_pnode->trivial_bw_used - src_pnode->trivial_bw;
      } else {
	old_over_bw = 0;
      }

1117
      dst_pnode->trivial_bw_used += vlink->delay_info.bandwidth;
Robert Ricci's avatar
Robert Ricci committed
1118 1119 1120 1121 1122 1123 1124 1125 1126

      int new_over_bw;
      if (src_pnode->trivial_bw_used > src_pnode->trivial_bw) {
	new_over_bw = src_pnode->trivial_bw_used - src_pnode->trivial_bw;
      } else {
	new_over_bw = 0;
      }
	
      if (new_over_bw) {
1127 1128
	// Count how many multiples of the maximum bandwidth we're at
	int num_violations =
1129 1130 1131
	  (int)(floor((double)((src_pnode->trivial_bw_used -1)
			       / src_pnode->trivial_bw))
		- floor((double)((old_bw -1)/src_pnode->trivial_bw)));
1132 1133 1134
	violated += num_violations;
	vinfo.bandwidth += num_violations;

Robert Ricci's avatar
Robert Ricci committed
1135 1136 1137
	double added_bandwidth_percent = (new_over_bw - old_over_bw) * 1.0 /
	  src_pnode->trivial_bw;
	SADD(SCORE_TRIVIAL_PENALTY * added_bandwidth_percent);
1138 1139 1140 1141
      }
    }
    break;
#endif
1142
  case tb_link_info::LINK_UNMAPPED:
1143
  case tb_link_info::LINK_DELAYED:
1144
    cout << "*** Internal error: Should not be here either." << endl;
1145
    exit(EXIT_FATAL);
1146
    break;
1147
  }
1148 1149 1150

  // Handle vnodes that are not allowed to have a mix of trivial and
  // non-trivial links
1151
  if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
1152 1153 1154 1155 1156 1157
      src_vnode->trivial_links++;
      dst_vnode->trivial_links++;
      if (src_vnode->disallow_trivial_mix &&
	      (src_vnode->trivial_links == 1) &&
	      (src_vnode->nontrivial_links != 0)) {
	  // We just added the first trivial link
1158
	  SADD(SCORE_TRIVIAL_MIX);
1159 1160 1161 1162 1163 1164 1165
	  violated++;
	  vinfo.trivial_mix++;
      }
      if (dst_vnode->disallow_trivial_mix &&
	      (dst_vnode->trivial_links == 1) &&
	      (dst_vnode->nontrivial_links != 0)) {
	  // We just added the first trivial link
1166
	  SADD(SCORE_TRIVIAL_MIX);
1167 1168 1169 1170 1171 1172 1173 1174 1175 1176
	  violated++;
	  vinfo.trivial_mix++;
      }
  } else {
      src_vnode->nontrivial_links++;
      dst_vnode->nontrivial_links++;
      if (src_vnode->disallow_trivial_mix &&
	      (src_vnode->nontrivial_links == 1) &&
	      (src_vnode->trivial_links != 0)) {
	  // We just added the first trivial link
1177
	  SADD(SCORE_TRIVIAL_MIX);
1178 1179 1180 1181 1182 1183 1184
	  violated++;
	  vinfo.trivial_mix++;
      }
      if (dst_vnode->disallow_trivial_mix &&
	      (dst_vnode->nontrivial_links == 1) &&
	      (dst_vnode->trivial_links != 0)) {
	  // We just added the first trivial link
1185
	  SADD(SCORE_TRIVIAL_MIX);
1186 1187 1188 1189 1190
	  violated++;
	  vinfo.trivial_mix++;
      }
  }

1191 1192 1193 1194 1195 1196 1197 1198 1199
}

/*
 * int add_node(vvertex vv,pvertex pv,bool deterministic)
 * Add a mapping of vv to pv and adjust score appropriately.
 * Returns 1 in the case of an incompatible mapping.  If determinisitic
 * is true then it deterministically solves the link problem for best
 * score.  Note: deterministic takes considerably longer.
 */
1200
int add_node(vvertex vv,pvertex pv, bool deterministic, bool is_fixed, bool skip_links)
1201
{
1202
  // Get the vnode and pnode associated with the passed vertices
1203 1204
  tb_vnode *vnode = get(vvertex_pmap,vv);
  tb_pnode *pnode = get(pvertex_pmap,pv);
1205

1206 1207 1208 1209 1210 1211 1212
  assert(!vnode->assigned);

  SDEBUG(cerr << "SCORE: add_node(" << vnode->name << "," <<
	 pnode->name << ")" << endl);
#ifdef SCORE_DEBUG_LOTS
  cerr << *vnode;
  cerr << *pnode;
Mac Newbold's avatar
Mac Newbold committed
1213
#endif
1214
  SDEBUG(cerr << "  vnode type = " << vnode->type << endl);
Mac Newbold's avatar
Mac Newbold committed
1215
  
1216
  /*
1217 1218 1219 1220
   * Handle types - first, check to see if the node is capable of taking on the
   * vnode's type. If it can with a static type, just do the bookkeeping for
   * that static type. Otherwise convert the node to the correct dynamic type,
   * failing if we can't for some reason (ie. it already has another type.
1221
   */
1222 1223
  tb_pnode::type_record *tr;
  tb_pnode::types_map::iterator mit = pnode->types.find(vnode->type);
1224

1225 1226 1227 1228 1229 1230
  if (mit == pnode->types.end()) {
    // This pnode can't take on the vnode's type - we normally shouldn't get
    // here, due to the way we pick pnodes
    return 1;
  }

1231 1232 1233
  /*
   * Handle types
   */
1234
  tr = mit->second;
1235
  if (tr->is_static()) {
1236
    // XXX: Scoring???
1237
    if (tr->get_current_load() < tr->get_max_load()) {
1238
    } else {
Mac Newbold's avatar
Mac Newbold committed
1239 1240 1241
      return 1;
    }
  } else {
1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253
    // Figure out the pnode's type
    if (!pnode->typed) {
      // If this pnode has no type yet, give it one
      SDEBUG(cerr << "  virgin pnode" << endl);
      SDEBUG(cerr << "    vtype = " << vnode->type << endl);

      // Remove check assuming at higher level?
      // Remove higher level checks?
      if (!pnode->set_current_type(vnode->type)) {
	// didn't find a type
	SDEBUG(cerr << "  no matching type" << endl);
	//cerr << "Failed due to bad type!" << endl;
Mac Newbold's avatar
Mac Newbold committed
1254 1255
	return 1;
      }
1256 1257

      SDEBUG(cerr << "  matching type found (" << pnode->current_type <<
1258 1259
	  ", max = " << pnode->current_type_record->get_max_load() << ")" <<
          endl);
1260 1261 1262 1263 1264 1265 1266 1267 1268 1269
      } else {
	// The pnode already has a type, let's just make sure it's compatible
	SDEBUG(cerr << "  pnode already has type" << endl);
	if (pnode->current_type != vnode->type) {
	  SDEBUG(cerr << "  incompatible types" << endl);
	  return 1;
	} else {
	  SDEBUG(cerr << "  compatible types" << endl);
	}
      }
Mac Newbold's avatar
Mac Newbold committed
1270 1271
    }

1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303
  /*
   * Handle subnodes
   */
  if (vnode->subnode_of) {
      // First handle our parent
      if (vnode->subnode_of->assigned) {
	  tb_pnode *assignment = get(pvertex_pmap,
		  vnode->subnode_of->assignment);
	  if ((!pnode->subnode_of) ||
		 (pnode->subnode_of != assignment)) {
	      SADD(SCORE_SUBNODE);
	      violated++;
	      vinfo.subnodes++;
	  }
      }
  }
  if (!vnode->subnodes.empty()) {
      // Then any children we might have
      tb_vnode::subnode_list::iterator sit;
      for (sit = vnode->subnodes.begin(); sit != vnode->subnodes.end(); sit++) {
	  if ((*sit)->assigned) {
	      tb_pnode *assignment = get(pvertex_pmap,(*sit)->assignment);
	  if ((!assignment->subnode_of) ||
		 (assignment->subnode_of != pnode)) {
		  SADD(SCORE_SUBNODE);
		  violated++;
		  vinfo.subnodes++;
	      }
	  }
      }
  }

1304 1305 1306 1307 1308 1309 1310
#ifdef PENALIZE_UNUSED_INTERFACES
  pnode->used_interfaces = 0;
#endif
 
#ifdef SMART_UNMAP
  pnode->assigned_nodes.insert(vnode);
#endif
1311 1312 1313 1314 1315 1316 1317

  /*
   * Record the node's assignment. Need to do this now so that 'loopback' links
   * work below.
   */
  vnode->assignment = pv;
  vnode->assigned = true;
1318

1319 1320 1321
  /* Links */
  if (!skip_links) {
      resolve_links(vv,pv,vnode,pnode,deterministic);
Mac Newbold's avatar
Mac Newbold committed
1322
  }
1323
  
1324
  int old_load = tr->get_current_load();
1325 1326
  int old_total_load = pnode->total_load;

Mac Newbold's avatar
Mac Newbold committed
1327
  // finish setting up pnode
1328
  tr->add_load(vnode->typecount);
1329
  pnode->total_load += vnode->typecount;
1330 1331

#ifdef PENALIZE_UNUSED_INTERFACES
1332
  // XXX
1333 1334
  assert(pnode->used_interfaces <= pnode->total_interfaces);
  SADD((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
Mac Newbold's avatar
Mac Newbold committed
1335
#endif
1336

1337
  if (tr->get_current_load() > tr->get_max_load()) {
1338
    SDEBUG(cerr << "  load too high - penalty (" <<
1339 1340 1341 1342
	pnode->current_type_record->get_current_load() << ")" << endl);
    for (int i = MAX(old_load,tr->get_max_load());
	 i < tr->get_current_load();
	 i++) {
1343 1344 1345 1346
      SADD(SCORE_PNODE_PENALTY);
      vinfo.pnode_load++;
      violated++;
    }
Mac Newbold's avatar
Mac Newbold committed
1347
  } else {
1348
    SDEBUG(cerr << "  load is fine" << endl);
Mac Newbold's avatar
Mac Newbold committed
1349
  }
1350
  if (old_total_load == 0) {
1351
    SDEBUG(cerr << "  new pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
1352
    SADD(SCORE_PNODE);
1353 1354 1355
    // ptypes
    tb_pnode::types_list::iterator lit = pnode->type_list.begin();
    while (lit != pnode->type_list.end()) {
1356 1357
	int new_violations = 
	    (*lit)->get_ptype()->add_users((*lit)->get_max_load());
1358 1359 1360 1361 1362 1363 1364
	if (new_violations) {
	    SADD(SCORE_MAX_TYPES * new_violations);
	    violated += new_violations;
	    vinfo.max_types += new_violations;
	}
	lit++;
    }
Mac Newbold's avatar
Mac Newbold committed
1365
  }
1366 1367 1368 1369
#ifdef LOAD_BALANCE
  SSUB(SCORE_PNODE * (powf(1 + ((pnode->current_load-1) * 1.0)/pnode->max_load,2)));
  SADD(SCORE_PNODE * (powf(1 + ((pnode->current_load) * 1.0)/pnode->max_load,2)));
#endif
Mac Newbold's avatar
Mac Newbold committed
1370 1371 1372 1373 1374 1375

  // node no longer unassigned
  SSUB(SCORE_UNASSIGNED);
  vinfo.unassigned--;
  violated--;

1376
  // features/desires
1377 1378 1379 1380 1381 1382
  score_and_violations sv = score_fds(vnode,pnode,true);
  SADD(sv.first);
  if (!is_fixed) {
      violated += sv.second;
      vinfo.desires += sv.second;
  }
1383 1384

  // pclass
1385
  if ((!disable_pclasses) && (!tr->is_static()) && pnode->my_class &&
1386
	  (pnode->my_class->used_members == 0)) {
1387
    SDEBUG(cerr << "  new pclass" << endl);
1388
    SADD(SCORE_PCLASS);
1389
  }
1390 1391

  // vclass
1392 1393 1394
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->assign_node(vnode->type);
    SDEBUG(cerr << "  vclass assign " << score_delta << endl);
1395 1396 1397 1398 1399 1400 1401
    SADD(score_delta*SCORE_VCLASS);
    if (score_delta >= 1) {
      violated++;
      vinfo.vclass++;
    }
  }

1402
  SDEBUG(cerr << "  assignment=" << pnode->name << endl);
1403
  SDEBUG(cerr << "  new score=" << score << " new violated=" << violated << endl);
1404

1405
  if (!tr->is_static()) {
1406 1407 1408
    if (pnode->my_class) {
      pclass_set(vnode,pnode);
    }
1409
  }
1410
  
Mac Newbold's avatar
Mac Newbold committed
1411 1412 1413
  return 0;
}

1414
bool find_best_link(pvertex pv,pvertex switch_pv,tb_vlink *vlink,
1415
			 pedge &out_edge)
Mac Newbold's avatar
Mac Newbold committed
1416
{
1417 1418
  pvertex dest_pv;
  double best_distance = 1000.0;
Mac Newbold's avatar
Mac Newbold committed
1419
  int best_users = 1000;
1420 1421 1422 1423
  pedge best_pedge;
  bool found_best=false;
  poedge_iterator pedge_it,end_pedge_it;
  tie(pedge_it,end_pedge_it) = out_edges(pv,PG);
1424

1425 1426 1427 1428 1429 1430
  for (;pedge_it!=end_pedge_it;++pedge_it) {
    dest_pv = target(*pedge_it,PG);
    if (dest_pv == pv)
      dest_pv = source(*pedge_it,PG);
    if (dest_pv == switch_pv) {
      tb_plink *plink = get(pedge_pmap,*pedge_it);
Robert Ricci's avatar
Robert Ricci committed
1431

1432 1433 1434 1435 1436
      // Skip any links whose type is wrong (ie. doesn't match the vlink)
      if (plink->types.find(vlink->type) == plink->types.end()) {
	  continue;
      }

Robert Ricci's avatar
Robert Ricci committed
1437 1438
      // Get delay characteristics - NOTE: Currently does not actually do
      // anything
1439 1440 1441 1442 1443
      tb_delay_info physical_delay;
      physical_delay.bandwidth = plink->delay_info.bandwidth - plink->bw_used;
      physical_delay.delay = plink->delay_info.delay;
      physical_delay.loss = plink->delay_info.loss;
      double distance = vlink->delay_info.distance(physical_delay);
Robert Ricci's avatar
Robert Ricci committed
1444 1445

      double available_bandwidth =  plink->delay_info.bandwidth - plink->bw_used;
1446

Robert Ricci's avatar
Robert Ricci committed
1447 1448
      // For sticking emulated links in emulated links we care about the
      // distance, and whether or not we've gone over bandwidth
Robert Ricci's avatar
Robert Ricci committed
1449
      int users;
Robert Ricci's avatar