166 	unsigned long n = (unsigned long)inode / L1_CACHE_BYTES;  in chunk_hash()  local
167 	return chunk_hash_heads + n % HASH_SIZE;  in chunk_hash()
200 	int n;  in audit_tree_match()  local
201 	for (n = 0; n < chunk->count; n++)  in audit_tree_match()
202 		if (chunk->owners[n].owner == tree)  in audit_tree_match()
360 	int n;  in tag_chunk()  local
370 	for (n = 0; n < old->count; n++) {  in tag_chunk()
371 		if (old->owners[n].owner == tree) {  in tag_chunk()
422 	for (n = 0, p = chunk->owners; n < old->count; n++, p++) {  in tag_chunk()
423 		struct audit_tree *s = old->owners[n].owner;  in tag_chunk()
425 		p->index = old->owners[n].index;  in tag_chunk()
429 		list_replace_init(&old->owners[n].list, &p->list);  in tag_chunk()
881 	int n;  in evict_chunk()  local
906 	for (n = 0; n < chunk->count; n++)  in evict_chunk()
907 		list_del_init(&chunk->owners[n].list);  in evict_chunk()