cxgbe/iw_cxgbe/resource.c

90 	u32 entry;
91 	entry = c4iw_id_alloc(id_table);
92 	if (entry == (u32)(-1)) {
95 	return entry;
98 void c4iw_put_resource(struct c4iw_id_table *id_table, u32 entry)
100 	CTR2(KTR_IW_CXGBE, "%s entry 0x%x", __func__, entry);
101 	c4iw_id_free(id_table, entry);
106 	struct c4iw_qid_list *entry;
112 		entry = list_entry(uctx->cqids.next, struct c4iw_qid_list,
113 				   entry);
114 		list_del(&entry->entry);
115 		qid = entry->qid;
116 		kfree(entry);
125 			entry = kmalloc(sizeof *entry, GFP_KERNEL);
126 			if (!entry)
128 			entry->qid = i;
129 			list_add_tail(&entry->entry, &uctx->cqids);
136 		entry = kmalloc(sizeof *entry, GFP_KERNEL);
137 		if (!entry)
139 		entry->qid = qid;
140 		list_add_tail(&entry->entry, &uctx->qpids);
142 			entry = kmalloc(sizeof *entry, GFP_KERNEL);
143 			if (!entry)
145 			entry->qid = i;
146 			list_add_tail(&entry->entry, &uctx->qpids);
162 	struct c4iw_qid_list *entry;
164 	entry = kmalloc(sizeof *entry, GFP_KERNEL);
165 	if (!entry)
168 	entry->qid = qid;
170 	list_add_tail(&entry->entry, &uctx->cqids);
176 	struct c4iw_qid_list *entry;
182 		entry = list_entry(uctx->qpids.next, struct c4iw_qid_list,
183 				   entry);
184 		list_del(&entry->entry);
185 		qid = entry->qid;
186 		kfree(entry);
195 			entry = kmalloc(sizeof *entry, GFP_KERNEL);
196 			if (!entry)
198 			entry->qid = i;
199 			list_add_tail(&entry->entry, &uctx->qpids);
206 		entry = kmalloc(sizeof *entry, GFP_KERNEL);
207 		if (!entry)
209 		entry->qid = qid;
210 		list_add_tail(&entry->entry, &uctx->cqids);
212 			entry = kmalloc(sizeof *entry, GFP_KERNEL);
213 			if (!entry)
215 			entry->qid = i;
216 			list_add_tail(&entry->entry, &uctx->cqids);
232 	struct c4iw_qid_list *entry;
234 	entry = kmalloc(sizeof *entry, GFP_KERNEL);
235 	if (!entry)
238 	entry->qid = qid;
240 	list_add_tail(&entry->entry, &uctx->qpids);