gdunlap/sched-sim.hg

annotate simulator.c @ 6:403bd7680df6

Add runstate printing, script to run and parse
author George Dunlap <gdunlap@xensource.com>
date Mon Oct 19 20:15:18 2009 +0100 (2009-10-19)
parents 18f3d6e25ffc
children 31f36108fc43
rev   line source
gdunlap@0 1 #include <stdlib.h>
gdunlap@0 2 #include <stdio.h>
gdunlap@0 3 #include <assert.h>
gdunlap@0 4
gdunlap@0 5 #define ASSERT assert
gdunlap@0 6
gdunlap@0 7 #include "stats.h"
gdunlap@0 8 #include "list.h"
gdunlap@0 9 #include "sim.h"
gdunlap@0 10 #include "workload.h"
gdunlap@2 11 #include "sched.h"
gdunlap@2 12 #include "options.h"
gdunlap@0 13
gdunlap@0 14 FILE *warn;
gdunlap@0 15
gdunlap@0 16 enum event_type {
gdunlap@0 17 EVT_BLOCK,
gdunlap@0 18 EVT_WAKE,
gdunlap@0 19 EVT_TIMER,
gdunlap@0 20 EVT_MAX
gdunlap@0 21 };
gdunlap@0 22
gdunlap@0 23 char *event_name[EVT_MAX] = {
gdunlap@0 24 [EVT_BLOCK]="block",
gdunlap@0 25 [EVT_WAKE] ="wake ",
gdunlap@0 26 [EVT_TIMER]="timer"
gdunlap@0 27 };
gdunlap@0 28
gdunlap@0 29 struct event {
gdunlap@0 30 struct list_head event_list;
gdunlap@0 31 enum event_type type;
gdunlap@0 32 int time;
gdunlap@0 33 int param; /* Usually VM ID */
gdunlap@0 34 };
gdunlap@0 35
gdunlap@0 36 char * state_name[STATE_MAX] = {
gdunlap@0 37 [STATE_RUN]= "run ",
gdunlap@0 38 [STATE_PREEMPT]="preempt",
gdunlap@0 39 [STATE_WAKE]= "wake ",
gdunlap@0 40 [STATE_BLOCK]= "block ",
gdunlap@0 41 };
gdunlap@0 42
gdunlap@0 43 struct {
gdunlap@0 44 int now;
gdunlap@0 45 struct list_head events;
gdunlap@0 46 struct list_head *timer;
gdunlap@0 47 const struct sched_ops *sched_ops;
gdunlap@0 48 } sim;
gdunlap@0 49
gdunlap@0 50
gdunlap@1 51 #ifndef VM_DATA_PUBLIC
gdunlap@1 52 struct global_vm_data {
gdunlap@0 53 int count;
gdunlap@0 54 struct vm vms[MAX_VMS];
gdunlap@1 55 };
gdunlap@1 56 #endif
gdunlap@1 57 struct global_vm_data V;
gdunlap@0 58
gdunlap@0 59 extern struct scheduler sched_rr;
gdunlap@5 60 extern struct scheduler sched_credit01;
gdunlap@0 61 int default_scheduler = 0;
gdunlap@0 62 struct scheduler *schedulers[] =
gdunlap@0 63 {
gdunlap@0 64 &sched_rr,
gdunlap@5 65 &sched_credit01,
gdunlap@2 66 NULL
gdunlap@0 67 };
gdunlap@0 68
gdunlap@0 69 /* Options */
gdunlap@0 70
gdunlap@0 71 struct global_pcpu_data P;
gdunlap@0 72
gdunlap@0 73 /* Sim list interface */
gdunlap@0 74 /* NB: Caller must free if they're not going to use it! */
gdunlap@0 75 #define list_event(_l) (list_entry((_l), struct event, event_list))
gdunlap@0 76
gdunlap@0 77 struct event* sim_remove_event(int type, int param)
gdunlap@0 78 {
gdunlap@0 79 struct event* ret = NULL;
gdunlap@0 80 struct list_head *pos, *tmp;
gdunlap@0 81
gdunlap@0 82 /* Look for an event that matches this one and remove it */
gdunlap@0 83 list_for_each_safe(pos, tmp, &sim.events)
gdunlap@0 84 {
gdunlap@0 85 struct event *tevt = list_event(pos);
gdunlap@0 86 if ( tevt->type == type
gdunlap@0 87 && tevt->param == param )
gdunlap@0 88 {
gdunlap@0 89 list_del(pos);
gdunlap@0 90 ret = tevt;
gdunlap@0 91 break;
gdunlap@0 92 }
gdunlap@0 93 }
gdunlap@0 94
gdunlap@0 95 return ret;
gdunlap@0 96 }
gdunlap@0 97
gdunlap@0 98 void sim_insert_event(int time, int type, int param, int reset)
gdunlap@0 99 {
gdunlap@0 100 struct list_head *pos = NULL;
gdunlap@0 101 struct event *evt=NULL;
gdunlap@0 102
gdunlap@0 103 ASSERT(time >= sim.now);
gdunlap@0 104
gdunlap@0 105 if ( reset )
gdunlap@0 106 evt=sim_remove_event(type, param);
gdunlap@0 107
gdunlap@0 108 if ( !evt )
gdunlap@0 109 evt = (struct event *)malloc(sizeof(*evt));
gdunlap@0 110
gdunlap@0 111 evt->time = time;
gdunlap@0 112 evt->type = type;
gdunlap@0 113 evt->param = param;
gdunlap@0 114
gdunlap@1 115 printf(" [insert t%d %s param%d]\n",
gdunlap@1 116 evt->time, event_name[evt->type], evt->param);
gdunlap@1 117
gdunlap@0 118 INIT_LIST_HEAD(&evt->event_list);
gdunlap@0 119
gdunlap@0 120 list_for_each(pos, &sim.events)
gdunlap@0 121 {
gdunlap@0 122 if ( list_event(pos)->time > evt->time )
gdunlap@0 123 break;
gdunlap@0 124 }
gdunlap@0 125 list_add_tail(&evt->event_list, pos);
gdunlap@0 126 }
gdunlap@0 127
gdunlap@0 128 struct event sim_next_event(void)
gdunlap@0 129 {
gdunlap@0 130 struct event *evt;
gdunlap@0 131 struct list_head *next;
gdunlap@0 132
gdunlap@0 133 ASSERT(!list_empty(&sim.events));
gdunlap@0 134
gdunlap@0 135 next=sim.events.next;
gdunlap@0 136
gdunlap@0 137 list_del(next);
gdunlap@0 138
gdunlap@0 139 evt=list_event(next);
gdunlap@0 140
gdunlap@0 141 printf("%d: evt %s param%d\n",
gdunlap@0 142 evt->time, event_name[evt->type], evt->param);
gdunlap@0 143
gdunlap@0 144 free(evt);
gdunlap@0 145
gdunlap@0 146 /* XXX */
gdunlap@0 147 return *evt;
gdunlap@0 148 }
gdunlap@0 149
gdunlap@0 150 /*
gdunlap@0 151 * VM simulation
gdunlap@0 152 */
gdunlap@0 153 void vm_next_event(struct vm *v)
gdunlap@0 154 {
gdunlap@0 155 v->phase_index = ( v->phase_index + 1 ) % v->workload->phase_count;
gdunlap@0 156
gdunlap@0 157 v->e = v->workload->list + v->phase_index;
gdunlap@0 158 }
gdunlap@0 159
gdunlap@0 160 struct vm* vm_from_vid(int vid)
gdunlap@0 161 {
gdunlap@1 162 if ( vid >= V.count )
gdunlap@1 163 {
gdunlap@1 164 fprintf(stderr, "%s: v%d >= V.count %d!\n",
gdunlap@1 165 __func__, vid, V.count);
gdunlap@1 166 exit(1);
gdunlap@1 167 }
gdunlap@0 168
gdunlap@0 169 return V.vms + vid;
gdunlap@0 170 }
gdunlap@0 171
gdunlap@0 172 void vm_block(int now, struct vm *v)
gdunlap@0 173 {
gdunlap@0 174 ASSERT(v->e->type == PHASE_RUN);
gdunlap@0 175 v->time_this_phase += now - v->state_start_time;
gdunlap@3 176 printf("%s: v%d time_this_phase %d (evt %d)\n",
gdunlap@3 177 __func__, v->vid, v->time_this_phase, v->e->time);
gdunlap@0 178
gdunlap@0 179 ASSERT(v->time_this_phase == v->e->time);
gdunlap@0 180
gdunlap@0 181 vm_next_event(v);
gdunlap@0 182
gdunlap@0 183 ASSERT(v->e->type == PHASE_BLOCK);
gdunlap@0 184
gdunlap@0 185 sim_insert_event(now + v->e->time, EVT_WAKE, v->vid, 0);
gdunlap@0 186 v->time_this_phase = 0;
gdunlap@0 187 v->was_preempted = 0;
gdunlap@0 188 }
gdunlap@0 189
gdunlap@0 190 /* Called when wake event happens; increment timer and reset state */
gdunlap@0 191 void vm_wake(int now, struct vm *v)
gdunlap@0 192 {
gdunlap@0 193 ASSERT(v->e->type == PHASE_BLOCK);
gdunlap@0 194 ASSERT(v->time_this_phase == 0);
gdunlap@0 195
gdunlap@0 196 v->time_this_phase = now - v->state_start_time;
gdunlap@0 197
gdunlap@0 198 if ( now != 0 )
gdunlap@0 199 ASSERT(v->time_this_phase == v->e->time);
gdunlap@0 200
gdunlap@0 201 vm_next_event(v);
gdunlap@0 202
gdunlap@0 203 v->time_this_phase = 0;
gdunlap@0 204 }
gdunlap@0 205
gdunlap@0 206 /* Called when actually starting to run; make block event and set state */
gdunlap@0 207 void vm_run(int now, struct vm *v)
gdunlap@0 208 {
gdunlap@0 209 ASSERT(v->e->type == PHASE_RUN);
gdunlap@3 210 ASSERT(v->time_this_phase <= v->e->time);
gdunlap@0 211
gdunlap@0 212 sim_insert_event(now + v->e->time - v->time_this_phase, EVT_BLOCK, v->vid, 0);
gdunlap@0 213 v->state_start_time = now;
gdunlap@0 214 }
gdunlap@0 215
gdunlap@0 216 /* Preempt: Remove block event, update amount of runtime (so that when it runs again we can accurately
gdunlap@0 217 * generate a new block event) */
gdunlap@0 218 void vm_preempt(int now, struct vm *v)
gdunlap@0 219 {
gdunlap@0 220 struct event* evt;
gdunlap@0 221
gdunlap@3 222 v->time_this_phase += now - v->state_start_time;
gdunlap@3 223 printf("%s: v%d time_this_phase %d (evt %d)\n",
gdunlap@3 224 __func__, v->vid, v->time_this_phase, v->e->time);
gdunlap@3 225
gdunlap@3 226 ASSERT( v->time_this_phase <= v->e->time );
gdunlap@3 227
gdunlap@3 228 /* Only remove block event if we still have more runtime left */
gdunlap@0 229 if ( ( evt = sim_remove_event(EVT_BLOCK, v->vid) ) )
gdunlap@0 230 free(evt);
gdunlap@0 231
gdunlap@0 232 v->was_preempted = 1;
gdunlap@0 233 }
gdunlap@0 234
gdunlap@0 235
gdunlap@0 236 /* Callbacks the scheduler may make */
gdunlap@0 237 void sim_sched_timer(int time, int pid)
gdunlap@0 238 {
gdunlap@3 239 if ( time < 0 )
gdunlap@3 240 {
gdunlap@3 241 fprintf(stderr, "%s: Time %d < 0!\n",
gdunlap@3 242 __func__, time);
gdunlap@3 243 abort();
gdunlap@3 244 }
gdunlap@3 245
gdunlap@1 246 if ( pid >= P.count )
gdunlap@1 247 {
gdunlap@1 248 fprintf(stderr, "%s: p%d >= P.count %d\n",
gdunlap@1 249 __func__, pid, P.count);
gdunlap@1 250 exit(1);
gdunlap@1 251 }
gdunlap@1 252
gdunlap@1 253 if ( P.pcpus[pid].idle )
gdunlap@1 254 {
gdunlap@1 255 P.pcpus[pid].idle = 0;
gdunlap@1 256 P.idle--;
gdunlap@1 257 }
gdunlap@0 258 sim_insert_event(sim.now + time, EVT_TIMER, pid, 1);
gdunlap@0 259 }
gdunlap@0 260
gdunlap@6 261 void dump_running(int now, struct vm *v)
gdunlap@6 262 {
gdunlap@6 263 printf("runtime v%d %d %llu\n",
gdunlap@6 264 v->vid,
gdunlap@6 265 now,
gdunlap@6 266 v->stats.state[RUNSTATE_RUNNING].cycles);
gdunlap@6 267 }
gdunlap@6 268
gdunlap@0 269 void sim_runstate_change(int now, struct vm *v, int new_runstate)
gdunlap@0 270 {
gdunlap@0 271 int ostate, nstate;
gdunlap@0 272 int stime = now - v->state_start_time;
gdunlap@0 273
gdunlap@0 274 /* Valid transitions:
gdunlap@0 275 * + R->A (preemption): remove block event
gdunlap@0 276 * + R->B (block) : Insert wake event
gdunlap@0 277 * + A->R (run) : Insert block event
gdunlap@0 278 * + B->A (wake) : No action necessary
gdunlap@0 279 */
gdunlap@0 280
gdunlap@0 281 switch ( v->runstate )
gdunlap@0 282 {
gdunlap@0 283 case RUNSTATE_RUNNING:
gdunlap@0 284 ostate = STATE_RUN;
gdunlap@0 285 break;
gdunlap@0 286 case RUNSTATE_RUNNABLE:
gdunlap@0 287 if ( v->was_preempted )
gdunlap@0 288 ostate = STATE_PREEMPT;
gdunlap@0 289 else
gdunlap@0 290 ostate = STATE_WAKE;
gdunlap@0 291 break;
gdunlap@0 292 case RUNSTATE_BLOCKED:
gdunlap@0 293 ostate = STATE_BLOCK;
gdunlap@0 294 break;
gdunlap@0 295 }
gdunlap@0 296
gdunlap@0 297 update_cycles(&v->stats.state[ostate], stime);
gdunlap@0 298
gdunlap@6 299 if ( v->runstate == RUNSTATE_RUNNING
gdunlap@6 300 || new_runstate == RUNSTATE_RUNNING )
gdunlap@6 301 dump_running(now, v);
gdunlap@6 302
gdunlap@0 303
gdunlap@0 304 if ( v->runstate == RUNSTATE_RUNNING
gdunlap@0 305 && new_runstate == RUNSTATE_RUNNABLE )
gdunlap@0 306 {
gdunlap@0 307 nstate = STATE_PREEMPT;
gdunlap@0 308 vm_preempt(now, v);
gdunlap@0 309 }
gdunlap@0 310 else if ( v->runstate == RUNSTATE_RUNNING
gdunlap@0 311 && new_runstate == RUNSTATE_BLOCKED )
gdunlap@0 312 {
gdunlap@0 313 nstate = STATE_BLOCK;
gdunlap@0 314 vm_block(now, v);
gdunlap@0 315 }
gdunlap@0 316 else if ( v->runstate == RUNSTATE_RUNNABLE
gdunlap@0 317 && new_runstate == RUNSTATE_RUNNING )
gdunlap@0 318 {
gdunlap@0 319 nstate = STATE_RUN;
gdunlap@0 320 vm_run(now, v);
gdunlap@0 321 }
gdunlap@0 322 else if ( v->runstate == RUNSTATE_BLOCKED
gdunlap@0 323 && new_runstate == RUNSTATE_RUNNABLE )
gdunlap@0 324 {
gdunlap@0 325 nstate = STATE_WAKE;
gdunlap@0 326 vm_wake(now, v);
gdunlap@0 327 }
gdunlap@0 328 else
gdunlap@0 329 goto unexpected_transition;
gdunlap@0 330
gdunlap@0 331 printf("%d: v%d %s %d -> %s\n",
gdunlap@0 332 now, v->vid, state_name[ostate], stime, state_name[nstate]);
gdunlap@0 333
gdunlap@0 334 v->runstate = new_runstate;
gdunlap@0 335 v->state_start_time = now;
gdunlap@0 336
gdunlap@0 337 return;
gdunlap@0 338
gdunlap@0 339 unexpected_transition:
gdunlap@0 340 fprintf(stderr, "Unexpected transition for vm %d: %d->%d\n",
gdunlap@0 341 v->vid,
gdunlap@0 342 v->runstate,
gdunlap@0 343 new_runstate);
gdunlap@0 344 exit(1);
gdunlap@0 345 }
gdunlap@0 346
gdunlap@0 347 /*
gdunlap@0 348 * Main loop
gdunlap@0 349 */
gdunlap@0 350 void simulate(void)
gdunlap@0 351 {
gdunlap@0 352 while ( sim.now < opt.time_limit )
gdunlap@0 353 {
gdunlap@0 354 /* Take next event off list */
gdunlap@0 355 struct event evt;
gdunlap@0 356
gdunlap@0 357 evt = sim_next_event();
gdunlap@0 358
gdunlap@0 359 sim.now = evt.time;
gdunlap@0 360
gdunlap@0 361 switch(evt.type)
gdunlap@0 362 {
gdunlap@0 363 case EVT_WAKE:
gdunlap@0 364 {
gdunlap@0 365 struct vm *v = vm_from_vid(evt.param);
gdunlap@0 366 ASSERT(v->processor == -1);
gdunlap@0 367 sim_runstate_change(sim.now, v, RUNSTATE_RUNNABLE);
gdunlap@2 368 sim.sched_ops->wake(sim.now, v->vid);
gdunlap@0 369 }
gdunlap@0 370 break;
gdunlap@0 371 case EVT_BLOCK:
gdunlap@0 372 {
gdunlap@0 373 struct vm *v = vm_from_vid(evt.param);
gdunlap@0 374
gdunlap@0 375 ASSERT(v->processor != -1);
gdunlap@0 376 ASSERT(v->processor <= P.count);
gdunlap@0 377
gdunlap@0 378 sim_runstate_change(sim.now, v, RUNSTATE_BLOCKED);
gdunlap@0 379
gdunlap@0 380 evt.param = v->processor; /* FIXME */
gdunlap@0 381 }
gdunlap@0 382 /* FALL-THRU */
gdunlap@0 383 case EVT_TIMER:
gdunlap@0 384 {
gdunlap@0 385 struct vm *prev, *next;
gdunlap@0 386 int pid = evt.param;
gdunlap@0 387
gdunlap@0 388 ASSERT(pid < P.count);
gdunlap@0 389
gdunlap@0 390 prev = P.pcpus[pid].current;
gdunlap@0 391
gdunlap@0 392 next = sim.sched_ops->schedule(sim.now, pid);
gdunlap@0 393
gdunlap@0 394 if ( prev && prev != next )
gdunlap@0 395 {
gdunlap@0 396 prev->processor = -1;
gdunlap@0 397 if( prev->runstate != RUNSTATE_BLOCKED )
gdunlap@0 398 sim_runstate_change(sim.now, prev, RUNSTATE_RUNNABLE);
gdunlap@0 399 }
gdunlap@0 400
gdunlap@1 401
gdunlap@0 402 P.pcpus[pid].current = next;
gdunlap@1 403 if ( next )
gdunlap@1 404 {
gdunlap@1 405 if ( next != prev )
gdunlap@1 406 {
gdunlap@1 407 sim_runstate_change(sim.now, next, RUNSTATE_RUNNING);
gdunlap@1 408 next->processor = pid;
gdunlap@1 409 }
gdunlap@1 410 }
gdunlap@3 411 else
gdunlap@1 412 {
gdunlap@3 413 if ( P.pcpus[pid].idle )
gdunlap@3 414 {
gdunlap@3 415 fprintf(stderr, "Strange, pid %d already idle!\n",
gdunlap@3 416 pid);
gdunlap@3 417 abort();
gdunlap@3 418 }
gdunlap@3 419
gdunlap@3 420 /* If the pcpu is going idle, clear all timers from it */
gdunlap@3 421 sim_remove_event(EVT_TIMER, pid);
gdunlap@3 422
gdunlap@1 423 P.pcpus[pid].idle = 1;
gdunlap@1 424 P.idle++;
gdunlap@1 425 }
gdunlap@0 426 }
gdunlap@0 427 break;
gdunlap@0 428 default:
gdunlap@0 429 fprintf(stderr, "Unexpected event type: %d\n", evt.type);
gdunlap@0 430 exit(1);
gdunlap@0 431 break;
gdunlap@0 432 }
gdunlap@0 433 }
gdunlap@0 434 }
gdunlap@0 435
gdunlap@0 436 void init(void)
gdunlap@0 437 {
gdunlap@0 438 int vid, i;
gdunlap@0 439 const struct workload *w;
gdunlap@0 440
gdunlap@0 441 /* Initialize simulation variables */
gdunlap@0 442 sim.now=0;
gdunlap@0 443 sim.timer=NULL;
gdunlap@0 444 INIT_LIST_HEAD(&sim.events);
gdunlap@0 445 sim.sched_ops = &opt.scheduler->ops;
gdunlap@0 446
gdunlap@0 447 /* Initialize pcpus */
gdunlap@0 448 P.count = opt.pcpu_count;
gdunlap@1 449 P.idle = 0;
gdunlap@0 450 for ( i=0; i<P.count; i++ )
gdunlap@0 451 {
gdunlap@0 452 P.pcpus[i].pid = i;
gdunlap@1 453 P.pcpus[i].idle = 1;
gdunlap@1 454 P.idle++;
gdunlap@0 455 P.pcpus[i].current = NULL;
gdunlap@0 456 }
gdunlap@0 457
gdunlap@0 458 /* Initialize scheduler */
gdunlap@0 459 sim.sched_ops->sched_init();
gdunlap@0 460
gdunlap@0 461 /* Initialize vms */
gdunlap@0 462 w=opt.workload;
gdunlap@1 463 V.count = 0;
gdunlap@0 464 for ( vid=0; vid<w->vm_count; vid++)
gdunlap@0 465 {
gdunlap@0 466 struct vm *v = V.vms+vid;
gdunlap@0 467
gdunlap@0 468 v->vid = vid;
gdunlap@0 469 v->runstate = RUNSTATE_BLOCKED;
gdunlap@0 470 v->processor = -1;
gdunlap@0 471 v->private = NULL;
gdunlap@0 472
gdunlap@0 473 v->state_start_time = 0;
gdunlap@0 474 v->time_this_phase = 0;
gdunlap@0 475
gdunlap@0 476
gdunlap@0 477 v->phase_index = -1;
gdunlap@0 478 v->e = NULL;
gdunlap@0 479 v->workload = w->vm_workloads+vid;
gdunlap@0 480
gdunlap@0 481 V.count++;
gdunlap@0 482
gdunlap@0 483 sim.sched_ops->vm_init(vid);
gdunlap@0 484 }
gdunlap@0 485
gdunlap@0 486 /* Set VM starting conditions */
gdunlap@0 487 for ( vid=0; vid<V.count; vid++)
gdunlap@0 488 {
gdunlap@0 489 struct vm *v = V.vms+vid;
gdunlap@0 490
gdunlap@0 491 switch(v->workload->list[0].type)
gdunlap@0 492 {
gdunlap@0 493 case PHASE_RUN:
gdunlap@0 494 v->phase_index = v->workload->phase_count - 1;
gdunlap@0 495 v->e = v->workload->list + v->phase_index;
gdunlap@0 496
gdunlap@0 497 sim_insert_event(sim.now, EVT_WAKE, v->vid, 0);
gdunlap@0 498 v->state_start_time = sim.now;
gdunlap@0 499 v->time_this_phase = 0;
gdunlap@0 500 break;
gdunlap@0 501 case PHASE_BLOCK:
gdunlap@0 502 v->phase_index = 0;
gdunlap@0 503 v->e = v->workload->list;
gdunlap@0 504
gdunlap@0 505 sim_insert_event(sim.now + v->e->time, EVT_WAKE, v->vid, 0);
gdunlap@0 506 v->state_start_time = sim.now;
gdunlap@0 507 v->time_this_phase = 0;
gdunlap@0 508 break;
gdunlap@0 509 }
gdunlap@0 510 }
gdunlap@0 511 }
gdunlap@0 512
gdunlap@0 513 void report(void)
gdunlap@0 514 {
gdunlap@0 515 int i, j;
gdunlap@0 516
gdunlap@0 517 for ( i=0; i<V.count; i++ )
gdunlap@0 518 {
gdunlap@0 519 struct vm *v = V.vms + i;
gdunlap@0 520
gdunlap@0 521 printf("VM %d\n", i);
gdunlap@0 522 for ( j = 0; j < STATE_MAX ; j++ )
gdunlap@0 523 {
gdunlap@0 524 char s[128];
gdunlap@0 525 snprintf(s, 128, " %s", state_name[j]);
gdunlap@0 526 print_cycle_summary(&v->stats.state[j], sim.now, s);
gdunlap@0 527 }
gdunlap@0 528 }
gdunlap@0 529 }
gdunlap@0 530
gdunlap@0 531 int main(int argc, char * argv[])
gdunlap@0 532 {
gdunlap@0 533 warn = stdout;
gdunlap@0 534
gdunlap@2 535 parse_options(argc, argv);
gdunlap@0 536
gdunlap@0 537 /* Setup simulation */
gdunlap@0 538 init();
gdunlap@0 539
gdunlap@0 540 /* Run simulation */
gdunlap@0 541 simulate();
gdunlap@0 542 /* Report statistics */
gdunlap@0 543 report();
gdunlap@0 544 }