Cosmetic

src/excit.c

@@ -82,17 +82,17 @@ int excit_get_func_table(excit_t it, struct excit_func_table_s **func_table)
 
 /*--------------------------------------------------------------------*/
 
-#define ALLOC_EXCIT(op) {\
-	it = malloc(sizeof(struct excit_s) + sizeof(struct op## _it_s));\
-	if (!it)\
-		return NULL;\
-	it->data = (void *)((char *)it + sizeof(struct excit_s));\
-	if (!excit_ ##op## _func_table.alloc)\
-		goto error;\
-	it->func_table = &excit_ ##op## _func_table;\
-	it->dimension = 0;\
-	if (excit_ ##op## _func_table.alloc(it))\
-		goto error;\
+#define ALLOC_EXCIT(op) { \
+	it = malloc(sizeof(struct excit_s) + sizeof(struct op## _it_s)); \
+	if (!it) \
+		return NULL; \
+	it->data = (void *)((char *)it + sizeof(struct excit_s)); \
+	if (!excit_ ##op## _func_table.alloc) \
+		goto error; \
+	it->func_table = &excit_ ##op## _func_table; \
+	it->dimension = 0; \
+	if (excit_ ##op## _func_table.alloc(it)) \
+		goto error; \
 }
 
 excit_t excit_alloc(enum excit_type_e type)

src/excit.h

@@ -255,7 +255,7 @@ int excit_size(const excit_t it, ssize_t *size);
  * "it": an iterator.
  * "n": number of iterators desired.
  * "results": an array of at least n excit_t, or NULL in which case no iterator
- / *            is created.
+ *            is created.
  * Returns EXCIT_SUCCESS, -EXCIT_EDOM if the source iterator is too small to be
  * subdivised in the wanted number or an error code.
  */
@@ -406,14 +406,12 @@ int excit_product_split_dim(const excit_t it, ssize_t dim, ssize_t n,
  */
 int excit_slice_init(excit_t it, excit_t src, excit_t indexer);
 
-
 enum tleaf_it_policy_e {
   TLEAF_POLICY_ROUND_ROBIN, /* Iterate on tree leaves in a round-robin fashion */
   TLEAF_POLICY_SCATTER, /* Iterate on tree leaves such spreading as much as possible */
   TLEAF_POLICY_USER /* Policy is a user defined policy */
 };
 
-
 /*
  * Initialize a tleaf iterator by giving its depth, levels arity and iteration policy.
  * "it": a tleaf iterator