1 /*- 2 * Copyright (c) 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Peter McIlroy. 7 * 8 * %sccs.include.redist.c% 9 * 10 * @(#)extern.h 8.1 (Berkeley) 06/06/93 11 */ 12 13 void append __P((u_char **, int, int, FILE *, void (*)(), struct field *)); 14 void concat __P((FILE *, FILE *)); 15 length_t enterkey __P((struct recheader *, 16 DBT *, int, struct field *)); 17 void fixit __P((int *, char **)); 18 void fldreset __P((struct field *)); 19 FILE *ftmp __P((void)); 20 void fmerge __P((int, union f_handle, 21 int, int (*)(), FILE *, void (*)(), struct field *)); 22 void fsort __P((int, int, union f_handle, int, FILE *, struct field *)); 23 int geteasy __P((int, union f_handle, 24 int, struct recheader *, u_char *, struct field *)); 25 int getnext __P((int, union f_handle, 26 int, struct recheader *, u_char *, struct field *)); 27 int makekey __P((int, union f_handle, 28 int, struct recheader *, u_char *, struct field *)); 29 int makeline __P((int, union f_handle, 30 int, struct recheader *, u_char *, struct field *)); 31 void merge __P((int, int, int (*)(), FILE *, void (*)(), struct field *)); 32 void num_init __P((void)); 33 void onepass __P((u_char **, int, long, long *, u_char *, FILE *)); 34 int optval __P((int, int)); 35 void order __P((union f_handle, int (*)(), struct field *)); 36 void putline __P((struct recheader *, FILE *)); 37 void putrec __P((struct recheader *, FILE *)); 38 void rd_append __P((int, union f_handle, int, FILE *, u_char *, u_char *)); 39 int seq __P((FILE *, DBT *, DBT *)); 40 int setfield __P((char *, struct field *, int)); 41 void settables __P((int)); 42