B                 170 common/gcc-millicode/qdivrem.c 	for (t = v[1]; t < B / 2; t <<= 1)
B                 197 common/gcc-millicode/qdivrem.c 			qhat = B;
B                 208 common/gcc-millicode/qdivrem.c 			if ((rhat += v1) >= B)
B                 220 common/gcc-millicode/qdivrem.c 			t = (B - HHALF(t)) & (B - 1);
B                  58 user/testbin/matmult/matmult-orig.c int B[Dim][Dim];
B                  69 user/testbin/matmult/matmult-orig.c 	     B[i][j] = j;
B                  76 user/testbin/matmult/matmult-orig.c 		 C[i][j] += A[i][k] * B[k][j];
B                  52 user/testbin/matmult/matmult.c int B[Dim][Dim];
B                  64 user/testbin/matmult/matmult.c 	     B[i][j] = j;
B                  71 user/testbin/matmult/matmult.c 		T[i][j][k] = A[i][k] * B[k][j];