score.cc 68.2 KB
Newer Older
Robert Ricci's avatar
Robert Ricci committed
1
/*
Robert Ricci's avatar
Robert Ricci committed
2
 * Copyright (c) 2000-2010 University of Utah and the Flux Group.
3
 *
4
 * {{{EMULAB-LICENSE
5
 *
6
 * This file is part of the Emulab network testbed software.
7
 *
8 9 10 11
 * This file is free software: you can redistribute it and/or modify it
 * under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or (at
 * your option) any later version.
12
 *
13 14 15 16
 * This file is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Affero General Public
 * License for more details.
17
 *
18 19
 * You should have received a copy of the GNU Affero General Public License
 * along with this file.  If not, see <http://www.gnu.org/licenses/>.
20
 *
21
 * }}}
Robert Ricci's avatar
Robert Ricci committed
22 23
 */

24
static const char rcsid[] = "$Id: score.cc,v 1.69 2009-12-09 22:53:44 ricci Exp $";
25

26
#include "port.h"
27

28
#include <iostream>
29 30 31 32
#include <float.h>

#include <boost/config.hpp>
#include <boost/utility.hpp>
33
#include BOOST_PMAP_HEADER
34 35 36 37
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>

using namespace boost;
38 39

#include "common.h"
40
#include "vclass.h"
41
#include "delay.h"
42
#include "physical.h"
43
#include "virtual.h"
44 45
#include "pclass.h"
#include "score.h"
46
#include "featuredesire.h"
47

48
#include "math.h"
49

50
extern switch_pred_map_map switch_preds;
51

52
extern bool disable_pclasses;
53 54
extern bool strategy_balance;
extern bool strategy_pack;
55
extern bool scoring_type_violation;
56

57
double score;			// The score of the current mapping
58 59 60 61 62
int violated;			// How many times the restrictions
				// have been violated.

violated_info vinfo;		// specific info on violations

63
extern tb_vgraph VG;		// virtual graph
64
extern tb_pgraph PG;		// physical grpaph
65
extern tb_sgraph SG;		// switch fabric
66

67 68
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);
69
bool find_best_link(pvertex pv,pvertex switch_pv,tb_vlink *vlink,
70
                    pedge &out_edge, bool check_src_iface,
71
                    bool check_dst_iface);
72 73 74
int find_interswitch_path(pvertex src_pv,pvertex dest_pv,
			  int bandwidth,pedge_path &out_path,
			  pvertex_list &out_switches);
75 76
score_and_violations score_fds(tb_vnode *vnode, tb_pnode *pnode, bool add);

77 78 79 80
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);
81 82 83 84

#ifdef FIX_PLINK_ENDPOINTS
void score_link_endpoints(pedge pe);
#endif
85 86

#ifdef SCORE_DEBUG_MORE
87 88
#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
89 90 91 92 93
#else
#define SADD(amount) score += amount
#define SSUB(amount) score -= amount
#endif

94 95 96 97
// 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

98 99 100 101 102 103
#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

104
#ifdef SCORE_DEBUG
105 106 107
#ifdef SCORE_DEBUG_MAX
#define SDEBUG(a) if (scoredebugcount++ < SCORE_DEBUG_MAX) { a; }
#else
108
#define SDEBUG(a) a
109
#endif
110
#else
111
#define SDEBUG(a)
112 113
#endif

114 115 116
#define MIN(a,b) (((a) < (b))? (a) : (b))
#define MAX(a,b) (((a) > (b))? (a) : (b))

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 156 157 158 159 160 161 162
/*
 * '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;

163 164 165 166
/*
 * score()
 * Returns the score.
 */
167
double get_score() {return score;}
168 169 170 171 172 173 174 175

/*
 * init_score()
 * This initialized the scoring system.  It also clears all
 * assignments.
 */
void init_score()
{
176
  SDEBUG(cerr << "SCORE: Initializing" << endl);
177 178 179
  score=0;
  violated=0;

180 181 182 183 184
  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;
185 186 187 188
    SADD(SCORE_UNASSIGNED);
    vinfo.unassigned++;
    violated++;
  }
189 190 191 192
  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);
193 194 195 196 197
    SADD(SCORE_NO_CONNECTION);
    vlink->no_connection=true;
    vinfo.no_connection++;
    vlink->link_info.type_used = tb_link_info::LINK_UNMAPPED;
    violated++;
198
  }
199 200
  pvertex_iterator pvertex_it,end_pvertex_it;
  tie(pvertex_it,end_pvertex_it) = vertices(PG);
201
  /*
202 203 204 205 206 207
  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;
208
  }
209
  */
210 211 212 213 214 215 216
  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;
217 218
  }

219
  SDEBUG(cerr << "  score=" << score << " violated=" << violated << endl);
220
}
221

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

  /*
   * 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.
   */

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

      if (second_link) {
326
        SDEBUG(cerr << "    intraswitch: finding second link (" <<  ")" << endl;)
327 328
        // See note above
        if (!find_best_link(dest_pv,*switch_it,vlink,second,flipped,!flipped)) {
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
          // 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);
357

358 359 360 361 362
      total_weight += LINK_RESOLVE_INTRASWITCH;
      SDEBUG(cerr << "    intraswitch " << first << " and " << second
          <<                     endl);
    }
  }
363 364 365 366 367 368 369

  // If we're not allowed to use interswitch links for this vlink, just
  // skip all of the attempts to find interswitch links
  if (!vlink->allow_interswitch){
      // Bad Rob, no GOTO
      goto skip_interswitch_links;
  }
370 371 372 373 374 375 376 377 378 379
  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);

380 381 382 383 384 385 386 387
      /*
       * 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;
388
        SDEBUG(cerr << "    interswitch: not first link in a path" << endl);
389
      } else {
390
        SDEBUG(cerr << "    interswitch: *is* first link in a path" << endl);
391 392 393 394 395
        first_link = true;
      }
      if ((dest_pv == *source_switch_it) ||
          (dest_pv == *dest_switch_it)) {
        second_link = false;
396
        SDEBUG(cerr << "    interswitch: not second link in a path" << endl);
397
      } else {
398
        SDEBUG(cerr << "    interswitch: *is* second link in a path" << endl);
399 400
        second_link = true;
      }
401

402 403
      // Get link objects
      if (first_link) {
404 405
        // See note above
        if (!find_best_link(pv,*source_switch_it,vlink,first,!flipped,flipped)) {
406 407 408
            // No link to this switch
            SDEBUG(cerr << "    interswitch failed - no first link"
                << endl;)
409 410
              continue;
          }
411 412 413
      }

      if (second_link) {
414 415 416
        // See note above
        if (!find_best_link(dest_pv,*dest_switch_it,vlink,second,flipped,!flipped)) {
          // No link to this switch
417 418
          SDEBUG(cerr << "    interswitch failed - no second link" <<                                          endl;)
            continue;
419
        }
420 421 422 423 424 425 426
      }

      // 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) {
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
          // 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);
          }
461
      } else {
462
          // If not auto-adjusting, just use the specified bandwidth
463 464
          bandwidth = vlink->delay_info.bandwidth;
      }
465

466 467 468 469
      // 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!
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
        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";)
      }
    }
  }
497

498 499
skip_interswitch_links:

500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517
  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:
518 519
	default:
	    // These shouldn't be passed in: fall through to below and die
520 521
	break;
    }
522

523 524
    cerr << "*** Internal error: Should not be here. (resolution_cost)" << endl;
    exit(EXIT_FATAL);
525 526 527 528 529 530
}

/*
 * Mark a vlink as unassigned
 */
void mark_vlink_unassigned(tb_vlink *vlink) {
531 532
    SDEBUG(cerr << "    marking " << vlink->name << " unassigned" << endl;)
    assert(!vlink->no_connection);
533 534 535 536 537 538 539
    SADD(SCORE_NO_CONNECTION);
    vlink->no_connection=true;
    vinfo.no_connection++;
    vlink->link_info.type_used = tb_link_info::LINK_UNMAPPED;
    violated++;
}

540 541 542 543 544 545 546 547 548 549 550 551
/*
 * 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--;
}

552 553 554 555 556 557 558 559 560 561
/*
 * 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);
562
    SDEBUG(cerr << "  dest_vv is backwards" << endl);
563 564 565 566 567 568 569 570 571
  }

  /*
   * 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) {
572
    SDEBUG(cerr << "  vlink is flipped" << endl);
573
    flipped = true;
574
    assert(vlink->dst == vv);
575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594
  }

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

596 597 598 599 600 601 602
      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!
603 604
         * 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.
605
         */
606 607 608 609
        SDEBUG(cerr << "    allowed" << endl;)
        if (vlink->no_connection) {
          mark_vlink_assigned(vlink);
        }
610 611
        score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
      } else {
612 613 614 615
        SDEBUG(cerr << "    not allowed" << endl;)
        if (!vlink->no_connection) {
          mark_vlink_unassigned(vlink);
        }
616 617 618 619 620 621
      }
    } else {
      //assert(resolution_index <= 1)
      resolution_vector resolutions;
      float total_weight = find_link_resolutions(resolutions, pv, dest_pv,
          vlink,pnode,dest_pnode,flipped);
622

623
      int n_resolutions = resolutions.size();
624
      //int resolution_index = n_resolutions - 1;
625
      int resolution_index = n_resolutions;
626

627 628 629 630 631
      /*
       * check for no link
       */
      if (resolution_index == 0) {
        SDEBUG(cerr << "  Could not find any resolutions" << endl;)
632 633
        if (!vlink->no_connection) {
            mark_vlink_unassigned(vlink);
634
        }
635
      } else {
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656
        /*
         * 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:
657
	      case tb_link_info::LINK_DELAYED:
658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692
                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
693 694 695
        /*
         * Make it so
         */
696 697 698
        vlink->link_info = resolutions[index];
        SDEBUG(cerr << "  choice:" << vlink->link_info);
        score_link_info(edge,pnode,dest_pnode,vnode,dest_vnode);
699 700 701 702 703 704 705 706

        /*
         * Check to see if we are fixing a violation
         */
        if (vlink->no_connection) {
          SDEBUG(cerr << "  Fixing previous violations." << endl);
          mark_vlink_assigned(vlink);
        }
707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735
      }
    }
  }
}

/*
 * 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 {
736
      seen_links.insert(vlink);
737 738 739 740 741
      resolve_link(vv,pv,vnode,pnode,deterministic,*vedge_it);
    }
  }
}

742 743 744 745
/* 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.
 */
746 747
void unscore_link_info(vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode, tb_vnode *src_vnode,
	tb_vnode *dst_vnode)
748 749
{
  tb_vlink *vlink = get(vedge_pmap,ve);
750 751 752

  // Handle vnodes that are not allowed to have a mix of trivial and
  // non-trivial links
753
  if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
754 755 756 757 758 759
      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
760
	  SSUB(SCORE_TRIVIAL_MIX);
761 762 763 764 765 766 767
	  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
768
	  SSUB(SCORE_TRIVIAL_MIX);
769 770 771
	  violated--;
	  vinfo.trivial_mix--;
      }
772
  } else if (vlink->link_info.type_used != tb_link_info::LINK_UNMAPPED) {
773 774 775 776 777 778
      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
779
	  SSUB(SCORE_TRIVIAL_MIX);
780 781 782 783 784 785 786
	  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
787
	  SSUB(SCORE_TRIVIAL_MIX);
788 789 790 791 792 793
	  violated--;
	  vinfo.trivial_mix--;
      }
  }

  // Unscore the link itself
794
  if (vlink->link_info.type_used == tb_link_info::LINK_DIRECT) {
795 796
    // DIRECT LINK
    SDEBUG(cerr << "   direct link" << endl);
797 798 799
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;

800
    SSUB(SCORE_DIRECT_LINK);
801 802
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    vlink->link_info.plinks.clear();
803
  } else if (vlink->link_info.type_used == tb_link_info::LINK_INTERSWITCH) {
804 805
    // INTERSWITCH LINK
    SDEBUG(cerr << "  interswitch link" << endl);
806 807
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
808

809 810 811
#ifndef INTERSWITCH_LENGTH
    SSUB(SCORE_INTERSWITCH_LINK);
#endif
812 813

    pedge_path &path = vlink->link_info.plinks;
814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835
    // 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);
      }
836 837
      // We count the bandwidth into and out of the switch
      the_switch->nontrivial_bw_used -= vlink->delay_info.bandwidth * 2;
838 839
    }
    vlink->link_info.switches.clear();
840
  } else if (vlink->link_info.type_used == tb_link_info::LINK_INTRASWITCH) {
841 842
    // INTRASWITCH LINK
    SDEBUG(cerr << "   intraswitch link" << endl);
843 844 845
    src_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used -= vlink->delay_info.bandwidth;

846
    SSUB(SCORE_INTRASWITCH_LINK);
847

848 849 850 851 852
    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());
853 854
    // We count the bandwidth into and out of the switch
    the_switch->nontrivial_bw_used -= vlink->delay_info.bandwidth * 2;
855 856 857 858 859 860
    if (--the_switch->switch_used_links == 0) {
      SDEBUG(cerr << "  releasing switch" << endl);
      SSUB(SCORE_SWITCH);
    }
    vlink->link_info.switches.clear();
  }
861 862

#ifdef TRIVIAL_LINK_BW
863
  else if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
864
      // Trivial link - we may get to remove violations
Robert Ricci's avatar
Robert Ricci committed
865 866 867 868 869 870
      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;
871
	int old_bw = src_pnode->trivial_bw_used;
Robert Ricci's avatar
Robert Ricci committed
872 873 874 875 876
	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;
	}
877
        SDEBUG(cerr << "  old trivial bandwidth over by " << old_over_bw << endl);
Robert Ricci's avatar
Robert Ricci committed
878 879 880 881 882 883 884 885 886

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

	if (old_over_bw) {
890
	  // Count how many multiples of the maximum bandwidth we're at
891 892 893 894 895
          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);
896 897
	  violated -= num_violations;
	  vinfo.bandwidth -= num_violations;
Robert Ricci's avatar
Robert Ricci committed
898 899 900 901
	  double removed_bandwidth_percent = (old_over_bw - new_over_bw) * 1.0 /
	    src_pnode->trivial_bw;
	  SSUB(SCORE_TRIVIAL_PENALTY * removed_bandwidth_percent);
	}
902
      }
Robert Ricci's avatar
Robert Ricci committed
903

904 905 906
      unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
  }
#endif
907

908 909 910 911 912
  // 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;
  }
913

914
}
915

916 917
/*
 * This removes a virtual node from the assignments, adjusting
918 919
 * the score appropriately.
 */
920
void remove_node(vvertex vv)
921
{
922
  // Find the vnode associated with the vvertex, and the pnode it's assigned to
923 924 925 926 927 928 929 930 931 932
  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;
933 934 935 936
#endif

  assert(pnode != NULL);

937
  /*
938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953
   * 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;
  }
954

955

956 957 958
  /*
   * Clean up the pnode's state
   */
959
  if (!tr->is_static()) {
960 961 962
    if (pnode->my_class) {
      pclass_unset(pnode);
    }
963
  }
964

965
  // pclass
966
  if ((!disable_pclasses) && !(tr->is_static()) && pnode->my_class
967
	  && (pnode->my_class->used_members == 0)) {
968
    SDEBUG(cerr << "  freeing pclass" << endl);
969
    SSUB(SCORE_PCLASS);
970 971 972
    if (scoring_type_violation) {
        vinfo.mult_types--;
    }
973
  }
974 975

  // vclass
976 977 978
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->unassign_node(vnode->type);
    SDEBUG(cerr << "  vclass unassign " << score_delta << endl);
979

980 981 982 983 984 985
    if (score_delta <= -1) {
      violated--;
      vinfo.vclass--;
    }
    SSUB(-score_delta*SCORE_VCLASS);
  }
986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018

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

1019 1020 1021
  /*
   * Now, take care of the virtual links that are attached to the vnode
   */
1022 1023
  voedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = out_edges(vv,VG);
1024
  hash_set<const tb_vlink*, hashptr<const tb_vlink*> > seen_loopback_links;
1025 1026
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    tb_vlink *vlink = get(vedge_pmap,*vedge_it);
1027 1028 1029

    // Find the other end of the vlink - we might be either its source or
    // destination (target)
1030 1031 1032 1033 1034 1035
    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);

1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
    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);
      }
    }

1047

1048 1049
    // Only unscore the link if the vnode on the other end is assigned - this
    // way, only the first end to be unmapped causes unscoring
1050 1051 1052
    if (! dest_vnode->assigned) {
      continue;
    }
1053

1054
    // Find the pnode on the ther end of the link, and unscore it!
1055 1056
    pvertex dest_pv = dest_vnode->assignment;
    tb_pnode *dest_pnode = get(pvertex_pmap,dest_pv);
1057
    unscore_link_info(*vedge_it,pnode,dest_pnode,vnode,dest_vnode);
1058

1059 1060 1061 1062 1063
    // 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);
    }
1064

1065
  }
1066

1067
#ifdef PENALIZE_UNUSED_INTERFACES
1068
  // Keep track of the number of interfaces that the pnode is using
1069 1070 1071
  SSUB((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
  pnode->used_interfaces = 0;
#endif
1072

1073 1074 1075
  /*
   * Adjust scores for the pnode
   */
1076 1077
  int old_load = tr->get_current_load();
  tr->remove_load(vnode->typecount);
1078
  pnode->total_load -= vnode->typecount;
1079 1080 1081 1082 1083 1084 1085
  if (strategy_balance) {
    // 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
    SSUB(SCORE_PNODE * (powf(1+ ((tr->get_current_load()+1) * 1.0)/tr->get_max_load(),2)));
    SADD(SCORE_PNODE * (powf(1+ tr->get_current_load() * 1.0/tr->get_max_load(),2)));
  }
  if (strategy_pack) {
1086 1087 1088 1089 1090 1091 1092 1093 1094
    // Inverse of strategy_balance - note that we have to make sure to not let
    // the number drop below zero (which might happen if allow_overload is set)
    int leftover_slots = tr->get_max_load() - tr->get_current_load();
    int prev_leftover_slots = tr->get_max_load() - (tr->get_current_load()+1);
    if (prev_leftover_slots < 0) { prev_leftover_slots = 0; }
    if (leftover_slots < 0) { leftover_slots = 0; }

    SSUB(SCORE_PNODE * (powf((prev_leftover_slots * 1.0)/tr->get_max_load(),0.5)));
    SADD(SCORE_PNODE * (powf((leftover_slots * 1.0)/tr->get_max_load(),0.5)));
1095
  }
1096
  if (pnode->total_load == 0) {
1097
    // If the pnode is now free, we need to do some cleanup
1098
    SDEBUG(cerr << "  releasing pnode" << endl);
1099
    SSUB(SCORE_PNODE);
1100
    pnode->remove_current_type();
1101
    pclass_reset_maps(pnode);
1102 1103 1104
    // ptypes
    tb_pnode::types_list::iterator lit = pnode->type_list.begin();
    while (lit != pnode->type_list.end()) {
1105 1106
	int removed_violations =
	    (*lit)->get_ptype()->remove_users((*lit)->get_max_load());
1107 1108 1109 1110 1111 1112 1113
	if (removed_violations) {
	    SSUB(SCORE_MAX_TYPES * removed_violations);
	    violated -= removed_violations;
	    vinfo.max_types -= removed_violations;
	}
	lit++;
    }
1114
  } else if (old_load > tr->get_max_load()) {
1115 1116 1117
    // 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 <<
1118 1119 1120 1121 1122
	    ", 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--) {
1123 1124 1125 1126
      SSUB(SCORE_PNODE_PENALTY);
      vinfo.pnode_load--;
      violated--;
    }
1127
  }
1128

1129 1130 1131 1132 1133 1134 1135
  /*
   * Score the fact that we now have one more unassigned vnode
   */
  vnode->assigned = false;
  SADD(SCORE_UNASSIGNED);
  vinfo.unassigned++;
  violated++;
1136

1137

1138 1139 1140
  /*
   * Scoring for features and desires
   */
1141 1142 1143 1144
  score_and_violations sv = score_fds(vnode,pnode,false);
  SSUB(sv.first);
  violated -= sv.second;
  vinfo.desires -= sv.second;
1145 1146

  SDEBUG(cerr << "  new score = " << score << " new violated = " << violated << endl);
1147 1148
}

1149 1150 1151
/* 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.
1152
 */
1153 1154
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode, tb_vnode *src_vnode,
	tb_vnode *dst_vnode)
1155
{
1156 1157
  tb_vlink *vlink = get(vedge_pmap,ve);
  tb_pnode *the_switch;
1158

1159 1160 1161 1162 1163 1164
  // 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) {
1165 1166 1167
    // Check for special sentinel value to make sure we remembered to re-set
    // the value before
    assert(vlink->delay_info.bandwidth == -2);
1168 1169 1170 1171 1172
    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);
  }
1173

1174
  switch (vlink->link_info.type_used) {
1175 1176
  case tb_link_info::LINK_DIRECT:
    SADD(SCORE_DIRECT_LINK);
1177 1178
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1179 1180 1181 1182
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    break;
  case tb_link_info::LINK_INTRASWITCH:
    SADD(SCORE_INTRASWITCH_LINK);
1183 1184
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1185 1186 1187 1188 1189 1190 1191 1192
    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);
    }
1193 1194
    // We count the bandwidth into and out of the switch
    the_switch->nontrivial_bw_used += vlink->delay_info.bandwidth * 2;
1195 1196
    break;
  case tb_link_info::LINK_INTERSWITCH:
1197 1198
    src_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
    dst_pnode->nontrivial_bw_used += vlink->delay_info.bandwidth;
1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215
#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
1216

1217 1218 1219 1220 1221 1222 1223
    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);
      }
1224 1225
      // We count the bandwidth into and out of the switch
      the_switch->nontrivial_bw_used += vlink->delay_info.bandwidth * 2;
1226 1227 1228
    }
    break;
  case tb_link_info::LINK_TRIVIAL:
1229
  #ifdef TRIVIAL_LINK_BW
Robert Ricci's avatar
Robert Ricci committed
1230 1231 1232 1233 1234 1235
    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;
1236
      int old_bw = src_pnode->trivial_bw_used;
Robert Ricci's avatar
Robert Ricci committed
1237 1238 1239 1240 1241
      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;
      }
1242
      SDEBUG(cerr << "  old trivial bandwidth over by " << old_over_bw << endl);
Robert Ricci's avatar
Robert Ricci committed
1243

1244
      dst_pnode->trivial_bw_used += vlink->delay_info.bandwidth;
Robert Ricci's avatar
Robert Ricci committed
1245 1246 1247 1248 1249 1250 1251

      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;
      }
1252
      SDEBUG(cerr << "  new trivial bandwidth over by " << new_over_bw << endl);
1253

Robert Ricci's avatar
Robert Ricci committed
1254
      if (new_over_bw) {
1255
	// Count how many multiples of the maximum bandwidth we're at
1256 1257 1258 1259 1260
        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);
1261 1262 1263
	violated += num_violations;
	vinfo.bandwidth += num_violations;

Robert Ricci's avatar
Robert Ricci committed
1264 1265 1266
	double added_bandwidth_percent = (new_over_bw - old_over_bw) * 1.0 /
	  src_pnode->trivial_bw;
	SADD(SCORE_TRIVIAL_PENALTY * added_bandwidth_percent);
1267 1268 1269 1270
      }
    }
    break;
#endif
1271
  case tb_link_info::LINK_UNMAPPED:
1272
  case tb_link_info::LINK_DELAYED:
1273
    cout << "*** Internal error: Should not be here either." << endl;
1274
    exit(EXIT_FATAL);
1275
    break;
1276
  }
1277 1278 1279

  // Handle vnodes that are not allowed to have a mix of trivial and
  // non-trivial links
1280
  if (vlink->link_info.type_used == tb_link_info::LINK_TRIVIAL) {
1281 1282 1283 1284 1285 1286
      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
1287
	  SADD(SCORE_TRIVIAL_MIX);
1288 1289 1290 1291 1292 1293 1294
	  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
1295
	  SADD(SCORE_TRIVIAL_MIX);
1296 1297 1298 1299 1300 1301 1302 1303 1304 1305
	  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
1306
	  SADD(SCORE_TRIVIAL_MIX);
1307 1308 1309 1310 1311 1312 1313
	  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
1314
	  SADD(SCORE_TRIVIAL_MIX);
1315 1316 1317 1318 1319
	  violated++;
	  vinfo.trivial_mix++;
      }
  }

1320 1321 1322 1323 1324 1325 1326 1327 1328
}

/*
 * 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.
 */
1329
int add_node(vvertex vv,pvertex pv, bool deterministic, bool is_fixed, bool skip_links)
1330
{
1331
  // Get the vnode and pnode associated with the passed vertices
1332 1333
  tb_vnode *vnode = get(vvertex_pmap,vv);
  tb_pnode *pnode = get(pvertex_pmap,pv);
1334

1335 1336 1337 1338 1339 1340 1341
  assert(!vnode->assigned);

  SDEBUG(cerr << "SCORE: add_node(" << vnode->name << "," <<
	 pnode->name << ")" << endl);
#ifdef SCORE_DEBUG_LOTS
  cerr << *vnode;
  cerr << *pnode;
1342
#endif
1343
  SDEBUG(cerr << "  vnode type = " << vnode->type << endl);
1344

1345
  /*
1346 1347 1348 1349
   * 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.
1350
   */
1351 1352
  tb_pnode::type_record *tr;
  tb_pnode::types_map::iterator mit = pnode->types.find(vnode->type);
1353

1354 1355 1356 1357 1358 1359
  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;
  }

1360 1361 1362
  /*
   * Handle types
   */
1363
  tr = mit->second;
1364
  if (tr->is_static()) {
1365
    // XXX: Scoring???
1366
    if (tr->get_current_load() < tr->get_max_load()) {
1367
    } else {
1368 1369 1370
      return 1;
    }
  } else {
1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382
    // 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;
1383 1384
	return 1;
      }
1385 1386

      SDEBUG(cerr << "  matching type found (" << pnode->current_type <<
1387 1388
	  ", max = " << pnode->current_type_record->get_max_load() << ")" <<
          endl);
1389 1390 1391 1392 1393 1394 1395 1396 1397 1398
      } 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);
	}
      }
1399 1400
    }

1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432
  /*
   * 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++;
	      }
	  }
      }
  }

1433 1434 1435
#ifdef PENALIZE_UNUSED_INTERFACES
  pnode->used_interfaces = 0;
#endif
1436

1437 1438 1439 1440 1441 1442
  /*
   * Record the node's assignment. Need to do this now so that 'loopback' links
   * work below.
   */
  vnode->assignment = pv;
  vnode->assigned = true;
1443

1444 1445 1446
  /* Links */
  if (!skip_links) {
      resolve_links(vv,pv,vnode,pnode,deterministic);
1447
  }
1448

1449
  int old_load = tr->get_current_load();
1450 1451
  int old_total_load = pnode->total_load;

1452
  // finish setting up pnode
1453
  tr->add_load(vnode->typecount);
1454
  pnode->total_load += vnode->typecount;
1455 1456

#ifdef PENALIZE_UNUSED_INTERFACES
1457
  // XXX
1458 1459
  assert(pnode->used_interfaces <= pnode->total_interfaces);
  SADD((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
1460
#endif
1461

1462
  if (tr->get_current_load() > tr->get_max_load()) {
1463
    SDEBUG(cerr << "  load too high - penalty (" <<
1464 1465 1466 1467
	pnode->current_type_record->get_current_load() << ")" << endl);
    for (int i = MAX(old_load,tr->get_max_load());
	 i < tr->get_current_load();
	 i++) {
1468 1469 1470 1471
      SADD(SCORE_PNODE_PENALTY);
      vinfo.pnode_load++;
      violated++;
    }
1472
  } else {
1473
    SDEBUG(cerr << "  load is fine" << endl);
1474
  }
1475
  if (old_total_load == 0) {
1476
    SDEBUG(cerr << "  new pnode" << endl);
1477
    SADD(SCORE_PNODE);
1478 1479 1480
    // ptypes
    tb_pnode::types_list::iterator lit = pnode->type_list.begin();
    while (lit != pnode->type_list.end()) {
1481
	int new_violations =
1482
	    (*lit)->get_ptype()->add_users((*lit)->get_max_load());
1483 1484 1485 1486 1487 1488 1489
	if (new_violations) {
	    SADD(SCORE_MAX_TYPES * new_violations);
	    violated += new_violations;
	    vinfo.max_types += new_violations;
	}
	lit++;
    }
1490
  }
1491 1492 1493 1494 1495 1496

  if (strategy_balance) {
    SSUB(SCORE_PNODE * (powf(1 + ((tr->get_current_load()-1) * 1.0)/tr->get_max_load(),2)));
    SADD(SCORE_PNODE * (powf(1 + ((tr->get_current_load()) * 1.0)/tr->get_max_load(),2)));
  }
  if (strategy_pack) {
1497 1498 1499 1500 1501 1502 1503 1504
    /* Note comment above about not letting drop below zero */
    int leftover_slots = tr->get_max_load() - tr->get_current_load();
    int prev_leftover_slots = tr->get_max_load() - (tr->get_current_load()-1);
    if (prev_leftover_slots < 0) { prev_leftover_slots = 0; }
    if (leftover_slots < 0) { leftover_slots = 0; }

    SSUB(