Lines Matching refs:retval
51 void *retval;
55 retval = radix_tree_delete(&xa->root, index);
56 if (retval == NULL_VALUE)
57 retval = NULL;
59 return (retval);
65 void *retval;
68 retval = __xa_erase(xa, index);
71 return (retval);
81 void *retval;
84 retval = radix_tree_lookup(&xa->root, index);
87 if (retval == NULL_VALUE)
88 retval = NULL;
90 return (retval);
120 int retval;
134 retval = radix_tree_insert(&xa->root, *pindex, ptr);
136 switch (retval) {
142 retval = -ENOMEM;
153 return (retval);
159 int retval;
165 retval = __xa_alloc(xa, pindex, ptr, mask, gfp);
168 return (retval);
181 int retval;
196 retval = radix_tree_insert(&xa->root, *pnext_index, ptr);
198 switch (retval) {
201 retval = -ENOMEM;
220 return (retval);
227 int retval;
230 retval = __xa_alloc_cyclic(xa, pindex, ptr, mask, pnext_index, gfp);
233 return (retval);
246 int retval;
252 retval = radix_tree_insert(&xa->root, index, ptr);
254 switch (retval) {
264 return (retval);
270 int retval;
273 retval = __xa_insert(xa, index, ptr, gfp);
276 return (retval);
290 int retval;
296 retval = radix_tree_store(&xa->root, index, &ptr);
298 switch (retval) {
308 ptr = XA_ERROR(retval);
311 ptr = XA_ERROR(retval);
320 void *retval;
323 retval = __xa_store(xa, index, ptr, gfp);
326 return (retval);
375 bool retval;
378 retval = __xa_empty(xa);
381 return (retval);
394 void *retval;
408 retval = *ppslot;
409 if (retval == NULL_VALUE)
410 retval = NULL;
413 retval = NULL;
415 return (retval);
421 void *retval;
424 retval = __xa_next(xa, pindex, not_first);
427 return (retval);