/haiku-fatelf/src/bin/zip/ |
H A D | zipfile.c | 63 #define LOCEXT 24 /* length of extra field */ 79 #define CENEXT 26 /* length of extra field */ 321 if (z->ext && z->cext && z->extra != z->cextra) 324 "local extra (%ld bytes) != central extra (%ld bytes): ", 329 /* in noisy mode, extra field sizes are always reported */ 334 /* Only give info if extra bytes were added by another system */ 446 z->zname = z->name = z->iname = z->extra = z->cextra = z->comment = NULL; 453 /* Read file name and extra field and skip data */ 463 (z->ext && (z->extra [all...] |
H A D | trees.c | 152 local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 155 local int near extra_dbits[D_CODES] /* extra bits for each distance code */ 158 local int near extra_blbits[BL_CODES]/* extra bits for each bit length code */ 237 * need for the L_CODES extra codes used during heap construction. However 253 int near *extra_bits; /* extra bits for each code or NULL */ 634 int near *extra = desc->extra_bits; local 642 int xbits; /* extra bits */ 664 if (n >= base) xbits = extra[n-base]; 791 /* new is 0 or 1 so it does not have extra bits */ 1192 int extra; /* numbe local [all...] |
H A D | zipup.c | 254 char *a; /* extra field of file to check filetype of */ 324 /* Free the old extra fields which are probably obsolete */ 326 free((zvoid *)(z->extra)); 328 if (z->cext && z->extra != z->cextra) { 331 z->extra = z->cextra = NULL; 344 #else /* RISCOS must set m after setting extra field */ 362 /* create extra field and change z->att and z->atx if desired */ 369 m = special != NULL && filetypes(z->extra, special) ? STORE : method; 407 /* create extra field and change z->att and z->atx if desired */ 423 * allocate an extra pag [all...] |
/haiku-fatelf/src/libs/zlib/ |
H A D | inflate.c | 19 * - Remove unnecessary second byte pull from length extra in inffast.c 34 * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths 715 state->head->extra = Z_NULL; 723 state->head->extra != Z_NULL) { 725 zmemcpy(state->head->extra + len, next, 1053 state->extra = (unsigned)(here.op) & 15; 1056 if (state->extra) { 1057 NEEDBITS(state->extra); 1058 state->length += BITS(state->extra); 1059 DROPBITS(state->extra); [all...] |
H A D | trees.c | 62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */ 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 93 * need for the L_CODES extra codes used during heap construction. However 124 const intf *extra_bits; /* extra bits for each code or NULL */ 501 const intf *extra = desc->stat_desc->extra_bits; local 507 int xbits; /* extra bits */ 529 if (n >= base) xbits = extra[n-base]; 659 /* node is 0 or 1 so it does not have extra bits */ 1085 int extra; /* numbe local [all...] |
/haiku-fatelf/src/tools/docbook/libxml2/ |
H A D | c14n.c | 128 * @extra: extra informations 133 xmlC14NErrMemory(const char *extra) argument 136 XML_ERR_NO_MEMORY, XML_ERR_ERROR, NULL, 0, extra, 138 "Memory allocation failed : %s\n", extra); 143 * @extra: extra informations 148 xmlC14NErrParam(const char *extra) argument 151 XML_ERR_INTERNAL_ERROR, XML_ERR_ERROR, NULL, 0, extra, 153 "Invalid parameter : %s\n", extra); 163 xmlC14NErrInternal(const char *extra) argument 178 xmlC14NErrInvalidNode(const char *node_type, const char *extra) argument 193 xmlC14NErrUnknownNode(int node_type, const char *extra) argument [all...] |
/haiku-fatelf/src/bin/unzip/ |
H A D | explode.c | 65 c17b 16 Feb 02 C. Spieler changed type of the "extra lengths" array 66 "extra" from ush into uch (to save space) 168 static ZCONST uch extra[] = variable 259 register unsigned e; /* table entry flag/number of extra bits */ 305 if (e) /* get length extra bits */ 377 register unsigned e; /* table entry flag/number of extra bits */ 423 if (e) /* get length extra bits */ 552 if ((r = huft_build(__G__ l, 64, 0, cplen3, extra, &tl, &bl)) != 0) 566 if ((r = huft_build(__G__ l, 64, 0, cplen2, extra, &tl, &bl)) != 0) 582 r = huft_build(__G__ l, 64, 0, cpdist8, extra, [all...] |
/haiku-fatelf/headers/cpp/std/ |
H A D | bastring.cc | 31 operator new (size_t s, size_t extra) argument 33 return Allocator::allocate(s + extra * sizeof (charT)); 57 create (size_t extra) argument 59 extra = frob_size (extra + 1); 60 Rep *p = new (extra) Rep; 61 p->res = extra;
|
/haiku-fatelf/src/bin/less/ |
H A D | command.c | 896 char *extra; local 1007 extra = NULL; 1008 action = fcmd_decode(cbuf, &extra); 1010 * If an "extra" string was returned, 1013 if (extra != NULL) 1014 ungetsc(extra); 1272 if (extra != NULL) 1273 quit(*extra);
|
/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | regcomp.c | 43 void *extra); 46 void *extra); 47 static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node); 48 static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node); 51 static reg_errcode_t calc_first (void *extra, bin_tree_t *node); 52 static reg_errcode_t calc_next (void *extra, bin_tree_t *node); 53 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node); 116 const unsigned char *extra, 126 static reg_errcode_t free_tree (void *extra, bin_tree_t *node); 127 static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_ 1211 postorder(bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), void *extra) argument 1243 preorder(bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), void *extra) argument 1276 optimize_subexps(void *extra, bin_tree_t *node) argument 1307 lower_subexps(void *extra, bin_tree_t *node) argument 1366 calc_first(void *extra, bin_tree_t *node) argument 1411 link_nfa_nodes(void *extra, bin_tree_t *node) argument 2774 const unsigned char *extra; local 3425 const unsigned char *weights, *extra, *cp; local 3592 build_charclass_op(re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, const unsigned char *class_name, const unsigned char *extra, bool non_match, reg_errcode_t *err) argument 3793 mark_opt_subexp(void *extra, bin_tree_t *node) argument [all...] |
/haiku-fatelf/src/bin/findutils/gnulib/lib/ |
H A D | regcomp.c | 37 void *extra); 40 void *extra); 41 static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node); 42 static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node); 45 static reg_errcode_t calc_first (void *extra, bin_tree_t *node); 46 static reg_errcode_t calc_next (void *extra, bin_tree_t *node); 47 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node); 110 const unsigned char *extra, 120 static reg_errcode_t free_tree (void *extra, bin_tree_t *node); 121 static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_ 1178 postorder(bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), void *extra) argument 1210 preorder(bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), void *extra) argument 1243 optimize_subexps(void *extra, bin_tree_t *node) argument 1274 lower_subexps(void *extra, bin_tree_t *node) argument 1333 calc_first(void *extra, bin_tree_t *node) argument 1353 calc_next(void *extra, bin_tree_t *node) argument 1376 link_nfa_nodes(void *extra, bin_tree_t *node) argument 2743 const unsigned char *extra; local 3391 const unsigned char *weights, *extra, *cp; local 3554 build_charclass_op(re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, const unsigned char *class_name, const unsigned char *extra, bool non_match, reg_errcode_t *err) argument 3755 mark_opt_subexp(void *extra, bin_tree_t *node) argument 3782 free_tree(void *extra, bin_tree_t *node) argument [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/regex/ |
H A D | regcomp.c | 39 void *extra); 42 void *extra); 43 static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node); 44 static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node); 47 static reg_errcode_t calc_first (void *extra, bin_tree_t *node); 48 static reg_errcode_t calc_next (void *extra, bin_tree_t *node); 49 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node); 112 const unsigned char *extra, 122 static reg_errcode_t free_tree (void *extra, bin_tree_t *node); 123 static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_ 1175 postorder(bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), void *extra) argument 1207 preorder(bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), void *extra) argument 1240 optimize_subexps(void *extra, bin_tree_t *node) argument 1271 lower_subexps(void *extra, bin_tree_t *node) argument 1330 calc_first(void *extra, bin_tree_t *node) argument 1352 calc_next(void *extra, bin_tree_t *node) argument 1375 link_nfa_nodes(void *extra, bin_tree_t *node) argument 2727 const unsigned char *extra; local 3375 const unsigned char *weights, *extra, *cp; local 3542 build_charclass_op(re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, const unsigned char *class_name, const unsigned char *extra, int non_match, reg_errcode_t *err) argument 3741 mark_opt_subexp(void *extra, bin_tree_t *node) argument 3768 free_tree(void *extra, bin_tree_t *node) argument [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | cp-valprint.c | 683 int extra = 0; local 708 extra = (val - TYPE_FIELD_BITPOS (domain, i)); 709 if (extra & 0x7) 712 extra >>= 3; 727 if (extra) 728 fprintf_filtered (stream, " + %d bytes", extra);
|
/haiku-fatelf/src/libs/print/libgutenprint/src/main/ |
H A D | print-weave.c | 628 int extra; local 660 extra = w->first_row_printed 662 if (extra > 0) { 663 extra = (extra + w->rw.separation - 1) / w->rw.separation; 664 jetsused -= extra; 665 phantomrows += extra; 668 extra = startrow + w->rw.separation * (phantomrows + jetsused - 1) 670 if (extra > 0) { 671 extra 1724 int extra; local [all...] |
/haiku-fatelf/src/bin/gzip/ |
H A D | trees.c | 94 local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 97 local int near extra_dbits[D_CODES] /* extra bits for each distance code */ 100 local int near extra_blbits[BL_CODES]/* extra bits for each bit length code */ 184 * need for the L_CODES extra codes used during heap construction. However 200 int near *extra_bits; /* extra bits for each code or NULL */ 487 int near *extra = desc->extra_bits; local 495 int xbits; /* extra bits */ 517 if (n >= base) xbits = extra[n-base]; 644 /* new is 0 or 1 so it does not have extra bits */ 1022 int extra; /* numbe local [all...] |
/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | trees.c | 62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ 65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */ 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 93 * need for the L_CODES extra codes used during heap construction. However 124 const intf *extra_bits; /* extra bits for each code or NULL */ 499 const intf *extra = desc->stat_desc->extra_bits; local 505 int xbits; /* extra bits */ 527 if (n >= base) xbits = extra[n-base]; 657 /* node is 0 or 1 so it does not have extra bits */ 1081 int extra; /* numbe local [all...] |
/haiku-fatelf/src/libs/pdflib/libs/pdflib/ |
H A D | p_tiff.c | 269 uint16 unit, bpc, compression, photometric, inkset, extra, *sinfo; local 331 &extra, &sinfo); 491 if (extra != 0) 492 image->components -= extra; /* ignore the extra channels */ 520 if (extra != 0) { 535 * can't pass through extra bits or use multiple data sources 538 if (extra != 0 || 556 if (extra != 0 || 559 image->components -= extra; /* ignor [all...] |
/haiku-fatelf/src/bin/gdb/libiberty/ |
H A D | obstack.c | 108 (that adds an extra first argument), based on the state of use_extra_arg. 173 the extra bytes won't be missed terribly, but if range checking is on 174 and we used a larger request, a whole extra 4096 bytes would be 179 int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1)) 182 size = 4096 - extra; 232 the extra bytes won't be missed terribly, but if range checking is on 233 and we used a larger request, a whole extra 4096 bytes would be 238 int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1)) 241 size = 4096 - extra; 309 /* We used to copy the odd few remaining bytes as one extra COPYING_UNI 178 int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1)) local 237 int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1)) local [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/extensions/ |
H A D | obstack.c | 115 (that adds an extra first argument), based on the state of use_extra_arg. 178 the extra bytes won't be missed terribly, but if range checking is on 179 and we used a larger request, a whole extra 4096 bytes would be 184 int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1)) local 187 size = 4096 - extra; 237 the extra bytes won't be missed terribly, but if range checking is on 238 and we used a larger request, a whole extra 4096 bytes would be 243 int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1)) local 246 size = 4096 - extra; 320 /* We used to copy the odd few remaining bytes as one extra COPYING_UNI [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/MyNetwork/ |
H A D | IconListItem.cpp | 38 extra = data;
|
/haiku-fatelf/src/apps/webpositive/tabview/ |
H A D | TabView.cpp | 85 float extra = be_control_look->DefaultLabelSpacing(); local 87 return BSize(labelWidth, _LabelHeight() + extra);
|
/haiku-fatelf/src/libs/print/libgutenprint/src/testpattern/ |
H A D | testpattern.c | 569 unsigned extra = len - blocks; \ 588 memset(s_data, 0xff, sizeof(T) * extra * \ 598 memset(s_data, 0xff, sizeof(T) * extra * 3); \ 609 memset(s_data, 0, sizeof(T) * extra * 3); \ 619 memset(s_data, 0, sizeof(T) * extra * 4); \ 629 memset(s_data, 0, sizeof(T) * extra * 4); \ 639 memset(s_data, 0, sizeof(T) * extra); \ 648 memset(s_data, 0xff, sizeof(T) * extra); \
|
/haiku-fatelf/src/system/libroot/posix/glibc/stdio-common/ |
H A D | printf_size.c | 225 fp_info.extra = info->extra;
|
/haiku-fatelf/src/apps/deskbar/ |
H A D | TeamMenuItem.cpp | 368 float extra = fVertical ? 0.0f : -1.0f; local 374 + ((frame.Width() - iconBounds.Width()) / 2) + extra; 375 float offsety = contLoc.y + 3.0f + extra; 385 ((frame.Height() - iconBounds.Height()) / 2) + extra; 392 drawLoc.y = frame.top + ((frame.Height() - labelHeight) / 2) + extra;
|
/haiku-fatelf/src/kits/tracker/ |
H A D | TrackerInitialState.cpp | 260 int32 alignment, bool extra); 292 int32 alignment, bool extra) 302 // already got this extra atribute, no work left 313 fExtraAttrs.AddBool("attr:extra", extra); 454 // install a couple of extra fields for bookmark 290 AddExtraAttribute(const char* publicName, const char* name, uint32 type, bool viewable, bool editable, float width, int32 alignment, bool extra) argument
|