NetBSD/usr.bin/sort/Makefile

#	$NetBSD: Makefile,v 1.8 2009/09/10 22:02:40 dsl Exp $
#	from: @(#)Makefile	8.1 (Berkeley) 6/6/93

PROG=	sort
SRCS=	append.c fields.c files.c fsort.c init.c msort.c sort.c tmp.c
SRCS+=	radix_sort.c

LDADD+=-lutil
DPADD+=${LIBUTIL}

.include <bsd.prog.mk>
Save length of key instead of relying of the weight of the record sep. This frees a byte value to use for 'end of key' (to correctly sort short keys) while still having a weight assigned to the field sep. (Unless -t is given, the field sep is in the field data.) Do reverse sorts by writing the output file in reverse order (rather than reversing the sort - apart from merges). All key compares are now unweighted. For 'sort -u' mark duplicates keys during the sort and don't write to the output. Use -S to mean a posix sort - where equal keys are sorted using the raw record (rather than being kept in the original order). For 'sort -f' (no keys) generate a key of the folded data (as for -n -i and -d), simplifies the code and allows a 'posix' sort. 2009-09-11 02:02:40 +04:00			`# $NetBSD: Makefile,v 1.8 2009/09/10 22:02:40 dsl Exp $`
Hit sort(1) with a hammer till it compiles. Also add RCSIDs. 2000-10-07 22:37:09 +04:00			`# from: @(#)Makefile 8.1 (Berkeley) 6/6/93`
4.4BSD-Lite2 contrib/sort 2000-10-07 20:39:34 +04:00
			`PROG= sort`
put tmp.c back to Makefile, too 2001-02-19 20:45:24 +03:00			`SRCS= append.c fields.c files.c fsort.c init.c msort.c sort.c tmp.c`
Include a local copy of the sradixsort() code from libc. Currently unchanged apart from the deletion of the 'unstable' version and other unneeded code. Use fldtab[0]. not fldtab-> when we are referring to the global info in the 0th entry to emphasise that this entry is different. fldtab[0].weights is only needed in the SINGL_FLD case - so set it there. Re-indent a big 'if' is setfield() so that the line breaks match the logic - which looks dubious now! 2009-09-05 13:16:18 +04:00			`SRCS+= radix_sort.c`
4.4BSD-Lite2 contrib/sort 2000-10-07 20:39:34 +04:00
Save length of key instead of relying of the weight of the record sep. This frees a byte value to use for 'end of key' (to correctly sort short keys) while still having a weight assigned to the field sep. (Unless -t is given, the field sep is in the field data.) Do reverse sorts by writing the output file in reverse order (rather than reversing the sort - apart from merges). All key compares are now unweighted. For 'sort -u' mark duplicates keys during the sort and don't write to the output. Use -S to mean a posix sort - where equal keys are sorted using the raw record (rather than being kept in the original order). For 'sort -f' (no keys) generate a key of the folded data (as for -n -i and -d), simplifies the code and allows a 'posix' sort. 2009-09-11 02:02:40 +04:00			`LDADD+=-lutil`
			`DPADD+=${LIBUTIL}`

4.4BSD-Lite2 contrib/sort 2000-10-07 20:39:34 +04:00			`.include <bsd.prog.mk>`