HomeSort by: relevance | last modified time | path
    Searched refs:RECHEADER (Results 1 - 8 of 8) sorted by relevancy

  /src/usr.bin/sort/
sort.h 117 typedef struct recheader { struct
122 } RECHEADER;
162 typedef int (*get_func_t)(FILE *, RECHEADER *, u_char *, struct field *);
163 typedef void (*put_func_t)(const RECHEADER *, FILE *);
178 RECHEADER *allocrec(RECHEADER *, size_t);
179 void append(RECHEADER **, int, FILE *, void (*)(const RECHEADER *, FILE *));
181 length_t enterkey(RECHEADER *, const u_char *, u_char *, size_t, struct field *);
189 int geteasy(FILE *, RECHEADER *, u_char *, struct field *)
    [all...]
append.c 75 append(RECHEADER **keylist, int nelem, FILE *fp, put_func_t put)
77 RECHEADER **cpos, **lastkey;
78 RECHEADER *crec;
radix_sort.c 56 RECHEADER **sa; /* Base of saved area */
61 static void simplesort(RECHEADER **, int, int);
71 radix_sort(RECHEADER **a, RECHEADER **ta, int n)
75 RECHEADER **ak, **tai, **lim;
76 RECHEADER *hdr;
79 RECHEADER **top[256];
168 simplesort(RECHEADER **a, int n, int data_index)
170 RECHEADER **ak, **ai;
171 RECHEADER *akh
    [all...]
files.c 85 makeline_copydown(RECHEADER *recbuf)
91 makeline(FILE *fp, RECHEADER *recbuf, u_char *bufend, struct field *dummy2)
144 makekey(FILE *fp, RECHEADER *recbuf, u_char *bufend, struct field *ftbl)
228 putrec(const RECHEADER *rec, FILE *fp)
230 EWRITE(rec, 1, REC_ROUNDUP(offsetof(RECHEADER, data) + rec->length), fp,
238 putline(const RECHEADER *rec, FILE *fp)
248 putkeydump(const RECHEADER *rec, FILE *fp)
250 EWRITE(rec, 1, REC_ROUNDUP(offsetof(RECHEADER, data) + rec->offset), fp,
258 geteasy(FILE *fp, RECHEADER *rec, u_char *end, struct field *dummy2)
263 (void)sizeof (char[offsetof(RECHEADER, length) == 0 ? 1 : -1])
    [all...]
fsort.c 84 RECHEADER **keylist;
85 RECHEADER **keypos, **keyp;
86 RECHEADER *buffer;
92 RECHEADER *crec;
93 RECHEADER *nbuffer;
136 crec = (RECHEADER *)(crec->data + SALIGN(crec->length));
msort.c 80 RECHEADER *rec;
84 static int cmp(RECHEADER *, RECHEADER *);
199 RECHEADER *new_rec;
371 RECHEADER *crec, *prec, *trec;
380 crec = malloc(offsetof(RECHEADER, data[DEFLLEN]));
382 prec = malloc(offsetof(RECHEADER, data[DEFLLEN]));
418 cmp(RECHEADER *rec1, RECHEADER *rec2)
sort.c 414 RECHEADER *
415 allocrec(RECHEADER *rec, size_t size)
fields.c 88 * constructs sort key with leading recheader, followed by the key,
92 enterkey(RECHEADER *keybuf, const u_char *keybuf_end, u_char *line_data,

Completed in 15 milliseconds