30 	int n = 0;  in block_to_path()  local
35 		offsets[n++] = block;  in block_to_path()
37 		offsets[n++] = DIRECT;  in block_to_path()
38 		offsets[n++] = block;  in block_to_path()
40 		offsets[n++] = DIRECT+1;  in block_to_path()
41 		offsets[n++] = block >> ptrs_bits;  in block_to_path()
42 		offsets[n++] = block & (indirect_blocks - 1);  in block_to_path()
44 		offsets[n++] = DIRECT+2;  in block_to_path()
45 		offsets[n++] = block >> (ptrs_bits * 2);  in block_to_path()
46 		offsets[n++] = (block >> ptrs_bits) & (indirect_blocks - 1);  in block_to_path()
47 		offsets[n++] = block & (indirect_blocks - 1);  in block_to_path()
51 	return n;  in block_to_path()
131 	int n = 0;  in alloc_branch()  local
135 	if (branch[0].key) for (n = 1; n < num; n++) {  in alloc_branch()
139 		branch[n].key = sysv_new_block(inode->i_sb);  in alloc_branch()
140 		if (!branch[n].key)  in alloc_branch()
146 		parent = block_to_cpu(SYSV_SB(inode->i_sb), branch[n-1].key);  in alloc_branch()
150 		branch[n].bh = bh;  in alloc_branch()
151 		branch[n].p = (sysv_zone_t*) bh->b_data + offsets[n];  in alloc_branch()
152 		*branch[n].p = branch[n].key;  in alloc_branch()
157 	if (n == num)  in alloc_branch()
161 	for (i = 1; i < n; i++)  in alloc_branch()
163 	for (i = 0; i < n; i++)  in alloc_branch()
371 	int n;  in sysv_truncate()  local
385 	n = block_to_path(inode, iblock, offsets);  in sysv_truncate()
386 	if (n == 0)  in sysv_truncate()
389 	if (n == 1) {  in sysv_truncate()
394 	partial = find_shared(inode, n, offsets, chain, &nr);  in sysv_truncate()
401 		free_branches(inode, &nr, &nr+1, (chain+n-1) - partial);  in sysv_truncate()
406 				(chain+n-1) - partial);  in sysv_truncate()
413 	while (n < DEPTH) {  in sysv_truncate()
414 		nr = i_data[DIRECT + n - 1];  in sysv_truncate()
416 			i_data[DIRECT + n - 1] = 0;  in sysv_truncate()
418 			free_branches(inode, &nr, &nr+1, n);  in sysv_truncate()
420 		n++;  in sysv_truncate()