1 /*
2  * Copyright(c) 2017 Intel Corporation.
3  *
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.
6  *
7  * GPL LICENSE SUMMARY
8  *
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.
12  *
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.
17  *
18  * BSD LICENSE
19  *
20  * Redistribution and use in source and binary forms, with or without
21  * modification, are permitted provided that the following conditions
22  * are met:
23  *
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
29  *    distribution.
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.
33  *
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.
45  *
46  */
47 
48 #include "exp_rcv.h"
49 #include "trace.h"
50 
51 /**
52  * exp_tid_group_init - initialize exp_tid_set
53  * @set: the set
54  */
55 static void hfi1_exp_tid_set_init(struct exp_tid_set *set)
56 {
57 	INIT_LIST_HEAD(&set->list);
58 	set->count = 0;
59 }
60 
61 /**
62  * hfi1_exp_tid_group_init - initialize rcd expected receive
63  * @rcd: the rcd
64  */
65 void hfi1_exp_tid_group_init(struct hfi1_ctxtdata *rcd)
66 {
67 	hfi1_exp_tid_set_init(&rcd->tid_group_list);
68 	hfi1_exp_tid_set_init(&rcd->tid_used_list);
69 	hfi1_exp_tid_set_init(&rcd->tid_full_list);
70 }
71 
72 /**
73  * alloc_ctxt_rcv_groups - initialize expected receive groups
74  * @rcd: the context to add the groupings to
75  */
76 int hfi1_alloc_ctxt_rcv_groups(struct hfi1_ctxtdata *rcd)
77 {
78 	struct hfi1_devdata *dd = rcd->dd;
79 	u32 tidbase;
80 	struct tid_group *grp;
81 	int i;
82 	u32 ngroups;
83 
84 	ngroups = rcd->expected_count / dd->rcv_entries.group_size;
85 	rcd->groups =
86 		kcalloc_node(ngroups, sizeof(*rcd->groups),
87 			     GFP_KERNEL, rcd->numa_id);
88 	if (!rcd->groups)
89 		return -ENOMEM;
90 	tidbase = rcd->expected_base;
91 	for (i = 0; i < ngroups; i++) {
92 		grp = &rcd->groups[i];
93 		grp->size = dd->rcv_entries.group_size;
94 		grp->base = tidbase;
95 		tid_group_add_tail(grp, &rcd->tid_group_list);
96 		tidbase += dd->rcv_entries.group_size;
97 	}
98 
99 	return 0;
100 }
101 
102 /**
103  * free_ctxt_rcv_groups - free  expected receive groups
104  * @rcd: the context to free
105  *
106  * The routine dismantles the expect receive linked
107  * list and clears any tids associated with the receive
108  * context.
109  *
110  * This should only be called for kernel contexts and the
111  * a base user context.
112  */
113 void hfi1_free_ctxt_rcv_groups(struct hfi1_ctxtdata *rcd)
114 {
115 	kfree(rcd->groups);
116 	rcd->groups = NULL;
117 	hfi1_exp_tid_group_init(rcd);
118 
119 	hfi1_clear_tids(rcd);
120 }
121