HomeSort by: relevance | last modified time | path
    Searched defs:fields (Results 1 - 25 of 281) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/gpl3/gdb/dist/sim/ppc/
gen-itable.c 45 instruction->file_entry->fields[insn_name],
88 char **fields = instruction->file_entry->fields; local
91 instruction->file_entry->fields[insn_name],
95 lf_printf(file, " \"%s\",\n", fields[insn_format]);
96 lf_printf(file, " \"%s\",\n", fields[insn_form]);
97 lf_printf(file, " \"%s\",\n", fields[insn_flags]);
98 lf_printf(file, " \"%s\",\n", fields[insn_mnemonic]);
99 lf_printf(file, " \"%s\",\n", fields[insn_name]);
table.h 30 char *fields[0]; /* User defined */ member in struct:_table_model_entry
41 char *fields[0]; /* User defined */ member in struct:_table_entry
  /src/external/gpl3/gdb.old/dist/sim/ppc/
gen-itable.c 45 instruction->file_entry->fields[insn_name],
88 char **fields = instruction->file_entry->fields; local
91 instruction->file_entry->fields[insn_name],
95 lf_printf(file, " \"%s\",\n", fields[insn_format]);
96 lf_printf(file, " \"%s\",\n", fields[insn_form]);
97 lf_printf(file, " \"%s\",\n", fields[insn_flags]);
98 lf_printf(file, " \"%s\",\n", fields[insn_mnemonic]);
99 lf_printf(file, " \"%s\",\n", fields[insn_name]);
table.h 30 char *fields[0]; /* User defined */ member in struct:_table_model_entry
41 char *fields[0]; /* User defined */ member in struct:_table_entry
  /src/external/mpl/bind/dist/bin/tests/system/inline/
tests_signed_zone_files.py 39 A dictionary of raw-format header fields read from a zone file.
42 fields = [ variable in class:RawFormatHeader
55 super().__init__(zip(self.fields, header.unpack_from(header_data)))
  /src/external/bsd/ipf/dist/lib/
parsefields.c 11 wordtab_t *f, *fields; local
15 fields = NULL;
33 if (fields == NULL) {
34 fields = malloc(2 * sizeof(*fields));
36 fields = realloc(fields, (num + 1) * sizeof(*fields));
40 fields[num - 1].w_word = f->w_word;
42 fields[num - 1].w_word = t
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/TableGen/
JSONBackend.cpp 142 json::Array fields; local
148 fields.push_back(Name);
153 obj["!fields"] = std::move(fields);
  /src/external/gpl3/binutils/dist/opcodes/
mcore-dis.c 303 static char *fields[] = { local
308 (*print_func) (stream, "\t%s", fields[inst & 0x7]);
  /src/external/gpl3/binutils.old/dist/opcodes/
mcore-dis.c 300 static char *fields[] = { local
305 (*print_func) (stream, "\t%s", fields[inst & 0x7]);
  /src/external/gpl3/gdb.old/dist/opcodes/
mcore-dis.c 300 static char *fields[] = { local
305 (*print_func) (stream, "\t%s", fields[inst & 0x7]);
  /src/external/gpl3/gdb/dist/opcodes/
mcore-dis.c 300 static char *fields[] = { local
305 (*print_func) (stream, "\t%s", fields[inst & 0x7]);
  /src/sys/fs/cd9660/
iso_rrip.h 62 int fields; /* interesting fields in this analysis */ member in struct:__anon6719
  /src/tests/lib/libc/regex/
split.c 36 * split - divide a string into fields, like awk split()
38 * returns number of fields, including overflow
40 * fields[] list is not NULL-terminated
41 * nfields number of entries available in fields[]
45 split(char *string, char *fields[], int nfields, const char *sep)
52 char **fp = fields;
85 /* we have overflowed the fields vector -- just count them */
115 /* we have overflowed the fields vector -- just count them */
188 char *fields[MNF]; local
197 (void) split(buf, fields, MNF, argv[2])
216 char *fields[NF]; local
309 char *fields[RNF+1]; local
    [all...]
  /src/external/gpl3/gcc/dist/libgcc/config/i386/
heap-trampoline.c 81 struct __attribute__((packed)) fields { struct in union:ix86_trampoline
91 } fields; member in union:ix86_trampoline
109 struct __attribute__((packed)) fields { struct in union:ix86_trampoline
114 } fields; member in union:ix86_trampoline
212 trampoline->fields.chain_ptr = chain;
214 trampoline->fields.func_ptr = func;
216 uintptr_t off_add = (uintptr_t) &trampoline->fields.func_offset;
218 trampoline->fields.func_offset = (uintptr_t)func - off_add;
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
bitfields2.c 1 /* Test program to test bit field operations on bit fields of large
14 struct fields struct
98 /* Fill alternating fields with all 1's and verify that none of the bits
99 "bleed over" to the other fields. */
118 /* Fill the unsigned fields with the maximum positive value and verify
129 /* Fill the signed fields with the maximum positive value, then the maximally
bitfields.c 3 /* For non-ANSI compilers, use plain ints for the signed bit fields. However,
12 struct fields struct
84 struct fields one;
85 struct fields two;
137 /* Fill alternating fields with all 1's and verify that none of the bits
138 "bleed over" to the other fields. */
164 /* Fill the unsigned fields with the maximum positive value and verify
178 /* Fill the signed fields with the maximum positive value, then the maximally
macscp1.c 15 struct fields struct in struct:outer
21 } fields; member in struct:outer
25 #define addr fields.fault.addr
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
bitfields2.c 1 /* Test program to test bit field operations on bit fields of large
14 struct fields struct
98 /* Fill alternating fields with all 1's and verify that none of the bits
99 "bleed over" to the other fields. */
118 /* Fill the unsigned fields with the maximum positive value and verify
129 /* Fill the signed fields with the maximum positive value, then the maximally
bitfields.c 3 /* For non-ANSI compilers, use plain ints for the signed bit fields. However,
12 struct fields struct
84 struct fields one;
85 struct fields two;
137 /* Fill alternating fields with all 1's and verify that none of the bits
138 "bleed over" to the other fields. */
164 /* Fill the unsigned fields with the maximum positive value and verify
178 /* Fill the signed fields with the maximum positive value, then the maximally
macscp1.c 15 struct fields struct in struct:outer
21 } fields; member in struct:outer
25 #define addr fields.fault.addr
  /src/external/historical/nawk/dist/testdir/
chem.awk 79 $1 == "left" { left[++stack] = fields(2, NF); printf("Last: [\n"); next }
109 from = fields(cf, NF)
118 from = fields(cf, NF)
125 from = "from Last." leave(last, dir) " " fields(cf, NF)
145 return fields(cf-1, NF)
159 printf("\" %s\" ljust at last [].se\n", fields(4,NF))
472 function fields(n1, n2, i, s) { function
  /src/usr.sbin/ypserv/revnetgroup/
parse_netgroup.c 182 int fields; local
223 fields = 0;
228 fields++;
247 * fields. It's up to user programs
260 if (fields < 3)
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
Record.h 64 llvm::iterator_range<const_field_iter> fields() const { function in class:clang::interp::Record
65 return llvm::make_range(Fields.begin(), Fields.end());
68 unsigned getNumFields() { return Fields.size(); }
69 Field *getField(unsigned I) { return &Fields[I]; }
89 Record(const RecordDecl *, BaseList &&Bases, FieldList &&Fields,
100 /// List of all the fields in the record.
101 FieldList Fields;
  /src/external/bsd/nsd/dist/simdzone/src/generic/
format.h 12 #define FIELDS(fields) \
13 { (sizeof(fields)/sizeof(fields[0])), fields }
18 #define ENTRY(name, fields) \
19 { { { name, sizeof(name) - 1 }, 0 }, 0, false, false, fields, 0, 0 }
153 static const rdata_info_t fields[] = { local
160 static const type_info_t rr = ENTRY("RR", FIELDS(fields));
243 static const rdata_info_t fields[] = { local
326 static const rdata_info_t fields[] = { FIELD("name") }; local
347 static const rdata_info_t fields[] = { FIELD("ttl") }; local
367 static const rdata_info_t fields[] = { FIELD("OWNER") }; local
    [all...]
  /src/external/gpl3/gdb.old/dist/sim/igen/
gen-icache.c 143 /* look through the set of expanded sub fields to see if this field
333 /* extract instruction fields */
416 /* pass one - process instruction fields.
429 /* Always expand named fields (even if constant), so
473 /* pass two - any cache fields not processed above */
504 filter *fields; member in struct:_form_fields
523 filter_add (&new_form->fields, insn->field_names);
530 filter_add (&(*form)->fields, insn->field_names);
584 (format->fields, cache_rule->original_fields))
603 /* define an entry for any fields not covered by a cache rule *
    [all...]

Completed in 27 milliseconds

1 2 3 4 5 6 7 8 91011>>