48 #define	END	256  macro
63 long	count [END+1];
85 int	parent [2*END+1];
88 char	length [END+1];
89 long	bits [END+1];
111 } heap [END+2];
127 	for (i = 0; i < END; i++)  in input()
166 		for (c = 0; c < END; c++)  in output()
187 		c = (--inleft < 0) ? END : (*inp++ & 0377);  in output()
212 	} while (c != END);  in output()
256 	count[END] = 1;  in packfile()
258 	for (i = END; i >= 0; i--) {  in packfile()
277 	lastnode = END;  in packfile()
295 	for (i = 0; i <= END; i++) {  in packfile()
327 		for (c = 0; c <= END; c++)  in packfile()