/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
H A D | mangle1.C | 13 class codes class 17 codes (int ptr); 21 codes::codes (int ptr) function in class:codes
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/ |
H A D | pr24059.c | 6 unsigned char codes[((int) 100)]; member in struct:pred_data 9 void compute_predicate_codes (char *codes, struct pred_data *p) argument 13 codes[i] = p->codes[i] ? 2 : 0;
|
/haiku-buildtools/gcc/zlib/contrib/infback9/ |
H A D | inflate9.h | 30 Read deflate codes: 43 code FAR *next; /* next available space in codes[] */ 46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
H A D | inftree9.h | 39 1446, which is the sum of 852 for literal/length codes and 594 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 32 6 15" for distance codes returns 594. 60 unsigned codes, code FAR * FAR *table,
|
H A D | inftree9.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table, 32 int inflate_table9(type, lens, codes, table, bits, work) 35 unsigned codes; 46 int left; /* number of prefix codes available */ 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 64 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 68 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */ 72 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */ 79 code lengths are lens[0..codes [all...] |
/haiku-buildtools/gcc/zlib/ |
H A D | inftrees.h | 39 1444, which is the sum of 852 for literal/length codes and 592 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 61 unsigned codes, code FAR * FAR *table,
|
H A D | inflate.h | 72 Read deflate codes in fixed or dynamic block: 106 code const FAR *lencode; /* starting table for length/literal codes */ 107 code const FAR *distcode; /* starting table for distance codes */ 115 code FAR *next; /* next available space in codes[] */ 118 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
H A D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table, 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) 35 unsigned codes; 46 int left; /* number of prefix codes available */ 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ 77 code lengths are lens[0..codes [all...] |
H A D | inflate.c | 121 state->lencode = state->distcode = state->next = state->codes; 330 puts(" /* inffixed.h -- table for decoding fixed codes"); 558 if there is no input available. The decoding of variable length codes uses 844 Tracev((stderr, "inflate: fixed codes block%s\n", 846 state->mode = LEN_; /* decode codes */ 853 Tracev((stderr, "inflate: dynamic codes block%s\n", 922 state->next = state->codes; 996 state->next = state->codes; 1015 Tracev((stderr, "inflate: codes ok\n")); 1454 if (state->lencode >= state->codes [all...] |
/haiku-buildtools/binutils/zlib/contrib/infback9/ |
H A D | inflate9.h | 30 Read deflate codes: 43 code FAR *next; /* next available space in codes[] */ 46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
H A D | inftree9.h | 39 1446, which is the sum of 852 for literal/length codes and 594 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 32 6 15" for distance codes returns 594. 60 unsigned codes, code FAR * FAR *table,
|
H A D | inftree9.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table, 32 int inflate_table9(type, lens, codes, table, bits, work) 35 unsigned codes; 46 int left; /* number of prefix codes available */ 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 64 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 68 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */ 72 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */ 79 code lengths are lens[0..codes [all...] |
/haiku-buildtools/binutils/zlib/ |
H A D | inftrees.h | 39 1444, which is the sum of 852 for literal/length codes and 592 for distance 40 codes. These values were found by exhaustive searches using the program 43 maximum bit length of a code. "enough 286 9 15" for literal/length codes 44 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 61 unsigned codes, code FAR * FAR *table,
|
H A D | inflate.h | 72 Read deflate codes in fixed or dynamic block: 106 code const FAR *lencode; /* starting table for length/literal codes */ 107 code const FAR *distcode; /* starting table for distance codes */ 115 code FAR *next; /* next available space in codes[] */ 118 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
H A D | inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table, 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) 35 unsigned codes; 46 int left; /* number of prefix codes available */ 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ 77 code lengths are lens[0..codes [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | gensupport.h | 72 int num_codes; /* number of codes accepted */ 75 bool codes[NUM_RTX_CODE]; /* set of codes accepted */ member in struct:pred_data
|
H A D | read-rtl.c | 48 /* The group (modes or codes) to which the iterator or attribute belongs. */ 124 static struct iterator_group modes, codes, ints, substs; variable in typeref:struct: 155 /* Implementations of the iterator_group callbacks for codes. */ 540 htab_traverse (codes.iterators, add_current_iterators, NULL); 658 codes.attrs = htab_create (13, leading_string_hash, leading_string_eq_p, 0); 659 codes.iterators = htab_create (13, leading_string_hash, 661 codes.find_builtin = find_code; 662 codes.apply_iterator = apply_code_iterator; 690 lower = add_mapping (&codes, codes [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/ |
H A D | bug200.go | 11 // hash codes so it missed the duplication
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | makefile.vms | 112 INSN_INCLUDES=insn-attr.h insn-codes.h insn-config.h insn-flags.h 172 insn-codes.h: gencodes.exe $(MDFILE) 233 combine.obj: combine.c insn-attr.h insn-flags.h insn-codes.h insn-config.h 235 c-decl.obj: c-decl.c expr.h integrate.h insn-codes.h insn-config.h 242 except.obj: except.c insn-flags.h insn-codes.h insn-config.h 243 explow.obj: explow.c insn-flags.h insn-codes.h insn-config.h 244 expmed.obj: expmed.c insn-flags.h insn-codes.h insn-config.h 246 final.obj: final.c tm.h insn-attr.h insn-flags.h insn-codes.h insn-config.h 248 function.obj: function.c insn-flags.h insn-codes.h insn-config.h insn-codes [all...] |
H A D | genrecog.c | 137 /* This table contains a list of the rtl codes that can possibly match a 146 RTX_CODE codes[NUM_RTX_CODE]; 427 if (preds[i].codes[1] == 0 && new->code == UNKNOWN) 429 new->code = preds[i].codes[0]; 434 for (j = 0; j < NUM_RTX_CODE && preds[i].codes[j] != 0; j++) 435 if (preds[i].codes[j] == CONST_INT) 628 both true. Similarly for codes, integer elements, and vector lengths. */ 653 have any codes in common. */ 662 /* If D2 tests an explicit code, see if it is in the list of valid codes 666 for (i = 0; i < NUM_RTX_CODE && preds[d1->pred].codes[ 145 RTX_CODE codes[NUM_RTX_CODE]; member in struct:pred_table [all...] |
/haiku-buildtools/binutils/gas/testsuite/gas/arm/ |
H A D | fpa-mem.s | 29 # condition codes
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/arm/ |
H A D | fpa-mem.s | 29 # condition codes
|
/haiku-buildtools/legacy/gcc/gcc/java/ |
H A D | gjavah.c | 593 unsigned char *codes = jcf->read_ptr; local 602 && codes[0] == OPCODE_aload_0 603 && codes[1] == OPCODE_getfield 604 && (codes[4] == OPCODE_areturn 605 || codes[4] == OPCODE_dreturn 606 || codes[4] == OPCODE_freturn 607 || codes[4] == OPCODE_ireturn 608 || codes[4] == OPCODE_lreturn)) 612 index = (codes[2] << 8) | codes[ [all...] |
/haiku-buildtools/gcc/zlib/contrib/puff/ |
H A D | puff.c | 49 * - Fix fixed codes table error 63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case 91 #define MAXLCODES 286 /* maximum number of literal/length codes */ 92 #define MAXDCODES 30 /* maximum number of distance codes */ 93 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */ 94 #define FIXLCODES 288 /* number of fixed literal/length codes */ 218 * - The codes as stored in the compressed data are bit-reversed relative to 219 * a simple integer ordering of codes of the same lengths. Hence below the 225 * - The first code for the shortest length is all zeros. Subsequent codes of 230 * - Incomplete codes ar 435 local int codes(struct state *s, function [all...] |
/haiku-buildtools/binutils/zlib/contrib/puff/ |
H A D | puff.c | 49 * - Fix fixed codes table error 63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case 79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks 92 #define MAXLCODES 286 /* maximum number of literal/length codes */ 93 #define MAXDCODES 30 /* maximum number of distance codes */ 94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */ 95 #define FIXLCODES 288 /* number of fixed literal/length codes */ 219 * - The codes as stored in the compressed data are bit-reversed relative to 220 * a simple integer ordering of codes of the same lengths. Hence below the 226 * - The first code for the shortest length is all zeros. Subsequent codes o 436 local int codes(struct state *s, function [all...] |