2 * Copyright(c) 2017 Intel Corporation.
4 * This file is provided under a dual BSD/GPLv2 license. When using or
5 * redistributing this file, you may do so under either license.
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of version 2 of the GNU General Public License as
11 * published by the Free Software Foundation.
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
20 * Redistribution and use in source and binary forms, with or without
21 * modification, are permitted provided that the following conditions
24 * - Redistributions of source code must retain the above copyright
25 * notice, this list of conditions and the following disclaimer.
26 * - Redistributions in binary form must reproduce the above copyright
27 * notice, this list of conditions and the following disclaimer in
28 * the documentation and/or other materials provided with the
30 * - Neither the name of Intel Corporation nor the names of its
31 * contributors may be used to endorse or promote products derived
32 * from this software without specific prior written permission.
34 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
35 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
36 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
37 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
38 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
39 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
40 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
41 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
42 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
43 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
44 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
52 * exp_tid_group_init - initialize exp_tid_set
55 void hfi1_exp_tid_group_init(struct exp_tid_set
*set
)
57 INIT_LIST_HEAD(&set
->list
);
62 * alloc_ctxt_rcv_groups - initialize expected receive groups
63 * @rcd - the context to add the groupings to
65 int hfi1_alloc_ctxt_rcv_groups(struct hfi1_ctxtdata
*rcd
)
67 struct hfi1_devdata
*dd
= rcd
->dd
;
69 struct tid_group
*grp
;
72 tidbase
= rcd
->expected_base
;
73 for (i
= 0; i
< rcd
->expected_count
/
74 dd
->rcv_entries
.group_size
; i
++) {
75 grp
= kzalloc(sizeof(*grp
), GFP_KERNEL
);
78 grp
->size
= dd
->rcv_entries
.group_size
;
80 tid_group_add_tail(grp
, &rcd
->tid_group_list
);
81 tidbase
+= dd
->rcv_entries
.group_size
;
86 hfi1_free_ctxt_rcv_groups(rcd
);
91 * free_ctxt_rcv_groups - free expected receive groups
92 * @rcd - the context to free
94 * The routine dismantles the expect receive linked
95 * list and clears any tids associated with the receive
98 * This should only be called for kernel contexts and the
99 * a base user context.
101 void hfi1_free_ctxt_rcv_groups(struct hfi1_ctxtdata
*rcd
)
103 struct tid_group
*grp
, *gptr
;
105 WARN_ON(!EXP_TID_SET_EMPTY(rcd
->tid_full_list
));
106 WARN_ON(!EXP_TID_SET_EMPTY(rcd
->tid_used_list
));
108 list_for_each_entry_safe(grp
, gptr
, &rcd
->tid_group_list
.list
, list
) {
109 tid_group_remove(grp
, &rcd
->tid_group_list
);
113 hfi1_clear_tids(rcd
);