216  * ->first_trees points to its beginning, ->trees - to the current end of data.
217  * ->tree_count is the number of free entries in array pointed to by ->trees.
234 	struct audit_tree_refs *p = ctx->trees;  in put_tree_ref()
247 		ctx->trees = p;  in put_tree_ref()
256 	struct audit_tree_refs *p = ctx->trees;  in grow_tree_refs()
258 	ctx->trees = kzalloc_obj(struct audit_tree_refs);  in grow_tree_refs()
259 	if (!ctx->trees) {  in grow_tree_refs()
260 		ctx->trees = p;  in grow_tree_refs()
264 		p->next = ctx->trees;  in grow_tree_refs()
266 		ctx->first_trees = ctx->trees;  in grow_tree_refs()
286 	for (q = p; q != ctx->trees; q = q->next, n = 31) {  in unroll_tree_refs()
296 	ctx->trees = p;  in unroll_tree_refs()
318 	for (p = ctx->first_trees; p != ctx->trees; p = p->next) {  in match_tree_refs()
2070 	p = context->trees;  in handle_one()
2099 	p = context->trees;  in handle_path()