-
Notifications
You must be signed in to change notification settings - Fork 0
/
hmpi_p2p.c.back
2196 lines (1770 loc) · 67.4 KB
/
hmpi_p2p.c.back
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
134
135
136
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
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
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
577
578
579
580
581
582
583
584
585
586
587
588
589
590
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
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
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
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
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
794
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
825
826
827
828
829
830
831
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
968
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
/* Copyright (c) 2010-2013 The Trustees of Indiana University.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* - Neither the Indiana University nor the names of its contributors may be
* used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef MPI
#define MPI_FOO
#undef MPI
#endif
#define HMPI_INTERNAL
#include "hmpi.h"
#ifdef MPI_FOO
#define MPI
#else
#undef MPI
#endif
#include "profile.h"
//Block size to use when using the accelerated sender-receiver copy.
#ifdef __bg__
#define BLOCK_SIZE_ONE 16384
//#define BLOCK_SIZE_ONE 4096
#define BLOCK_SIZE_TWO 65536
#else
#define BLOCK_SIZE_ONE 4096
#define BLOCK_SIZE_TWO 12288
#endif
#define MIN_COPY_SIZE 4096
#include <malloc.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "error.h"
#include "lock.h"
#include "profile.h"
#ifdef FULL_PROFILE
#define FULL_PROFILE_INIT() PROFILE_INIT()
#define FULL_PROFILE_TIMER(v) PROFILE_TIMER(v)
#define FULL_PROFILE_TIMER_EXTERN(v) PROFILE_TIMER_EXTERN(v)
#define FULL_PROFILE_START(v) PROFILE_START(v)
#define FULL_PROFILE_STOP(v) PROFILE_STOP(v)
#define FULL_PROFILE_TIMER_RESET(v) PROFILE_TIMER_RESET(v)
#define FULL_PROFILE_TIMER_SHOW(v) PROFILE_TIMER_SHOW(v)
#else
#define FULL_PROFILE_INIT()
#define FULL_PROFILE_TIMER(v)
#define FULL_PROFILE_TIMER_EXTERN(v)
#define FULL_PROFILE_START(v)
#define FULL_PROFILE_STOP(v)
#define FULL_PROFILE_TIMER_RESET(v)
#define FULL_PROFILE_TIMER_SHOW(v)
#endif
FULL_PROFILE_TIMER_EXTERN(MPI_Other);
FULL_PROFILE_TIMER_EXTERN(MPI_Send);
FULL_PROFILE_TIMER_EXTERN(MPI_Recv);
FULL_PROFILE_TIMER_EXTERN(MPI_Isend);
FULL_PROFILE_TIMER_EXTERN(MPI_Irecv);
FULL_PROFILE_TIMER_EXTERN(MPI_Test);
FULL_PROFILE_TIMER_EXTERN(MPI_Testall);
FULL_PROFILE_TIMER_EXTERN(MPI_Wait);
FULL_PROFILE_TIMER_EXTERN(MPI_Waitall);
FULL_PROFILE_TIMER_EXTERN(MPI_Waitany);
FULL_PROFILE_TIMER_EXTERN(MPI_Iprobe);
FULL_PROFILE_TIMER_EXTERN(MPI_Barrier);
FULL_PROFILE_TIMER_EXTERN(MPI_Reduce);
FULL_PROFILE_TIMER_EXTERN(MPI_Allreduce);
FULL_PROFILE_TIMER_EXTERN(MPI_Scan);
FULL_PROFILE_TIMER_EXTERN(MPI_Bcast);
FULL_PROFILE_TIMER_EXTERN(MPI_Scatter);
FULL_PROFILE_TIMER_EXTERN(MPI_Gather);
FULL_PROFILE_TIMER_EXTERN(MPI_Gatherv);
FULL_PROFILE_TIMER_EXTERN(MPI_Allgather);
FULL_PROFILE_TIMER_EXTERN(MPI_Allgatherv);
FULL_PROFILE_TIMER_EXTERN(MPI_Alltoall);
#ifdef ENABLE_OPI
FULL_PROFILE_TIMER_EXTERN(OPI_Alloc);
FULL_PROFILE_TIMER_EXTERN(OPI_Free);
FULL_PROFILE_TIMER_EXTERN(OPI_Give);
FULL_PROFILE_TIMER_EXTERN(OPI_Take);
#endif
//Statistics on message size, counts.
#ifdef HMPI_STATS
#define HMPI_STATS_INIT() PROFILE_INIT()
#define HMPI_STATS_COUNTER(v) PROFILE_COUNTER(v)
#define HMPI_STATS_COUNTER_EXTERN(v) PROFILE_COUNTER_EXTERN(v)
#define HMPI_STATS_ACCUMULATE(v, c) PROFILE_ACCUMULATE(v, c)
#define HMPI_STATS_COUNTER_RESET(v) PROFILE_COUNTER_RESET(v)
#define HMPI_STATS_COUNTER_SHOW(v) PROFILE_COUNTER_SHOW(v)
#else
#define HMPI_STATS_INIT()
#define HMPI_STATS_COUNTER(v)
#define HMPI_STATS_COUNTER_EXTERN(v)
#define HMPI_STATS_ACCUMULATE(v, c)
#define HMPI_STATS_COUNTER_RESET(v)
#define HMPI_STATS_COUNTER_SHOW(v)
#endif
HMPI_STATS_COUNTER_EXTERN(send_size);
HMPI_STATS_COUNTER_EXTERN(send_local);
HMPI_STATS_COUNTER_EXTERN(send_remote);
HMPI_STATS_COUNTER_EXTERN(send_imm);
HMPI_STATS_COUNTER_EXTERN(send_syn);
HMPI_STATS_COUNTER_EXTERN(recv_syn);
HMPI_STATS_COUNTER_EXTERN(recv_mem);
HMPI_STATS_COUNTER_EXTERN(recv_anysrc);
// Debugging functionality
#if 0
#include <execinfo.h>
static void show_backtrace(void) __attribute__((unused));
static void show_backtrace(void)
{
void* buffer[64];
int nptrs;
nptrs = backtrace(buffer, 64);
backtrace_symbols_fd(buffer, nptrs, STDOUT_FILENO);
fflush(stdout);
}
#endif
#ifdef HMPI_CHECKSUM
uint32_t compute_csum(uint8_t* buf, size_t len)
{
uint32_t csum = 0;
for(size_t i = 0; i < len; i++) {
csum = csum * 31 + buf[i];
}
return csum;
}
#endif
#ifdef HMPI_LOGCALLS
extern int g_log_fd;
#define LOG_MPI_CALL log_mpi_call
void log_mpi_call(char* fmt, ...);
#else
#define LOG_MPI_CALL(fmt, ...)
#endif
// Internal global structures
//Each thread has a list of send and receive requests.
//The receive requests are managed privately by the owning thread.
//The send requests list for a particular thread contains sends whose target is
// that thread. Other threads place their send requests on this list, and the
// thread owning the list matches receives against them in match_recv().
HMPI_Item g_recv_reqs_head = {NULL};
HMPI_Item* g_recv_reqs_tail = NULL;
#ifdef USE_MCS
mcs_qnode_t* g_lock_q; //Q node for lock.
#endif
HMPI_Request_list* g_send_reqs = NULL; //Shared: Senders add sends here
HMPI_Request_list* g_tl_my_send_reqs; //Shortcut to my global send Q
HMPI_Request_list g_tl_send_reqs; //Receiver-local send Q
//Pool of unused reqs to save malloc time.
static HMPI_Item* g_free_reqs = NULL;
#define get_reqstat(req) req->stat
static inline void update_reqstat(HMPI_Request req, int stat) {
#ifdef __bg__
__lwsync();
//FENCE();
#endif
req->stat = stat;
}
//TODO - Maybe send reqs should be allocated on the receiver. How?
HMPI_Request acquire_req(void)
{
HMPI_Item* item = g_free_reqs;
//Malloc a new req only if none are in the pool.
if(item == NULL) {
HMPI_Request req = (HMPI_Request)MALLOC(HMPI_Request_info, 1);
req->match = 0;
req->do_free = DO_NOT_FREE;
return req;
} else {
g_free_reqs = item->next;
return (HMPI_Request)item;
}
}
static inline void release_req(HMPI_Request req)
{
//Return a req to the pool -- once allocated, a req is never freed.
HMPI_Item* item = (HMPI_Item*)req;
switch(req->do_free) {
case DO_FREE:
free(req->buf);
req->do_free = DO_NOT_FREE;
break;
#ifdef ENABLE_OPI
case DO_OPI_FREE:
OPI_Free(&req->buf);
req->do_free = DO_NOT_FREE;
break;
#endif
default:
break;
}
item->next = g_free_reqs;
g_free_reqs = item;
}
static inline void add_send_req(HMPI_Request_list* req_list,
HMPI_Request req) {
//Insert req at tail.
HMPI_Item* item = (HMPI_Item*)req;
#ifdef DEBUG
item->next = NULL;
#endif
#ifdef USE_MCS
mcs_qnode_t* q = g_lock_q; //Could fold this back into macros..
__LOCK_ACQUIRE(&req_list->lock, q);
#else
LOCK_ACQUIRE(&req_list->lock);
#endif
//NOTE -- On BG/Q other cores can see these two writes in a different order
// than what is written here. Thus update_send_reqs() needs to be careful
// to acquire the lock before relying on some ordering here.
req_list->tail->next = item;
req_list->tail = item;
#ifdef USE_MCS
__LOCK_RELEASE(&req_list->lock, q);
#else
LOCK_RELEASE(&req_list->lock);
#endif
}
static inline void remove_send_req(HMPI_Request_list* req_list,
HMPI_Item* prev, const HMPI_Item* cur)
{
//Since we only remove from the receiver-local send Q, there is no need for
//locking.
if(cur->next == NULL) {
prev->next = NULL;
req_list->tail = prev;
} else {
prev->next = cur->next;
}
}
static inline void update_send_reqs(HMPI_Request_list* local_list, HMPI_Request_list* shared_list)
{
if(shared_list->tail != &shared_list->head) {
HMPI_Item* tail;
//NOTE - we can safely compare head/tail here, but we need the lock to
// do more on BQ/Q. On x86 it's safe to grab the first node in the
// shared Q, But on BG/Q we can see the two writes in add_send_req() in
// reverse order. Thus we need to acquire the lock, ensuring that we
// see both writes before grabbing head.next in the next statement. If
// we move the lock after that statement, it is possible to see the
// updated tail in add_send_req(), come through and grab the shared
// head.next before we see the updated head.next.
#ifdef __x86_64__
//For x86, this statement is safe outside the lock.
// See comments above and non-x86 statement below.
// The branch ensures at least one node. Senders only add at the tail,
// so head.next won't change out from under us.
local_list->tail->next = shared_list->head.next;
#endif
#ifdef USE_MCS
mcs_qnode_t* q = g_lock_q; //Could fold this back into macros..;
__LOCK_ACQUIRE(&shared_list->lock, q);
#else
LOCK_ACQUIRE(&shared_list->lock);
#endif
#ifndef __x86_64__ //NOT x86
//For non x86 (eg PPC) this statement needs to be protected.
// See comments and x86 statement above.
local_list->tail->next = shared_list->head.next;
#endif
tail = shared_list->tail;
shared_list->tail = &shared_list->head;
#ifdef USE_MCS
__LOCK_RELEASE(&shared_list->lock, q);
#else
LOCK_RELEASE(&shared_list->lock);
#endif
//This is safe, the pointers involved here are now only accessible by
// this core.
local_list->tail = tail;
tail->next = NULL;
}
}
static inline void add_recv_req(HMPI_Request req) {
HMPI_Item* item = (HMPI_Item*)req;
//Add at tail to ensure matching occurs in order.
item->next = NULL;
g_recv_reqs_tail->next = item;
g_recv_reqs_tail = item;
}
static inline void remove_recv_req(HMPI_Item* prev, const HMPI_Item* cur) {
if(cur->next == NULL) {
g_recv_reqs_tail = prev;
prev->next = NULL;
} else {
prev->next = cur->next;
}
}
//Match for receives that are *NOT* ANY_SOURCE
static inline HMPI_Request match_recv(HMPI_Request_list* req_list, HMPI_Request recv_req)
{
HMPI_Item* cur;
HMPI_Item* prev;
HMPI_Request req;
int proc = recv_req->proc;
int tag = recv_req->tag;
int context = recv_req->context;
for(prev = &req_list->head, cur = prev->next;
cur != NULL; prev = cur, cur = cur->next) {
req = (HMPI_Request)cur;
#ifdef ENABLE_OPI
if(req->type == HMPI_SEND &&
req->proc == proc &&
(req->tag == tag || tag == MPI_ANY_TAG) &&
req->context == context) {
#else
if(req->proc == proc &&
(req->tag == tag || tag == MPI_ANY_TAG) &&
req->context == context) {
#endif
remove_send_req(req_list, prev, cur);
//recv_req->proc = req->proc; //Not necessary, no ANY_SRC
recv_req->tag = req->tag;
//WARNING("%d match_recv req %p proc %d tag %d ctx %d send req %p\n",
// HMPI_COMM_WORLD->comm_rank, recv_req, proc, tag, context, req);
return req;
}
}
return HMPI_REQUEST_NULL;
}
//Match for takes
#ifdef ENABLE_OPI
static inline HMPI_Request match_take(HMPI_Request_list* req_list, HMPI_Request recv_req)
{
HMPI_Item* cur;
HMPI_Item* prev;
HMPI_Request req;
int proc = recv_req->proc;
int tag = recv_req->tag;
int context = recv_req->context;
for(prev = &req_list->head, cur = prev->next;
cur != NULL; prev = cur, cur = cur->next) {
req = (HMPI_Request)cur;
if(req->type == OPI_GIVE &&
req->proc == proc &&
(req->tag == tag || tag == MPI_ANY_TAG) &&
req->context == context) {
remove_send_req(req_list, prev, cur);
//recv_req->proc = req->proc; //Not necessary, no ANY_SRC
recv_req->tag = req->tag;
//printf("%d matched recv req %d proc %d tag %d to send req %p\n",
// g_hmpi_rank, recv_req, proc, tag, req);
return req;
}
}
return HMPI_REQUEST_NULL;
}
#endif
//Match for receives with ANY_SOURCE.
//Three things can happen here:
// No matching send is found:
// return HMPI_REQUEST_NULL, req->u.req != MPI_REQUEST_NULL
// Matching MPI (inter-node) send is found:
// req->u.req == MPI_REQUEST_NULL and return HMPI_REQUEST_NULL
// Matching local send is found:
// req->u.req == MPI_REQUEST_NULL and return send_req
//Callers should check return value for local matches, and req->u.req for
// inter-node matches.
static inline HMPI_Request match_recv_any(HMPI_Request_list* req_list, HMPI_Request recv_req)
{
HMPI_Item* cur;
HMPI_Item* prev;
HMPI_Request req;
int tag = recv_req->tag;
int context = recv_req->context;
for(prev = &req_list->head, cur = prev->next;
cur != NULL; prev = cur, cur = cur->next) {
req = (HMPI_Request)cur;
if((req->tag == tag || tag == MPI_ANY_TAG) &&
context == req->context) {
MPI_Status status;
int flag;
//Matched a local message -- try to cancel the MPI-level receive.
//If not successful, we throw out the local match and use what MPI
// gave us. If cancel succeeds, we use the local match.
MPI_Cancel(&recv_req->u.req);
MPI_Wait(&recv_req->u.req, &status);
MPI_Test_cancelled(&status, &flag);
if(!flag) {
//Not cancelled - use the inter-node message from MPI.
int count;
int type_size;
MPI_Get_count(&status, recv_req->datatype, &count);
MPI_Type_size(recv_req->datatype, &type_size);
recv_req->proc = status.MPI_SOURCE;
recv_req->tag = status.MPI_TAG;
recv_req->size = count * type_size;
update_reqstat(recv_req, HMPI_REQ_COMPLETE);
//Indicate no local req was matched.
return HMPI_REQUEST_NULL;
}
//Cancel succeeded, use the local send match.
remove_send_req(req_list, prev, cur);
recv_req->proc = req->proc;
recv_req->tag = req->tag;
return req;
}
}
return HMPI_REQUEST_NULL;
}
static /*inline*/ int match_probe(int source, int tag, int context, HMPI_Request* send_req) {
HMPI_Item* cur;
HMPI_Request req;
HMPI_Request_list* req_list = &g_tl_send_reqs;
update_send_reqs(req_list, g_tl_my_send_reqs);
for(cur = req_list->head.next; cur != NULL; cur = cur->next) {
req = (HMPI_Request)cur;
//The send request can't have ANY_SOURCE or ANY_TAG,
// so don't check for that.
if((req->proc == source || source == MPI_ANY_SOURCE) &&
(req->tag == tag || tag == MPI_ANY_TAG) &&
req->context == context) {
//We don't want to do anything other than return the send req.
*send_req = req;
return 1;
}
}
return 0;
}
//We assume req->type == HMPI_SEND
static inline int HMPI_Progress_send(const HMPI_Request send_req)
{
if(get_reqstat(send_req) == HMPI_REQ_COMPLETE) {
return HMPI_REQ_COMPLETE;
}
//Write blocks on this send req if receiver has matched it.
//If mesage is short, receiver won't bother clearing the match lock, and
// instead just does the copy and marks completion.
if(send_req->match &&
CAS_T_BOOL(volatile uint32_t, &send_req->match, (uint32_t)1, (uint32_t)0)) {
HMPI_Request recv_req = (HMPI_Request)send_req->u.match_req;
uintptr_t rbuf = (uintptr_t)recv_req->buf;
//Receiver does any size sanity checking.
size_t size = send_req->size;
size_t block_size = (size_t)BLOCK_SIZE_ONE;
if(size >= (size_t)BLOCK_SIZE_TWO << 1) {
block_size = (size_t)BLOCK_SIZE_TWO;
}
uintptr_t sbuf = (uintptr_t)send_req->buf;
volatile size_t* offsetptr = &recv_req->u.offset;
size_t offset;
//length to copy is min of len - offset and BLOCK_SIZE
while((offset = FETCH_ADD64(offsetptr, block_size)) < size) {
size_t left = size - offset;
memcpy((void*)(rbuf + offset), (void*)(sbuf + offset),
(left < block_size ? left : block_size));
}
//Signal that the sender is done copying.
//Possible for the receiver to still be copying here.
#ifdef __bg__
STORE_FENCE();
#endif
send_req->match = 1;
//Receiver will set completion soon, wait rather than running off.
//TODO: test the performance with and without this on say AMG.
while(get_reqstat(send_req) != HMPI_REQ_COMPLETE);
HMPI_STATS_ACCUMULATE(send_syn, 1);
return HMPI_REQ_COMPLETE;
}
#if 0
if(send_req->match &&
CAS_T_BOOL(volatile uint32_t, &send_req->match, (uint32_t)1, (uint32_t)0)) {
HMPI_Request recv_req = (HMPI_Request)send_req->u.match_req;
uintptr_t sbuf = (uintptr_t)send_req->buf;
uintptr_t rbuf = (uintptr_t)recv_req->buf;
size_t size = recv_req->size;
size_t offset;
size_t len;
while(1) {
//LOCK
while(__sync_lock_test_and_set(&recv_req->lock, 1) != 0);
offset = recv_req->u.offset;
len = (size - offset) >> 1; //Half of remaining length
recv_req->u.offset = offset + len;
//UNLOCK
__sync_lock_release(&recv_req->lock);
if(size - offset <= MIN_COPY_SIZE) {
break;
}
//WARNING("%d send copy offset %ld len %ld size %ld",
// HMPI_COMM_WORLD->comm_rank, offset, len, size);
memcpy((void*)(rbuf + offset), (void*)(sbuf + offset), len);
}
//Signal that the sender is done copying.
//Possible for the receiver to still be copying here.
#ifdef __bg__
STORE_FENCE();
#endif
send_req->match = 1;
//Receiver will set completion soon, wait rather than running off.
//TODO: test the performance with and without this on say AMG.
while(get_reqstat(send_req) != HMPI_REQ_COMPLETE);
HMPI_STATS_ACCUMULATE(send_syn, 1);
return HMPI_REQ_COMPLETE;
}
#endif
return HMPI_REQ_ACTIVE;
}
//For req->type == HMPI_RECV
static inline void HMPI_Complete_recv(HMPI_Request recv_req, HMPI_Request send_req)
{
size_t send_size = send_req->size;
size_t size = recv_req->size;
#ifdef DEBUG
if(unlikely(send_size > size)) {
ERROR("%d recv message from %d of size %ld truncated to %ld",
HMPI_COMM_WORLD->comm_rank, send_req->proc, send_size, size);
}
#endif
if(send_size < size) {
//Adjust receive size if the incoming message is smaller.
//WARNING("%d recv from %d is %d bytes, recv is %d bytes",
// HMPI_COMM_WORLD->comm_rank, send_req->proc, send_size, size);
recv_req->size = send_size;
size = send_size;
}
uintptr_t rbuf = (uintptr_t)recv_req->buf;
uintptr_t sbuf = (uintptr_t)send_req->buf;
if(size < (size_t)BLOCK_SIZE_ONE << 1 || !IS_SM_BUF((void*)rbuf)) {
//Use memcpy for small messages, and when the user's receive buf isn't
// in the SM region. On the recv path, buf is always the user's recv
// buf, whether it's an SM region or not.
memcpy((void*)rbuf, (void*)sbuf, size);
HMPI_STATS_ACCUMULATE(recv_mem, 1);
} else {
//The setting of send_req->match_req signals to sender that they can
// start doing copying as well, if they are testing the req.
recv_req->u.offset = (size_t)0;
send_req->u.match_req = recv_req;
STORE_FENCE();
send_req->match = 1;
size_t block_size = BLOCK_SIZE_ONE;
if(size >= (size_t)BLOCK_SIZE_TWO << 1) {
block_size = (size_t)BLOCK_SIZE_TWO;
}
volatile size_t* offsetptr = &recv_req->u.offset;
size_t offset = 0;
//length to copy is min of len - offset and BLOCK_SIZE
while((offset = FETCH_ADD64(offsetptr, block_size)) < size) {
size_t left = size - offset;
memcpy((void*)(rbuf + offset), (void*)(sbuf + offset),
(left < block_size ? left : block_size));
}
//Wait if the sender is copying.
while(!CAS_T_BOOL(volatile uint32_t, &send_req->match, 1, 0));
HMPI_STATS_ACCUMULATE(recv_syn, 1);
}
#if 0
if(size < (size_t)MIN_COPY_SIZE || !IS_SM_BUF((void*)rbuf)) {
//Use memcpy for small messages, and when the user's receive buf isn't
// in the SM region. On the recv path, buf is always the user's recv
// buf, whether it's an SM region or not.
memcpy((void*)rbuf, (void*)sbuf, size);
HMPI_STATS_ACCUMULATE(recv_mem, 1);
} else {
//Use the offset on the send req.
send_req->u.match_req = recv_req;
//Maybe this should be on recv_req?
//Setting nonzero signals to sender that they can copy.
size_t offset = 0;
size_t len = recv_req->u.offset = (size_t)size >> 1;
STORE_FENCE();
send_req->match = 1;
//Make sure this proc has up to date data from sender (ie msg data)
//TODO - necessary? check on BGQ
LOAD_FENCE();
do {
//WARNING("%d loop copy offset %ld len %ld size %ld",
// HMPI_COMM_WORLD->comm_rank, offset, len, size);
memcpy((void*)(rbuf + offset), (void*)(sbuf + offset), len);
//LOCK
while(__sync_lock_test_and_set(&recv_req->lock, 1) != 0);
offset = recv_req->u.offset;
len = (size - offset) >> 1; //Half of remaining length
recv_req->u.offset = offset + len;
//UNLOCK
__sync_lock_release(&recv_req->lock);
} while(size - offset > MIN_COPY_SIZE);
//WARNING("%d finish copy offset %ld len %ld (%ld) size %ld",
// HMPI_COMM_WORLD->comm_rank, offset, len, size - offset, size);
memcpy((void*)(rbuf + offset), (void*)(sbuf + offset), size - offset);
//Wait if the sender is copying.
while(!CAS_T_BOOL(volatile uint32_t, &send_req->match, 1, 0));
HMPI_STATS_ACCUMULATE(recv_syn, 1);
}
#endif
#ifdef HMPI_CHECKSUM
#warning "csum enabled"
uint32_t recv_csum = compute_csum(recv_req->buf, size);
if(recv_csum != send_req->csum) {
printf("%d csum %d mismatched sender %d csum %d\n",
HMPI_COMM_WORLD->comm_rank, recv_csum, send_req->proc, send_req->csum);
}
#endif
#ifdef DEBUG
printf("%d completed local-level RECV buf %p size %lu source %d tag %d\n",
HMPI_COMM_WORLD->comm_rank, recv_req->buf, recv_req->size, recv_req->proc, recv_req->tag);
printf("%d completed local-level SEND buf %p size %lu dest %d tag %d\n",
send_req->proc, send_req->buf, send_req->size, HMPI_COMM_WORLD->comm_rank, send_req->tag);
#endif
//Mark send and receive requests done
update_reqstat(send_req, HMPI_REQ_COMPLETE);
update_reqstat(recv_req, HMPI_REQ_COMPLETE);
}
#ifdef ENABLE_OPI
//For req->type == OPI_TAKE
static inline void HMPI_Complete_take(HMPI_Request recv_req, HMPI_Request send_req)
{
#if DEBUG
if(unlikely(send_req->size > recv_req->size)) {
ERROR("%d recv message from %d of size %ld truncated to %ld\n",
HMPI_COMM_WORLD->comm_rank, send_req->proc, send_size, size);
}
#endif
recv_req->size = send_req->size;
#if 0
//TODO - check this out -- with immediate, the send side doesn't have to
// alloc/free, though the receive side still does.
if(size < 256) {
//Size is too small - just memcpy the buffer instead of doing OP.
//But, I have to alloc and free.. blah
OPI_Alloc(recv_req->buf, size);
memcpy(*((void**)recv_req->buf), send_req->buf, size);
OPI_Free(&send_req->buf);
} else {
#endif
//Easy OP
*((void**)recv_req->buf) = send_req->buf;
//}
//Mark send and receive requests done
update_reqstat(send_req, HMPI_REQ_COMPLETE);
update_reqstat(recv_req, HMPI_REQ_COMPLETE);
}
#endif
//For req->type == MPI_SEND || req->type == MPI_RECV
// Not HMPI_RECV_ANY_SOURCE!
static int HMPI_Progress_mpi(HMPI_Request req)
{
int flag;
MPI_Status status;
#if DEBUG
if(req->ir.req == MPI_REQUEST_NULL) {
ERROR("%d Progress_mpi on null request!", HMPI_COMM_WORLD->comm_rank);
}
#endif
MPI_Test(&req->ir.req, &flag, &status);
if(flag) {
//Update status
int count;
int type_size;
//This isn't necessary for sends: message size, proc, and tag are
// already known, so don't query for them.
if(req->type == MPI_RECV) {
MPI_Get_count(&status, req->datatype, &count);
MPI_Type_size(req->datatype, &type_size);
req->tag = status.MPI_TAG;
//This cast is costly but important for msgs >2/4gb
req->size = (size_t)count * (size_t)type_size;
}
//Not necessary: req will always be completed and free'd upon return.
//update_reqstat(req, HMPI_REQ_COMPLETE);
return HMPI_REQ_COMPLETE;
}
return HMPI_REQ_ACTIVE;
}
//For req->type == HMPI_RECV_ANY_SOURCE
static int HMPI_Progress_mpi_any(HMPI_Request req)
{
int flag;
MPI_Status status;
#if DEBUG
if(req->u.req == MPI_REQUEST_NULL) {
ERROR("%d Progress_mpi on null request!", HMPI_COMM_WORLD->comm_rank);
}
#endif
MPI_Test(&req->u.req, &flag, &status);
if(flag) {
//Update status
int count;
int type_size;
MPI_Get_count(&status, req->datatype, &count);
MPI_Type_size(req->datatype, &type_size);
req->proc = status.MPI_SOURCE;
req->tag = status.MPI_TAG;
req->size = count * type_size;
update_reqstat(req, HMPI_REQ_COMPLETE);
return HMPI_REQ_COMPLETE;
}
return HMPI_REQ_ACTIVE;
}
//#define HMPI_PRINTQUEUE 1
#ifdef HMPI_PRINTQUEUE
#include <time.h>
void printqueue(HMPI_Item* recv_reqs_head, HMPI_Request_list* local_list)
{
static time_t last_time = 0;
time_t cur_time = time(NULL);
//Don't print more than once every 3 seconds.
if(cur_time - last_time < 3) {
return;
}
last_time = cur_time;
HMPI_Item* cur;
WARNING("%d printing reqs", HMPI_COMM_WORLD->comm_rank);
//Print the receive requests, if any.
if(recv_reqs_head->next == NULL) {
WARNING("%d no recv reqs", HMPI_COMM_WORLD->comm_rank);
} else {
for(cur = recv_reqs_head->next; cur != NULL; cur = cur->next) {
HMPI_Request req = (HMPI_Request)cur;
WARNING("%d recv req proc %d tag %d context %d size %ld",
HMPI_COMM_WORLD->comm_rank, req->proc,
req->tag, req->context, req->size);
}
}
//Print the incoming send requests, if any.
if(local_list->head.next == NULL) {
WARNING("%d no send reqs", HMPI_COMM_WORLD->comm_rank);
} else {
for(cur = local_list->head.next; cur != NULL; cur = cur->next) {
HMPI_Request req = (HMPI_Request)cur;
WARNING("%d send req proc %d tag %d context %d size %ld",
HMPI_COMM_WORLD->comm_rank, req->proc,
req->tag, req->context, req->size);
}
}
}
#endif
//Progress local receive requests.
//TODO - this could benefit from BGQ nops.
static void HMPI_Progress(HMPI_Item* recv_reqs_head,
HMPI_Request_list* local_list, HMPI_Request_list* shared_list) {
HMPI_Item* cur;
HMPI_Item* prev;
HMPI_Request req;
//TODO - poll MPI here?
update_send_reqs(local_list, shared_list);
#ifdef HMPI_PRINTQUEUE
printqueue(recv_reqs_head, local_list);
#endif
//Progress receive requests.
//We remove items from the list, but they are still valid; nothing in this
//function will free or modify a req. So, it's safe to do cur = cur->next.
//Note the careful updating of prev; we need to leave it alone on iterations
//where cur is matched successfully and only update it otherwise.
// This prevents the recv_reqs list from getting corrupted due to a bad
// prev pointer.
for(prev = recv_reqs_head, cur = prev->next;
cur != NULL; cur = cur->next) {
req = (HMPI_Request)cur;
if(likely(req->type == HMPI_RECV)) {
HMPI_Request send_req = match_recv(local_list, req);
if(send_req != HMPI_REQUEST_NULL) {
HMPI_Complete_recv(req, send_req);
remove_recv_req(prev, cur);
continue; //Whenever we remove a req, dont update prev
}
#ifdef ENABLE_OPI
} else if(req->type == OPI_TAKE) {
HMPI_Request send_req = match_take(local_list, req);
if(send_req != HMPI_REQUEST_NULL) {
HMPI_Complete_take(req, send_req);
remove_recv_req(prev, cur);
continue; //Whenever we remove a req, dont update prev
}
#endif
} else { //req->type == HMPI_RECV_ANY_SOURCE
//First, check for a local match.
// match_recv_any() may complete the MPI-level receive here.
// In that case, it returns REQUEST_NULL indicating no match,
// but the request will be in completed state.
HMPI_Request send_req = match_recv_any(local_list, req);
if(send_req != HMPI_REQUEST_NULL) {
HMPI_Complete_recv(req, send_req);
remove_recv_req(prev, cur);
continue; //Whenever we remove a req, dont update prev
} else if(req->u.req == MPI_REQUEST_NULL) {
//This means match_recv_any tried to cancel the MPI recv and
// failed, so we completed the MPI request.
remove_recv_req(prev, cur);
continue;
} else {
//Check MPI-level completion.