/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
H A D | trivial.C | 34 u32 var1; member in class:class1 45 class1::class1(u32 u, ul &l) : var1(u), ulref(l) 58 u32 var1; 69 class1::class1(u32 u, ul *l) : var1(u), ulref(*l)
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.dg/cpp/ |
H A D | macsyntx.c | 44 #define var1(x, ...) macro 54 var1() /* { dg-warning "rest arguments to be used" } */ 55 var1(ichi) /* { dg-warning "rest arguments to be used" } */ 56 var1(ichi, ni) /* OK. */
|
/openbsd-current/gnu/usr.bin/perl/ |
H A D | time64.c | 135 # define TIME64_TRACE1(format, var1) (fprintf(stderr, format, var1)) 136 # define TIME64_TRACE2(format, var1, var2) (fprintf(stderr, format, var1, var2)) 137 # define TIME64_TRACE3(format, var1, var2, var3) (fprintf(stderr, format, var1, var2, var3)) 140 # define TIME64_TRACE1(format, var1) ((void)0) 141 # define TIME64_TRACE2(format, var1, var2) ((void)0) 142 # define TIME64_TRACE3(format, var1, var2, var3) ((void)0)
|
/openbsd-current/gnu/gcc/gcc/ |
H A D | tree-ssa-copyrename.c | 113 copy_rename_partition_coalesce (var_map map, tree var1, tree var2, FILE *debug) argument 121 gcc_assert (TREE_CODE (var1) == SSA_NAME); 124 register_ssa_partition (map, var1, false); 127 p1 = partition_find (map->var_partition, SSA_NAME_VERSION (var1)); 133 print_generic_expr (debug, var1, TDF_SLIM);
|
H A D | tree-ssa-dse.c | 256 def_operand_p var1; local 265 FOR_EACH_SSA_MUST_AND_MAY_DEF_OPERAND (var1, var2, stmt, op_iter) 267 defvar = DEF_FROM_PTR (var1); 346 FOR_EACH_SSA_MUST_AND_MAY_DEF_OPERAND (var1, var2, stmt, op_iter) 348 single_imm_use (DEF_FROM_PTR (var1), &use_p, &temp);
|
H A D | var-tracking.c | 1310 variable_different_p (variable var1, variable var2, argument 1315 if (var1 == var2) 1318 if (var1->n_var_parts != var2->n_var_parts) 1321 for (i = 0; i < var1->n_var_parts; i++) 1323 if (var1->var_part[i].offset != var2->var_part[i].offset) 1327 if (!((REG_P (var1->var_part[i].cur_loc) 1329 && (REGNO (var1->var_part[i].cur_loc) 1331 || rtx_equal_p (var1->var_part[i].cur_loc, 1335 if (variable_part_different_p (&var1->var_part[i], &var2->var_part[i])) 1337 if (variable_part_different_p (&var2->var_part[i], &var1 1350 variable var1, var2; local 1382 variable var1, var2; local [all...] |
H A D | tree-ssa-live.c | 109 var_union (var_map map, tree var1, tree var2) argument 119 if (TREE_CODE (var1) == SSA_NAME) 120 p1 = partition_find (map->var_partition, SSA_NAME_VERSION (var1)); 123 p1 = var_to_partition (map, var1); 126 root_var = var1;
|
H A D | fold-const.c | 8887 tree var1, con1, lit1, minus_lit1; 8896 var1 = split_tree (arg1, code, &con1, &lit1, &minus_lit1, 8904 && var0 && var1) 8907 tree tmp1 = var1; 8922 && (2 < ((var0 != 0) + (var1 != 0) 8931 var0 = associate_trees (var0, var1, code, type); 8852 tree var1, con1, lit1, minus_lit1; local
|
/openbsd-current/gnu/usr.bin/perl/t/op/ |
H A D | tie_fetch_count.t | 181 tie my $var1 => 'main', \1; 182 $dummy = $$var1 ; check_count '${}'; 198 tie my $var1 => 'main', 1; 199 $dummy = $$var1 ; check_count 'symbolic ${}'; 200 $dummy = @$var1 ; check_count 'symbolic @{}'; 201 $dummy = %$var1 ; check_count 'symbolic %{}'; 202 $dummy = *$var1 ; check_count 'symbolic *{}'; 204 $dummy = &$var1 ; check_count 'symbolic &{}'; 325 tie $var1, "main", "a"; 326 substr$var1, [all...] |
H A D | taint.t | 2274 for my $var1 ($TAINT, "123") { 2277 is( tainted(sprintf '%s', $var1, $var2), tainted($var1), 2278 "sprintf '%s', '$var1', '$var2'" ); 2279 is( tainted(sprintf ' %s', $var1, $var2), tainted($var1), 2280 "sprintf ' %s', '$var1', '$var2'" ); 2281 is( tainted(sprintf '%s%s', $var1, $var2), 2282 tainted($var1) || tainted($var2), 2283 "sprintf '%s%s', '$var1', ' [all...] |
/openbsd-current/gnu/gcc/libdecnumber/ |
H A D | decNumber.c | 2666 /* Exp =Exp +len(var1) -len(var2) */ 2703 /* long subtractions. These are acc and var1 respectively. */ 2704 /* var1 is a copy of the lhs coefficient, var2 is the rhs coefficient.*/ 2721 Unit varbuff[D2U (DECBUFFER * 2 + DECDPUN) * sizeof (Unit)]; /* buffer for var1 */ 2722 Unit *var1 = varbuff; /* -> var1 array for long subtraction */ local 2729 Int var1initpad = 0; /* var1 initial padding (digits) */ 2942 /* var1 is the padded LHS ready for subtractions. */ 2944 /* The maximum units we need for var1 (long subtraction) is: */ 2968 var1 [all...] |
/openbsd-current/gnu/usr.bin/binutils/gdb/mi/ |
H A D | gdb-mi.el | 205 (dolist (var1 gdb-var-list) 206 (if (string-equal (cadr var1) (cadr varchild))
|
/openbsd-current/gnu/usr.bin/binutils/gdb/testsuite/gdb.stabs/ |
H A D | weird.exp | 79 print_weird_var var1
|
/openbsd-current/gnu/usr.bin/perl/cpan/ExtUtils-MakeMaker/lib/ExtUtils/ |
H A D | Mksymlists.pm | 223 DL_VARS => [ $var1, $var2, $var3 ],
|
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | fold-const.c | 5392 tree var1, con1, lit1, minus_lit1; 5400 var1 = split_tree (arg1, code, &con1, &lit1, &minus_lit1, 5405 if (2 < ((var0 != 0) + (var1 != 0) 5414 var0 = associate_trees (var0, var1, code, type); 5358 tree var1, con1, lit1, minus_lit1; local
|