model-net-mpi-replay.c 36.4 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/*
 * Copyright (C) 2014 University of Chicago.
 * See COPYRIGHT notice in top-level directory.
 *
 */
#include <ross.h>
#include <inttypes.h>

#include "codes/codes-workload.h"
#include "codes/codes.h"
#include "codes/configuration.h"
#include "codes/codes_mapping.h"
#include "codes/model-net.h"
#include "codes/rc-stack.h"
#include "codes/quicklist.h"

#define TRACE -1
#define MAX_WAIT_REQS 200

char workload_type[128];
char workload_file[8192];
char offset_file[8192];
static int wrkld_id;
static int num_net_traces = 0;

/* Doing LP IO*/
static char lp_io_dir[256] = {'\0'};
static lp_io_handle io_handle;
static unsigned int lp_io_use_suffix = 0;
static int do_lp_io = 0;

typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
typedef int16_t dumpi_req_id;

static int net_id = 0;
static float noise = 5.0;
static int num_net_lps, num_nw_lps;

long long num_bytes_sent=0;
long long num_bytes_recvd=0;

double max_time = 0,  max_comm_time = 0, max_wait_time = 0, max_send_time = 0, max_recv_time = 0;
double avg_time = 0, avg_comm_time = 0, avg_wait_time = 0, avg_send_time = 0, avg_recv_time = 0;

/* global variables for codes mapping */
static char lp_group_name[MAX_NAME_LENGTH], lp_type_name[MAX_NAME_LENGTH], annotation[MAX_NAME_LENGTH];
static int mapping_grp_id, mapping_type_id, mapping_rep_id, mapping_offset;

/* runtime option for disabling computation time simulation */
static int disable_delay = 0;

/* MPI_OP_GET_NEXT is for getting next MPI operation when the previous operation completes.
* MPI_SEND_ARRIVED is issued when a MPI message arrives at its destination (the message is transported by model-net and an event is invoked when it arrives. 
* MPI_SEND_POSTED is issued when a MPI message has left the source LP (message is transported via model-net). */
enum MPI_NW_EVENTS
{
	MPI_OP_GET_NEXT=1,
	MPI_SEND_ARRIVED,
    MPI_SEND_ARRIVED_CB, // for tracking message times on sender
	MPI_SEND_POSTED,
};

/* stores pointers of pending MPI operations to be matched with their respective sends/receives. */
struct mpi_msgs_queue
{
    int op_type;
    int tag;
    int source_rank;
    int dest_rank;
    int num_bytes;
    tw_stime req_init_time;
	dumpi_req_id req_id;
    struct qlist_head ql;
};

/* stores request IDs of completed MPI operations (Isends or Irecvs) */
struct completed_requests
{
	dumpi_req_id req_id;
    struct qlist_head ql;
};

/* for wait operations, store the pending operation and number of completed waits so far. */
struct pending_waits
{
    int op_type;
    int req_ids[MAX_WAIT_REQS];
	int num_completed;
	tw_stime start_time;
    struct qlist_head ql;
};

typedef struct mpi_msgs_queue mpi_msgs_queue;
typedef struct completed_requests completed_requests;
typedef struct pending_waits pending_waits;

/* state of the network LP. It contains the pointers to send/receive lists */
struct nw_state
{
	long num_events_per_lp;
	tw_lpid nw_id;
	short wrkld_end;

    struct rc_stack * processed_ops;
	struct rc_stack * matched_qitems;

    /* count of sends, receives, collectives and delays */
	unsigned long num_sends;
	unsigned long num_recvs;
	unsigned long num_cols;
	unsigned long num_delays;
	unsigned long num_wait;
	unsigned long num_waitall;
	unsigned long num_waitsome;

	/* time spent by the LP in executing the app trace*/
	double start_time;
	double elapsed_time;
	/* time spent in compute operations */
	double compute_time;
	/* time spent in message send/isend */
	double send_time;
	/* time spent in message receive */
	double recv_time;
	/* time spent in wait operation */
	double wait_time;
	/* FIFO for isend messages arrived on destination */
	struct qlist_head arrival_queue;
	/* FIFO for irecv messages posted but not yet matched with send operations */
	struct qlist_head pending_recvs_queue;
	/* List of completed send/receive requests */
	struct qlist_head completed_reqs;
134
135
136

    /* Pending wait operation */
    struct pending_waits * wait_op;
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
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
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
* ptr_match_op holds the matched MPI operation which are removed from the queues when a send is matched with the receive in forward event handler. 
* network event being sent. op is the MPI operation issued by the network workloads API. rv_data holds the data for reverse computation (TODO: Fill this data structure only when the simulation runs in optimistic mode). */
struct nw_message
{
   int msg_type;

   struct
   {
     /* forward event handler */
     struct
     {
        int op_type;
        tw_lpid src_rank;
        tw_lpid dest_rank;
        int num_bytes;
        int data_type;
        double sim_start_time;
        // for callbacks - time message was received
        double msg_send_time;
        int16_t req_id;   
        int tag;
     } msg_info;

     /* required for reverse computation*/
     struct 
      {
        int found_match;
        short matched_op;
        dumpi_req_id saved_matched_req;

        double saved_send_time;
        double saved_recv_time;
        double saved_wait_time;
      } rc;
  } u;
};

/* executes MPI isend and send operations */
static void codes_exec_mpi_send(
        nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op);
/* execute MPI irecv operation */
static void codes_exec_mpi_recv(
        nw_state* s, tw_lp* lp, nw_message * m, struct codes_workload_op * mpi_op);
/* reverse of mpi recv function. */
static void codes_exec_mpi_recv_rc(
        nw_state* s, nw_message* m, tw_lp* lp, struct codes_workload_op * mpi_op);
/* execute the computational delay */
static void codes_exec_comp_delay(
        nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op);
/* gets the next MPI operation from the network-workloads API. */
static void get_next_mpi_operation(
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp);
/* reverse handler of get next mpi operation. */
static void get_next_mpi_operation_rc(
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp);
/* Makes a call to get_next_mpi_operation. */
static void codes_issue_next_event(tw_lp* lp);
/* reverse handler of next operation */
static void codes_issue_next_event_rc(tw_lp* lp);


///////////////////// HELPER FUNCTIONS FOR MPI MESSAGE QUEUE HANDLING ///////////////
/* upon arrival of local completion message, inserts operation in completed send queue */
/* upon arrival of an isend operation, updates the arrival queue of the network */
static void update_arrival_queue(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);
/* reverse of the above function */
static void update_arrival_queue_rc(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);
/* callback to a message sender for computing message time */
static void update_message_time(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);
/* reverse for computing message time */
static void update_message_time_rc(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);

/* conversion from seconds to eanaoseconds */
static tw_stime s_to_ns(tw_stime ns);

/* helper function - maps an MPI rank to an LP id */
static tw_lpid rank_to_lpid(int rank)
{
    return codes_mapping_get_lpid_from_relative(rank, NULL, "nw-lp", NULL, 0);
}

/* reverse handler of notify_waits function. */
/*static void notify_waits_rc(nw_state* s, tw_bf* bf, tw_lp* lp, nw_message* m, dumpi_req_id completed_req)
{
   int i;

   *//*if(bf->c1)
    {*/
	/* if pending wait is still present and is of type MPI_WAIT then do nothing*/
/*	s->wait_time = s->saved_wait_time; 	
	mpi_completed_queue_insert_op(&s->completed_reqs, completed_req);	
	s->pending_waits = wait_elem;
	s->saved_pending_wait = NULL;
    }
*/
/*  if(lp->gid == TRACE)
	  printf("\n %lf reverse -- notify waits req id %d ", tw_now(lp), completed_req);
  
  printCompletedQueue(s, lp);
  
  if(m->u.rc.matched_op == 1)
	s->pending_waits->num_completed--;
   *//* if a wait-elem exists, it means the request ID has been matched*/
  /* if(m->u.rc.matched_op == 2) 
    {
        if(lp->gid == TRACE)
        {
            printf("\n %lf matched req id %d ", tw_now(lp), completed_req);
            printCompletedQueue(s, lp);
        }
        struct pending_waits* wait_elem = m->u.rc.saved_pending_wait;
        s->wait_time = m->u.rc.saved_wait_time;
        int count = wait_elem->mpi_op->u.waits.count; 

        for( i = 0; i < count; i++ )
            mpi_completed_queue_insert_op(&s->completed_reqs, wait_elem->mpi_op->u.waits.req_ids[i]);

        wait_elem->num_completed--;	
        s->pending_waits = wait_elem;
        tw_rand_reverse_unif(lp->rng);
   }
}*/

/* notify the completed send/receive request to the wait operation. */
/*static int notify_waits(nw_state* s, tw_bf* bf, tw_lp* lp, nw_message* m, dumpi_req_id completed_req)
{
	int i;
	*//* traverse the pending waits list and look what type of wait operations are 
	there. If its just a single wait and the request ID has just been completed, 
	then the network node LP can go on with fetching the next operation from the log.
	If its waitall then wait for all pending requests to complete and then proceed. */
	/*struct pending_waits* wait_elem = s->pending_waits;
	m->u.rc.matched_op = 0;
	
	if(lp->gid == TRACE)
		printf("\n %lf notify waits req id %d ", tw_now(lp), completed_req);

	if(!wait_elem)
		return 0;

	int op_type = wait_elem->mpi_op->op_type;

	if(op_type == CODES_WK_WAIT)
	{
		if(wait_elem->mpi_op->u.wait.req_id == completed_req)	
		  {
			m->u.rc.saved_wait_time = s->wait_time;
			s->wait_time += (tw_now(lp) - wait_elem->start_time);
                        remove_req_id(&s->completed_reqs, completed_req);
	
			m->u.rc.saved_pending_wait = wait_elem;			
            s->pending_waits = NULL;
			codes_issue_next_event(lp);	
			return 0;
		 }
	}
	else if(op_type == CODES_WK_WAITALL)
	{
	   int required_count = wait_elem->mpi_op->u.waits.count;
	  for(i = 0; i < required_count; i++)
	   {
	    if(wait_elem->mpi_op->u.waits.req_ids[i] == completed_req)
		{
			if(lp->gid == TRACE)
				printCompletedQueue(s, lp);
			m->u.rc.matched_op = 1;
			wait_elem->num_completed++;	
		}
	   }
	   
	  if(wait_elem->num_completed == required_count)
	   {
            if(lp->gid == TRACE)
            {
                printf("\n %lf req %d completed %d", tw_now(lp), completed_req, wait_elem->num_completed);
                printCompletedQueue(s, lp);
            }
            m->u.rc.matched_op = 2;
            m->u.rc.saved_wait_time = s->wait_time;
            s->wait_time += (tw_now(lp) - wait_elem->start_time);
            m->u.rc.saved_pending_wait = wait_elem;
            s->pending_waits = NULL; 
            
            for(i = 0; i < required_count; i++)
                remove_req_id(&s->completed_reqs, wait_elem->mpi_op->u.waits.req_ids[i]);	
            
            codes_issue_next_event(lp); //wait completed
       }
    }
	return 0;
}
*/
/* reverse handler of MPI wait operation */
/*static void codes_exec_mpi_wait_rc(nw_state* s, nw_message* m, tw_lp* lp, struct codes_workload_op * mpi_op)
{
    if(s->pending_waits)
     {
    	s->pending_waits = NULL;
	    return;
     }
   else
    {
        codes_issue_next_event_rc(lp);
 	    mpi_completed_queue_insert_op(&s->completed_reqs, mpi_op->u.wait.req_id);	
        rc_stack_pop(s->st);
    }
}
*/
/* execute MPI wait operation */
/*static void codes_exec_mpi_wait(nw_state* s, tw_lp* lp, nw_message * m, struct codes_workload_op * mpi_op)
{
*/    /* check in the completed receives queue if the request ID has already been completed.*/
/*    assert(!s->pending_waits);
    dumpi_req_id req_id = mpi_op->u.wait.req_id;

    struct completed_requests* current = s->completed_reqs;
    while(current) {
        if(current->req_id == req_id) {
            remove_req_id(&s->completed_reqs, req_id);
            m->u.rc.saved_wait_time = s->wait_time;
            codes_issue_next_event(lp);
            return;
        }
        current = current->next;
    }

  */  /* If not, add the wait operation in the pending 'waits' list. */
    /*struct pending_waits* wait_op = malloc(sizeof(struct pending_waits));
    wait_op->mpi_op = mpi_op;
    wait_op->num_completed = 0;
    wait_op->start_time = tw_now(lp);
    s->pending_waits = wait_op;

//    rc_stack_push(lp, wait_op, free, s->st);
}

static void codes_exec_mpi_wait_all_rc(nw_state* s, nw_message* m, tw_lp* lp, struct codes_workload_op * mpi_op)
{
  if(lp->gid == TRACE)
   {
       printf("\n %lf codes exec mpi waitall reverse %d ", tw_now(lp), m->u.rc.found_match);
       printCompletedQueue(s, lp); 
   } 
  if(m->u.rc.found_match)
    {
        int i;
        int count = mpi_op->u.waits.count;
        dumpi_req_id req_id[count];

        for( i = 0; i < count; i++)
        {
            req_id[i] = mpi_op->u.waits.req_ids[i];
            mpi_completed_queue_insert_op(&s->completed_reqs, req_id[i]);
        }
        codes_issue_next_event_rc(lp);
    }
    else
    {
        struct pending_waits* wait_op = s->pending_waits;
        rc_stack_pop(s->st);
        s->pending_waits = NULL;
        assert(!s->pending_waits);
        if(lp->gid == TRACE)
            printf("\n %lf Nullifying codes waitall ", tw_now(lp));
   }
}
static void codes_exec_mpi_wait_all(
        nw_state* s, tw_lp* lp, nw_message * m, struct codes_workload_op * mpi_op)
{
  //assert(!s->pending_waits);
  int count = mpi_op->u.waits.count;
  *//* If the count is not less than max wait reqs then stop */
  /*assert(count < MAX_WAIT_REQS);

  int i, num_completed = 0;
  dumpi_req_id req_id[count];
  struct completed_requests* current = s->completed_reqs;

  *//* check number of completed irecvs in the completion queue */ 
  /*if(lp->gid == TRACE)
    {
  	printf(" \n (%lf) MPI waitall posted %d count", tw_now(lp), mpi_op->u.waits.count);
	for(i = 0; i < count; i++)
		printf(" %d ", (int)mpi_op->u.waits.req_ids[i]);
   	printCompletedQueue(s, lp);	 
   }
  while(current) 
   {
	  for(i = 0; i < count; i++)
	   {
	     req_id[i] = mpi_op->u.waits.req_ids[i];
	     if(req_id[i] == current->req_id)
 		    num_completed++;
   	  }
	 current = current->next;
   }

  if(TRACE== lp->gid)
	  printf("\n %lf Num completed %d count %d ", tw_now(lp), num_completed, count);

  m->u.rc.found_match = 0;
  if(count == num_completed)
  {
	m->u.rc.found_match = 1;
	for( i = 0; i < count; i++)	
		remove_req_id(&s->completed_reqs, req_id[i]);

	codes_issue_next_event(lp);
  }
  else
  {*/
 	/* If not, add the wait operation in the pending 'waits' list. */
	  /*struct pending_waits* wait_op = malloc(sizeof(struct pending_waits));
	  wait_op->mpi_op = mpi_op;  
	  wait_op->num_completed = num_completed;
	  wait_op->start_time = tw_now(lp);
      rc_stack_push(lp, wait_op, free, s->st);
      s->pending_waits = wait_op;
  }
}*/

/* search for a matching mpi operation and remove it from the list. 
 * Record the index in the list from where the element got deleted. 
 * Index is used for inserting the element once again in the queue for reverse computation. */
static int rm_matching_rcv(nw_state * ns, tw_lp * lp, mpi_msgs_queue * qitem)
{
    int matched = 0;
472
    int index = 0;
473
474
475
476
477
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;
    qlist_for_each(ent, &ns->pending_recvs_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
        if((qi->num_bytes >= qitem->num_bytes)
478
479
                && ((qi->tag == qitem->tag) || qi->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qi->source_rank == -1))
480
481
482
483
        {
            matched = 1;
            break;
        }
484
        ++index;
485
486
487
488
489
490
491
    }
    
    if(matched)
    {
        ns->recv_time += (tw_now(lp) - qi->req_init_time);
        qlist_del(&qi->ql);
        rc_stack_push(lp, qi, free, ns->matched_qitems);
492
        return index;
493
494
495
496
497
498
499
500
501
502
503
    }
    return -1;
}

static int rm_matching_send(nw_state * ns, tw_lp * lp, mpi_msgs_queue * qitem)
{

    int matched = 0;
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;

504
    int index = 0;
505
506
507
508
509
510
511
512
513
    qlist_for_each(ent, &ns->arrival_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
        if((qi->num_bytes <= qitem->num_bytes) 
                && (qi->tag == qitem->tag || qitem->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qitem->source_rank == -1))
        {
            matched = 1;
            break;
        }
514
        ++index;
515
516
517
518
519
520
    }

    if(matched)
    {
        qlist_del(&qi->ql);
        rc_stack_push(lp, qi, free, ns->matched_qitems);
521
        return index;
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
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
    }
    return -1;
}
static void codes_issue_next_event_rc(tw_lp * lp)
{
	    tw_rand_reverse_unif(lp->rng);	
}

/* Trigger getting next event at LP */
static void codes_issue_next_event(tw_lp* lp)
{
   tw_event *e;
   nw_message* msg;

   tw_stime ts;

   ts = g_tw_lookahead + 0.1 + tw_rand_exponential(lp->rng, noise);
   e = tw_event_new( lp->gid, ts, lp );
   msg = tw_event_data(e);

   msg->msg_type = MPI_OP_GET_NEXT;
   tw_event_send(e);
}

/* Simulate delays between MPI operations */
static void codes_exec_comp_delay(
        nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op)
{
	tw_event* e;
	tw_stime ts;
	nw_message* msg;

        if (disable_delay) {
            ts = 0.0; // no compute time sim
        }
        else {
            s->compute_time += s_to_ns(mpi_op->u.delay.seconds);
            ts = s_to_ns(mpi_op->u.delay.seconds);
        }

	ts += g_tw_lookahead + 0.1 + tw_rand_exponential(lp->rng, noise);
	
	e = tw_event_new( lp->gid, ts , lp );
	msg = tw_event_data(e);
	msg->msg_type = MPI_OP_GET_NEXT;

	tw_event_send(e); 
                
}

/* reverse computation operation for MPI irecv */
static void codes_exec_mpi_recv_rc(nw_state* ns, nw_message* m, tw_lp* lp, struct codes_workload_op * mpi_op)
{
	num_bytes_recvd -= mpi_op->u.recv.num_bytes;
	ns->recv_time = m->u.rc.saved_recv_time;
577
	if(m->u.rc.found_match >= 0)
578
579
580
	  {
        rc_stack_pop(ns->matched_qitems);
		ns->recv_time = m->u.rc.saved_recv_time;
581
        int queue_count = qlist_count(&ns->arrival_queue); 
582
583
        
        mpi_msgs_queue * qi = rc_stack_pop(ns->matched_qitems);	
584
585
586
587
588
589
590
591
592
593
       
        if(!m->u.rc.found_match)
        {
            qlist_add(&qi->ql, &ns->arrival_queue);
        }
        else if(m->u.rc.found_match == queue_count)
        {
            qlist_add_tail(&qi->ql, &ns->arrival_queue);
        }
        else if(m->u.rc.found_match > 0 && m->u.rc.found_match < queue_count) 
594
        {
595
596
597
598
599
600
601
602
603
604
605
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &ns->arrival_queue)
            {
               if(index == m->u.rc.found_match)
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
               index++; 
            }
606
        }
607
608
609
610
        codes_issue_next_event_rc(lp);
      }
	else if(m->u.rc.found_match < 0)
	    {
611
612
613
614
615
616
            struct qlist_head * ent = qlist_pop_back(&ns->pending_recvs_queue); 
            mpi_msgs_queue * qi = qlist_entry(ent, mpi_msgs_queue, ql);
            free(qi);
            
            if(mpi_op->op_type == CODES_WK_IRECV)
                codes_issue_next_event_rc(lp);
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
	    }
}

/* Execute MPI Irecv operation (non-blocking receive) */ 
static void codes_exec_mpi_recv(nw_state* s, tw_lp* lp, nw_message * m, struct codes_workload_op * mpi_op)
{
/* Once an irecv is posted, list of completed sends is checked to find a matching isend.
   If no matching isend is found, the receive operation is queued in the pending queue of
   receive operations. */

	m->u.rc.saved_recv_time = s->recv_time;
	num_bytes_recvd += mpi_op->u.recv.num_bytes;

    mpi_msgs_queue * recv_op = (mpi_msgs_queue*) malloc(sizeof(mpi_msgs_queue));
    recv_op->req_init_time = tw_now(lp);
    recv_op->op_type = mpi_op->op_type;
    recv_op->source_rank = mpi_op->u.recv.source_rank;
    recv_op->dest_rank = mpi_op->u.recv.dest_rank;
    recv_op->num_bytes = mpi_op->u.recv.num_bytes;
    recv_op->tag = mpi_op->u.recv.tag;
    recv_op->req_id = mpi_op->u.recv.req_id;

	int found_matching_sends = rm_matching_send(s, lp, recv_op);

	/* save the req id inserted in the completed queue for reverse computation. */
	if(found_matching_sends < 0)
	  {
	   	  m->u.rc.found_match = -1;
645
          qlist_add_tail(&recv_op->ql, &s->pending_recvs_queue);
646
647
648
649
650
651
652
653
654
655
	
	       /* for mpi irecvs, this is a non-blocking receive so just post it and move on with the trace read. */
		if(mpi_op->op_type == CODES_WK_IRECV)
		   {
			codes_issue_next_event(lp);	
			return;
		   }
	  }
	else
	  {
656
	   	m->u.rc.found_match = found_matching_sends;
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
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
        rc_stack_push(lp, recv_op, free, s->matched_qitems);
        codes_issue_next_event(lp); 
	 }
}

/* executes MPI send and isend operations */
static void codes_exec_mpi_send(nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op)
{
	/* model-net event */
	tw_lpid dest_rank;
	codes_mapping_get_lp_info(lp->gid, lp_group_name, &mapping_grp_id, 
	    lp_type_name, &mapping_type_id, annotation, &mapping_rep_id, &mapping_offset);

	if(net_id == DRAGONFLY) /* special handling for the dragonfly case */
	{
		int num_routers, lps_per_rep, factor;
		num_routers = codes_mapping_get_lp_count("MODELNET_GRP", 1,
                  "dragonfly_router", NULL, 1);
	 	lps_per_rep = (2 * num_nw_lps) + num_routers;	
		factor = mpi_op->u.send.dest_rank / num_nw_lps;
		dest_rank = (lps_per_rep * factor) + (mpi_op->u.send.dest_rank % num_nw_lps);	
	}
	else
	{
		/* other cases like torus/simplenet/loggp etc. */
		codes_mapping_get_lp_id(lp_group_name, lp_type_name, NULL, 1,  
	    	  mpi_op->u.send.dest_rank, mapping_offset, &dest_rank);
	}

	num_bytes_sent += mpi_op->u.send.num_bytes;

	nw_message local_m;
	nw_message remote_m;

    local_m.u.msg_info.sim_start_time = tw_now(lp);
    local_m.u.msg_info.dest_rank = mpi_op->u.send.dest_rank;
    local_m.u.msg_info.src_rank = mpi_op->u.send.source_rank;
    local_m.u.msg_info.op_type = mpi_op->op_type; 
    local_m.msg_type = MPI_SEND_POSTED;
    local_m.u.msg_info.tag = mpi_op->u.send.tag;
    local_m.u.msg_info.num_bytes = mpi_op->u.send.num_bytes;
    local_m.u.msg_info.req_id = mpi_op->u.send.req_id;

    remote_m = local_m;
	remote_m.msg_type = MPI_SEND_ARRIVED;

	model_net_event(net_id, "test", dest_rank, mpi_op->u.send.num_bytes, 0.0, 
	    sizeof(nw_message), (const void*)&remote_m, sizeof(nw_message), (const void*)&local_m, lp);

	/* isend executed, now get next MPI operation from the queue */ 
	if(mpi_op->op_type == CODES_WK_ISEND)
	   codes_issue_next_event(lp);
}

/* convert seconds to ns */
static tw_stime s_to_ns(tw_stime ns)
{
    return(ns * (1000.0 * 1000.0 * 1000.0));
}

/* reverse handler for updating arrival queue function */
static void update_arrival_queue_rc(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
	s->recv_time = m->u.rc.saved_recv_time;
    codes_local_latency_reverse(lp);
722
723
  
    if(m->u.rc.found_match >= 0)
724
725
726
	{
        rc_stack_pop(s->matched_qitems);
        mpi_msgs_queue * qi = rc_stack_pop(s->matched_qitems);	
727
728
729
730
731
732
733
        int queue_count = qlist_count(&s->pending_recvs_queue); 

        if(!m->u.rc.found_match)
        {
            qlist_add(&qi->ql, &s->pending_recvs_queue);
        }
        else if(m->u.rc.found_match == queue_count)
734
        {
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
            qlist_add_tail(&qi->ql, &s->pending_recvs_queue);
        }
        else if(m->u.rc.found_match > 0 && m->u.rc.found_match < queue_count)
        {
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &s->pending_recvs_queue)
            {
               if(index == m->u.rc.found_match)
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
               index++; 
            }
750
751
        }
    }
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
	else if(m->u.rc.found_match < 0)
	{
	    struct qlist_head * ent = qlist_pop_back(&s->arrival_queue); 
        mpi_msgs_queue * qi = qlist_entry(ent, mpi_msgs_queue, ql);
        free(qi);
    }
}

/* once an isend operation arrives, the pending receives queue is checked to find out if there is a irecv that has already been posted. If no isend has been posted, */
static void update_arrival_queue(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
	m->u.rc.saved_recv_time = s->recv_time;


    // send a callback to the sender to increment times
    tw_event *e_callback =
        tw_event_new(rank_to_lpid(m->u.msg_info.src_rank),
                codes_local_latency(lp), lp);
    nw_message *m_callback = tw_event_data(e_callback);
    m_callback->msg_type = MPI_SEND_ARRIVED_CB;
    m_callback->u.msg_info.msg_send_time = tw_now(lp) - m->u.msg_info.sim_start_time;
    tw_event_send(e_callback);

    /* Now reconstruct the queue item */
    mpi_msgs_queue * arrived_op = (mpi_msgs_queue *) malloc(sizeof(mpi_msgs_queue));
    arrived_op->req_init_time = m->u.msg_info.sim_start_time;
    arrived_op->op_type = m->u.msg_info.op_type;
    arrived_op->source_rank = m->u.msg_info.src_rank;
    arrived_op->dest_rank = m->u.msg_info.dest_rank;
    arrived_op->num_bytes = m->u.msg_info.num_bytes;
    arrived_op->tag = m->u.msg_info.tag;
    arrived_op->req_id = m->u.msg_info.req_id;

    int found_matching_recv = rm_matching_rcv(s, lp, arrived_op);

    if(found_matching_recv < 0)
    {
        m->u.rc.found_match = -1;
        qlist_add_tail(&arrived_op->ql, &s->arrival_queue);
    }
    else
    {
794
        m->u.rc.found_match = found_matching_recv;
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
        rc_stack_push(lp, arrived_op, free, s->matched_qitems);
    }
}
static void update_message_time(
        nw_state * s,
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp)
{
    m->u.rc.saved_send_time = s->send_time;
    s->send_time += m->u.msg_info.msg_send_time;
}

static void update_message_time_rc(
        nw_state * s,
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp)
{
    s->send_time = m->u.rc.saved_send_time;
}

/* initializes the network node LP, loads the trace file in the structs, calls the first MPI operation to be executed */
void nw_test_init(nw_state* s, tw_lp* lp)
{
   /* initialize the LP's and load the data */
   char * params = NULL;
   dumpi_trace_params params_d;
  
   memset(s, 0, sizeof(*s));
825
   s->nw_id = codes_mapping_get_lp_relative_id(lp->gid, 0, 0);
826
827
828
829

   if(!num_net_traces) 
	num_net_traces = num_net_lps;

830
831
   assert(num_net_traces <= num_net_lps);

832
833
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
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
   if (strcmp(workload_type, "dumpi") == 0){
       strcpy(params_d.file_name, workload_file);
       params_d.num_net_traces = num_net_traces;

       params = (char*)&params_d;
   }
  /* In this case, the LP will not generate any workload related events*/
   if(s->nw_id >= params_d.num_net_traces)
	    return;

   /* Initialize the RC stack */
   rc_stack_create(&s->processed_ops);
   rc_stack_create(&s->matched_qitems);

   assert(s->processed_ops != NULL);
   assert(s->matched_qitems != NULL);

   wrkld_id = codes_workload_load("dumpi-trace-workload", params, 0, (int)s->nw_id);

   INIT_QLIST_HEAD(&s->arrival_queue);
   INIT_QLIST_HEAD(&s->pending_recvs_queue);
   INIT_QLIST_HEAD(&s->completed_reqs);

   /* clock starts when the first event is processed */
   s->start_time = tw_now(lp);
   codes_issue_next_event(lp);

   return;
}

void nw_test_event_handler(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
	*(int *)bf = (int)0;
    rc_stack_gc(lp, s->processed_ops);
    rc_stack_gc(lp, s->matched_qitems);

    switch(m->msg_type)
	{
		case MPI_SEND_ARRIVED:
			update_arrival_queue(s, bf, m, lp);
		break;

		case MPI_SEND_ARRIVED_CB:
			update_message_time(s, bf, m, lp);
		break;

		case MPI_OP_GET_NEXT:
			get_next_mpi_operation(s, bf, m, lp);	
		break; 
	}
}

static void get_next_mpi_operation_rc(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
    struct codes_workload_op * mpi_op = 
        (struct codes_workload_op *)rc_stack_pop(s->processed_ops);
	
    codes_workload_get_next_rc(wrkld_id, 0, (int)s->nw_id, mpi_op);

	if(mpi_op->op_type == CODES_WK_END)
		return;

	switch(mpi_op->op_type)
	{
		case CODES_WK_SEND:
		case CODES_WK_ISEND:
		{
			model_net_event_rc(net_id, lp, mpi_op->u.send.num_bytes);
			if(mpi_op->op_type == CODES_WK_ISEND)
				codes_issue_next_event_rc(lp);
			s->num_sends--;
			num_bytes_sent -= mpi_op->u.send.num_bytes;
		}
		break;

		case CODES_WK_IRECV:
		case CODES_WK_RECV:
		{
			codes_exec_mpi_recv_rc(s, m, lp, mpi_op);
			s->num_recvs--;
		}
		break;
		case CODES_WK_DELAY:
		{
			s->num_delays--;
                        
            if (!disable_delay) {
                    tw_rand_reverse_unif(lp->rng);
                     s->compute_time -= s_to_ns(mpi_op->u.delay.seconds);
            }
		}
		break;
		case CODES_WK_BCAST:
		case CODES_WK_ALLGATHER:
		case CODES_WK_ALLGATHERV:
		case CODES_WK_ALLTOALL:
		case CODES_WK_ALLTOALLV:
		case CODES_WK_REDUCE:
		case CODES_WK_ALLREDUCE:
		case CODES_WK_COL:
		{
			s->num_cols--;
		    codes_issue_next_event_rc(lp);
        }
		break;
	
		case CODES_WK_WAIT:
		{
			s->num_wait--;
		    codes_issue_next_event_rc(lp);
			//codes_exec_mpi_wait_rc(s, m, lp, mpi_op);
		}
		break;
		case CODES_WK_WAITALL:
		{
			s->num_waitall--;
		    codes_issue_next_event_rc(lp);
			//codes_exec_mpi_wait_all_rc(s, m, lp, mpi_op);
		}
		break;
		case CODES_WK_WAITSOME:
		case CODES_WK_WAITANY:
		{
			s->num_waitsome--;
		    codes_issue_next_event_rc(lp);
        }
		break;
		default:
			printf("\n Invalid op type %d ", mpi_op->op_type);
	}
}

static void get_next_mpi_operation(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
		struct codes_workload_op * mpi_op = malloc(sizeof(struct codes_workload_op));
        codes_workload_get_next(wrkld_id, 0, (int)s->nw_id, mpi_op);
968
        rc_stack_push(lp, mpi_op, free, s->processed_ops);
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000

        if(mpi_op->op_type == CODES_WK_END)
        {
            s->elapsed_time = tw_now(lp) - s->start_time;
            return;
        }
		switch(mpi_op->op_type)
		{
			case CODES_WK_SEND:
			case CODES_WK_ISEND:
			 {
				s->num_sends++;
				codes_exec_mpi_send(s, lp, mpi_op);
			 }
			break;
	
			case CODES_WK_RECV:
			case CODES_WK_IRECV:
			  {
				s->num_recvs++;
				codes_exec_mpi_recv(s, lp, m, mpi_op);
			  }
			break;

			case CODES_WK_DELAY:
			  {
				s->num_delays++;
				codes_exec_comp_delay(s, lp, mpi_op);
			  }
			break;

			case CODES_WK_BCAST:
For faster browsing, not all history is shown. View entire blame