-/* OpAssign tests\r
- */\r
-#include <testfwk.h>\r
-\r
-#ifdef SDCC\r
-#include <sdcc-lib.h>\r
-#else\r
-#define _STATMEM\r
-#endif\r
-\r
-typedef struct\r
-{\r
- char a;\r
- char n;\r
-} item_type;\r
-\r
-item_type t;\r
-\r
-\r
-_STATMEM item_type* get_next_item(void)\r
-{\r
- /* have a side effect */\r
- t.n++;\r
-\r
- /* keep things easy, not implementing a list.\r
- Using a true list would break things\r
- even more pointedly:\r
- a) reading beyond end of the list and\r
- b) intermixing list members */\r
- return &t;\r
-}\r
-\r
-\r
-void\r
-testOpAssign(void)\r
-{\r
- t.a = 0;\r
- t.n = 0;\r
-\r
- /* get_next_item() should be called only once */\r
- get_next_item()->a |= 42;\r
-\r
- ASSERT (t.a == 42);\r
- ASSERT (t.n == 1);\r
-}\r
+/* OpAssign tests
+ */
+#include <testfwk.h>
+
+#ifdef SDCC
+#include <sdcc-lib.h>
+#else
+#define _STATMEM
+#endif
+
+typedef struct
+{
+ char a;
+ char n;
+} item_type;
+
+item_type t;
+
+
+_STATMEM item_type* get_next_item(void)
+{
+ /* have a side effect */
+ t.n++;
+
+ /* keep things easy, not implementing a list.
+ Using a true list would break things
+ even more pointedly:
+ a) reading beyond end of the list and
+ b) intermixing list members */
+ return &t;
+}
+
+
+void
+testOpAssign(void)
+{
+ t.a = 0;
+ t.n = 0;
+
+ /* get_next_item() should be called only once */
+ get_next_item()->a |= 42;
+
+ ASSERT (t.a == 42);
+ ASSERT (t.n == 1);
+}