74 	int n = 0;  in alloc_branch()  local
80 	if (parent) for (n = 1; n < num; n++) {  in alloc_branch()
86 		branch[n].key = cpu_to_block(nr);  in alloc_branch()
95 		branch[n].bh = bh;  in alloc_branch()
96 		branch[n].p = (block_t*) bh->b_data + offsets[n];  in alloc_branch()
97 		*branch[n].p = branch[n].key;  in alloc_branch()
103 	if (n == num)  in alloc_branch()
107 	for (i = 1; i < n; i++)  in alloc_branch()
109 	for (i = 0; i < n; i++)  in alloc_branch()
307 	int n;  in truncate()  local
314 	n = block_to_path(inode, iblock, offsets);  in truncate()
315 	if (!n)  in truncate()
318 	if (n == 1) {  in truncate()
325 	partial = find_shared(inode, n, offsets, chain, &nr);  in truncate()
331 		free_branches(inode, &nr, &nr+1, (chain+n-1) - partial);  in truncate()
336 				(chain+n-1) - partial);  in truncate()