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

7

8
#include "port.h"
9

10
#include <iostream.h>
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
#include <float.h>

#include <hash_map>
#include <rope>
#include <queue>
#include <slist>
#include <hash_set>

#include <boost/config.hpp>
#include <boost/utility.hpp>
#include <boost/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>

using namespace boost;
Mac Newbold's avatar
Mac Newbold committed
26 27

#include "common.h"
28
#include "vclass.h"
29
#include "delay.h"
30
#include "physical.h"
31
#include "virtual.h"
Christopher Alfeld's avatar
 
Christopher Alfeld committed
32 33 34
#include "pclass.h"
#include "score.h"

35
#include "math.h"
Mac Newbold's avatar
Mac Newbold committed
36

37
extern switch_pred_map_map switch_preds;
38

39
extern bool disable_pclasses;
40

41
double score;			// The score of the current mapping
Mac Newbold's avatar
Mac Newbold committed
42 43 44 45 46
int violated;			// How many times the restrictions
				// have been violated.

violated_info vinfo;		// specific info on violations

47
extern tb_vgraph VG;		// virtual graph
Mac Newbold's avatar
Mac Newbold committed
48
extern tb_pgraph PG;		// physical grpaph
49
extern tb_sgraph SG;		// switch fabric
Mac Newbold's avatar
Mac Newbold committed
50

51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
bool direct_link(pvertex a,pvertex b,tb_vlink *vlink,pedge &edge);
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);
bool find_link_to_switch(pvertex pv,pvertex switch_pv,tb_vlink *vlink,
			 pedge &out_edge);
int find_interswitch_path(pvertex src_pv,pvertex dest_pv,
			  int bandwidth,pedge_path &out_path,
			  pvertex_list &out_switches);
double fd_score(tb_vnode *vnode,tb_pnode *pnoder,int &out_fd_violated);
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode);
void unscore_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode);

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

#ifdef SCORE_DEBUG_MORE
68 69
#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
70 71 72 73 74
#else
#define SADD(amount) score += amount
#define SSUB(amount) score -= amount
#endif

75 76 77 78 79 80
#ifdef SCORE_DEBUG
#define SDEBUG(a) a
#else
#define SDEBUG(a)
#endif

Mac Newbold's avatar
Mac Newbold committed
81 82 83 84
/*
 * score()
 * Returns the score.
 */
85
double get_score() {return score;}
Mac Newbold's avatar
Mac Newbold committed
86 87 88 89 90 91 92 93

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

98 99 100 101 102
  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
103 104 105 106
    SADD(SCORE_UNASSIGNED);
    vinfo.unassigned++;
    violated++;
  }
107 108 109 110 111 112
  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);
    vlink->link_info.type=tb_link_info::LINK_UNKNOWN;
    vlink->no_connection=false;
Mac Newbold's avatar
Mac Newbold committed
113
  }
114 115
  pvertex_iterator pvertex_it,end_pvertex_it;
  tie(pvertex_it,end_pvertex_it) = vertices(PG);
116
  /*
117 118 119 120 121 122
  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
123
  }
124
  */
125 126 127 128 129 130 131
  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
132 133
  }

134
  SDEBUG(cerr << "  score=" << score << " violated=" << violated << endl);
135
}
136

137 138 139 140 141 142 143 144 145 146
/* 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.
 */
void unscore_link_info(vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode)
{
  tb_vlink *vlink = get(vedge_pmap,ve);
  if (vlink->link_info.type == tb_link_info::LINK_DIRECT) {
    // DIRECT LINK
    SDEBUG(cerr << "   direct link" << endl);
147
    SSUB(SCORE_DIRECT_LINK);
148 149 150 151 152 153 154 155 156
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    vlink->link_info.plinks.clear();
  } else if (vlink->link_info.type == tb_link_info::LINK_INTERSWITCH) {
    // INTERSWITCH LINK
    SDEBUG(cerr << "  interswitch link" << endl);
    
#ifndef INTERSWITCH_LENGTH
    SSUB(SCORE_INTERSWITCH_LINK);
#endif
157 158

    pedge_path &path = vlink->link_info.plinks;
159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198
    // 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);
      }
    }
    vlink->link_info.switches.clear();
  } else if (vlink->link_info.type == tb_link_info::LINK_INTRASWITCH) {
    // INTRASWITCH LINK
    SDEBUG(cerr << "   intraswitch link" << endl);
    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());
    if (--the_switch->switch_used_links == 0) {
      SDEBUG(cerr << "  releasing switch" << endl);
      SSUB(SCORE_SWITCH);
    }
    vlink->link_info.switches.clear();
  }
199 200 201 202 203 204 205 206 207 208 209 210 211 212

#ifdef TRIVIAL_LINK_BW
  else if (vlink->link_info.type == tb_link_info::LINK_TRIVIAL) {
      // Trivial link - we may get to remove violations
      if (src_pnode->trivial_bw &&
	      (src_pnode->trivial_bw_used > src_pnode->trivial_bw)) {
	  SSUB(SCORE_TRIVIAL_PENALTY);
	  vinfo.bandwidth--;
	  violated--;
      }
      src_pnode->trivial_bw_used -= vlink->delay_info.bandwidth;
      unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
  }
#endif
213
}
214

Mac Newbold's avatar
Mac Newbold committed
215 216
/*
 * This removes a virtual node from the assignments, adjusting
217 218
 * the score appropriately.
 */
219
void remove_node(vvertex vv)
Mac Newbold's avatar
Mac Newbold committed
220
{
221
  // Find the vnode associated with the vvertex, and the pnode it's assigned to
222 223 224 225 226 227 228 229 230 231
  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
232 233 234 235
#endif

  assert(pnode != NULL);

236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
  /* 
   * 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;
  }
 

255 256 257
  /*
   * Clean up the pnode's state
   */
258 259 260 261
  if (!tr->is_static) {
    if (pnode->my_class) {
      pclass_unset(pnode);
    }
262
  }
263

264 265
#ifdef SMART_UNMAP
  pnode->assigned_nodes.erase(vnode);
266
#endif
267 268

  // pclass
269
  if ((!disable_pclasses) && pnode->my_class && (pnode->my_class->used == 0)) {
270
    SDEBUG(cerr << "  freeing pclass" << endl);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
271 272
    SSUB(SCORE_PCLASS);
  }
273 274

  // vclass
275 276 277
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->unassign_node(vnode->type);
    SDEBUG(cerr << "  vclass unassign " << score_delta << endl);
278 279 280 281 282 283 284
    
    if (score_delta <= -1) {
      violated--;
      vinfo.vclass--;
    }
    SSUB(-score_delta*SCORE_VCLASS);
  }
Christopher Alfeld's avatar
 
Christopher Alfeld committed
285
  
286 287 288
  /*
   * Now, take care of the virtual links that are attached to the vnode
   */
289 290 291 292
  voedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = out_edges(vv,VG);
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    tb_vlink *vlink = get(vedge_pmap,*vedge_it);
293 294 295

    // Find the other end of the vlink - we might be either its source or
    // destination (target)
296 297 298 299 300 301
    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);

302 303
    // A 'not-connected' vlink only counts as a violation if both of its
    // endpoints are assigned
304 305 306 307 308 309
    if (vlink->no_connection) {
      SDEBUG(cerr << "  link no longer in violation.\n";)
      SSUB(SCORE_NO_CONNECTION);
      vlink->no_connection=false;
      vinfo.no_connection--;
      violated--;
310
    }
311
    
312 313
    // Only unscore the link if the vnode on the other end is assigned - this
    // way, only the first end to be unmapped causes unscoring
314 315 316 317 318 319 320
    if (! dest_vnode->assigned) {
      //cerr << "Skipping link unassignment, because " << dest_vnode->name
	//<< " is unassigned " << endl;
      continue;
    } else {
      //cerr << "Unassigning, " << dest_vnode->name << " is assigned " << endl;
    }
321
    
322
    // Find the pnode on the ther end of the link, and unscore it!
323 324 325
    pvertex dest_pv = dest_vnode->assignment;
    tb_pnode *dest_pnode = get(pvertex_pmap,dest_pv);
    unscore_link_info(*vedge_it,pnode,dest_pnode);
326
  }
327 328
 
#ifdef PENALIZE_UNUSED_INTERFACES
329
  // Keep track of the number of interfaces that the pnode is using
330 331 332 333
  SSUB((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
  pnode->used_interfaces = 0;
#endif
 
334 335 336
  /*
   * Adjust scores for the pnode
   */
337 338
  tr->current_load--;
  pnode->total_load--;
339
#ifdef LOAD_BALANCE
340 341
  // 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
342 343
  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)));
344
#endif
345

346
  if (pnode->total_load == 0) {
347
    // If the pnode is now free, we need to do some cleanup
348
    SDEBUG(cerr << "  releasing pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
349
    SSUB(SCORE_PNODE);
350 351
    pnode->remove_current_type();
  } else if (tr->current_load >= tr->max_load) {
352 353 354 355
    // If the pnode is still over its max load, reduce the penalty to adjust
    // for the new load.
    // XXX - This shouldn't ever happen, right? I don't think we can ever
    // over-assign to a pnode.
356 357 358
    SDEBUG(cerr << "  reducing penalty, new load=" <<
	pnode->current_type_record->current_load <<
	   " (>= " << pnode->current_type_record->max_load << ")" << endl);
Mac Newbold's avatar
Mac Newbold committed
359 360 361 362
    SSUB(SCORE_PNODE_PENALTY);
    vinfo.pnode_load--;
    violated--;
  }
363

364 365 366 367
  /*
   * Score the fact that we now have one more unassigned vnode
   */
  vnode->assigned = false;
Mac Newbold's avatar
Mac Newbold committed
368 369 370
  SADD(SCORE_UNASSIGNED);
  vinfo.unassigned++;
  violated++;
371

372 373 374
  /*
   * Scoring for features and desires
   */
Christopher Alfeld's avatar
 
Christopher Alfeld committed
375
  int fd_violated;
376
  double fds=fd_score(vnode,pnode,fd_violated);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
377 378 379
  SSUB(fds);
  violated -= fd_violated;
  vinfo.desires -= fd_violated;
380 381

  SDEBUG(cerr << "  new score = " << score << " new violated = " << violated << endl);
382 383
}

384 385 386
/* 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.
387
 */
388
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode)
389
{
390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425
  tb_vlink *vlink = get(vedge_pmap,ve);
  tb_pnode *the_switch;
  switch (vlink->link_info.type) {
  case tb_link_info::LINK_DIRECT:
    SADD(SCORE_DIRECT_LINK);
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    break;
  case tb_link_info::LINK_INTRASWITCH:
    SADD(SCORE_INTRASWITCH_LINK);
    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);
    }
    break;
  case tb_link_info::LINK_INTERSWITCH:
#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
426

427 428 429 430 431 432 433 434 435 436
    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);
      }
    }
    break;
  case tb_link_info::LINK_TRIVIAL:
437 438 439 440 441 442 443 444 445 446 447 448
  #ifdef TRIVIAL_LINK_BW
    if (dst_pnode->trivial_bw) {
      dst_pnode->trivial_bw_used += vlink->delay_info.bandwidth;
      if (dst_pnode->trivial_bw_used > dst_pnode->trivial_bw) {
	SADD(SCORE_TRIVIAL_PENALTY);
	vinfo.bandwidth++;
	violated++;
      }
    }
    break;
#endif
  case tb_link_info::LINK_UNKNOWN:
449 450 451
    cerr << "Internal error: Should not be here either." << endl;
    exit(1);
    break;
452
  }
453 454 455 456 457 458 459 460 461 462 463
}

/*
 * 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.
 */
int add_node(vvertex vv,pvertex pv, bool deterministic)
{
464
  // Get the vnode and pnode associated with the passed vertices
465 466
  tb_vnode *vnode = get(vvertex_pmap,vv);
  tb_pnode *pnode = get(pvertex_pmap,pv);
467

468 469 470 471 472 473 474
  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
475
#endif
476
  SDEBUG(cerr << "  vnode type = " << vnode->type << endl);
Mac Newbold's avatar
Mac Newbold committed
477
  
478
  /*
479 480 481 482
   * 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.
483
   */
484 485
  tb_pnode::type_record *tr;
  tb_pnode::types_map::iterator mit = pnode->types.find(vnode->type);
486

487 488 489 490 491 492 493 494 495 496 497
  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;
  }

  tr = mit->second;
  if (tr->is_static) {
    // XXX: Scoring???
    if (tr->current_load < tr->max_load) {
    } else {
Mac Newbold's avatar
Mac Newbold committed
498 499 500
      return 1;
    }
  } else {
501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517
    // 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)) {
	//    pnode->max_load=0;
	//   if (pnode->types.find(vnode->type) != pnode->types.end()) {
	//    pnode->max_load = pnode->types[vnode->type];
	// }
	//if (pnode->max_load == 0) {
	// 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
518 519
	return 1;
      }
520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547

      //    pnode->current_type=vnode->type;
      //    pnode->typed=true;

      SDEBUG(cerr << "  matching type found (" << pnode->current_type <<
	  ", max = " << pnode->current_type_record->max_load << ")" << endl);
      } 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);
	  if (pnode->current_type_record->current_load
	      == pnode->current_type_record->max_load) {
	    /* XXX - We could ignore this check and let the code
	       at the end of the routine penalize for going over
	       load.  Failing here seems to work better though. */

	    // XXX is this a bug?  do we need to revert the pnode/vnode to
	    // it's initial state.
	    SDEBUG(cerr << "  node is full" << endl);
	    cerr << "  node is full" << endl;
	    return 1;
	  }
	}
      }
Mac Newbold's avatar
Mac Newbold committed
548 549
    }

550 551 552 553 554 555 556 557
#ifdef PENALIZE_UNUSED_INTERFACES
  pnode->used_interfaces = 0;
#endif
 
#ifdef SMART_UNMAP
  pnode->assigned_nodes.insert(vnode);
#endif
 
558 559 560 561
  /*
   * Assign any links on the vnode that can now be assigned (due to the other
   * end of the link also being assigned)
   */
562 563 564 565 566 567
  voedge_iterator vedge_it,end_vedge_it;
  tie(vedge_it,end_vedge_it) = out_edges(vv,VG);	    
  for (;vedge_it!=end_vedge_it;++vedge_it) {
    tb_vlink *vlink = get(vedge_pmap,*vedge_it);
    vvertex dest_vv = target(*vedge_it,VG);

568
    if (dest_vv == vv) {
569
      dest_vv = source(*vedge_it,VG);
570 571
    }

572 573 574 575 576 577 578
    bool flipped = false; // 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
    
    if (vlink->src != vv) {
	flipped = true;
    }
579

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

584 585
    // If the other end of the link is assigned, we can go ahead and try to
    // find a home for the link itself
586 587 588 589 590 591 592 593
    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);
594
	if (allow_trivial_links && vlink->allow_trivial) {
595
	    vlink->link_info.type = tb_link_info::LINK_TRIVIAL;
596 597 598 599
	    // XXX - okay, this is really bad, but score_link_info doesn't
	    // usually get called for trivial links, and letting them fall
	    // through into the 'normal' link code below is disatrous!
	    score_link_info(*vedge_it,pnode,dest_pnode);
600 601 602 603 604
	} else {
	    SADD(SCORE_NO_CONNECTION);
	    vlink->no_connection=true;
	    vinfo.no_connection++;
	    violated++;
605
	}
606
      } else {
607 608 609 610 611 612 613 614 615 616 617
	SDEBUG(cerr << "   finding link resolutions" << endl);
	// We need to calculate all possible link resolutions, stick them
	// in a nice datastructure along with their weights, and then
	// select one randomly.
	typedef vector<tb_link_info> resolution_vector;
	typedef vector<pvertex_list> switchlist_vector;

	resolution_vector resolutions(10);
	int resolution_index = 0;
	float total_weight = 0;

618
	pedge pe;
619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640
	// Direct link
	if (direct_link(dest_pv,pv,vlink,pe)) {
	  resolutions[resolution_index].type = tb_link_info::LINK_DIRECT;
	  resolutions[resolution_index].plinks.push_back(pe);
	  resolution_index++;
	  total_weight += LINK_RESOLVE_DIRECT;
	  SDEBUG(cerr << "    direct_link " << pe << endl);
	}
	// Intraswitch link
	pedge first,second;
	for (pvertex_set::iterator switch_it = pnode->switches.begin();
	     switch_it != pnode->switches.end();++switch_it) {
	  if (dest_pnode->switches.find(*switch_it) != dest_pnode->switches.end()) {
#ifdef FIX_SHARED_INTERFACES
	      if ((!find_link_to_switch(pv,*switch_it,vlink,first)) || 
		      (!find_link_to_switch(dest_pv,*switch_it,vlink,second))) {
		  //cerr << "No acceptable links" << endl;
		  continue;
	      }
#else
	    find_link_to_switch(pv,*switch_it,vlink,first);
	    find_link_to_switch(dest_pv,*switch_it,vlink,second);
641
#endif
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 677 678 679 680 681 682 683 684 685 686 687 688
	    resolutions[resolution_index].type = tb_link_info::LINK_INTRASWITCH;
	    if (flipped) { // Order these need to go in depends on flipped bit
	      resolutions[resolution_index].plinks.push_back(second);
	      resolutions[resolution_index].plinks.push_back(first);
	    } else { 
	      resolutions[resolution_index].plinks.push_back(first);
	      resolutions[resolution_index].plinks.push_back(second);
	    }
	    resolutions[resolution_index].switches.push_front(*switch_it);
	    resolution_index++;
	    total_weight += LINK_RESOLVE_INTRASWITCH;
	    SDEBUG(cerr << "    intraswitch " << first << " and " << second << endl);
	  }
	}
	// Interswitch paths
	//cout << "Source switches list has " << pnode->switches.size() <<
	 //   " entries" << endl;
	for (pvertex_set::iterator source_switch_it = pnode->switches.begin();
	     source_switch_it != pnode->switches.end();
	     ++source_switch_it) {
	  //cout << "Source switch: " << get(pvertex_pmap,*source_switch_it)->name << endl;
	  //cout << "Dest switches list has " << dest_pnode->switches.size() <<
	   //   " entries" << endl;
	  //cout << "Dest pnode is " << dest_pnode->name << endl;
	  int tmp = 0;
	  for (pvertex_set::iterator dest_switch_it = dest_pnode->switches.begin();
	       dest_switch_it != dest_pnode->switches.end();
	       ++dest_switch_it) {
	    //cout << "Dest switch number " << ++tmp << endl;
	    //cout << "Dest switch: " << get(pvertex_pmap,*dest_switch_it)->name << endl;
	    if (*source_switch_it == *dest_switch_it) continue;
	    if (find_interswitch_path(*source_switch_it,*dest_switch_it,vlink->delay_info.bandwidth,
				      resolutions[resolution_index].plinks,
				      resolutions[resolution_index].switches) != 0) {
#ifdef FIX_SHARED_INTERFACES
	      if ((!find_link_to_switch(pv,*source_switch_it,vlink,first)) || 
		      (!find_link_to_switch(dest_pv,*dest_switch_it,vlink,second))) {
		  //cerr << "No acceptable links" << endl;
		  continue;
	      }
#else
	      find_link_to_switch(pv,*source_switch_it,vlink,first);
	      find_link_to_switch(dest_pv,*dest_switch_it,vlink,second);
#endif

	      resolutions[resolution_index].type = tb_link_info::LINK_INTERSWITCH;
	      if (flipped) { // Order these need to go in depends on flipped bit
689 690
	        resolutions[resolution_index].plinks.push_front(second);
	        resolutions[resolution_index].plinks.push_back(first);
691 692 693
	      } else {
	        resolutions[resolution_index].plinks.push_front(first);
	        resolutions[resolution_index].plinks.push_back(second);
694
	      }
695 696 697 698 699 700
	      resolution_index++;
	      total_weight += LINK_RESOLVE_INTERSWITCH;
	      SDEBUG(cerr << "    interswitch " <<
		     get(pvertex_pmap,*source_switch_it)->name << " and " <<
		     get(pvertex_pmap,*dest_switch_it)->name << endl);
	    }
701
	  }
702
	}
703

704 705
	// check for no link
	if (resolution_index == 0) {
706
	  SDEBUG(cerr << "  Could not find any resolutions." << endl);
707

708 709 710 711 712
	  SADD(SCORE_NO_CONNECTION);
	  vlink->no_connection=true;
	  vinfo.no_connection++;
	  vlink->link_info.type = tb_link_info::LINK_UNKNOWN;
	  violated++;
713 714 715 716 717 718 719 720
	} else {
	  // Check to see if we are fixing a violation
	  if (vlink->no_connection) {
	    SDEBUG(cerr << "  Fixing previous violations." << endl);
	    SSUB(SCORE_NO_CONNECTION);
	    vlink->no_connection=false;
	    vinfo.no_connection--;
	    violated--;
721
	  }
722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767
	  
	  // Choose a link
	  int index;
	  if (!deterministic) {
	    float choice = std::random()%(int)total_weight;
	    for (index = 0;index < resolution_index;++index) {
	      switch (resolutions[index].type) {
	      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_UNKNOWN:
	      case tb_link_info::LINK_TRIVIAL:
		cerr << "Internal error: Should not be here." << endl;
		exit(1);
		break;
	      }
	      if (choice < 0) break;
	    }
	  } else {
	    // Deterministic
	    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(*vedge_it,pnode,dest_pnode);
	      if ((score <= bestscore) &&
		  (violated <= bestviolated)) {
		bestscore = score;
		bestviolated = violated;
		bestindex = i;
	      }
	      unscore_link_info(*vedge_it,pnode,dest_pnode);
	    }
	    index = bestindex;
	  }
#ifdef PENALIZE_UNUSED_INTERFACES
	  pnode->used_interfaces++;
#endif
	  vlink->link_info = resolutions[index];
	  SDEBUG(cerr << "  choice:" << vlink->link_info);
	  score_link_info(*vedge_it,pnode,dest_pnode);
Mac Newbold's avatar
Mac Newbold committed
768 769 770 771
	}
      }
    }
  }
772
  
Mac Newbold's avatar
Mac Newbold committed
773
  // finish setting up pnode
774 775
  tr->current_load++;
  pnode->total_load++;
776 777 778 779

#ifdef PENALIZE_UNUSED_INTERFACES
  assert(pnode->used_interfaces <= pnode->total_interfaces);
  SADD((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
Mac Newbold's avatar
Mac Newbold committed
780
#endif
781 782 783

  vnode->assignment = pv;
  vnode->assigned = true;
784 785 786
  if (tr->current_load > tr->max_load) {
    SDEBUG(cerr << "  load too high - penalty (" <<
	pnode->current_type_record->current_load << ")" << endl);
Mac Newbold's avatar
Mac Newbold committed
787 788 789 790
    SADD(SCORE_PNODE_PENALTY);
    vinfo.pnode_load++;
    violated++;
  } else {
791
    SDEBUG(cerr << "  load is fine" << endl);
Mac Newbold's avatar
Mac Newbold committed
792
  }
793
  if (pnode->total_load == 1) {
794
    SDEBUG(cerr << "  new pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
795
    SADD(SCORE_PNODE);
796 797
#ifdef LOAD_BALANCE
    //SADD(SCORE_PNODE); // Yep, twice
Mac Newbold's avatar
Mac Newbold committed
798 799
#endif
  }
800 801 802 803 804 805 806
#ifdef LOAD_BALANCE
  //SSUB(SCORE_PNODE * (1.0 / pnode->max_load));
  //SSUB(SCORE_PNODE * (1 + powf(((pnode->current_load-1) * 1.0)/pnode->max_load,2)));
  //SADD(SCORE_PNODE * (1 + powf(((pnode->current_load) * 1.0)/pnode->max_load,2)));
  SSUB(SCORE_PNODE * (powf(1 + ((pnode->current_load-1) * 1.0)/pnode->max_load,2)));
  SADD(SCORE_PNODE * (powf(1 + ((pnode->current_load) * 1.0)/pnode->max_load,2)));
#endif
Mac Newbold's avatar
Mac Newbold committed
807 808 809 810 811 812

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

813
  // features/desires
Christopher Alfeld's avatar
 
Christopher Alfeld committed
814
  int fd_violated;
815
  double fds = fd_score(vnode,pnode,fd_violated);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
816 817 818 819 820
  SADD(fds);
  violated += fd_violated;
  vinfo.desires += fd_violated;

  // pclass
821
  if ((!disable_pclasses) && pnode->my_class && (pnode->my_class->used == 0)) {
822
    SDEBUG(cerr << "  new pclass" << endl);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
823
    SADD(SCORE_PCLASS);
824
  }
825 826

  // vclass
827 828 829
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->assign_node(vnode->type);
    SDEBUG(cerr << "  vclass assign " << score_delta << endl);
830 831 832 833 834 835 836
    SADD(score_delta*SCORE_VCLASS);
    if (score_delta >= 1) {
      violated++;
      vinfo.vclass++;
    }
  }

837 838
  SDEBUG(cerr << "  assignment=" << vnode->assignment << endl);
  SDEBUG(cerr << "  new score=" << score << " new violated=" << violated << endl);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
839

840 841 842 843
  if (!tr->is_static) {
    if (pnode->my_class) {
      pclass_set(vnode,pnode);
    }
844
  }
Christopher Alfeld's avatar
 
Christopher Alfeld committed
845
  
Mac Newbold's avatar
Mac Newbold committed
846 847 848 849 850 851
  return 0;
}

// returns "best" direct link between a and b.
// best = less users
//        break ties with minimum bw_used
852
bool direct_link(pvertex a,pvertex b,tb_vlink *vlink,pedge &edge)
Mac Newbold's avatar
Mac Newbold committed
853
{
854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885
  pvertex dest_pv;
  pedge best_pedge;
  tb_plink *plink;
  tb_plink *best_plink = NULL;
  poedge_iterator pedge_it,end_pedge_it;
  int best_users;
  double best_distance;
  tie(pedge_it,end_pedge_it) = out_edges(a,PG);
  for (;pedge_it!=end_pedge_it;++pedge_it) {
    dest_pv = target(*pedge_it,PG);
    if (dest_pv == a)
      dest_pv = source(*pedge_it,PG);
    if (dest_pv == b) {
      plink = get(pedge_pmap,*pedge_it);
      int users = plink->nonemulated;
      if (! vlink->emulated) {
	users += plink->emulated;
      }
      tb_delay_info physical_delay;
      physical_delay.bandwidth = plink->delay_info.bandwidth - plink->bw_used;
      physical_delay.delay = plink->delay_info.delay;
      physical_delay.loss = plink->delay_info.loss;
      double distance = vlink->delay_info.distance(physical_delay);
      if (distance == -1) {distance = DBL_MAX;}
      
      if ((! best_plink) ||
	  (users < best_users) ||
	  ((users == best_users) && (distance < best_distance))) {
	best_users = users;
	best_distance = distance;
	best_pedge = *pedge_it;
	best_plink = plink;
Mac Newbold's avatar
Mac Newbold committed
886 887 888
      }
    }
  }
889 890 891 892 893 894
  if (best_plink == NULL) {
    return false;
  } else {
    edge = best_pedge;
    return true;
  }
Mac Newbold's avatar
Mac Newbold committed
895 896
}

897 898
bool find_link_to_switch(pvertex pv,pvertex switch_pv,tb_vlink *vlink,
			 pedge &out_edge)
Mac Newbold's avatar
Mac Newbold committed
899
{
900 901
  pvertex dest_pv;
  double best_distance = 1000.0;
Mac Newbold's avatar
Mac Newbold committed
902
  int best_users = 1000;
903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919
  pedge best_pedge;
  bool found_best=false;
  poedge_iterator pedge_it,end_pedge_it;
  tie(pedge_it,end_pedge_it) = out_edges(pv,PG);
  for (;pedge_it!=end_pedge_it;++pedge_it) {
    dest_pv = target(*pedge_it,PG);
    if (dest_pv == pv)
      dest_pv = source(*pedge_it,PG);
    if (dest_pv == switch_pv) {
      tb_plink *plink = get(pedge_pmap,*pedge_it);
      tb_delay_info physical_delay;
      physical_delay.bandwidth = plink->delay_info.bandwidth - plink->bw_used;
      physical_delay.delay = plink->delay_info.delay;
      physical_delay.loss = plink->delay_info.loss;
      double distance = vlink->delay_info.distance(physical_delay);
      int users;

Robert Ricci's avatar
Robert Ricci committed
920 921
      // For sticking emulated links in emulated links we care about the
      // distance, and whether or not we've gone over bandwidth
922 923 924
      users = plink->nonemulated;
      if (! vlink->emulated) {
	users += plink->emulated;
Robert Ricci's avatar
Robert Ricci committed
925 926 927 928 929 930
      } else {
	  if (vlink->delay_info.bandwidth >
		  (plink->delay_info.bandwidth - plink->bw_used)) {
	      // Silly hack to make sure that this link doesn't get chosen
	      users = best_users + 1;
	  }
931
      }
Robert Ricci's avatar
Robert Ricci committed
932

933 934 935 936 937 938 939 940 941 942
      if (distance == -1) {
	// -1 == infinity
	distance = DBL_MAX;
      }
      if ((users < best_users) ||
	  ((users  == best_users) && (distance < best_distance))) {
	best_pedge = *pedge_it;
	best_distance = distance;
	found_best = true;
	best_users = plink->emulated+plink->nonemulated;
Mac Newbold's avatar
Mac Newbold committed
943 944 945
      }
    }
  }
946

947 948 949 950 951 952 953 954 955 956 957
#ifdef FIX_SHARED_INTERFACES
  if ((!vlink->emulated) && found_best && (best_users > 0)) {
      return false;
  }
#endif
  if (found_best) {
    out_edge = best_pedge;
    return true;
  } else {
    return false;
  }
Mac Newbold's avatar
Mac Newbold committed
958 959
}

960 961 962 963
// this uses the shortest paths calculated over the switch graph to
// find a path between src and dst.  It passes out list<edge>, a list
// of the edges used. (assumed to be empty to begin with).
// Returns 0 if no path exists and 1 otherwise.
964 965 966
int find_interswitch_path(pvertex src_pv,pvertex dest_pv,
			  int bandwidth,pedge_path &out_path,
			  pvertex_list &out_switches)
Mac Newbold's avatar
Mac Newbold committed
967
{
968 969 970 971 972 973
  // We know the shortest path from src to node already.  It's stored
  // in switch_preds[src] and is a node_array<edge>.  Let P be this
  // array.  We can trace our shortest path by starting at the end and
  // following the pred edges back until we reach src.  We need to be
  // careful though because the switch_preds deals with elements of SG
  // and we have elements of PG.
974 975 976 977 978 979 980

  svertex src_sv = get(pvertex_pmap,src_pv)->sgraph_switch;
  svertex dest_sv = get(pvertex_pmap,dest_pv)->sgraph_switch;

  sedge current_se;
  svertex current_sv = dest_sv;
  switch_pred_map &preds = *switch_preds[src_sv];
Mac Newbold's avatar
Mac Newbold committed
981
  
982
  if (preds[dest_sv] == dest_sv) {
983
    // unreachable
Mac Newbold's avatar
Mac Newbold committed
984 985
    return 0;
  }
986 987 988 989 990
  while (current_sv != src_sv) {
    out_switches.push_front(get(svertex_pmap,current_sv)->mate);
    current_se = edge(current_sv,preds[current_sv],SG).first;
    out_path.push_back(get(sedge_pmap,current_se)->mate);
    current_sv = preds[current_sv];
991
  }
992
  out_switches.push_front(get(svertex_pmap,current_sv)->mate);
993
  return 1;
Mac Newbold's avatar
Mac Newbold committed
994 995 996
}

// this does scoring for over users and over bandwidth on edges.
997
void score_link(pedge pe,vedge ve,tb_pnode *src_pnode, tb_pnode *dst_pnode)
Mac Newbold's avatar
Mac Newbold committed
998
{
999 1000
  tb_plink *plink = get(pedge_pmap,pe);
  tb_vlink *vlink = get(vedge_pmap,ve);
Mac Newbold's avatar
Mac Newbold committed
1001

1002 1003
  SDEBUG(cerr << "  score_link(" << pe << ") - " << plink->name << " / " <<
	 vlink->name << endl);
1004

1005 1006 1007 1008 1009 1010
#ifdef SCORE_DEBUG_LOTS
  cerr << *plink;
  cerr << *vlink;
#endif
  
  if (plink->type == tb_plink::PLINK_NORMAL) {
1011
    // need to account for three things here, the possiblity of a new plink
1012
    // the user of a new emulated link, and a possible violation.
1013 1014
    if (vlink->emulated) {
      plink->emulated++;
1015 1016
      SADD(SCORE_EMULATED_LINK);
    }
1017 1018
    else plink->nonemulated++;
    if (plink->nonemulated+plink->emulated == 1) {
1019
      // new link
1020
      SDEBUG(cerr << "    first user" << endl);
1021
      SADD(SCORE_DIRECT_LINK);
Mac Newbold's avatar
Mac Newbold committed
1022
    } else {
1023 1024
      // check for violation, basically if this is the first of it's
      // type to be added.
1025 1026 1027 1028 1029 1030 1031 1032 1033
      if (((! vlink->emulated) && (plink->nonemulated == 1)) ||
	  ((vlink->emulated) && (plink->emulated == 1))) {
	SDEBUG(cerr << "    link user - penalty" << endl);
	SADD(SCORE_DIRECT_LINK_PENALTY);
	vinfo.link_users++;
	violated++;
      }
#ifdef FIX_SHARED_INTERFACES
      if ((! vlink->emulated) && (plink->nonemulated > 1)) {
1034
	  //assert(false);
1035 1036 1037
	  SADD(SCORE_DIRECT_LINK_PENALTY);
	  vinfo.link_users++;
	  violated++;
1038
      }
1039
#endif
Mac Newbold's avatar
Mac Newbold committed
1040
    }
1041
  }
1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081

#ifdef FIX_PLINK_ENDPOINTS
  if (plink->fixends) {
      // Add this to the list of endpoints used by this plink
      nodepair p;
      if (src_pnode->name < dst_pnode->name) {
	  p.first = src_pnode->name;
	  p.second = dst_pnode->name;
      } else {
	  p.first = dst_pnode->name;
	  p.second = src_pnode->name;
      }
      if (plink->vedge_counts.find(p) == plink->vedge_counts.end()) {
	  plink->vedge_counts[p] = 1;
      } else {
	  plink->vedge_counts[p]++;
      }
      // Figure out if we need to add a violation
      if (p == plink->current_endpoints) {
	  plink->current_count++;
      } else {
	  // Nope, we just passed the old leader
	  if (plink->vedge_counts[p] > plink->current_count) {
	      plink->current_endpoints = p;
	      plink->current_count++;
	  } else {
	      // Yup, it's a new violation
	      SADD(5 * SCORE_DIRECT_LINK_PENALTY);
	      vinfo.incorrect_endpoints++;
	      violated++;
	  }
      }
  }
#endif

  if (plink->type != tb_plink::PLINK_LAN) {
    tb_delay_info physical_delay;
    physical_delay.bandwidth = plink->delay_info.bandwidth - plink->bw_used;
    physical_delay.delay = plink->delay_info.delay;
    physical_delay.loss = plink->delay_info.loss;
1082
    
1083 1084 1085 1086 1087
    double distance = vlink->delay_info.distance(physical_delay);

    plink->bw_used += vlink->delay_info.bandwidth;
#ifdef PENALIZE_BANDWIDTH
    SADD(plink->penalty * (vlink->delay_info.bandwidth * 1.0) / (plink->delay_info.bandwidth));
Mac Newbold's avatar
Mac Newbold committed
1088
#endif
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098

    if (distance == -1) {
      // violation
      SDEBUG(cerr << "    outside delay requirements." << endl);
      violated++;
      vinfo.delay++;
      SADD(SCORE_OUTSIDE_DELAY);
    } else {
      SADD(distance * SCORE_DELAY);
    }
Mac Newbold's avatar
Mac Newbold committed
1099 1100 1101
  }
}

1102 1103 1104 1105
/*
 * Remove the score incurred by a link. This should be the inverse of
 * score_link()
 */
1106
void unscore_link(pedge pe,vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode)
Mac Newbold's avatar
Mac Newbold committed
1107
{
1108
  // Get the vlink from the passed in edges
1109
  tb_vlink *vlink = get(vedge_pmap,ve);
Mac Newbold's avatar
Mac Newbold committed
1110

1111 1112 1113 1114 1115 1116 1117 1118 1119 1120
  // This is not in the slightest bit graceful! This function was not designed
  // for use with trivial links (which have no plink,) but I would like to call
  // it for symmetry
  if (vlink->link_info.type == tb_link_info::LINK_TRIVIAL) {
    goto UNSCORE_TRIVIAL;
  }

  tb_plink *plink;
  plink = get(pedge_pmap,pe);

1121 1122 1123 1124 1125 1126
  SDEBUG(cerr << "  unscore_link(" << pe << ") - " << plink->name << " / " <<
	 vlink->name << endl);

#ifdef SCORE_DEBUG_LOTS
  cerr << *plink;
  cerr << *vlink;
Mac Newbold's avatar
Mac Newbold committed
1127 1128
#endif

1129 1130 1131
  if (plink->type == tb_plink::PLINK_NORMAL) {