forked from ofiwg/libfabric
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathrxm_ep.c
2055 lines (1751 loc) · 54.2 KB
/
rxm_ep.c
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) 2013-2020 Intel Corporation. All rights reserved.
* Copyright (c) 2020 Cisco Systems, Inc. All rights reserved.
* (C) Copyright 2020 Hewlett Packard Enterprise Development LP
*
* This software is available to you under a choice of one of two
* licenses. You may choose to be licensed under the terms of the GNU
* General Public License (GPL) Version 2, available from the file
* COPYING in the main directory of this source tree, or the
* BSD license below:
*
* 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.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <inttypes.h>
#include <math.h>
#include <rdma/fabric.h>
#include <rdma/fi_collective.h>
#include <ofi.h>
#include <ofi_util.h>
#include "rxm.h"
static int rxm_match_noop(struct dlist_entry *item, const void *arg)
{
OFI_UNUSED(item);
OFI_UNUSED(arg);
return 1;
}
static int rxm_match_recv_entry(struct dlist_entry *item, const void *arg)
{
struct rxm_recv_match_attr *attr = (struct rxm_recv_match_attr *) arg;
struct rxm_recv_entry *recv_entry =
container_of(item, struct rxm_recv_entry, entry);
return ofi_match_addr(recv_entry->addr, attr->addr);
}
static int rxm_match_recv_entry_tag(struct dlist_entry *item, const void *arg)
{
struct rxm_recv_match_attr *attr = (struct rxm_recv_match_attr *) arg;
struct rxm_recv_entry *recv_entry =
container_of(item, struct rxm_recv_entry, entry);
return ofi_match_tag(recv_entry->tag, recv_entry->ignore, attr->tag);
}
static int rxm_match_recv_entry_tag_addr(struct dlist_entry *item, const void *arg)
{
struct rxm_recv_match_attr *attr = (struct rxm_recv_match_attr *) arg;
struct rxm_recv_entry *recv_entry =
container_of(item, struct rxm_recv_entry, entry);
return ofi_match_addr(recv_entry->addr, attr->addr) &&
ofi_match_tag(recv_entry->tag, recv_entry->ignore, attr->tag);
}
static int rxm_match_recv_entry_context(struct dlist_entry *item, const void *context)
{
struct rxm_recv_entry *recv_entry =
container_of(item, struct rxm_recv_entry, entry);
return recv_entry->context == context;
}
static fi_addr_t rxm_get_unexp_addr(struct rxm_unexp_msg *unexp_msg)
{
struct rxm_rx_buf *rx_buf;
rx_buf = container_of(unexp_msg, struct rxm_rx_buf, unexp_msg);
return (unexp_msg->addr != FI_ADDR_UNSPEC) ?
unexp_msg->addr : rx_buf->conn->peer->fi_addr;
}
static int rxm_match_unexp_msg(struct dlist_entry *item, const void *arg)
{
struct rxm_recv_match_attr *attr = (struct rxm_recv_match_attr *)arg;
struct rxm_unexp_msg *unexp_msg =
container_of(item, struct rxm_unexp_msg, entry);
return ofi_match_addr(attr->addr, rxm_get_unexp_addr(unexp_msg));
}
static int rxm_match_unexp_msg_tag(struct dlist_entry *item, const void *arg)
{
struct rxm_recv_match_attr *attr = (struct rxm_recv_match_attr *) arg;
struct rxm_unexp_msg *unexp_msg =
container_of(item, struct rxm_unexp_msg, entry);
return ofi_match_tag(attr->tag, attr->ignore, unexp_msg->tag);
}
static int rxm_match_unexp_msg_tag_addr(struct dlist_entry *item, const void *arg)
{
struct rxm_recv_match_attr *attr = (struct rxm_recv_match_attr *) arg;
struct rxm_unexp_msg *unexp_msg =
container_of(item, struct rxm_unexp_msg, entry);
return ofi_match_addr(attr->addr, rxm_get_unexp_addr(unexp_msg)) &&
ofi_match_tag(attr->tag, attr->ignore, unexp_msg->tag);
}
static int rxm_buf_reg(struct ofi_bufpool_region *region)
{
struct rxm_ep *rxm_ep = region->pool->attr.context;
struct rxm_domain *rxm_domain;
int ret;
bool hmem_enabled = !!(rxm_ep->util_ep.caps & FI_HMEM);
if (hmem_enabled) {
ret = ofi_hmem_host_register(region->mem_region,
region->pool->region_size);
if (ret != FI_SUCCESS)
return ret;
}
if (!rxm_ep->msg_mr_local)
return 0;
rxm_domain = container_of(rxm_ep->util_ep.domain,
struct rxm_domain, util_domain);
ret = rxm_msg_mr_reg_internal(rxm_domain, region->mem_region,
region->pool->region_size,
FI_SEND | FI_RECV | FI_READ | FI_WRITE,
OFI_MR_NOCACHE,
(struct fid_mr **) ®ion->context);
if (ret != FI_SUCCESS) {
if (hmem_enabled)
ofi_hmem_host_unregister(region->mem_region);
}
return ret;
}
static void rxm_init_rx_buf(struct ofi_bufpool_region *region, void *buf)
{
struct rxm_ep *ep = region->pool->attr.context;
struct rxm_rx_buf *rx_buf = buf;
rx_buf->hdr.desc = ep->msg_mr_local ?
fi_mr_desc((struct fid_mr *) region->context) : NULL;
rx_buf->ep = ep;
rx_buf->data = &rx_buf->pkt.data;
}
static void rxm_init_tx_buf(struct ofi_bufpool_region *region, void *buf)
{
struct rxm_ep *ep = region->pool->attr.context;
struct rxm_tx_buf *tx_buf = buf;
tx_buf->hdr.desc = ep->msg_mr_local ?
fi_mr_desc((struct fid_mr *) region->context) : NULL;
tx_buf->pkt.ctrl_hdr.version = RXM_CTRL_VERSION;
tx_buf->pkt.hdr.version = OFI_OP_VERSION;
}
static void rxm_buf_close(struct ofi_bufpool_region *region)
{
struct rxm_ep *ep = region->pool->attr.context;
if (ep->util_ep.caps & FI_HMEM)
ofi_hmem_host_unregister(region->mem_region);
if (ep->msg_mr_local) {
/* We would get a (fid_mr *) in context but
* it is safe to cast it into (fid *) */
fi_close(region->context);
}
}
static void rxm_recv_entry_init(struct rxm_recv_entry *entry, void *arg)
{
struct rxm_recv_queue *recv_queue = arg;
assert(recv_queue->type != RXM_RECV_QUEUE_UNSPEC);
entry->recv_queue = recv_queue;
entry->sar.msg_id = RXM_SAR_RX_INIT;
entry->sar.total_recv_len = 0;
/* set it to NULL to differentiate between regular ACKs and those
* sent with FI_INJECT */
entry->rndv.tx_buf = NULL;
entry->comp_flags = FI_RECV;
if (recv_queue->type == RXM_RECV_QUEUE_MSG)
entry->comp_flags |= FI_MSG;
else
entry->comp_flags |= FI_TAGGED;
}
static int rxm_recv_queue_init(struct rxm_ep *rxm_ep, struct rxm_recv_queue *recv_queue,
size_t size, enum rxm_recv_queue_type type)
{
recv_queue->rxm_ep = rxm_ep;
recv_queue->type = type;
recv_queue->fs = rxm_recv_fs_create(size, rxm_recv_entry_init,
recv_queue);
if (!recv_queue->fs)
return -FI_ENOMEM;
dlist_init(&recv_queue->recv_list);
dlist_init(&recv_queue->unexp_msg_list);
if (type == RXM_RECV_QUEUE_MSG) {
if (rxm_ep->rxm_info->caps & FI_DIRECTED_RECV) {
recv_queue->match_recv = rxm_match_recv_entry;
recv_queue->match_unexp = rxm_match_unexp_msg;
} else {
recv_queue->match_recv = rxm_match_noop;
recv_queue->match_unexp = rxm_match_noop;
}
} else {
if (rxm_ep->rxm_info->caps & FI_DIRECTED_RECV) {
recv_queue->match_recv = rxm_match_recv_entry_tag_addr;
recv_queue->match_unexp = rxm_match_unexp_msg_tag_addr;
} else {
recv_queue->match_recv = rxm_match_recv_entry_tag;
recv_queue->match_unexp = rxm_match_unexp_msg_tag;
}
}
return 0;
}
static void rxm_recv_queue_close(struct rxm_recv_queue *recv_queue)
{
/* It indicates that the recv_queue were allocated */
if (recv_queue->fs) {
rxm_recv_fs_free(recv_queue->fs);
recv_queue->fs = NULL;
}
// TODO cleanup recv_list and unexp msg list
}
static int rxm_ep_create_pools(struct rxm_ep *rxm_ep)
{
struct ofi_bufpool_attr attr = {0};
int ret;
attr.size = rxm_buffer_size + sizeof(struct rxm_rx_buf);
attr.alignment = 16;
attr.chunk_cnt = 1024;
attr.alloc_fn = rxm_buf_reg;
attr.free_fn = rxm_buf_close;
attr.init_fn = rxm_init_rx_buf;
attr.context = rxm_ep;
attr.flags = OFI_BUFPOOL_NO_TRACK;
ret = ofi_bufpool_create_attr(&attr, &rxm_ep->rx_pool);
if (ret) {
FI_WARN(&rxm_prov, FI_LOG_EP_CTRL,
"Unable to create rx buf pool\n");
return ret;
}
attr.size = rxm_buffer_size + sizeof(struct rxm_tx_buf);
attr.init_fn = rxm_init_tx_buf;
ret = ofi_bufpool_create_attr(&attr, &rxm_ep->tx_pool);
if (ret) {
FI_WARN(&rxm_prov, FI_LOG_EP_CTRL,
"Unable to create tx buf pool\n");
goto free_rx_pool;
}
ret = ofi_bufpool_create(&rxm_ep->coll_pool,
sizeof(struct rxm_coll_buf), 16, 0, 1024,
OFI_BUFPOOL_NO_TRACK);
if (ret) {
FI_WARN(&rxm_prov, FI_LOG_EP_CTRL,
"Unable to create peer xfer context pool\n");
goto free_tx_pool;
}
return 0;
free_tx_pool:
ofi_bufpool_destroy(rxm_ep->tx_pool);
free_rx_pool:
ofi_bufpool_destroy(rxm_ep->rx_pool);
rxm_ep->rx_pool = NULL;
return ret;
}
static int rxm_multi_recv_pool_init(struct rxm_ep *rxm_ep)
{
struct ofi_bufpool_attr attr = {
.size = sizeof(struct rxm_recv_entry),
.alignment = 16,
.max_cnt = 0,
.chunk_cnt = 16,
.alloc_fn = NULL,
.init_fn = NULL,
.context = rxm_ep,
.flags = OFI_BUFPOOL_NO_TRACK,
};
return ofi_bufpool_create_attr(&attr, &rxm_ep->multi_recv_pool);
}
static int rxm_ep_rx_queue_init(struct rxm_ep *rxm_ep)
{
int ret;
ret = rxm_recv_queue_init(rxm_ep, &rxm_ep->recv_queue,
rxm_ep->rxm_info->rx_attr->size,
RXM_RECV_QUEUE_MSG);
if (ret)
return ret;
ret = rxm_recv_queue_init(rxm_ep, &rxm_ep->trecv_queue,
rxm_ep->rxm_info->rx_attr->size,
RXM_RECV_QUEUE_TAGGED);
if (ret)
goto err_recv_tag;
ret = rxm_multi_recv_pool_init(rxm_ep);
if (ret)
goto err_multi;
return FI_SUCCESS;
err_multi:
rxm_recv_queue_close(&rxm_ep->trecv_queue);
err_recv_tag:
rxm_recv_queue_close(&rxm_ep->recv_queue);
return ret;
}
/* It is safe to call this function, even if `rxm_ep_txrx_res_open`
* has not yet been called */
static void rxm_ep_txrx_res_close(struct rxm_ep *ep)
{
rxm_recv_queue_close(&ep->trecv_queue);
rxm_recv_queue_close(&ep->recv_queue);
if (ep->multi_recv_pool) {
ofi_bufpool_destroy(ep->multi_recv_pool);
ep->multi_recv_pool = NULL;
}
if (ep->rx_pool) {
ofi_bufpool_destroy(ep->rx_pool);
ep->rx_pool = NULL;
}
if (ep->tx_pool) {
ofi_bufpool_destroy(ep->tx_pool);
ep->tx_pool = NULL;
}
}
static int rxm_setname(fid_t fid, void *addr, size_t addrlen)
{
struct rxm_ep *rxm_ep;
rxm_ep = container_of(fid, struct rxm_ep, util_ep.ep_fid.fid);
return fi_setname(&rxm_ep->msg_pep->fid, addr, addrlen);
}
static int rxm_getname(fid_t fid, void *addr, size_t *addrlen)
{
struct rxm_ep *rxm_ep;
rxm_ep = container_of(fid, struct rxm_ep, util_ep.ep_fid.fid);
return fi_getname(&rxm_ep->msg_pep->fid, addr, addrlen);
}
static int rxm_mc_close(struct fid *fid)
{
struct rxm_mc *rxm_mc;
rxm_mc = container_of(fid, struct rxm_mc, mc_fid.fid);
ofi_atomic_dec32(&rxm_mc->av_set->ref);
if (rxm_mc->util_coll_mc_fid) {
assert (rxm_mc->util_coll_join_completed == 1);
fi_close(&rxm_mc->util_coll_mc_fid->fid);
}
if (rxm_mc->offload_coll_mc_fid) {
assert (rxm_mc->offload_coll_join_completed == 1);
fi_close(&rxm_mc->offload_coll_mc_fid->fid);
}
free(rxm_mc);
return FI_SUCCESS;
}
static struct fi_ops rxm_mc_fi_ops = {
.size = sizeof(struct fi_ops),
.close = rxm_mc_close,
.bind = fi_no_bind,
.control = fi_no_control,
.ops_open = fi_no_ops_open,
};
static struct rxm_mc *rxm_create_mc(struct util_av_set *av_set,
void *context)
{
struct rxm_mc *rxm_mc;
rxm_mc = calloc(1, sizeof(*rxm_mc));
if (!rxm_mc)
return NULL;
rxm_mc->mc_fid.fid.fclass = FI_CLASS_MC;
rxm_mc->mc_fid.fid.context = context;
rxm_mc->mc_fid.fid.ops = &rxm_mc_fi_ops;
rxm_mc->mc_fid.fi_addr = (uintptr_t) rxm_mc;
ofi_atomic_inc32(&av_set->ref);
rxm_mc->av_set = av_set;
return rxm_mc;
}
static int rxm_join_coll(struct fid_ep *ep, const void *addr, uint64_t flags,
struct fid_mc **mc, void *context)
{
struct fi_collective_addr *c_addr;
const struct fid_av_set *set;
struct util_av_set *av_set;
struct rxm_mc *rxm_mc;
struct rxm_ep *rxm_ep;
int ret;
if (!(flags & FI_COLLECTIVE))
return -FI_ENOSYS;
c_addr = (struct fi_collective_addr *)addr;
set = c_addr->set;
av_set = container_of(set, struct util_av_set, av_set_fid);
rxm_mc = rxm_create_mc(av_set, context);
if (!rxm_mc)
return -FI_ENOMEM;
rxm_mc->context = context;
rxm_ep = container_of(ep, struct rxm_ep, util_ep.ep_fid);
ret = fi_join(rxm_ep->util_coll_ep, addr, flags,
&rxm_mc->util_coll_mc_fid, rxm_mc);
if (ret) {
fi_close(&rxm_mc->mc_fid.fid);
} else if (rxm_ep->offload_coll_ep) {
ret = fi_join(rxm_ep->offload_coll_ep, addr, flags,
&rxm_mc->offload_coll_mc_fid, context);
if (ret) {
/*mark util_coll_mc to be removed as soon as
util_coll_ep:fi_join() complets */
rxm_mc->util_coll_join_completed = -1;
}
}
if (!ret) {
*mc = &rxm_mc->mc_fid;
}
return ret;
}
static struct fi_ops_cm rxm_ops_cm = {
.size = sizeof(struct fi_ops_cm),
.setname = rxm_setname,
.getname = rxm_getname,
.getpeer = fi_no_getpeer,
.connect = fi_no_connect,
.listen = fi_no_listen,
.accept = fi_no_accept,
.reject = fi_no_reject,
.shutdown = fi_no_shutdown,
.join = rxm_join_coll,
};
static struct rxm_eager_ops def_eager_ops = {
.comp_tx = rxm_finish_eager_send,
.handle_rx = rxm_handle_eager,
};
static struct rxm_eager_ops coll_eager_ops = {
.comp_tx = rxm_finish_coll_eager_send,
.handle_rx = rxm_handle_coll_eager,
};
static bool rxm_ep_cancel_recv(struct rxm_ep *rxm_ep,
struct rxm_recv_queue *recv_queue, void *context)
{
struct fi_cq_err_entry err_entry;
struct rxm_recv_entry *recv_entry;
struct dlist_entry *entry;
int ret;
ofi_ep_lock_acquire(&rxm_ep->util_ep);
entry = dlist_remove_first_match(&recv_queue->recv_list,
rxm_match_recv_entry_context,
context);
if (!entry)
goto unlock;
recv_entry = container_of(entry, struct rxm_recv_entry, entry);
memset(&err_entry, 0, sizeof(err_entry));
err_entry.op_context = recv_entry->context;
err_entry.flags |= recv_entry->comp_flags;
err_entry.tag = recv_entry->tag;
err_entry.err = FI_ECANCELED;
err_entry.prov_errno = -FI_ECANCELED;
rxm_recv_entry_release(recv_entry);
ret = ofi_cq_write_error(rxm_ep->util_ep.rx_cq, &err_entry);
if (ret) {
FI_WARN(&rxm_prov, FI_LOG_CQ, "Error writing to CQ\n");
assert(0);
}
unlock:
ofi_ep_lock_release(&rxm_ep->util_ep);
return entry != NULL;
}
static ssize_t rxm_ep_cancel(fid_t fid_ep, void *context)
{
struct rxm_ep *ep;
ep = container_of(fid_ep, struct rxm_ep, util_ep.ep_fid);
if (rxm_passthru_info(ep->rxm_info))
return fi_cancel(&ep->srx_ctx->fid, context);
if (!rxm_ep_cancel_recv(ep, &ep->trecv_queue, context))
rxm_ep_cancel_recv(ep, &ep->recv_queue, context);
return 0;
}
static int rxm_ep_getopt(fid_t fid, int level, int optname, void *optval,
size_t *optlen)
{
struct rxm_ep *rxm_ep =
container_of(fid, struct rxm_ep, util_ep.ep_fid);
if (level != FI_OPT_ENDPOINT)
return -FI_ENOPROTOOPT;
switch (optname) {
case FI_OPT_MIN_MULTI_RECV:
assert(sizeof(rxm_ep->min_multi_recv_size) == sizeof(size_t));
*(size_t *)optval = rxm_ep->min_multi_recv_size;
*optlen = sizeof(size_t);
break;
case FI_OPT_BUFFERED_MIN:
assert(sizeof(rxm_ep->buffered_min) == sizeof(size_t));
*(size_t *)optval = rxm_ep->buffered_min;
*optlen = sizeof(size_t);
break;
case FI_OPT_BUFFERED_LIMIT:
assert(sizeof(rxm_ep->buffered_limit) == sizeof(size_t));
*(size_t *)optval = rxm_ep->buffered_limit;
*optlen = sizeof(size_t);
break;
default:
return -FI_ENOPROTOOPT;
}
return FI_SUCCESS;
}
static int rxm_ep_setopt(fid_t fid, int level, int optname,
const void *optval, size_t optlen)
{
struct rxm_ep *rxm_ep =
container_of(fid, struct rxm_ep, util_ep.ep_fid);
int ret = FI_SUCCESS;
if (level != FI_OPT_ENDPOINT)
return -FI_ENOPROTOOPT;
switch (optname) {
case FI_OPT_MIN_MULTI_RECV:
rxm_ep->min_multi_recv_size = *(size_t *)optval;
FI_INFO(&rxm_prov, FI_LOG_CORE,
"FI_OPT_MIN_MULTI_RECV set to %zu\n",
rxm_ep->min_multi_recv_size);
break;
case FI_OPT_BUFFERED_MIN:
if (rxm_ep->rx_pool) {
FI_WARN(&rxm_prov, FI_LOG_EP_DATA,
"Endpoint already enabled. Can't set opt now!\n");
ret = -FI_EOPBADSTATE;
} else if (*(size_t *)optval > rxm_ep->buffered_limit) {
FI_WARN(&rxm_prov, FI_LOG_EP_DATA,
"Invalid value for FI_OPT_BUFFERED_MIN: %zu "
"( > FI_OPT_BUFFERED_LIMIT: %zu)\n",
*(size_t *)optval, rxm_ep->buffered_limit);
ret = -FI_EINVAL;
} else {
rxm_ep->buffered_min = *(size_t *)optval;
FI_INFO(&rxm_prov, FI_LOG_CORE,
"FI_OPT_BUFFERED_MIN set to %zu\n",
rxm_ep->buffered_min);
}
break;
case FI_OPT_BUFFERED_LIMIT:
if (rxm_ep->rx_pool) {
FI_WARN(&rxm_prov, FI_LOG_EP_DATA,
"Endpoint already enabled. Can't set opt now!\n");
ret = -FI_EOPBADSTATE;
/* We do not check for maximum as we allow sizes up to SIZE_MAX */
} else if (*(size_t *)optval < rxm_ep->buffered_min) {
FI_WARN(&rxm_prov, FI_LOG_EP_DATA,
"Invalid value for FI_OPT_BUFFERED_LIMIT: %zu"
" ( < FI_OPT_BUFFERED_MIN: %zu)\n",
*(size_t *)optval, rxm_ep->buffered_min);
ret = -FI_EINVAL;
} else {
rxm_ep->buffered_limit = *(size_t *)optval;
FI_INFO(&rxm_prov, FI_LOG_CORE,
"FI_OPT_BUFFERED_LIMIT set to %zu\n",
rxm_ep->buffered_limit);
}
break;
default:
ret = -FI_ENOPROTOOPT;
}
return ret;
}
static struct fi_ops_ep rxm_ops_ep = {
.size = sizeof(struct fi_ops_ep),
.cancel = rxm_ep_cancel,
.getopt = rxm_ep_getopt,
.setopt = rxm_ep_setopt,
.tx_ctx = fi_no_tx_ctx,
.rx_ctx = fi_no_rx_ctx,
.rx_size_left = fi_no_rx_size_left,
.tx_size_left = fi_no_tx_size_left,
};
/* Caller must hold recv_queue->lock -- TODO which lock? */
struct rxm_rx_buf *
rxm_get_unexp_msg(struct rxm_recv_queue *recv_queue, fi_addr_t addr,
uint64_t tag, uint64_t ignore)
{
struct rxm_recv_match_attr match_attr;
struct dlist_entry *entry;
if (dlist_empty(&recv_queue->unexp_msg_list))
return NULL;
match_attr.addr = addr;
match_attr.tag = tag;
match_attr.ignore = ignore;
entry = dlist_find_first_match(&recv_queue->unexp_msg_list,
recv_queue->match_unexp, &match_attr);
if (!entry)
return NULL;
RXM_DBG_ADDR_TAG(FI_LOG_EP_DATA, "Match for posted recv found in unexp"
" msg list\n", match_attr.addr, match_attr.tag);
return container_of(entry, struct rxm_rx_buf, unexp_msg.entry);
}
static void rxm_recv_entry_init_common(struct rxm_recv_entry *recv_entry,
const struct iovec *iov, void **desc, size_t count,
fi_addr_t src_addr, uint64_t tag, uint64_t ignore,
void *context, uint64_t flags,
struct rxm_recv_queue *recv_queue)
{
size_t i;
assert(!recv_entry->rndv.tx_buf);
recv_entry->rxm_iov.count = (uint8_t) count;
recv_entry->addr = src_addr;
recv_entry->context = context;
recv_entry->flags = flags;
recv_entry->ignore = ignore;
recv_entry->tag = tag;
recv_entry->sar.msg_id = RXM_SAR_RX_INIT;
recv_entry->sar.total_recv_len = 0;
recv_entry->total_len = 0;
for (i = 0; i < count; i++) {
recv_entry->rxm_iov.iov[i] = iov[i];
recv_entry->total_len += iov[i].iov_len;
if (desc && desc[i])
recv_entry->rxm_iov.desc[i] = desc[i];
else
recv_entry->rxm_iov.desc[i] = NULL;
}
}
struct rxm_recv_entry *
rxm_recv_entry_get(struct rxm_ep *rxm_ep, const struct iovec *iov,
void **desc, size_t count, fi_addr_t src_addr,
uint64_t tag, uint64_t ignore, void *context,
uint64_t flags, struct rxm_recv_queue *recv_queue)
{
struct rxm_recv_entry *recv_entry;
if (ofi_freestack_isempty(recv_queue->fs))
return NULL;
recv_entry = ofi_freestack_pop(recv_queue->fs);
rxm_recv_entry_init_common(recv_entry, iov, desc, count, src_addr, tag,
ignore, context, flags, recv_queue);
return recv_entry;
}
struct rxm_recv_entry *
rxm_multi_recv_entry_get(struct rxm_ep *rxm_ep, const struct iovec *iov,
void **desc, size_t count, fi_addr_t src_addr,
uint64_t tag, uint64_t ignore, void *context,
uint64_t flags)
{
struct rxm_recv_entry *recv_entry;
recv_entry = ofi_buf_alloc(rxm_ep->multi_recv_pool);
rxm_recv_entry_init_common(recv_entry, iov, desc, count, src_addr, tag,
ignore, context, flags, NULL);
recv_entry->comp_flags = FI_MSG | FI_RECV;
return recv_entry;
}
struct rxm_tx_buf *rxm_get_tx_buf(struct rxm_ep *ep)
{
struct rxm_tx_buf *buf;
assert(ofi_mutex_held(&ep->util_ep.lock));
if (!ep->tx_credit)
return NULL;
buf = ofi_buf_alloc(ep->tx_pool);
if (buf) {
OFI_DBG_SET(buf->user_tx, true);
ep->tx_credit--;
}
return buf;
}
void rxm_free_tx_buf(struct rxm_ep *ep, struct rxm_tx_buf *buf)
{
assert(ofi_mutex_held(&ep->util_ep.lock));
assert(buf->user_tx);
OFI_DBG_SET(buf->user_tx, false);
ep->tx_credit++;
ofi_buf_free(buf);
}
struct rxm_coll_buf *rxm_get_coll_buf(struct rxm_ep *ep)
{
assert(ofi_mutex_held(&ep->util_ep.lock));
return ofi_buf_alloc(ep->coll_pool);
}
void rxm_free_coll_buf(struct rxm_ep *ep, struct rxm_coll_buf *buf)
{
assert(ofi_mutex_held(&ep->util_ep.lock));
ofi_buf_free(buf);
}
void rxm_rndv_hdr_init(struct rxm_ep *rxm_ep, void *buf,
const struct iovec *iov, size_t count,
struct fid_mr **mr)
{
struct rxm_rndv_hdr *rndv_hdr = (struct rxm_rndv_hdr *)buf;
size_t i;
for (i = 0; i < count && mr[i]; i++) {
rndv_hdr->iov[i].addr = RXM_MR_VIRT_ADDR(rxm_ep->msg_info) ?
(uintptr_t)iov[i].iov_base : 0;
rndv_hdr->iov[i].len = (uint64_t)iov[i].iov_len;
rndv_hdr->iov[i].key = fi_mr_key(mr[i]);
}
rndv_hdr->count = (uint8_t)count;
}
static void
rxm_ep_sar_tx_cleanup(struct rxm_ep *rxm_ep, struct rxm_conn *rxm_conn,
struct rxm_tx_buf *tx_buf)
{
struct rxm_tx_buf *first_tx_buf;
first_tx_buf = ofi_bufpool_get_ibuf(rxm_ep->tx_pool,
tx_buf->pkt.ctrl_hdr.msg_id);
rxm_free_tx_buf(rxm_ep, first_tx_buf);
rxm_free_tx_buf(rxm_ep, tx_buf);
}
struct rxm_deferred_tx_entry *
rxm_ep_alloc_deferred_tx_entry(struct rxm_ep *rxm_ep, struct rxm_conn *rxm_conn,
enum rxm_deferred_tx_entry_type type)
{
struct rxm_deferred_tx_entry *def_tx_entry;
def_tx_entry = calloc(1, sizeof(*def_tx_entry));
if (!def_tx_entry)
return NULL;
def_tx_entry->rxm_ep = rxm_ep;
def_tx_entry->rxm_conn = rxm_conn;
def_tx_entry->type = type;
dlist_init(&def_tx_entry->entry);
return def_tx_entry;
}
static void
rxm_ep_sar_handle_segment_failure(struct rxm_deferred_tx_entry *def_tx_entry,
ssize_t ret)
{
rxm_ep_sar_tx_cleanup(def_tx_entry->rxm_ep, def_tx_entry->rxm_conn,
def_tx_entry->sar_seg.cur_seg_tx_buf);
rxm_cq_write_error(def_tx_entry->rxm_ep->util_ep.tx_cq,
def_tx_entry->rxm_ep->util_ep.tx_cntr,
def_tx_entry->sar_seg.app_context, (int) ret);
}
/* Returns FI_SUCCESS if the SAR deferred TX queue is empty,
* otherwise, it returns -FI_EAGAIN or error from MSG provider */
static ssize_t
rxm_ep_progress_sar_deferred_segments(struct rxm_deferred_tx_entry *def_tx_entry)
{
ssize_t ret = 0;
struct rxm_tx_buf *tx_buf = def_tx_entry->sar_seg.cur_seg_tx_buf;
if (tx_buf) {
ret = fi_send(def_tx_entry->rxm_conn->msg_ep, &tx_buf->pkt,
sizeof(tx_buf->pkt) + tx_buf->pkt.ctrl_hdr.seg_size,
tx_buf->hdr.desc, 0, tx_buf);
if (ret) {
if (ret != -FI_EAGAIN) {
rxm_ep_sar_handle_segment_failure(def_tx_entry,
ret);
}
return ret;
}
def_tx_entry->sar_seg.next_seg_no++;
def_tx_entry->sar_seg.remain_len -= rxm_buffer_size;
if (def_tx_entry->sar_seg.next_seg_no ==
def_tx_entry->sar_seg.segs_cnt) {
assert(rxm_sar_get_seg_type(&tx_buf->pkt.ctrl_hdr) ==
RXM_SAR_SEG_LAST);
return 0;
}
}
while (def_tx_entry->sar_seg.next_seg_no !=
def_tx_entry->sar_seg.segs_cnt) {
ret = rxm_send_segment(
def_tx_entry->rxm_ep, def_tx_entry->rxm_conn,
def_tx_entry->sar_seg.app_context,
def_tx_entry->sar_seg.total_len,
def_tx_entry->sar_seg.remain_len,
def_tx_entry->sar_seg.msg_id, rxm_buffer_size,
def_tx_entry->sar_seg.next_seg_no,
def_tx_entry->sar_seg.segs_cnt,
def_tx_entry->sar_seg.payload.data,
def_tx_entry->sar_seg.flags,
def_tx_entry->sar_seg.payload.tag,
def_tx_entry->sar_seg.op,
def_tx_entry->sar_seg.payload.iov,
def_tx_entry->sar_seg.payload.count,
&def_tx_entry->sar_seg.payload.cur_iov_offset,
&def_tx_entry->sar_seg.cur_seg_tx_buf,
def_tx_entry->sar_seg.iface,
def_tx_entry->sar_seg.device);
if (ret) {
if (ret != -FI_EAGAIN) {
rxm_ep_sar_handle_segment_failure(def_tx_entry,
ret);
}
return ret;
}
def_tx_entry->sar_seg.next_seg_no++;
def_tx_entry->sar_seg.remain_len -= rxm_buffer_size;
}
return 0;
}
void rxm_ep_progress_deferred_queue(struct rxm_ep *rxm_ep,
struct rxm_conn *rxm_conn)
{
struct rxm_deferred_tx_entry *def_tx_entry;
struct iovec iov;
struct fi_msg msg;
ssize_t ret = 0;
if (rxm_conn->state != RXM_CM_CONNECTED)
return;
while (!dlist_empty(&rxm_conn->deferred_tx_queue) && !ret) {
def_tx_entry = container_of(rxm_conn->deferred_tx_queue.next,
struct rxm_deferred_tx_entry, entry);
switch (def_tx_entry->type) {
case RXM_DEFERRED_TX_RNDV_ACK:
ret = fi_send(def_tx_entry->rxm_conn->msg_ep,
&def_tx_entry->rndv_ack.rx_buf->
recv_entry->rndv.tx_buf->pkt,
def_tx_entry->rndv_ack.pkt_size,
def_tx_entry->rndv_ack.rx_buf->recv_entry->
rndv.tx_buf->hdr.desc,
0, def_tx_entry->rndv_ack.rx_buf);
if (ret) {
if (ret == -FI_EAGAIN)
return;
rxm_cq_write_error(def_tx_entry->rxm_ep->util_ep.rx_cq,
def_tx_entry->rxm_ep->util_ep.rx_cntr,
def_tx_entry->rndv_ack.rx_buf->
recv_entry->context, (int) ret);
}
if (def_tx_entry->rndv_ack.rx_buf->recv_entry->rndv
.tx_buf->pkt.ctrl_hdr
.type == rxm_ctrl_rndv_rd_done)
RXM_UPDATE_STATE(FI_LOG_EP_DATA,
def_tx_entry->rndv_ack.rx_buf,
RXM_RNDV_READ_DONE_SENT);
else
RXM_UPDATE_STATE(FI_LOG_EP_DATA,
def_tx_entry->rndv_ack.rx_buf,
RXM_RNDV_WRITE_DATA_SENT);
break;
case RXM_DEFERRED_TX_RNDV_DONE:
ret = fi_send(def_tx_entry->rxm_conn->msg_ep,
&def_tx_entry->rndv_done.tx_buf->write_rndv.done_buf->pkt,
sizeof(struct rxm_pkt),
def_tx_entry->rndv_done.tx_buf->write_rndv.done_buf->hdr.desc,
0, def_tx_entry->rndv_done.tx_buf);
if (ret) {
if (ret == -FI_EAGAIN)
return;
rxm_cq_write_error(def_tx_entry->rxm_ep->util_ep.tx_cq,
def_tx_entry->rxm_ep->util_ep.tx_cntr,
def_tx_entry->rndv_done.tx_buf, (int) ret);
}
RXM_UPDATE_STATE(FI_LOG_EP_DATA,
def_tx_entry->rndv_done.tx_buf,
RXM_RNDV_WRITE_DONE_SENT);
break;
case RXM_DEFERRED_TX_RNDV_READ:
ret = rxm_ep->rndv_ops->xfer(
def_tx_entry->rxm_conn->msg_ep,
def_tx_entry->rndv_read.rxm_iov.iov,
def_tx_entry->rndv_read.rxm_iov.desc,
def_tx_entry->rndv_read.rxm_iov.count, 0,
def_tx_entry->rndv_read.rma_iov.addr,
def_tx_entry->rndv_read.rma_iov.key,
def_tx_entry->rndv_read.rx_buf);
if (ret) {
if (ret == -FI_EAGAIN)
return;
rxm_cq_write_error(def_tx_entry->rxm_ep->util_ep.rx_cq,
def_tx_entry->rxm_ep->util_ep.rx_cntr,
def_tx_entry->rndv_read.rx_buf->
recv_entry->context, (int) ret);
}
break;
case RXM_DEFERRED_TX_RNDV_WRITE:
ret = rxm_ep->rndv_ops->xfer(
def_tx_entry->rxm_conn->msg_ep,
def_tx_entry->rndv_write.rxm_iov.iov,
def_tx_entry->rndv_write.rxm_iov.desc,
def_tx_entry->rndv_write.rxm_iov.count, 0,
def_tx_entry->rndv_write.rma_iov.addr,
def_tx_entry->rndv_write.rma_iov.key,
def_tx_entry->rndv_write.tx_buf);
if (ret) {
if (ret == -FI_EAGAIN)
return;
rxm_cq_write_error(def_tx_entry->rxm_ep->util_ep.rx_cq,
def_tx_entry->rxm_ep->util_ep.rx_cntr,
def_tx_entry->rndv_write.tx_buf, (int) ret);
}
break;
case RXM_DEFERRED_TX_SAR_SEG:
ret = rxm_ep_progress_sar_deferred_segments(def_tx_entry);
if (ret == -FI_EAGAIN)
return;