score.cc 66.2 KB
Newer Older
Robert Ricci's avatar
Robert Ricci committed
1 2
/*
 * EMULAB-COPYRIGHT
Robert Ricci's avatar
Robert Ricci 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
static const char rcsid[] = "$Id: score.cc,v 1.69 2009-12-09 22:53:44 ricci 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

#include <boost/config.hpp>
#include <boost/utility.hpp>
29
#include BOOST_PMAP_HEADER
30 31 32 33
#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, bool check_src_iface,
64
                    bool check_dst_iface);
65 66 67
int find_interswitch_path(pvertex src_pv,pvertex dest_pv,
			  int bandwidth,pedge_path &out_path,
			  pvertex_list &out_switches);
68 69
score_and_violations score_fds(tb_vnode *vnode, tb_pnode *pnode, bool add);

70 71 72 73
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);
74 75 76 77

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

#ifdef SCORE_DEBUG_MORE
80 81
#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
82 83 84 85 86
#else
#define SADD(amount) score += amount
#define SSUB(amount) score -= amount
#endif

87 88 89 90
// 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

91 92 93 94 95 96
#ifdef SCORE_DEBUG_MAX
// Handy way to print only the first N debugging messages, since that's usually
// enough to get the idea
static unsigned long scoredebugcount = 0;
#endif

97
#ifdef SCORE_DEBUG
98 99 100
#ifdef SCORE_DEBUG_MAX
#define SDEBUG(a) if (scoredebugcount++ < SCORE_DEBUG_MAX) { a; }
#else
101
#define SDEBUG(a) a
102
#endif
103
#else
Robert Ricci's avatar
Robert Ricci committed
104
#define SDEBUG(a) 
105 106
#endif

107 108 109
#define MIN(a,b) (((a) < (b))? (a) : (b))
#define MAX(a,b) (((a) > (b))? (a) : (b))

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 145 146 147 148 149 150 151 152 153 154 155
/*
 * '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
156 157 158 159
/*
 * score()
 * Returns the score.
 */
160
double get_score() {return score;}
Mac Newbold's avatar
Mac Newbold committed
161 162 163 164 165 166 167 168

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

173 174 175 176 177
  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
178 179 180 181
    SADD(SCORE_UNASSIGNED);
    vinfo.unassigned++;
    violated++;
  }
182 183 184 185
  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);
186 187 188 189 190
    SADD(SCORE_NO_CONNECTION);
    vlink->no_connection=true;
    vinfo.no_connection++;
    vlink->link_info.type_used = tb_link_info::LINK_UNMAPPED;
    violated++;
Mac Newbold's avatar
Mac Newbold committed
191
  }
192 193
  pvertex_iterator pvertex_it,end_pvertex_it;
  tie(pvertex_it,end_pvertex_it) = vertices(PG);
194
  /*
195 196 197 198 199 200
  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
201
  }
202
  */
203 204 205 206 207 208 209
  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
210 211
  }

212
  SDEBUG(cerr << "  score=" << score << " violated=" << violated << endl);
213
}
214

215 216 217 218 219 220 221 222
/*
 * 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) {
223
  SDEBUG(cerr << "   finding link resolutions from " << pnode->name << " to " << dest_pnode->name << endl);
224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
  /* 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;
255
  // Direct link (have to check both interfaces if they are fixed)
256
  if (find_best_link(dest_pv,pv,vlink,pe,true,true)) {
257 258 259 260
    tb_link_info info(tb_link_info::LINK_DIRECT);
    info.plinks.push_back(pe);
    resolutions.push_back(info);
    total_weight += LINK_RESOLVE_DIRECT;
261
    SDEBUG(cerr << "    added a direct_link " << pe << endl);
262
  }
263 264 265 266 267 268 269 270 271 272 273 274

  /*
   * IMPORTANT NOTE ABOUT find_best_link -
   *
   * We have to tell it whether it is supposed to check the source of the
   * vlink, the dest of the vlink, or both, for fixed interfaces. Of course, we
   * only want to check the 'node' side, not the switch side, of interswitch
   * and intraswitch paths. Of course, which end we're looking at depends on
   * the order we're traversing the vlink - the flipped variable. This is why
   * you see 'flipped' and '!flipped' passed to find_best_link() below.
   */

275 276 277 278 279 280
  // 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()) {
281
      SDEBUG(cerr << "    intraswitch: both are connected to " << *switch_it << endl);
282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
      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) {
308
        SDEBUG(cerr << "    intraswitch: finding first link" << endl;)
309 310
        // See note above
        if (!find_best_link(pv,*switch_it,vlink,first,!flipped,flipped)) {
311 312 313 314 315 316 317 318
          SDEBUG(cerr << "    intraswitch failed - no link first" <<
              endl;)
            // No link to this switch
            continue;
        }
      }

      if (second_link) {
319
        SDEBUG(cerr << "    intraswitch: finding second link (" <<  ")" << endl;)
320 321
        // See note above
        if (!find_best_link(dest_pv,*switch_it,vlink,second,flipped,!flipped)) {
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 355 356 357 358 359 360 361 362 363 364 365
          // 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);

366 367 368 369 370 371 372 373
      /*
       * Check to see if either, or both, pnodes are actually the
       * switches we are looking for
       */
      bool first_link, second_link;
      if ((pv == *source_switch_it) || (pv ==
            *dest_switch_it)) {
        first_link = false;
374
        SDEBUG(cerr << "    interswitch: not first link in a path" << endl);
375
      } else {
376
        SDEBUG(cerr << "    interswitch: *is* first link in a path" << endl);
377 378 379 380 381
        first_link = true;
      }
      if ((dest_pv == *source_switch_it) ||
          (dest_pv == *dest_switch_it)) {
        second_link = false;
382
        SDEBUG(cerr << "    interswitch: not second link in a path" << endl);
383
      } else {
384
        SDEBUG(cerr << "    interswitch: *is* second link in a path" << endl);
385 386
        second_link = true;
      }
387

388 389
      // Get link objects
      if (first_link) {
390 391
        // See note above
        if (!find_best_link(pv,*source_switch_it,vlink,first,!flipped,flipped)) {
392 393 394
            // No link to this switch
            SDEBUG(cerr << "    interswitch failed - no first link"
                << endl;)
395 396
              continue;
          }
397 398 399
      }

      if (second_link) {
400 401 402
        // See note above
        if (!find_best_link(dest_pv,*dest_switch_it,vlink,second,flipped,!flipped)) {
          // No link to this switch
403 404
          SDEBUG(cerr << "    interswitch failed - no second link" <<                                          endl;)
            continue;
405
        }
406 407 408 409 410 411 412
      }

      // For regular links, we just grab the vlink's bandwidth; for links
      // where we're matching the link speed to the 'native' one for the
      // interface, we have to look up interface speeds on both ends.
      int bandwidth;
      if (vlink->delay_info.adjust_to_native_bandwidth) {
413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446
          // Grab the actual plink objects for both pedges - it's possible for
          // one or both to be missing if we're linking directly to a switch
          // (as with a LAN)
          tb_plink *first_plink = NULL;
          tb_plink *second_plink = NULL;
          if (first_link) {
              first_plink = get(pedge_pmap,first);
          }
          if (second_link) {
              second_plink = get(pedge_pmap,second);
          }

          if (first_plink != NULL && second_plink != NULL) {
              // If both endpoints are not switches, we use the minimum
              // bandwidth
              bandwidth = min(first_plink->delay_info.bandwidth,
                      second_plink->delay_info.bandwidth);
          } else if (first_plink == NULL) {
              // If one end is a switch, use the bandwidth from the other
              // end
              bandwidth = second_plink->delay_info.bandwidth;
          } else if (second_plink == NULL) {
              bandwidth = first_plink->delay_info.bandwidth;
          } else {
              // Both endpoints are switches! (eg. this might be a link between
              // two LANs): It is not at all clear what the right semantics
              // for this would be, and unfortunately, we can't catch this
              // earlier. So, exiting with an error is crappy, but it's
              // unlikely to happen in our regular use, and it's the best we
              // can do.
              cerr << "*** Using bandwidth adjustment on virutal links " <<
                      "between switches not allowed " << endl;
              exit(EXIT_FATAL);
          }
447
      } else {
448
          // If not auto-adjusting, just use the specified bandwidth
449 450
          bandwidth = vlink->delay_info.bandwidth;
      }
451

452 453 454 455
      // Find a path on the switch fabric between these two switches
      if (find_interswitch_path(*source_switch_it,*dest_switch_it,bandwidth,
            info.plinks, info.switches) != 0) {
        // Okay, we found a real resolution!
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 498 499 500 501
        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:
502 503
	default:
	    // These shouldn't be passed in: fall through to below and die
504 505
	break;
    }
506 507 508
    
    cerr << "*** Internal error: Should not be here. (resolution_cost)" << endl;
    exit(EXIT_FATAL);
509 510 511 512 513 514
}

/*
 * Mark a vlink as unassigned
 */
void mark_vlink_unassigned(tb_vlink *vlink) {
515 516
    SDEBUG(cerr << "    marking " << vlink->name << " unassigned" << endl;)
    assert(!vlink->no_connection);
517 518 519 520 521 522 523
    SADD(SCORE_NO_CONNECTION);
    vlink->no_connection=true;
    vinfo.no_connection++;
    vlink->link_info.type_used = tb_link_info::LINK_UNMAPPED;
    violated++;
}

524 525 526 527 528 529 530 531 532 533 534 535
/*
 * Mark a vlink as assigned: fix up violations
 */
void mark_vlink_assigned(tb_vlink *vlink) {
    SDEBUG(cerr << "    marking " << vlink->name << " assigned" << endl;)
    assert(vlink->no_connection);
    SSUB(SCORE_NO_CONNECTION);
    vlink->no_connection=false;
    vinfo.no_connection--;
    violated--;
}

536 537 538 539 540 541 542 543 544 545
/*
 * 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);
546
    SDEBUG(cerr << "  dest_vv is backwards" << endl);
547 548 549 550 551 552 553 554 555
  }

  /*
   * 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) {
556
    SDEBUG(cerr << "  vlink is flipped" << endl);
557
    flipped = true;
558
    assert(vlink->dst == vv);
559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
  }

  /*
   * 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!
587 588
         * Note: We can't get here when doing adjust_to_native_bandwidth,
         * since it's illegal to allow trivial links when it's in use.
589
         */
590 591 592 593
        SDEBUG(cerr << "    allowed" << endl;)
        if (vlink->no_connection) {
          mark_vlink_assigned(vlink);
        }
594 595
        score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
      } else {
596 597 598 599
        SDEBUG(cerr << "    not allowed" << endl;)
        if (!vlink->no_connection) {
          mark_vlink_unassigned(vlink);
        }
600 601 602 603 604 605 606 607
      }
    } else {
      //assert(resolution_index <= 1)
      resolution_vector resolutions;
      float total_weight = find_link_resolutions(resolutions, pv, dest_pv,
          vlink,pnode,dest_pnode,flipped);
      
      int n_resolutions = resolutions.size();
608
      //int resolution_index = n_resolutions - 1;
609 610 611 612 613 614 615
      int resolution_index = n_resolutions;
      
      /*
       * check for no link
       */
      if (resolution_index == 0) {
        SDEBUG(cerr << "  Could not find any resolutions" << endl;)
616 617
        if (!vlink->no_connection) {
            mark_vlink_unassigned(vlink);
618
        }
619
      } else {
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640
        /*
         * 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:
641
	      case tb_link_info::LINK_DELAYED:
642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676
                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
677 678 679
        /*
         * Make it so
         */
680 681 682
        vlink->link_info = resolutions[index];
        SDEBUG(cerr << "  choice:" << vlink->link_info);
        score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
683 684 685 686 687 688 689 690

        /*
         * Check to see if we are fixing a violation
         */
        if (vlink->no_connection) {
          SDEBUG(cerr << "  Fixing previous violations." << endl);
          mark_vlink_assigned(vlink);
        }
691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725
      }
    }
  }
}

/*
 * 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);
    }
  }
}

726 727 728 729
/* 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.
 */
730 731
void unscore_link_info(vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode, tb_vnode *src_vnode,
	tb_vnode *dst_vnode)
732 733
{
  tb_vlink *vlink = get(vedge_pmap,ve);
734 735 736

  // Handle vnodes that are not allowed to have a mix of trivial and
  // non-trivial links
737
  if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
738 739 740 741 742 743
      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
744
	  SSUB(SCORE_TRIVIAL_MIX);
745 746 747 748 749 750 751
	  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
752
	  SSUB(SCORE_TRIVIAL_MIX);
753 754 755
	  violated--;
	  vinfo.trivial_mix--;
      }
756
  } else if (vlink->link_info.type_used != tb_link_info::LINK_UNMAPPED) {
757 758 759 760 761 762
      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
763
	  SSUB(SCORE_TRIVIAL_MIX);
764 765 766 767 768 769 770
	  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
771
	  SSUB(SCORE_TRIVIAL_MIX);
772 773 774 775 776 777
	  violated--;
	  vinfo.trivial_mix--;
      }
  }

  // Unscore the link itself
778
  if (vlink->link_info.type_used == tb_link_info::LINK_DIRECT) {
779 780
    // DIRECT LINK
    SDEBUG(cerr << "   direct link" << endl);
781 782 783
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;

784
    SSUB(SCORE_DIRECT_LINK);
785 786
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    vlink->link_info.plinks.clear();
787
  } else if (vlink->link_info.type_used == tb_link_info::LINK_INTERSWITCH) {
788 789
    // INTERSWITCH LINK
    SDEBUG(cerr << "  interswitch link" << endl);
790 791
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
792 793 794 795
    
#ifndef INTERSWITCH_LENGTH
    SSUB(SCORE_INTERSWITCH_LINK);
#endif
796 797

    pedge_path &path = vlink->link_info.plinks;
798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819
    // 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);
      }
820 821
      // We count the bandwidth into and out of the switch
      the_switch->nontrivial_bw_used -= vlink->delay_info.bandwidth * 2;
822 823
    }
    vlink->link_info.switches.clear();
824
  } else if (vlink->link_info.type_used == tb_link_info::LINK_INTRASWITCH) {
825 826
    // INTRASWITCH LINK
    SDEBUG(cerr << "   intraswitch link" << endl);
827 828 829
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;

830 831 832 833 834 835 836
    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());
837 838
    // We count the bandwidth into and out of the switch
    the_switch->nontrivial_bw_used -= vlink->delay_info.bandwidth * 2;
839 840 841 842 843 844
    if (--the_switch->switch_used_links == 0) {
      SDEBUG(cerr << "  releasing switch" << endl);
      SSUB(SCORE_SWITCH);
    }
    vlink->link_info.switches.clear();
  }
845 846

#ifdef TRIVIAL_LINK_BW
847
  else if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
848
      // Trivial link - we may get to remove violations
Robert Ricci's avatar
Robert Ricci committed
849 850 851 852 853 854
      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;
855
	int old_bw = src_pnode->trivial_bw_used;
Robert Ricci's avatar
Robert Ricci committed
856 857 858 859 860
	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;
	}
861
        SDEBUG(cerr << "  old trivial bandwidth over by " << old_over_bw << endl);
Robert Ricci's avatar
Robert Ricci committed
862 863 864 865 866 867 868 869 870

	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;
	}
871
        SDEBUG(cerr << "  new trivial bandwidth over by " << new_over_bw << endl);
Robert Ricci's avatar
Robert Ricci committed
872 873

	if (old_over_bw) {
874
	  // Count how many multiples of the maximum bandwidth we're at
875 876 877 878 879
          int new_multiple = src_pnode->trivial_bw_used / src_pnode->trivial_bw;
          int old_multiple = old_bw / src_pnode->trivial_bw;
	  int num_violations = old_multiple - new_multiple;
          SDEBUG(cerr << "  removing " << num_violations <<
                 " violations for trivial bandwidth" << endl);
880 881
	  violated -= num_violations;
	  vinfo.bandwidth -= num_violations;
Robert Ricci's avatar
Robert Ricci committed
882 883 884 885
	  double removed_bandwidth_percent = (old_over_bw - new_over_bw) * 1.0 /
	    src_pnode->trivial_bw;
	  SSUB(SCORE_TRIVIAL_PENALTY * removed_bandwidth_percent);
	}
886
      }
Robert Ricci's avatar
Robert Ricci committed
887

888 889 890
      unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
  }
#endif
891

892 893 894 895 896
  // If auto-adjusting the vlink bandwidth, we set it to a sentinel value
  // so that we can detect any problems next time we do a score_link_info()
  if (vlink->delay_info.adjust_to_native_bandwidth) {
      vlink->delay_info.bandwidth = -2;
  }
897

898
}
899

Mac Newbold's avatar
Mac Newbold committed
900 901
/*
 * This removes a virtual node from the assignments, adjusting
902 903
 * the score appropriately.
 */
904
void remove_node(vvertex vv)
Mac Newbold's avatar
Mac Newbold committed
905
{
906
  // Find the vnode associated with the vvertex, and the pnode it's assigned to
907 908 909 910 911 912 913 914 915 916
  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
917 918 919 920
#endif

  assert(pnode != NULL);

921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939
  /* 
   * 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;
  }
 

940 941 942
  /*
   * Clean up the pnode's state
   */
943
  if (!tr->is_static()) {
944 945 946
    if (pnode->my_class) {
      pclass_unset(pnode);
    }
947
  }
948

949
  // pclass
950
  if ((!disable_pclasses) && !(tr->is_static()) && pnode->my_class
951
	  && (pnode->my_class->used_members == 0)) {
952
    SDEBUG(cerr << "  freeing pclass" << endl);
953 954
    SSUB(SCORE_PCLASS);
  }
955 956

  // vclass
957 958 959
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->unassign_node(vnode->type);
    SDEBUG(cerr << "  vclass unassign " << score_delta << endl);
960 961 962 963 964 965 966
    
    if (score_delta <= -1) {
      violated--;
      vinfo.vclass--;
    }
    SSUB(-score_delta*SCORE_VCLASS);
  }
967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999

  /*
   * 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--;
	      }
	  }
      }
  }

1000 1001 1002
  /*
   * Now, take care of the virtual links that are attached to the vnode
   */
1003 1004
  voedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = out_edges(vv,VG);
1005
  hash_set<const tb_vlink*, hashptr<const tb_vlink*> > seen_loopback_links;
1006 1007
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    tb_vlink *vlink = get(vedge_pmap,*vedge_it);
1008 1009 1010

    // Find the other end of the vlink - we might be either its source or
    // destination (target)
1011 1012 1013 1014 1015 1016
    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);

1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
    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);
      }
    }

1028

1029 1030
    // Only unscore the link if the vnode on the other end is assigned - this
    // way, only the first end to be unmapped causes unscoring
1031 1032 1033
    if (! dest_vnode->assigned) {
      continue;
    }
1034
    
1035
    // Find the pnode on the ther end of the link, and unscore it!
1036 1037
    pvertex dest_pv = dest_vnode->assignment;
    tb_pnode *dest_pnode = get(pvertex_pmap,dest_pv);
1038
    unscore_link_info(*vedge_it,pnode,dest_pnode,vnode,dest_vnode);
1039 1040 1041 1042 1043 1044 1045
    
    // If the other end was connected before, it's not now
    if (!vlink->no_connection) {
      SDEBUG(cerr << "      link now in violation.\n";)
      mark_vlink_unassigned(vlink);
    }
    
1046
  }
1047 1048
 
#ifdef PENALIZE_UNUSED_INTERFACES
1049
  // Keep track of the number of interfaces that the pnode is using
1050 1051 1052 1053
  SSUB((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
  pnode->used_interfaces = 0;
#endif
 
1054 1055 1056
  /*
   * Adjust scores for the pnode
   */
1057 1058
  int old_load = tr->get_current_load();
  tr->remove_load(vnode->typecount);
1059
  pnode->total_load -= vnode->typecount;
1060
#ifdef LOAD_BALANCE
1061 1062
  // 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
1063 1064
  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)));
1065
#endif
1066
  if (pnode->total_load == 0) {
1067
    // If the pnode is now free, we need to do some cleanup
1068
    SDEBUG(cerr << "  releasing pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
1069
    SSUB(SCORE_PNODE);
1070
    pnode->remove_current_type();
1071
    pclass_reset_maps(pnode);
1072 1073 1074
    // ptypes
    tb_pnode::types_list::iterator lit = pnode->type_list.begin();
    while (lit != pnode->type_list.end()) {
1075 1076
	int removed_violations =
	    (*lit)->get_ptype()->remove_users((*lit)->get_max_load());
1077 1078 1079 1080 1081 1082 1083
	if (removed_violations) {
	    SSUB(SCORE_MAX_TYPES * removed_violations);
	    violated -= removed_violations;
	    vinfo.max_types -= removed_violations;
	}
	lit++;
    }
1084
  } else if (old_load > tr->get_max_load()) {
1085 1086 1087
    // 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 <<
1088 1089 1090 1091 1092
	    ", 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--) {
1093 1094 1095 1096
      SSUB(SCORE_PNODE_PENALTY);
      vinfo.pnode_load--;
      violated--;
    }
Mac Newbold's avatar
Mac Newbold committed
1097
  }
1098

Robert Ricci's avatar
Robert Ricci committed
1099 1100 1101 1102 1103 1104 1105 1106 1107
  /*
   * Score the fact that we now have one more unassigned vnode
   */
  vnode->assigned = false;
  SADD(SCORE_UNASSIGNED);
  vinfo.unassigned++;
  violated++;
  

1108 1109 1110
  /*
   * Scoring for features and desires
   */
1111 1112 1113 1114
  score_and_violations sv = score_fds(vnode,pnode,false);
  SSUB(sv.first);
  violated -= sv.second;
  vinfo.desires -= sv.second;
1115 1116

  SDEBUG(cerr << "  new score = " << score << " new violated = " << violated << endl);
1117 1118
}

1119 1120 1121
/* 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.
1122
 */
1123 1124
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode, tb_vnode *src_vnode,
	tb_vnode *dst_vnode)
1125
{
1126 1127
  tb_vlink *vlink = get(vedge_pmap,ve);
  tb_pnode *the_switch;
1128
  
1129 1130 1131 1132 1133 1134
  // If this link is to be adjusted to the native speed of the interface, go
  // ahead and do that now - we use the minimum of the two endpoint interfaces
  // Note! Not currently supported on trivial links! (it's illegal for
  // adjust_to_native_bandwidth and trivial_ok to both be true)
  if (vlink->delay_info.adjust_to_native_bandwidth &&
      vlink->link_info.type_used != tb_link_info::LINK_TRIVIAL) {
1135 1136 1137
    // Check for special sentinel value to make sure we remembered to re-set
    // the value before
    assert(vlink->delay_info.bandwidth == -2);
1138 1139 1140 1141 1142
    tb_plink *front_plink = get(pedge_pmap, vlink->link_info.plinks.front());
    tb_plink *back_plink = get(pedge_pmap, vlink->link_info.plinks.back());
    vlink->delay_info.bandwidth =
      min(front_plink->delay_info.bandwidth, back_plink->delay_info.bandwidth);
  }
1143
  
1144
  switch (vlink->link_info.type_used) {
1145 1146
  case tb_link_info::LINK_DIRECT:
    SADD(SCORE_DIRECT_LINK);
1147 1148
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1149 1150 1151 1152
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    break;
  case tb_link_info::LINK_INTRASWITCH:
    SADD(SCORE_INTRASWITCH_LINK);
1153 1154
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1155 1156 1157 1158 1159 1160 1161 1162
    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);
    }
1163 1164
    // We count the bandwidth into and out of the switch
    the_switch->nontrivial_bw_used += vlink->delay_info.bandwidth * 2;
1165 1166
    break;
  case tb_link_info::LINK_INTERSWITCH:
1167 1168
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185
#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
1186

1187 1188 1189 1190 1191 1192 1193
    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);
      }
1194 1195
      // We count the bandwidth into and out of the switch
      the_switch->nontrivial_bw_used += vlink->delay_info.bandwidth * 2;
1196 1197 1198
    }
    break;
  case tb_link_info::LINK_TRIVIAL:
1199
  #ifdef TRIVIAL_LINK_BW
Robert Ricci's avatar
Robert Ricci committed
1200 1201 1202 1203 1204 1205
    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;
1206
      int old_bw = src_pnode->trivial_bw_used;
Robert Ricci's avatar
Robert Ricci committed
1207 1208 1209 1210 1211
      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;
      }
1212
      SDEBUG(cerr << "  old trivial bandwidth over by " << old_over_bw << endl);
Robert Ricci's avatar
Robert Ricci committed
1213

1214
      dst_pnode->trivial_bw_used += vlink->delay_info.bandwidth;
Robert Ricci's avatar
Robert Ricci committed
1215 1216 1217 1218 1219 1220 1221

      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;
      }
1222
      SDEBUG(cerr << "  new trivial bandwidth over by " << new_over_bw << endl);
Robert Ricci's avatar
Robert Ricci committed
1223 1224
	
      if (new_over_bw) {
1225
	// Count how many multiples of the maximum bandwidth we're at
1226 1227 1228 1229 1230
        int new_multiple = src_pnode->trivial_bw_used / src_pnode->trivial_bw;
        int old_multiple = old_bw / src_pnode->trivial_bw;
	int num_violations = new_multiple - old_multiple;
        SDEBUG(cerr << "  adding " << num_violations <<
               " violations for trivial bandwidth" << endl);
1231 1232 1233
	violated += num_violations;
	vinfo.bandwidth += num_violations;

Robert Ricci's avatar
Robert Ricci committed
1234 1235 1236
	double added_bandwidth_percent = (new_over_bw - old_over_bw) * 1.0 /
	  src_pnode->trivial_bw;
	SADD(SCORE_TRIVIAL_PENALTY * added_bandwidth_percent);
1237 1238 1239 1240
      }
    }
    break;
#endif
1241
  case tb_link_info::LINK_UNMAPPED:
1242
  case tb_link_info::LINK_DELAYED:
1243
    cout << "*** Internal error: Should not be here either." << endl;
1244
    exit(EXIT_FATAL);
1245
    break;
1246
  }
1247 1248 1249

  // Handle vnodes that are not allowed to have a mix of trivial and
  // non-trivial links
1250
  if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
1251 1252 1253 1254 1255 1256
      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
1257
	  SADD(SCORE_TRIVIAL_MIX);
1258 1259 1260 1261 1262 1263 1264
	  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
1265
	  SADD(SCORE_TRIVIAL_MIX);
1266 1267 1268 1269 1270 1271 1272 1273 1274 1275
	  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
1276
	  SADD(SCORE_TRIVIAL_MIX);
1277 1278 1279 1280 1281 1282 1283
	  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
1284
	  SADD(SCORE_TRIVIAL_MIX);
1285 1286 1287 1288 1289
	  violated++;
	  vinfo.trivial_mix++;
      }
  }

1290 1291 1292 1293 1294 1295 1296 1297 1298
}

/*
 * 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.
 */
1299
int add_node(vvertex vv,pvertex pv, bool deterministic, bool is_fixed, bool skip_links)
1300
{
1301
  // Get the vnode and pnode associated with the passed vertices
1302 1303
  tb_vnode *vnode = get(vvertex_pmap,vv);
  tb_pnode *pnode = get(pvertex_pmap,pv);
1304

1305 1306 1307 1308 1309 1310 1311
  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
1312
#endif
1313
  SDEBUG(cerr << "  vnode type = " << vnode->type << endl);
Mac Newbold's avatar
Mac Newbold committed
1314
  
1315
  /*
1316 1317 1318 1319
   * 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.
1320
   */
1321 1322
  tb_pnode::type_record *tr;
  tb_pnode::types_map::iterator mit = pnode->types.find(vnode->type);
1323

1324 1325 1326 1327 1328 1329
  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;
  }

1330 1331 1332
  /*
   * Handle types
   */
1333
  tr = mit->second;
1334
  if (tr->is_static()) {
1335
    // XXX: Scoring???
1336
    if (tr->get_current_load() < tr->get_max_load()) {
1337
    } else {
Mac Newbold's avatar
Mac Newbold committed
1338 1339 1340
      return 1;
    }
  } else {
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352
    // 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
1353 1354
	return 1;
      }
1355 1356

      SDEBUG(cerr << "  matching type found (" << pnode->current_type <<
1357 1358
	  ", max = " << pnode->current_type_record->get_max_load() << ")" <<
          endl);
1359 1360 1361 1362 1363 1364 1365 1366 1367 1368
      } 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
1369 1370
    }

1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402
  /*
   * 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++;
	      }
	  }
      }
  }

1403 1404 1405 1406
#ifdef PENALIZE_UNUSED_INTERFACES
  pnode->used_interfaces = 0;
#endif
 
1407 1408 1409 1410 1411 1412
  /*
   * Record the node's assignment. Need to do this now so that 'loopback' links
   * work below.
   */
  vnode->assignment = pv;
  vnode->assigned = true;
1413

1414 1415 1416
  /* Links */
  if (!skip_links) {
      resolve_links(vv,pv,vnode,pnode,deterministic);
Mac Newbold's avatar
Mac Newbold committed
1417
  }