Searched defs:fill (Results 1 - 14 of 14) sorted by relevance
/ast/src/lib/libuu/ |
H A D | uulib.h | 51 int fill; member in struct:__anon446
|
/ast/src/cmd/pax/ |
H A D | pax-mime.c | 32 size_t fill; /* last member filler size */ member in struct:Mime_s 178 mime->fill++; 180 mime->fill++; 182 f->st->st_size += (s - v) - mime->fill;
|
/ast/src/lib/libcodex/ |
H A D | code-qp.c | 55 #define GETCHAR(p) ((p)->bp < (p)->be ? (int)*(p)->bp++ : fill(p)) 59 fill(State_t* state) function
|
H A D | code-uu.c | 42 int fill; member in struct:__anon332 96 #define GETCHAR(p) ((p)->bp < (p)->be ? (int)*(p)->bp++ : fill(p)) 100 fill(State_t* state) function 124 c3 = state->data->fill;
|
/ast/src/lib/libz/ |
H A D | inftrees.c | 56 unsigned fill; /* index for replicating entries */ local 156 Create and fill in decoding tables. In this loop, the table being 161 fill the table with replicated entries. 210 next = *table; /* current table to fill in */ 240 fill = 1U << curr; 241 min = fill; /* save offset to next table */ 243 fill -= incr; 244 next[(huff >> drop) + fill] = this; 245 } while (fill != 0); 302 drops back to the root table to fill i [all...] |
/ast/src/cmd/codexlib/lzd/ |
H A D | lzd.c | 61 #define GETCHAR(p) ((p)->ip < (p)->ie ? (int)*(p)->ip++ : fill(p)) 64 fill(State_t* state) function
|
/ast/src/cmd/codexlib/zip/ |
H A D | deflate.c | 79 288 codes just to fill out the Huffman codes. Codes 286 and 287 82 However, static trees define 32 codes (all 5 bits) to fill out the 125 #define NEXTBYTE(p) (((p)->ip < (p)->ie) ? (int)*(p)->ip++ : fill(p)) 165 fill(State_t* state) function
|
H A D | implode.c | 189 #define NEXTBYTE(p) ((p)->ip < (p)->ie ? (int)*(p)->ip++ : fill(p)) 197 fill(State_t* state) function
|
/ast/src/cmd/builtin/ |
H A D | od.c | 195 const char* fill; member in struct:Type_s 874 if (s = (char*)tp->fill)
|
/ast/src/cmd/ksh93/sh/ |
H A D | name.c | 2013 * characters, left-pad with <fill>. Trailing blanks 2016 * If the leftmost digit in <str> is not a digit, <fill> 2019 static void rightjust(char *str, int size, int fill) argument 2048 fill = ' '; 2050 *--sp = fill;
|
/ast/src/cmd/std/ |
H A D | ls.c | 802 pr(register List_t* lp, Ftw_t* ftw, register int fill) argument 822 fill -= sfkeyprintf(sfstdout, lp, state.format, key, NiL) + state.adjust; 825 if (fill > 0) 826 while (fill-- > 0)
|
/ast/src/cmd/codexlib/lzh/ |
H A D | lzh.c | 108 #define GETCHAR(p) ((p)->ip < (p)->ie ? (int)*(p)->ip++ : fill(p)) 111 fill(State_t* state) function
|
/ast/src/lib/libdss/ |
H A D | cx.h | 395 short fill; /* fill character */ member in struct:Cxformat_s
|
/ast/src/cmd/INIT/ |
H A D | ratz.c | 1723 unsigned fill; /* index for replicating entries */ local 1823 Create and fill in decoding tables. In this loop, the table being 1828 fill the table with replicated entries. 1877 next = *table; /* current table to fill in */ 1907 fill = ((unsigned int)1) << curr; 1908 min = fill; /* save offset to next table */ 1910 fill -= incr; 1911 next[(huff >> drop) + fill] = this; 1912 } while (fill != 0); 1969 drops back to the root table to fill i [all...] |
Completed in 42 milliseconds