@@ -52,4 +52,4 @@ along with GCC; see the file COPYING3.
#else
# define INTPTR_TYPE (TARGET_64BIT ? "long long int" : "int")
# define UINTPTR_TYPE (TARGET_64BIT ? "long long unsigned int" : "unsigned int")
-#endif
\ No newline at end of file
+#endif
@@ -228,4 +228,4 @@ legitimize_pe_coff_symbol (rtx addr, boo
return NULL_RTX;
}
-#include "gt-winnt-dll.h"
\ No newline at end of file
+#include "gt-winnt-dll.h"
@@ -329,4 +329,4 @@ class bit_complement_expression : public
void print ();
};
-#endif /* SYM_EXEC_EXPRESSION_H. */
\ No newline at end of file
+#endif /* SYM_EXEC_EXPRESSION_H. */
@@ -487,4 +487,4 @@ bit_complement_expression::print ()
else
fprintf (dump_file, "null");
}
-}
\ No newline at end of file
+}
@@ -83,4 +83,4 @@ bit_condition::print_expr_sign ()
default:
fprintf (dump_file, " ? ");
}
-}
\ No newline at end of file
+}
@@ -284,4 +284,4 @@ is_a_helper<bit_condition *>::test (bit_
return ptr->get_type () == value_type::BIT_CONDITION;
}
-#endif /* SYM_EXEC_EXPRESSION_IS_A_HELPER_H. */
\ No newline at end of file
+#endif /* SYM_EXEC_EXPRESSION_IS_A_HELPER_H. */
@@ -60,4 +60,4 @@ class bit_condition : public bit_express
value_bit *copy () const;
};
-#endif /* SYM_EXEC_CONDITION_H. */
\ No newline at end of file
+#endif /* SYM_EXEC_CONDITION_H. */
@@ -65,4 +65,4 @@ int main ()
return 0;
}
__builtin_abort (); // authentication of the return address is not required.
-}
\ No newline at end of file
+}
@@ -35,4 +35,4 @@ int main (int argc, char** argv) {
}
}
return 1;
-}
\ No newline at end of file
+}
@@ -141,4 +141,4 @@ __attribute__ ((noinline)) __attribute__
default:
return "Default";
}
-}
\ No newline at end of file
+}
@@ -8,4 +8,4 @@ vuint64m1_t test_vssubu_vx_u64m1(vuint64
return __riscv_vssubu_vx_u64m1(op1,0,0);
}
-/* { dg-final { scan-assembler-not {\tvssubu} } } */
\ No newline at end of file
+/* { dg-final { scan-assembler-not {\tvssubu} } } */
@@ -8,4 +8,4 @@ vuint64m1_t test_vssubu_vx_u64m1(vuint64
return __riscv_vssubu_vx_u64m1(op1,0,0);
}
-/* { dg-final { scan-assembler-not {\tvssubu} } } */
\ No newline at end of file
+/* { dg-final { scan-assembler-not {\tvssubu} } } */
@@ -10,4 +10,4 @@ int foo(int a)
/* { dg-final { scan-assembler-times "\\sandi\\s" 1 } } */
/* { dg-final { scan-assembler-times "\\sslli\\s" 1 } } */
/* { dg-final { scan-assembler-not "\\sli\\s" } } */
-/* { dg-final { scan-assembler-not "\\saddi\\s" } } */
\ No newline at end of file
+/* { dg-final { scan-assembler-not "\\saddi\\s" } } */
@@ -18,4 +18,4 @@ int16_t crc16_data16 ()
return __builtin_crc16_data16 (0x1234, 0x3214, 0x1021);
}
-/* { dg-final { scan-assembler-times "clmul\t" 6 } } */
\ No newline at end of file
+/* { dg-final { scan-assembler-times "clmul\t" 6 } } */
@@ -10,4 +10,4 @@ long long foo(long long a)
/* { dg-final { scan-assembler-times "\\sandi\\s" 1 } } */
/* { dg-final { scan-assembler-times "\\sslli\\s" 1 } } */
/* { dg-final { scan-assembler-not "\\sli\\s" } } */
-/* { dg-final { scan-assembler-not "\\saddi\\s" } } */
\ No newline at end of file
+/* { dg-final { scan-assembler-not "\\saddi\\s" } } */
@@ -14,4 +14,4 @@ void g()
d.f = e[2] >> (b << ~4194303 + 4194332) - 58096371;
}
-/* { dg-final { scan-assembler-not {th.extu\t[ax][0-9]+,[ax][0-9]+,37,13} } } */
\ No newline at end of file
+/* { dg-final { scan-assembler-not {th.extu\t[ax][0-9]+,[ax][0-9]+,37,13} } } */
@@ -82,4 +82,4 @@ do_test (void)
/* { dg-final { scan-tree-dump-times "loop vectorized using 16 byte vectors" 2 "vect" } } */
/* { dg-final { scan-tree-dump-times "loop vectorized using 32 byte vectors" 2 "vect" } } */
-/* { dg-final { scan-tree-dump-times {(?n)ABS_EXPR <vect} 2 "optimized" { target { ! ia32 } } } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times {(?n)ABS_EXPR <vect} 2 "optimized" { target { ! ia32 } } } } */
@@ -63,4 +63,4 @@ do_test (void)
}
/* { dg-final { scan-tree-dump-times "loop vectorized using 64 byte vectors" 2 "vect" } } */
-/* { dg-final { scan-tree-dump-times {(?n)ABS_EXPR <vect} 1 "optimized" { target { ! ia32 } } } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times {(?n)ABS_EXPR <vect} 1 "optimized" { target { ! ia32 } } } } */
@@ -8,4 +8,4 @@ int main()
}
/* { dg-final { scan-assembler {\.arch armv8.6-a\+rng\+sm4\+crc\+aes\+sha3\+fp16} } } */
-/* Test that SoC with cores of 3 variants work. */
\ No newline at end of file
+/* Test that SoC with cores of 3 variants work. */
@@ -23,4 +23,4 @@ CPU implementer : 0x51
CPU architecture: 8
CPU variant : 0x2
CPU part : 0x001
-CPU revision : 1
\ No newline at end of file
+CPU revision : 1
@@ -14,4 +14,4 @@ CPU implementer : 0x51
CPU architecture: 8
CPU variant : 0x1
CPU part : 0x001
-CPU revision : 1
\ No newline at end of file
+CPU revision : 1
@@ -3,4 +3,4 @@ struct a {
__attribute__((no_sanitize("")))
int f(int) [[pre:true]];
};
-int a::f(int) { return 0; }
\ No newline at end of file
+int a::f(int) { return 0; }
@@ -40,4 +40,4 @@ contains
ref4 = single%var ! Warnings in contained scope
end
end
-! { df-final { scan-tree-dump-times "ubound = 0" 3 "original" } }
\ No newline at end of file
+! { df-final { scan-tree-dump-times "ubound = 0" 3 "original" } }
@@ -17,4 +17,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -23,4 +23,4 @@ int main ()
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -22,4 +22,4 @@ uint16_t not_crcu8 (uint8_t *data, uint1
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -32,4 +32,4 @@ void crc_calculator_init_table(CRC_CALCU
}
p_crc_calculator->table[value] = remainder;
}
-}
\ No newline at end of file
+}
@@ -23,4 +23,4 @@ uint16_t crc16_mcrf4xx(uint16_t crc, uin
return crc;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -28,4 +28,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return a;
}
-/* { dg-final { scan-tree-dump "Output CRC and determined input CRC differ." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Output CRC and determined input CRC differ." "crc" } } */
@@ -24,4 +24,4 @@ uint16_t crc16_update (uint16_t crc, uin
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
@@ -23,4 +23,4 @@ uint16_t crc16_update(uint16_t crc, uint
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
@@ -24,4 +24,4 @@ uint16_t crc16_update(uint16_t crc, uint
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
@@ -15,4 +15,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -15,4 +15,4 @@ uint16_t crc(uint8_t byte, uint16_t reg)
}
return reg & 0xFFFF;
}
-/* { dg-final { scan-tree-dump "maybe contains CRC calculation." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "maybe contains CRC calculation." "crc" } } */
@@ -30,4 +30,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -35,4 +35,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -15,4 +15,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -18,4 +18,4 @@ void GenerateCRC32Table (u32 polynomial,
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -15,4 +15,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -46,4 +46,4 @@ u32 __attribute_const__ crc32_generic_sh
}
return crc;
-}
\ No newline at end of file
+}
@@ -20,4 +20,4 @@ void XS_Digest__CRC__crc64() {
}
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -20,4 +20,4 @@ int bar(int *a, int j)
return (&a[j + 1] - 2) == &a[k];
}
-/* { dg-final { scan-tree-dump-times "return 1;" 3 "optimized" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "return 1;" 3 "optimized" } } */
@@ -37,4 +37,4 @@ int main()
/* { dg-final { scan-tree-dump "crcu8 function maybe contains CRC calculation." "crc" } } */
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -23,4 +23,4 @@ uint16_t crc16_update(uint16_t crc, uint
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
@@ -29,4 +29,4 @@
TEST(double, ldexp, 8.0, double_ldexp)
TEST(float, ldexpf, 8.0f, float_ldexp)
-TEST(long double, ldexpl, 8.0L, long_ldexp)
\ No newline at end of file
+TEST(long double, ldexpl, 8.0L, long_ldexp)
@@ -17,4 +17,4 @@ no_nlz32 (int b) {
return c;
}
-/* { dg-final { scan-tree-dump-not "__builtin_ctz|\\.CLZ" "optimized" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-not "__builtin_ctz|\\.CLZ" "optimized" } } */
@@ -66,4 +66,4 @@ nlz32_2 (unsigned int b) {
}
/* { dg-final { scan-tree-dump-times "__builtin_ctz|\\.CTZ" 3 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "__builtin_clz|\\.CLZ" 2 "optimized" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "__builtin_clz|\\.CLZ" 2 "optimized" } } */
@@ -34,4 +34,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -28,4 +28,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc;
}
-/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
@@ -22,4 +22,4 @@ uint16_t not_crcu8 (uint8_t data, uint16
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -33,4 +33,4 @@ int main()
printf ("%d", a);
}
-/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
@@ -22,4 +22,4 @@ uint16_t not_crcu8 (uint8_t data, uint16
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -15,4 +15,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -23,4 +23,4 @@ void crcByteSchritt(unsigned char data)
}
crcReg &= 0xFF;
-}
\ No newline at end of file
+}
@@ -13,4 +13,4 @@ crc8(unsigned char value)
return value;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -28,4 +28,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return a + crc;
}
-/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
@@ -50,4 +50,4 @@ u32 crc32_generic_shift(u32 crc, size_t
}
/* { dg-final { scan-tree-dump "Loop iteration number isn't a constant." "crc" } } */
-/* { dg-final { scan-tree-dump "Loop iteration number is 30" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Loop iteration number is 30" "crc" } } */
@@ -22,4 +22,4 @@ uint16_t not_crcu8 (uint8_t data, uint16
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -34,4 +34,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc + c;
}
-/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
@@ -27,4 +27,4 @@ u32 calc_crc(unsigned char *buf, int len
}
return ~reg;
-}
\ No newline at end of file
+}
@@ -32,4 +32,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -15,4 +15,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -24,4 +24,4 @@ uint16_t ModbusCrc(const uint8_t *data,
return crc;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -22,4 +22,4 @@ uint16_t not_crcu8 (uint8_t data, uint16
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -62,4 +62,4 @@ u8 i2c_smbus_msg_pec(u8 pec, struct i2c_
return i2c_smbus_pec(pec, msg->buf, msg->len);
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -24,4 +24,4 @@ int CRC16_Init(int16u *Table, int16u Pol
return 0;
}
-/* { dg-final { scan-tree-dump "Second operand of the xor statement isn't an integer constant.\n" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Second operand of the xor statement isn't an integer constant.\n" "crc" } } */
@@ -28,4 +28,4 @@ void init_crc(void)
crctab[i] = accum;
}
}
-/* { dg-final { scan-tree-dump "maybe contains CRC calculation." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "maybe contains CRC calculation." "crc" } } */
@@ -17,4 +17,4 @@ uint16_t crc16(uint16_t crc, uint8_t a,
return crc;
}
-/* { dg-final { scan-tree-dump "Second operand of the xor statement isn't an integer constant.\n" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Second operand of the xor statement isn't an integer constant.\n" "crc" } } */
@@ -24,4 +24,4 @@ uint32_t crc32_le ( uint32_t crc, const
}
}
return crc;
-}
\ No newline at end of file
+}
@@ -25,4 +25,4 @@ unsigned int crc16 (unsigned int crcValu
/* { dg-final { scan-tree-dump "function maybe contains CRC calculation." "crc" } } */
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit forward" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{\[0, \]*1, 0, 0, 0, 0, 0, 0, 1, 0\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{\[0, \]*1, 0, 0, 0, 0, 0, 0, 1, 0\\\}" "crc" } } */
@@ -27,4 +27,4 @@ uint16_t not_crcu8 (uint16_t data, uint1
crc &= 0x7fff;
}
return crc;
-}
\ No newline at end of file
+}
@@ -46,4 +46,4 @@ int main ()
/* { dg-final { scan-tree-dump "function maybe contains CRC calculation." "crc" } } */
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit forward" "crc" } } */
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -48,4 +48,4 @@ int main ()
}
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump-times "Couldn't generate faster CRC code." 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "Couldn't generate faster CRC code." 0 "crc" } } */
@@ -37,4 +37,4 @@ int receive(/*int read_fd, */int file_fd
/* ... */
return -1;
-}
\ No newline at end of file
+}
@@ -49,4 +49,4 @@ int main ()
/* { dg-final { scan-tree-dump "Loop iteration number is 63" "crc" } } */
/* { dg-final { scan-tree-dump "Bit forward" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump-times "Couldn't generate faster CRC code." 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "Couldn't generate faster CRC code." 0 "crc" } } */
@@ -34,4 +34,4 @@ char calculateCRC8_(char* input, int len
return crc;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -39,4 +39,4 @@ int main()
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{\[0, \]*1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{\[0, \]*1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
@@ -23,4 +23,4 @@ uint16_t crc16_update(uint16_t crc, uint
/* { dg-final { scan-tree-dump "Loop iteration number is 7" "crc" } } */
/* { dg-final { scan-tree-dump "Bit reversed" "crc" } } */
/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
-/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "Polynomial's value is \\\{1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1\\\}" "crc" } } */
@@ -28,4 +28,4 @@ ee_u16 crcu8 (ee_u8 data, ee_u16 crc) {
return crc;
}
-/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "There is more than one output phi." "crc" } } */
@@ -20,4 +20,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -17,4 +17,4 @@ uint8_t not_crc(uint8_t crc, uint8_t dat
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -37,4 +37,4 @@ void make_crc_table (mng_datap pData)
pData->bCRCcomputed = 1;
}
-/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump "calculates CRC!" "crc" } } */
@@ -22,4 +22,4 @@ uint16_t not_crcu8 (uint8_t data, uint16
return crc;
}
-/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
\ No newline at end of file
+/* { dg-final { scan-tree-dump-times "calculates CRC!" 0 "crc" } } */
@@ -205,4 +205,4 @@ reflect_hwi (unsigned HOST_WIDE_INT valu
value >>= 1;
}
return reflected_value;
-}
\ No newline at end of file
+}
@@ -1296,4 +1296,4 @@ all_states_match_lfsr (value *lfsr, bool
return false;
return true;
-}
\ No newline at end of file
+}
@@ -493,4 +493,4 @@ static const struct ref_anchor
{ "5.1", "_Toc141791171" },
{ "5.5", "_Toc141791175" },
{ "5.8", "_Toc141791178" },
-};
\ No newline at end of file
+};