jdolecek f65ee1b182 merge(): use array of buffers instead of one big buffer for all records, and ...

enlarge them as necessary to read records from merged files; the buffers
	are allocated once per program run, so there shouldn't be any
	performance difference
This makes sort(1) pass also regression 40B and should make it
fully arbitrary long record capable.
XXX the buffer array could probably be freed on end of fmerge() to save memory

2001-01-19 10:50:31 +00:00

..

append.c

cosmetic style change

2001-01-18 20:59:43 +00:00

extern.h

comsetic prototype adjustment

2001-01-12 19:31:25 +00:00

fields.c

also remove the clpos++ added in rev 1.4

2001-01-13 19:04:21 +00:00

files.c

makeline(): make the overflow handling code safe vs. buffer realloc, add

2001-01-18 21:02:47 +00:00

fsort.c

use MERGE_FNUM instead of magic value 16

2001-01-19 10:13:21 +00:00

fsort.h

put MERGE_FNUM here, slighly clean up other defines

2001-01-19 10:12:35 +00:00

init.c

use toupper() where appropriate

2001-01-12 19:30:22 +00:00

Makefile

make ftmp() wrapper aroung tmpfile(), there is no need to reimplement it

2001-01-08 19:16:49 +00:00

msort.c

merge(): use array of buffers instead of one big buffer for all records, and

2001-01-19 10:50:31 +00:00

pathnames.h

Two classes of changes from the initial OpenBSD commit of this sort(1):

2000-10-07 20:37:06 +00:00

sort.1

set date to when this utility became default system sort(1) on NetBSD

2001-01-16 10:36:57 +00:00

sort.c

And make usage() test for NULL explicitly..

2001-01-13 20:21:56 +00:00

sort.h

adjust intendation

2001-01-19 10:14:31 +00:00