gdunlap/sched-sim.hg

annotate simulator.c @ 2:1d7310217c5a

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