Lines Matching refs:retval
49 void *retval;
52 retval = __xa_erase(xa, index);
55 return (retval);
65 void *retval;
68 retval = radix_tree_lookup(&xa->root, index);
71 return (retval);
101 int retval;
113 retval = radix_tree_insert(&xa->root, *pindex, ptr);
115 switch (retval) {
121 retval = -ENOMEM;
132 return (retval);
138 int retval;
141 retval = __xa_alloc(xa, pindex, ptr, mask, gfp);
144 return (retval);
157 int retval;
170 retval = radix_tree_insert(&xa->root, *pnext_index, ptr);
172 switch (retval) {
175 retval = -ENOMEM;
192 return (retval);
199 int retval;
202 retval = __xa_alloc_cyclic(xa, pindex, ptr, mask, pnext_index, gfp);
205 return (retval);
218 int retval;
222 retval = radix_tree_insert(&xa->root, index, ptr);
224 switch (retval) {
234 return (retval);
240 int retval;
243 retval = __xa_insert(xa, index, ptr, gfp);
246 return (retval);
260 int retval;
264 retval = radix_tree_store(&xa->root, index, &ptr);
266 switch (retval) {
274 ptr = XA_ERROR(retval);
277 ptr = XA_ERROR(retval);
286 void *retval;
289 retval = __xa_store(xa, index, ptr, gfp);
292 return (retval);
340 bool retval;
343 retval = __xa_empty(xa);
346 return (retval);
359 void *retval;
373 retval = *ppslot;
376 retval = NULL;
378 return (retval);
384 void *retval;
387 retval = __xa_next(xa, pindex, not_first);
390 return (retval);