score.cc 41.1 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 use_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 66 67 68 69 70 71 72 73 74 75
bool direct_link(pvertex a,pvertex b,tb_vlink *vlink,pedge &edge);
#ifdef FIX_PLINK_ENDPOINTS
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);
#else
void score_link(pedge pe,vedge ve);
void unscore_link(pedge pe,vedge ve);
#endif
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);
#ifdef FIX_PLINK_ENDPOINTS
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);
#else
void score_link_info(vedge ve);
void unscore_link_info(vedge ve);
#endif

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

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

85 86 87 88 89 90
#ifdef SCORE_DEBUG
#define SDEBUG(a) a
#else
#define SDEBUG(a)
#endif

Mac Newbold's avatar
Mac Newbold committed
91 92 93 94
/*
 * score()
 * Returns the score.
 */
95
double get_score() {return score;}
Mac Newbold's avatar
Mac Newbold committed
96 97 98 99 100 101 102 103

/*
 * init_score()
 * This initialized the scoring system.  It also clears all
 * assignments.
 */
void init_score()
{
104
  SDEBUG(cerr << "SCORE: Initializing" << endl);
Mac Newbold's avatar
Mac Newbold committed
105 106 107 108
  score=0;
  violated=0;
  vinfo.unassigned = vinfo.pnode_load = 0;
  vinfo.no_connection = vinfo.link_users = vinfo.bandwidth = 0;
109 110 111
#ifdef FIX_PLINK_ENDPOINTS
  vinfo.incorrect_endpoints = 0;
#endif
Mac Newbold's avatar
Mac Newbold committed
112

113 114 115 116 117
  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
118
    SADD(SCORE_UNASSIGNED);
119
    //cout << "Init: Counting " << vnode->name << endl;
Mac Newbold's avatar
Mac Newbold committed
120 121 122
    vinfo.unassigned++;
    violated++;
  }
123 124 125 126 127 128
  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
129
  }
130 131 132 133 134 135 136 137
  pvertex_iterator pvertex_it,end_pvertex_it;
  tie(pvertex_it,end_pvertex_it) = vertices(PG);
  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
138
  }
139 140 141 142 143 144 145
  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
146 147
  }

148
  SDEBUG(cerr << "  score=" << score << " violated=" << violated << endl);
149
}
150

151 152 153 154 155 156 157 158 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 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228
/* 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.
 */
#ifdef FIX_PLINK_ENDPOINTS
void unscore_link_info(vedge ve,tb_pnode *src_pnode,tb_pnode *dst_pnode)
#else
void unscore_link_info(vedge ve)
#endif
{
  tb_vlink *vlink = get(vedge_pmap,ve);
  if (vlink->link_info.type == tb_link_info::LINK_DIRECT) {
    // DIRECT LINK
    SDEBUG(cerr << "   direct link" << endl);
#ifdef FIX_PLINK_ENDPOINTS
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
#else
    unscore_link(vlink->link_info.plinks.front(),ve);
#endif
    vlink->link_info.plinks.clear();
  } else if (vlink->link_info.type == tb_link_info::LINK_INTERSWITCH) {
    // INTERSWITCH LINK
    SDEBUG(cerr << "  interswitch link" << endl);
    
    pedge_path &path = vlink->link_info.plinks;
#ifndef INTERSWITCH_LENGTH
    SSUB(SCORE_INTERSWITCH_LINK);
#endif
    // XXX: Potentially bogus;
    int numinterlinks;
    numinterlinks = -2;
    for (pedge_path::iterator it=path.begin();
	 it != path.end();++it) {
#ifdef FIX_PLINK_ENDPOINTS
      unscore_link(*it,ve,src_pnode,dst_pnode);
#else
      unscore_link(*it,ve);
#endif
      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);
    
#ifdef FIX_PLINK_ENDPOINTS
    unscore_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    unscore_link(vlink->link_info.plinks.back(),ve,src_pnode,dst_pnode);
#else
    unscore_link(vlink->link_info.plinks.front(),ve);
    unscore_link(vlink->link_info.plinks.back(),ve);
#endif
    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();
  }
}
Mac Newbold's avatar
Mac Newbold committed
229 230
/*
 * This removes a virtual node from the assignments, adjusting
231 232
 * the score appropriately.  */
void remove_node(vvertex vv)
Mac Newbold's avatar
Mac Newbold committed
233 234
{
  /* Find pnode assigned to */
235 236 237 238 239 240 241 242 243 244 245
  tb_vnode *vnode = get(vvertex_pmap,vv);
  assert(vnode->assigned);
  pvertex pv = vnode->assignment;
  tb_pnode *pnode = get(pvertex_pmap,pv);
  //cerr << "remove_node: " << vnode->name << endl;

  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
246 247 248 249
#endif

  assert(pnode != NULL);

250 251 252
  if (pnode->my_class) {
    pclass_unset(pnode);
  }
253

254 255
#ifdef SMART_UNMAP
  pnode->assigned_nodes.erase(vnode);
256
#endif
257 258 259 260

  // pclass
  if (use_pclasses && pnode->my_class && (pnode->my_class->used == 0)) {
    SDEBUG(cerr << "  freeing pclass" << endl);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
261 262
    SSUB(SCORE_PCLASS);
  }
263 264

  // vclass
265 266 267
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->unassign_node(vnode->type);
    SDEBUG(cerr << "  vclass unassign " << score_delta << endl);
268 269 270 271 272 273 274
    
    if (score_delta <= -1) {
      violated--;
      vinfo.vclass--;
    }
    SSUB(-score_delta*SCORE_VCLASS);
  }
Christopher Alfeld's avatar
 
Christopher Alfeld committed
275
  
Mac Newbold's avatar
Mac Newbold committed
276
  // remove the scores associated with each edge
277 278 279 280 281 282 283 284 285 286 287 288 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);
    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);

    if (vlink->no_connection) {
      SDEBUG(cerr << "  link no longer in violation.\n";)
      SSUB(SCORE_NO_CONNECTION);
      vlink->no_connection=false;
      vinfo.no_connection--;
      violated--;
293
    }
294 295 296 297 298 299 300 301 302 303
    
    if (! dest_vnode->assigned) continue;
    
#ifdef FIX_PLINK_ENDPOINTS
    pvertex dest_pv = dest_vnode->assignment;
    tb_pnode *dest_pnode = get(pvertex_pmap,dest_pv);
    unscore_link_info(*vedge_it,pnode,dest_pnode);
#else
    unscore_link_info(*vedge_it);
#endif
304
  }
305 306 307 308 309 310
 
#ifdef PENALIZE_UNUSED_INTERFACES
  SSUB((pnode->total_interfaces - pnode->used_interfaces) * SCORE_UNUSED_INTERFACE);
  pnode->used_interfaces = 0;
#endif
 
311
  // adjust pnode scores
312 313 314 315 316 317 318 319
  pnode->current_load--;
  vnode->assigned = false;
#ifdef LOAD_BALANCE
  //SADD(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)));
320
#endif
321 322 323
  if (pnode->current_load == 0) {
    // release pnode
    SDEBUG(cerr << "  releasing pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
324
    SSUB(SCORE_PNODE);
325 326
#ifdef LOAD_BALANCE
    //SSUB(SCORE_PNODE);
Mac Newbold's avatar
Mac Newbold committed
327
#endif
328 329
  
    
Mac Newbold's avatar
Mac Newbold committed
330
    // revert pnode type
331 332 333 334
    pnode->typed=false;
  } else if (pnode->current_load >= pnode->max_load) {
    SDEBUG(cerr << "  reducing penalty, new load=" << pnode->current_load <<
	   " (>= " << pnode->max_load << ")" << endl);
Mac Newbold's avatar
Mac Newbold committed
335 336 337 338
    SSUB(SCORE_PNODE_PENALTY);
    vinfo.pnode_load--;
    violated--;
  }
339

Mac Newbold's avatar
Mac Newbold committed
340 341 342 343
  // add score for unassigned node
  SADD(SCORE_UNASSIGNED);
  vinfo.unassigned++;
  violated++;
344 345

  // features/desires
Christopher Alfeld's avatar
 
Christopher Alfeld committed
346
  int fd_violated;
347
  double fds=fd_score(vnode,pnode,fd_violated);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
348 349 350
  SSUB(fds);
  violated -= fd_violated;
  vinfo.desires -= fd_violated;
351 352 353 354 355 356

  // remove lan node if necessary
  if (vnode->type.compare("lan") == 0) {
    SDEBUG(cerr << "Deleting lan node." << endl);
    delete_lan_node(pv);
  }
357
  
358
  SDEBUG(cerr << "  new score = " << score << " new violated = " << violated << endl);
359 360
}

361 362 363
/* 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.
364
 */
365 366 367 368 369
#ifdef FIX_PLINK_ENDPOINTS
void score_link_info(vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode)
#else
void score_link_info(vedge ve)
#endif
370
{
371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419
  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);
#ifdef FIX_PLINK_ENDPOINTS
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
#else
    score_link(vlink->link_info.plinks.front(),ve);
#endif
    break;
  case tb_link_info::LINK_INTRASWITCH:
    SADD(SCORE_INTRASWITCH_LINK);
#ifdef FIX_PLINK_ENDPOINTS
    score_link(vlink->link_info.plinks.front(),ve,src_pnode,dst_pnode);
    score_link(vlink->link_info.plinks.back(),ve,src_pnode,dst_pnode);
#else
    score_link(vlink->link_info.plinks.front(),ve);
    score_link(vlink->link_info.plinks.back(),ve);
#endif
    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) {
#ifdef FIX_PLINK_ENDPOINTS
	score_link(*plink_It,ve,src_pnode,dst_pnode);
#else
	score_link(*plink_It,ve);
#endif
	numinterlinks++;
    }
#ifdef INTERSWITCH_LENGTH
    for (int i = 1; i <= numinterlinks; i++) {
	SADD(SCORE_INTERSWITCH_LINK);
    }
#endif
420

421 422 423 424 425 426 427 428 429 430 431 432 433 434
    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_UNKNOWN:
  case tb_link_info::LINK_TRIVIAL:
    cerr << "Internal error: Should not be here either." << endl;
    exit(1);
    break;
435
  }
436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456
}

/*
 * 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)
{
  tb_vnode *vnode = get(vvertex_pmap,vv);
  tb_pnode *pnode = get(pvertex_pmap,pv);
  //cerr << "add_node: " << vnode->name << endl;
  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
457
#endif
458
  SDEBUG(cerr << "  vnode type = " << vnode->type << endl);
Mac Newbold's avatar
Mac Newbold committed
459 460
  
  // set up pnode
461

Mac Newbold's avatar
Mac Newbold committed
462
  // figure out type
463 464 465 466
  if (!pnode->typed) {
    SDEBUG(cerr << "  virgin pnode" << endl);
    SDEBUG(cerr << "    vtype = " << vnode->type << endl);

Mac Newbold's avatar
Mac Newbold committed
467 468
    // Remove check assuming at higher level?
    // Remove higher level checks?
469 470 471 472 473
    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) {
Mac Newbold's avatar
Mac Newbold committed
474
      // didn't find a type
475 476
      SDEBUG(cerr << "  no matching type" << endl);
      //cerr << "add_node FAILED! (no matching type)" << endl;
Mac Newbold's avatar
Mac Newbold committed
477 478
      return 1;
    }
479 480 481
    
    pnode->current_type=vnode->type;
    pnode->typed=true;
482

483 484
    SDEBUG(cerr << "  matching type found (" <<pnode->current_type <<
	   ", max = " << pnode->max_load << ")" << endl);
Mac Newbold's avatar
Mac Newbold committed
485
  } else {
486 487 488 489
    SDEBUG(cerr << "  pnode already has type" << endl);
    if (pnode->current_type != vnode->type) {
      SDEBUG(cerr << "  incompatible types" << endl);
      //cerr << "add_node FAILED! (incompatible types)" << endl;
Mac Newbold's avatar
Mac Newbold committed
490 491
      return 1;
    } else {
492 493
      SDEBUG(cerr << "  compatible types" << endl);
      if (pnode->current_load == pnode->max_load) {
494 495 496
	/* 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. */
497 498 499 500 501

	// 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 << "add_node FAILED! (node is full)" << endl;
Mac Newbold's avatar
Mac Newbold committed
502 503 504 505 506
	return 1;
      }
    }
  }

507 508 509 510 511 512 513 514
#ifdef PENALIZE_UNUSED_INTERFACES
  pnode->used_interfaces = 0;
#endif
 
#ifdef SMART_UNMAP
  pnode->assigned_nodes.insert(vnode);
#endif
 
515
  // set up links
516 517 518 519 520 521 522 523
  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);

   if (dest_vv == vv) {
      dest_vv = source(*vedge_it,VG);
524 525
    }

526 527 528 529 530 531 532
    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;
    }
533

534
    tb_vnode *dest_vnode = get(vvertex_pmap,dest_vv);
535

536 537 538 539 540 541 542 543 544 545 546 547
    pedge pe;
    
    SDEBUG(cerr << "  edge to " << dest_vnode->name << endl);

    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);
548
	if (allow_trivial_links && vlink->allow_trivial) {
549 550 551 552 553 554
	    vlink->link_info.type = tb_link_info::LINK_TRIVIAL;
	} else {
	    SADD(SCORE_NO_CONNECTION);
	    vlink->no_connection=true;
	    vinfo.no_connection++;
	    violated++;
555
	}
556
      } else {
557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589
	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;

	// 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);
590
#endif
591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637
	    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
638 639
	        resolutions[resolution_index].plinks.push_front(second);
	        resolutions[resolution_index].plinks.push_back(first);
640 641 642
	      } else {
	        resolutions[resolution_index].plinks.push_front(first);
	        resolutions[resolution_index].plinks.push_back(second);
643
	      }
644 645 646 647 648 649
	      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);
	    }
650
	  }
651
	}
652

653 654 655 656 657 658 659 660 661 662 663 664 665
	// check for no link
	if (resolution_index == 0) {
	    //cerr << "No resolutions at all" << endl;
	  SDEBUG(cerr << "  Could not find any resolutions. Trying delay." <<
		 endl);

#if 0
	  // Create virtual delay node and link with special free vlinks.
	  vvertex delayv = make_delay_node(vlink);
	  tb_pnode *delaypnode = find_pnode(get(vvertex_pmap,delayv));
	  
	  // Assign delay node
	  if (add_node(delayv,pnode2vertex[delaypnode],false) == 1) {
666
#endif
667 668 669 670 671 672 673
	    SDEBUG(cerr << "Failed to delay." << endl);
	    SADD(SCORE_NO_CONNECTION);
	    vlink->no_connection=true;
	    vinfo.no_connection++;
	    violated++;
#if 0
	  }
674
#endif
675 676 677 678 679 680 681 682 683
	} else {
	    //cerr << "Some resolutions" << endl;
	  // 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--;
684
	  }
685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742
	  
	  // 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];
#ifdef FIX_PLINK_ENDPOINTS
	      score_link_info(*vedge_it,pnode,dest_pnode);
#else
	      score_link_info(*vedge_it);
#endif
	      if ((score <= bestscore) &&
		  (violated <= bestviolated)) {
		bestscore = score;
		bestviolated = violated;
		bestindex = i;
	      }
#ifdef FIX_PLINK_ENDPOINTS
	      unscore_link_info(*vedge_it,pnode,dest_pnode);
#else
	      unscore_link_info(*vedge_it);
#endif
	    }
	    index = bestindex;
	  }
#ifdef PENALIZE_UNUSED_INTERFACES
	  pnode->used_interfaces++;
#endif
	  vlink->link_info = resolutions[index];
	  SDEBUG(cerr << "  choice:" << vlink->link_info);
#ifdef FIX_PLINK_ENDPOINTS
	  score_link_info(*vedge_it,pnode,dest_pnode);
#else
	  score_link_info(*vedge_it);
#endif
Mac Newbold's avatar
Mac Newbold committed
743 744
	}
      }
745 746 747 748 749 750 751 752 753
#ifdef AUTO_MIGRATE
      if (dest_vnode->type.compare("lan") == 0) {
	  //cout << "Auto-migrating LAN " << dest_vnode->name << " (because of "
	   //   << vnode->name << ")" << endl;
	  remove_node(dest_vv);
	  pvertex lanpv = make_lan_node(dest_vv);
	  add_node(dest_vv,lanpv,false);
      }
#endif
Mac Newbold's avatar
Mac Newbold committed
754 755
    }
  }
756
  
Mac Newbold's avatar
Mac Newbold committed
757
  // finish setting up pnode
758 759 760 761 762
  pnode->current_load++;

#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
763
#endif
764 765 766 767 768 769

  vnode->assignment = pv;
  vnode->assigned = true;
  if (pnode->current_load > pnode->max_load) {
    SDEBUG(cerr << "  load to high - penalty (" << pnode->current_load <<
	   ")" << endl);
Mac Newbold's avatar
Mac Newbold committed
770 771 772 773
    SADD(SCORE_PNODE_PENALTY);
    vinfo.pnode_load++;
    violated++;
  } else {
774
    SDEBUG(cerr << "  load is fine" << endl);
Mac Newbold's avatar
Mac Newbold committed
775
  }
776 777
  if (pnode->current_load == 1) {
    SDEBUG(cerr << "  new pnode" << endl);
Mac Newbold's avatar
Mac Newbold committed
778
    SADD(SCORE_PNODE);
779 780
#ifdef LOAD_BALANCE
    //SADD(SCORE_PNODE); // Yep, twice
Mac Newbold's avatar
Mac Newbold committed
781 782
#endif
  }
783 784 785 786 787 788 789
#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
790 791 792 793 794 795

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

796
  // features/desires
Christopher Alfeld's avatar
 
Christopher Alfeld committed
797
  int fd_violated;
798
  double fds = fd_score(vnode,pnode,fd_violated);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
799 800 801 802 803
  SADD(fds);
  violated += fd_violated;
  vinfo.desires += fd_violated;

  // pclass
804 805
  if (use_pclasses && pnode->my_class && (pnode->my_class->used == 0)) {
    SDEBUG(cerr << "  new pclass" << endl);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
806
    SADD(SCORE_PCLASS);
807
  }
808 809

  // vclass
810 811 812
  if (vnode->vclass != NULL) {
    double score_delta = vnode->vclass->assign_node(vnode->type);
    SDEBUG(cerr << "  vclass assign " << score_delta << endl);
813 814 815 816 817 818 819
    SADD(score_delta*SCORE_VCLASS);
    if (score_delta >= 1) {
      violated++;
      vinfo.vclass++;
    }
  }

820 821
  SDEBUG(cerr << "  assignment=" << vnode->assignment << endl);
  SDEBUG(cerr << "  new score=" << score << " new violated=" << violated << endl);
Christopher Alfeld's avatar
 
Christopher Alfeld committed
822

823 824 825
  if (pnode->my_class) {
    pclass_set(vnode,pnode);
  }
Christopher Alfeld's avatar
 
Christopher Alfeld committed
826
  
Mac Newbold's avatar
Mac Newbold committed
827 828 829 830 831 832
  return 0;
}

// returns "best" direct link between a and b.
// best = less users
//        break ties with minimum bw_used
833
bool direct_link(pvertex a,pvertex b,tb_vlink *vlink,pedge &edge)
Mac Newbold's avatar
Mac Newbold committed
834
{
835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866
  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
867 868 869
      }
    }
  }
870 871 872 873 874 875
  if (best_plink == NULL) {
    return false;
  } else {
    edge = best_pedge;
    return true;
  }
Mac Newbold's avatar
Mac Newbold committed
876 877
}

878 879
bool find_link_to_switch(pvertex pv,pvertex switch_pv,tb_vlink *vlink,
			 pedge &out_edge)
Mac Newbold's avatar
Mac Newbold committed
880
{
881 882
  pvertex dest_pv;
  double best_distance = 1000.0;
Mac Newbold's avatar
Mac Newbold committed
883
  int best_users = 1000;
884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900
  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
901 902
      // For sticking emulated links in emulated links we care about the
      // distance, and whether or not we've gone over bandwidth
903 904 905
      users = plink->nonemulated;
      if (! vlink->emulated) {
	users += plink->emulated;
Robert Ricci's avatar
Robert Ricci committed
906 907 908 909 910 911
      } 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;
	  }
912
      }
Robert Ricci's avatar
Robert Ricci committed
913

914 915 916 917 918 919 920 921 922 923
      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
924 925 926
      }
    }
  }
927

928 929 930 931 932 933 934 935 936 937 938
#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
939 940
}

941 942 943 944
// 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.
945 946 947
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
948
{
949 950 951 952 953 954
  // 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.
955 956 957 958 959 960 961

  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
962
  
963
  if (preds[dest_sv] == dest_sv) {
964
    // unreachable
Mac Newbold's avatar
Mac Newbold committed
965 966
    return 0;
  }
967 968 969 970 971
  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];
972
  }
973
  out_switches.push_front(get(svertex_pmap,current_sv)->mate);
974
  return 1;
Mac Newbold's avatar
Mac Newbold committed
975 976 977
}

// this does scoring for over users and over bandwidth on edges.
978 979 980 981 982
#ifdef FIX_PLINK_ENDPOINTS
void score_link(pedge pe,vedge ve,tb_pnode *src_pnode, tb_pnode *dst_pnode)
#else
void score_link(pedge pe,vedge ve)
#endif
Mac Newbold's avatar
Mac Newbold committed
983
{
984 985
  tb_plink *plink = get(pedge_pmap,pe);
  tb_vlink *vlink = get(vedge_pmap,ve);
Mac Newbold's avatar
Mac Newbold committed
986

987 988
  SDEBUG(cerr << "  score_link(" << pe << ") - " << plink->name << " / " <<
	 vlink->name << endl);
989

990 991 992 993 994 995
#ifdef SCORE_DEBUG_LOTS
  cerr << *plink;
  cerr << *vlink;
#endif
  
  if (plink->type == tb_plink::PLINK_NORMAL) {
996 997
    // need too account for three things here, the possiblity of a new plink
    // the user of a new emulated link, and a possible violation.
998 999
    if (vlink->emulated) {
      plink->emulated++;
1000 1001
      SADD(SCORE_EMULATED_LINK);
    }
1002 1003
    else plink->nonemulated++;
    if (plink->nonemulated+plink->emulated == 1) {
1004
      // new link
1005
      SDEBUG(cerr << "    first user" << endl);
1006
      SADD(SCORE_DIRECT_LINK);
Mac Newbold's avatar
Mac Newbold committed
1007
    } else {
1008 1009
      // check for violation, basically if this is the first of it's
      // type to be added.
1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020
      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)) {
	  //cerr << "Penalizing overused link" << endl;
	  assert(false);
1021 1022 1023
	  SADD(SCORE_DIRECT_LINK_PENALTY);
	  vinfo.link_users++;
	  violated++;
1024
      }
1025
#endif
Mac Newbold's avatar
Mac Newbold committed
1026
    }
1027
  }
1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 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

#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;
1068
    
1069 1070 1071 1072 1073
    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
1074
#endif
1075 1076 1077 1078 1079 1080 1081 1082 1083 1084

    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
1085 1086 1087
  }
}

1088 1089 1090 1091 1092
#ifdef FIX_PLINK_ENDPOINTS
void unscore_link(pedge pe,vedge ve, tb_pnode *src_pnode, tb_pnode *dst_pnode)
#else
void unscore_link(pedge pe,vedge ve)
#endif
Mac Newbold's avatar
Mac Newbold committed
1093
{
1094 1095
  tb_plink *plink = get(pedge_pmap,pe);
  tb_vlink *vlink = get(vedge_pmap,ve);
Mac Newbold's avatar
Mac Newbold committed
1096

1097 1098 1099 1100 1101 1102
  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
1103 1104
#endif

1105 1106 1107
  if (plink->type == tb_plink::PLINK_NORMAL) {
    if (vlink->emulated) {
      plink->emulated--;
1108 1109
      SSUB(SCORE_EMULATED_LINK);
    } else {
1110 1111 1112 1113 1114 1115 1116 1117 1118
      plink->nonemulated--;
#ifdef FIX_SHARED_INTERFACES
      if (plink->nonemulated >= 1) {
	  //cerr << "Freeing overused link" << endl;
	  SSUB(SCORE_DIRECT_LINK_PENALTY);
	  vinfo.link_users--;
	  violated--;
      }
#endif
1119
    }
1120
    if (plink->nonemulated+plink->emulated == 0) {
1121
      // link no longer used
1122
      SDEBUG(cerr << "   freeing link" << endl);
1123 1124 1125 1126
      SSUB(SCORE_DIRECT_LINK);
    } else {
      // check to see if re freed up a violation, basically did
      // we remove the last of it's link type.
1127 1128
      if ((vlink->emulated && (plink->emulated == 0)) ||
	  ((! vlink->emulated) && plink->nonemulated == 0)) {
1129
	// all good
1130
	SDEBUG(cerr << "   users ok" << endl);
1131 1132 1133 1134
	SSUB(SCORE_DIRECT_LINK_PENALTY);
	vinfo.link_users--;
	violated--;
      }
Mac Newbold's avatar
Mac Newbold committed
1135 1136
    }
  }
1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183
#ifdef FIX_PLINK_ENDPOINTS
  if (plink->fixends) {
      // Subtract this from the list of endpoints for 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;
      }
      int newcount;
      assert(plink->vedge_counts[p] > 0);
      newcount = --plink->vedge_counts[p];
      if (newcount == 0) {
	  plink->vedge_counts.erase(p);
      }

      // Ok, let's see if this removes any violations
      if (p == plink->current_endpoints) {
	  // Need to re-find the heaviest endpoint count
	  nodepair_count_map::iterator it = plink->vedge_counts.begin();
	  int highestcount = 0;
	  nodepair highestp;
	  while (it != plink->vedge_counts.end()) {
	      if (it->second > highestcount) {
		  highestcount = it->second;
		  highestp = it->first;
	      }
	      it++;
	  }
	  plink->current_endpoints = highestp;
	  plink->current_count = highestcount;
	  if (newcount < highestcount) {
	      // Yep, we just got rid of a violation
	      SSUB(5*SCORE_DIRECT_LINK_PENALTY);
	      vinfo.incorrect_endpoints--;
	      violated--;
	  }
      } else {
	  // Yep, we just got rid of a violation
	  SSUB(5*SCORE_DIRECT_LINK_PENALTY);
	  vinfo.incorrect_endpoints--;
	  violated--;
      }
  }
#endif
Mac Newbold's avatar
Mac Newbold committed
1184 1185
  
  // bandwidth check
1186 1187 1188 1189
  if (plink->type != tb_plink::PLINK_LAN) {
    plink->bw_used -= vlink->delay_info.bandwidth;
#ifdef PENALIZE_BANDWIDTH
    SSUB(plink->penalty * (vlink->delay_info.bandwidth * 1.0) / (plink->delay_info.bandwidth));
Mac Newbold's avatar
Mac Newbold committed
1190
#endif
1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206

    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) {
      // violation
      SDEBUG(cerr << "    removing delay violation." << endl);
      violated--;
      vinfo.delay--;
      SSUB(SCORE_OUTSIDE_DELAY);
    } else {
      SSUB(distance * SCORE_DELAY);
    }
Mac Newbold's avatar