33 					Indirect chain[DEPTH],  in get_branch()
37 	Indirect *p = chain;  in get_branch()
42 	add_chain (chain, NULL, i_data(inode) + *offsets);  in get_branch()
50 		if (!verify_chain(chain, p))  in get_branch()
116 				     Indirect chain[DEPTH],  in splice_branch()
125 	if (!verify_chain(chain, where-1) || *where->p)  in splice_branch()
157 	Indirect chain[DEPTH];  in get_block()  local
166 	partial = get_branch(inode, depth, offsets, chain, &err);  in get_block()
171 		map_bh(bh, inode->i_sb, block_to_cpu(chain[depth-1].key));  in get_block()
173 		partial = chain+depth-1; /* the whole chain */  in get_block()
180 		while (partial > chain) {  in get_block()
196 	left = (chain + depth) - partial;  in get_block()
197 	err = alloc_branch(inode, left, offsets+(partial-chain), partial);  in get_block()
201 	if (splice_branch(inode, chain, partial, left) < 0)  in get_block()
208 	while (partial > chain) {  in get_block()
226 				Indirect chain[DEPTH],  in find_shared()
235 	partial = get_branch(inode, k, offsets, chain, &err);  in find_shared()
239 		partial = chain + k-1;  in find_shared()
244 	for (p=partial;p>chain && all_zeroes((block_t*)p->bh->b_data,p->p);p--)  in find_shared()
246 	if (p == chain + k - 1 && p > chain) {  in find_shared()
305 	Indirect chain[DEPTH];  in truncate()  local
326 	partial = find_shared(inode, n, offsets, chain, &nr);  in truncate()
328 		if (partial == chain)  in truncate()
332 		free_branches(inode, &nr, &nr+1, (chain+n-1) - partial);  in truncate()
335 	while (partial > chain) {  in truncate()
337 				(chain+n-1) - partial);  in truncate()