284 	struct audit_chunk *old;  in replace_mark_chunk()  local
287 	old = mark_chunk(mark);  in replace_mark_chunk()
291 	if (old)  in replace_mark_chunk()
292 		old->mark = NULL;  in replace_mark_chunk()
295 static void replace_chunk(struct audit_chunk *new, struct audit_chunk *old)  in replace_chunk()  argument
300 	new->key = old->key;  in replace_chunk()
301 	list_splice_init(&old->trees, &new->trees);  in replace_chunk()
304 	for (i = j = 0; j < old->count; i++, j++) {  in replace_chunk()
305 		if (!old->owners[j].owner) {  in replace_chunk()
309 		owner = old->owners[j].owner;  in replace_chunk()
311 		new->owners[i].index = old->owners[j].index - j + i;  in replace_chunk()
315 		list_replace_init(&old->owners[j].list, &new->owners[i].list);  in replace_chunk()
317 	replace_mark_chunk(old->mark, new);  in replace_chunk()
324 	list_replace_rcu(&old->hash, &new->hash);  in replace_chunk()
463 	struct audit_chunk *chunk, *old;  in tag_chunk()  local
479 	old = mark_chunk(mark);  in tag_chunk()
480 	for (n = 0; n < old->count; n++) {  in tag_chunk()
481 		if (old->owners[n].owner == tree) {  in tag_chunk()
490 	chunk = alloc_chunk(old->count + 1);  in tag_chunk()
518 	replace_chunk(chunk, old);  in tag_chunk()
522 	audit_mark_put_chunk(old);  in tag_chunk()
872 int audit_tag_tree(char *old, char *new)  in audit_tag_tree()  argument
888 	err = kern_path(old, 0, &path1);  in audit_tag_tree()