Lines Matching refs:a
5 # You may obtain a copy of the License at
45 .param p0, "a" # I
49 # return ~a & ~b;
87 .param p0, "a" # Z
91 # return !a & !b;
123 .param p0, "a" # J
127 # return ~a | ~b;
164 .param p0, "a" # Z
168 # return !a | !b;
177 # This is a regression test. The initial logic was inserting the new bitwise
209 .param p0, "a" # I
213 # int a1 = a + 1;
248 .param p0, "a" # I
252 # return ~a ^ ~b;
284 .param p0, "a" # Z
288 # return !a ^ !b;
323 .param p0, "a" # I
329 # return (tmp & 0x1) + (~a & tmp);
367 # public static int $opt$noinline$andToOr(int a, int b) {
368 # return ~a & ~b;
373 .param p0, "a" # I
420 # public static boolean $opt$noinline$booleanAndToOr(boolean a, boolean b) {
421 # return !a & !b;
426 .param p0, "a" # Z
488 # public static long $opt$noinline$orToAnd(long a, long b) {
489 # return ~a | ~b;
494 .param p0, "a" # J
542 # public static boolean $opt$noinline$booleanOrToAnd(boolean a, boolean b) {
543 # return !a | !b;
548 .param p0, "a" # Z
583 # This is a regression test. The initial logic was inserting the new bitwise
617 # public static int $opt$noinline$regressInputsAway(int a, int b) {
618 # int a1 = a + 1;
627 .param p0, "a" # I
677 # public static int $opt$noinline$notXorToXor(int a, int b) {
678 # return ~a ^ ~b;
683 .param p0, "a" # I
725 # public static boolean $opt$noinline$booleanNotXorToXor(boolean a, boolean b) {
726 # return !a ^ !b;
731 .param p0, "a" # Z
794 # public static int $opt$noinline$notMultipleUses(int a, int b) {
796 # return (tmp & 0x1) + (~a & tmp);
801 .param p0, "a" # I