Lines Matching defs:in
5 * Redistribution and use in source and binary forms, with or without
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
39 * pack(1) will then store symbols (leaf) nodes count in each huffman
44 * explicitly transmitted (not necessary anyway) in the symbol table.
51 * have at most 256 symbols in the huffman tree. pack(1) rejects empty
54 * last level symbol count by 2 which makes it a number in
64 * Represent the huffman tree in a similar way that pack(1) would
65 * store in a packed file. We store all symbols in a linear table,
74 int *symbolsin; /* Table of leaf symbols count in each
76 int *inodesin; /* Table of internal nodes count in
93 * initialized (in our case, they all point to valid memory block).
119 * leaf nodes in the next level. For the last level there
148 unpack_parse_header(int in, int out, char *pre, size_t prelen, off_t *bytes_in,
159 /* Read in and fill the rest bytes of header */
160 bytesread = read(in, hdr + prelen, PACK_HEADER_LENGTH - prelen);
179 if ((unpackd->fpIn = fdopen(in, "r")) == NULL)
216 * Read in the symbol table, which contain [2, 256] symbols.
217 * In order to fit the count in one byte, pack(1) would offset
311 unpack(int in, int out, char *pre, size_t prelen, off_t *bytes_in)
315 in = dup(in);
316 if (in == -1)
322 unpack_parse_header(in, out, pre, prelen, bytes_in, &unpackd);