Lines Matching refs:alloc
580 * The ma_state alloc member is overloaded to hold a pointer to the first
582 * set, then the alloc contains the number of requested nodes. If there is an
589 if (!mas->alloc || ((unsigned long)mas->alloc & 0x1))
592 return mas->alloc->total;
601 * located in @mas->alloc->request_count, or directly in @mas->alloc if there is
603 * encoding to store in @mas->alloc directly.
607 if (!mas->alloc || ((unsigned long)mas->alloc & 0x1)) {
609 mas->alloc = NULL;
611 mas->alloc = (struct maple_alloc *)(((count) << 1U) | 1U);
615 mas->alloc->request_count = count;
622 * The alloc count is either stored directly in @mas, or in
623 * @mas->alloc->request_count if there is at least one node allocated. Decode
624 * the request count if it's stored directly in @mas->alloc.
630 if ((unsigned long)mas->alloc & 0x1)
631 return (unsigned long)(mas->alloc) >> 1;
632 else if (mas->alloc)
633 return mas->alloc->request_count;
1165 struct maple_alloc *ret, *node = mas->alloc;
1175 mas->alloc = NULL;
1182 mas->alloc = node->slot[0];
1183 mas->alloc->total = node->total - 1;
1207 * Stores the maple node back into @mas->alloc for reuse. Updates allocated and
1213 struct maple_alloc *head = mas->alloc;
1234 mas->alloc = reuse;
1264 if (!allocated || mas->alloc->node_count == MAPLE_ALLOC_SLOTS) {
1270 node->slot[0] = mas->alloc;
1276 mas->alloc = node;
1281 node = mas->alloc;
1301 mas->alloc->total = allocated;
1309 if (mas->alloc && !(((unsigned long)mas->alloc & 0x1)))
1310 mas->alloc->total = allocated;
5579 node = mas->alloc;
5580 mas->alloc = node->slot[0];
5591 mas->alloc = NULL;
7251 pr_err(" min=%lx max=%lx alloc=%p, depth=%u, flags=%x\n",
7252 mas->min, mas->max, mas->alloc, mas->depth, mas->mas_flags);