Home
last modified time | relevance | path

Searched refs:n_fields (Results 1 – 4 of 4) sorted by relevance

/openbsd-src/gnu/llvm/clang/utils/VtableTest/
H A Dgen.cc138 int n_fields = N_FIELDS == 0 ? 0 : random() % (N_FIELDS*4); in gs() local
140 if (n_fields >= N_FIELDS) in gs()
141 n_fields = 0; in gs()
142 for (int i = 0; i < n_fields; ++i) { in gs()
288 for (int i = 0; i < n_fields; ++i) { in gs()
291 if (n_fields == 0) { in gs()
/openbsd-src/gnu/usr.bin/perl/ext/Hash-Util-FieldHash/t/
H A D02_function.t224 my $n_fields = 1000;
225 my @fields = map {}, $n_fields;
233 is( $err, 0, "$n_obs entries in $n_fields fields");
237 is( $err, 0, "one entry gone from $n_fields fields");
241 is( $err, 0, "all entries gone from $n_fields fields");
/openbsd-src/gnu/gcc/gcc/cp/
H A Dclass.c2615 int n_fields = 0; in count_fields() local
2619 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x))); in count_fields()
2621 n_fields += 1; in count_fields()
2623 return n_fields; in count_fields()
4975 int n_fields = 0; in finish_struct_1() local
5093 n_fields = count_fields (TYPE_FIELDS (t)); in finish_struct_1()
5094 if (n_fields > 7) in finish_struct_1()
5098 sizeof (struct sorted_fields_type) + n_fields * sizeof (tree)); in finish_struct_1()
5099 field_vec->len = n_fields; in finish_struct_1()
5101 qsort (field_vec->elts, n_fields, sizeof (tree), in finish_struct_1()
/openbsd-src/gnu/usr.bin/gcc/gcc/cp/
H A Dclass.c2918 int n_fields = 0; local
2922 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
2924 n_fields += 1;
2926 return n_fields;
5295 int n_fields = 0; local
5423 n_fields = count_fields (TYPE_FIELDS (t));
5424 if (n_fields > 7)
5426 tree field_vec = make_tree_vec (n_fields);
5428 qsort (&TREE_VEC_ELT (field_vec, 0), n_fields, sizeof (tree),