fix code to follow coding conventions for braces

examples/mlr/mlr.c

@@ -33,7 +33,7 @@
    where M, N, K are the parameters of the task, exponents are coming
    from model->combinations[..][..]  and finally a, b, c are
    coefficients which mostly depend on the machine speed.
-   
+
    These coefficients are going to be automatically computed using
    least square method.
 
@@ -65,7 +65,7 @@ void cpu_func(void *buffers[], void *cl_arg)
 			     	  &m,
      			     	  &n,
      			     	  &k);
-	
+
 	for(i=0; i < (long) (m*m*n); i++)
 		sum+=i;
 
@@ -85,7 +85,8 @@ void cpu_func(void *buffers[], void *cl_arg)
 
 static const char * parameters_names[]	= {	"M",	"N",	"K", };
 
-static struct starpu_perfmodel cl_model_init = {
+static struct starpu_perfmodel cl_model_init =
+{
 	.type = STARPU_MULTIPLE_REGRESSION_BASED,
 	.symbol = "mlr_init",
 	.parameters = cl_params,
@@ -104,7 +105,8 @@ static unsigned combi2 [3]		= {	0,	3,	1 };
 
 static unsigned *combinations[] = { combi1, combi2 };
 
-static struct starpu_perfmodel cl_model_final = {
+static struct starpu_perfmodel cl_model_final =
+{
 	.type = STARPU_MULTIPLE_REGRESSION_BASED,
 	.symbol = "mlr_final",
 	.parameters = cl_params,
@@ -117,14 +119,16 @@ static struct starpu_perfmodel cl_model_final = {
 /* End of the part specific to multiple linear regression perfmodels */
 /* ############################################ */
 
-static struct starpu_codelet cl_init = {
+static struct starpu_codelet cl_init =
+{
 	.cpu_funcs = { cpu_func },
 	.cpu_funcs_name = { "cpu_func" },
 	.nbuffers = 0,
 	.model = &cl_model_init,
 };
 
-static struct starpu_codelet cl_final = {
+static struct starpu_codelet cl_final =
+{
 	.cpu_funcs = { cpu_func },
 	.cpu_funcs_name = { "cpu_func" },
 	.nbuffers = 0,
@@ -140,7 +144,7 @@ int main(int argc, char **argv)
 	ret = starpu_init(NULL);
 	if (ret == -ENODEV)
 		return 77;
-	
+
 	sum=0;
 	int m,n,k;
 
@@ -150,7 +154,7 @@ int main(int argc, char **argv)
 		m = (int) ((rand() % 10)+1);
 		n = (int) ((rand() % 10)+1);
 		k = (int) ((rand() % 10)+1);
-		
+
 		for(j=0; j < 42; j++)
 		{
 			starpu_insert_task(&cl_init,
@@ -165,7 +169,7 @@ int main(int argc, char **argv)
 				   0);
 		}
 	}
-			  
+
 	starpu_shutdown();
 
 	return 0;

examples/sched_ctx/axpy_partition_gpu.h

@@ -22,7 +22,8 @@
 #pragma once
 
 
-__device__ static uint get_smid(void) {
+__device__ static uint get_smid(void)
+{
 #if defined(__CUDACC__)
   uint ret;
   asm("mov.u32 %0, %smid;" : "=r"(ret) );
@@ -50,7 +51,7 @@ __syncthreads();							\
 if(block_start > active_blocks)						\
   {									\
     return;								\
-  }									
+  }
 
 #define __P_LOOPXY							\
   dim3 blockid;								\

examples/scheduler/heteroprio_test.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2015  INRIA
- * Copyright (C) 2016  CNRS
+ * Copyright (C) 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -173,11 +173,13 @@ int main(int argc, char** argv)
 	memset(handles, 0, sizeof(handles[0])*nbHandles);
 	int dataA[nbHandles];
 	int idx;
-	for(idx = 0; idx < nbHandles; ++idx){
+	for(idx = 0; idx < nbHandles; ++idx)
+	{
 		dataA[idx] = idx;
 	}
 	int idxHandle;
-	for(idxHandle = 0; idxHandle < nbHandles; ++idxHandle){
+	for(idxHandle = 0; idxHandle < nbHandles; ++idxHandle)
+	{
 		starpu_variable_data_register(&handles[idxHandle], 0, (uintptr_t)&dataA[idxHandle], sizeof(dataA[idxHandle]));
 	}
 

examples/spmv/dw_block_spmv_kernels.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2009, 2010-2011, 2015, 2017  Université de Bordeaux
- * Copyright (C) 2010, 2011  CNRS
+ * Copyright (C) 2010, 2011, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -48,7 +48,8 @@ static inline void common_block_spmv(void *descr[], int s, STARPU_ATTRIBUTE_UNUS
 			cblas_sgemv(CblasRowMajor, CblasNoTrans, dx, dy, 1.0f, block, ld, in, 1, 1.0f, out, 1);
 			break;
 #ifdef STARPU_USE_CUDA
-		case 1: {
+		case 1:
+		{
 			cublasStatus_t status = cublasSgemv (starpu_cublas_get_local_handle(),
 					CUBLAS_OP_T, dx, dy, &p1, block, ld, in, 1, &p1, out, 1);
 			if (status != CUBLAS_STATUS_SUCCESS)

examples/stencil/stencil-tasks.c

@@ -151,7 +151,8 @@ void create_task_save(unsigned iter, unsigned z, int dir, int local_rank)
 
 	}
 	else
-	{	/* node_z != local_rank, this MPI node doesn't have the saved data */
+	{
+		/* node_z != local_rank, this MPI node doesn't have the saved data */
 		if (node_z_and_d == local_rank)
 		{
 			create_task_save_mpi_recv(iter, z, dir, local_rank);

mpi/examples/matrix_mult/mm.c

@@ -93,7 +93,8 @@ static void disp_matrix(double *m)
 }
 #endif
 
-static void check_result(void) {
+static void check_result(void)
+{
 	int row,col;
 	for (row = 0; row < N; row++)
 	{
@@ -131,7 +132,8 @@ static void register_matrices()
 
 	int b_row,b_col;
 
-	for (b_row = 0; b_row < NB; b_row++) {
+	for (b_row = 0; b_row < NB; b_row++)
+	{
 		/* Register a block to StarPU */
 		starpu_matrix_data_register(&A_h[b_row],
 				mr,
@@ -148,7 +150,8 @@ static void register_matrices()
 		starpu_mpi_data_register(A_h[b_row], tag++, 0);
 	}
 
-	for (b_col = 0; b_col < NB; b_col++) {
+	for (b_col = 0; b_col < NB; b_col++)
+	{
 		starpu_matrix_data_register(&B_h[b_col],
 				mr,
 				(comm_rank == 0)?(uintptr_t)(B+b_col*BS):0, N, BS, N,
@@ -157,8 +160,10 @@ static void register_matrices()
 		starpu_mpi_data_register(B_h[b_col], tag++, 0);
 	}
 
-	for (b_row = 0; b_row < NB; b_row++) {
-		for (b_col = 0; b_col < NB; b_col++) {
+	for (b_row = 0; b_row < NB; b_row++)
+	{
+		for (b_col = 0; b_col < NB; b_col++)
+		{
 			starpu_matrix_data_register(&C_h[b_row*NB+b_col],
 					mr,
 					(comm_rank == 0)?(uintptr_t)(C+b_row*BS*N+b_col*BS):0, N, BS, BS,
@@ -194,8 +199,10 @@ static void distribute_matrix_C(void)
 static void undistribute_matrix_C(void)
 {
 	int b_row,b_col;
-	for (b_row = 0; b_row < NB; b_row++) {
-		for (b_col = 0; b_col < NB; b_col++) {
+	for (b_row = 0; b_row < NB; b_row++)
+	{
+		for (b_col = 0; b_col < NB; b_col++)
+		{
 			starpu_data_handle_t h = C_h[b_row*NB+b_col]; 
 			starpu_mpi_data_migrate(MPI_COMM_WORLD, h, 0);
 		}
@@ -207,16 +214,20 @@ static void unregister_matrices()
 {
 	int b_row,b_col;
 
-	for (b_row = 0; b_row < NB; b_row++) {
+	for (b_row = 0; b_row < NB; b_row++)
+	{
 		starpu_data_unregister(A_h[b_row]);
 	}
 
-	for (b_col = 0; b_col < NB; b_col++) {
+	for (b_col = 0; b_col < NB; b_col++)
+	{
 		starpu_data_unregister(B_h[b_col]);
 	}
 
-	for (b_row = 0; b_row < NB; b_row++) {
-		for (b_col = 0; b_col < NB; b_col++) {
+	for (b_row = 0; b_row < NB; b_row++)
+	{
+		for (b_col = 0; b_col < NB; b_col++)
+		{
 			starpu_data_unregister(C_h[b_row*NB+b_col]);
 		}
 	}
@@ -252,9 +263,12 @@ static void cpu_mult(void *handles[], STARPU_ATTRIBUTE_UNUSED void *arg)
 	assert(n_col_A == n_row_B);
 
 	unsigned i,j,k;
-	for (k = 0; k < n_row_C; k++) {
-		for (j = 0; j < n_col_C; j++) {
-			for (i = 0; i < n_col_A; i++) {
+	for (k = 0; k < n_row_C; k++)
+	{
+		for (j = 0; j < n_col_C; j++)
+		{
+			for (i = 0; i < n_col_A; i++)
+			{
 				block_C[k*ld_C+j] += block_A[k*ld_A+i] * block_B[i*ld_B+j]; 
 			}
 
@@ -296,16 +310,20 @@ int main(int argc, char *argv[])
 	}
 
 	/* Parse the matrix size and block size optional args */
-	if (argc > 1) {
+	if (argc > 1)
+	{
 		N = atoi(argv[1]);
-		if (N < 1) {
+		if (N < 1)
+		{
 			fprintf(stderr, "invalid matrix size\n");
 			exit(1);
 		}
-		if (argc > 2) {
+		if (argc > 2)
+		{
 			BS = atoi(argv[2]);
 		}
-		if (BS < 1 || N % BS != 0) {
+		if (BS < 1 || N % BS != 0)
+		{
 			fprintf(stderr, "invalid block size\n");
 			exit(1);
 		}
@@ -356,7 +374,8 @@ int main(int argc, char *argv[])
 	undistribute_matrix_C();
 	unregister_matrices();
 
-	if (comm_rank == 0) {
+	if (comm_rank == 0)
+	{
 #if VERBOSE
 		disp_matrix(C);
 #endif

mpi/examples/mpi_lu/plu_example.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010-2011, 2013, 2015, 2017  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012, 2013, 2016  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2013, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -70,26 +70,32 @@ static TYPE **(tmp_21_block[2]);
 static void parse_args(int rank, int argc, char **argv)
 {
 	int i;
-	for (i = 1; i < argc; i++) {
-		if (strcmp(argv[i], "-size") == 0) {
+	for (i = 1; i < argc; i++)
+	{
+		if (strcmp(argv[i], "-size") == 0)
+		{
 			char *argptr;
 			size = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-nblocks") == 0) {
+		if (strcmp(argv[i], "-nblocks") == 0)
+		{
 			char *argptr;
 			nblocks = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-check") == 0) {
+		if (strcmp(argv[i], "-check") == 0)
+		{
 			check = 1;
 		}
 
-		if (strcmp(argv[i], "-display") == 0) {
+		if (strcmp(argv[i], "-display") == 0)
+		{
 			display = 1;
 		}
 
-		if (strcmp(argv[i], "-numa") == 0) {
+		if (strcmp(argv[i], "-numa") == 0)
+		{
 #ifdef STARPU_HAVE_LIBNUMA
 			numa = 1;
 #else
@@ -98,17 +104,20 @@ static void parse_args(int rank, int argc, char **argv)
 #endif
 		}
 
-		if (strcmp(argv[i], "-p") == 0) {
+		if (strcmp(argv[i], "-p") == 0)
+		{
 			char *argptr;
 			p = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-q") == 0) {
+		if (strcmp(argv[i], "-q") == 0)
+		{
 			char *argptr;
 			q = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0) {
+		if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0)
+		{
 			fprintf(stderr,"usage: %s [-size n] [-nblocks b] [-check] [-display] [-numa] [-p p] [-q q]\n", argv[0]);
 			fprintf(stderr,"\np * q must be equal to the number of MPI nodes\n");
 			exit(0);
@@ -251,7 +260,8 @@ static void init_matrix(int rank)
 					size/nblocks, size/nblocks, sizeof(TYPE));
 				starpu_data_set_coordinates(*handleptr, 2, j, i);
 			}
-			else {
+			else
+			{
 				*blockptr = STARPU_POISON_PTR;
 				*handleptr = STARPU_POISON_PTR;
 			}
@@ -297,7 +307,8 @@ static void init_matrix(int rank)
 
 	allocated_memory_extra += 2*nblocks*(sizeof(starpu_data_handle_t) + sizeof(TYPE *));
 #else
-	for (i = 0; i < 2; i++) {
+	for (i = 0; i < 2; i++)
+	{
 		tmp_12_block_handles[i] = calloc(nblocks, sizeof(starpu_data_handle_t));
 		tmp_21_block_handles[i] = calloc(nblocks, sizeof(starpu_data_handle_t));
 		tmp_12_block[i] = calloc(nblocks, sizeof(TYPE *));
@@ -332,7 +343,8 @@ static void init_matrix(int rank)
 				size/nblocks, size/nblocks, size/nblocks, sizeof(TYPE));
 		}
 #else
-	for (i = 0; i < 2; i++) {
+	for (i = 0; i < 2; i++)
+	{
 		if (tmp_12_block_is_needed(rank, nblocks, k))
 		{
 			starpu_malloc((void **)&tmp_12_block[i][k], blocksize);
@@ -411,7 +423,8 @@ int main(int argc, char **argv)
 	 *	Initialization
 	 */
 	int thread_support;
-	if (MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &thread_support) != MPI_SUCCESS) {
+	if (MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &thread_support) != MPI_SUCCESS)
+	{
 		fprintf(stderr,"MPI_Init_thread failed\n");
 		exit(1);
 	}

mpi/examples/mpi_lu/plu_implicit_example.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010-2011, 2013, 2017  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2016  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -51,26 +51,32 @@ int get_block_rank(unsigned i, unsigned j);
 static void parse_args(int argc, char **argv)
 {
 	int i;
-	for (i = 1; i < argc; i++) {
-		if (strcmp(argv[i], "-size") == 0) {
+	for (i = 1; i < argc; i++)
+	{
+		if (strcmp(argv[i], "-size") == 0)
+		{
 			char *argptr;
 			size = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-nblocks") == 0) {
+		if (strcmp(argv[i], "-nblocks") == 0)
+		{
 			char *argptr;
 			nblocks = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-check") == 0) {
+		if (strcmp(argv[i], "-check") == 0)
+		{
 			check = 1;
 		}
 
-		if (strcmp(argv[i], "-display") == 0) {
+		if (strcmp(argv[i], "-display") == 0)
+		{
 			display = 1;
 		}
 
-		if (strcmp(argv[i], "-numa") == 0) {
+		if (strcmp(argv[i], "-numa") == 0)
+		{
 #ifdef STARPU_HAVE_LIBNUMA
 			numa = 1;
 #else
@@ -78,17 +84,20 @@ static void parse_args(int argc, char **argv)
 #endif
 		}
 
-		if (strcmp(argv[i], "-p") == 0) {
+		if (strcmp(argv[i], "-p") == 0)
+		{
 			char *argptr;
 			p = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-q") == 0) {
+		if (strcmp(argv[i], "-q") == 0)
+		{
 			char *argptr;
 			q = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0) {
+		if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0)
+		{
 			fprintf(stderr,"usage: %s [-size n] [-nblocks b] [-check] [-display] [-numa] [-p p] [-q q]\n", argv[0]);
 			fprintf(stderr,"\np * q must be equal to the number of MPI nodes\n");
 			exit(0);
@@ -168,7 +177,8 @@ static void init_matrix(int rank)
 					(uintptr_t)*blockptr, size/nblocks,
 					size/nblocks, size/nblocks, sizeof(TYPE));
 			}
-			else {
+			else
+			{
 				starpu_matrix_data_register(handleptr, -1,
 					0, size/nblocks,
 					size/nblocks, size/nblocks, sizeof(TYPE));

mpi/examples/mpi_lu/plu_outofcore_example.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010-2011, 2013-2014, 2017  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2016  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -53,26 +53,32 @@ int get_block_rank(unsigned i, unsigned j);
 static void parse_args(int argc, char **argv)
 {
 	int i;
-	for (i = 1; i < argc; i++) {
-		if (strcmp(argv[i], "-size") == 0) {
+	for (i = 1; i < argc; i++)
+	{
+		if (strcmp(argv[i], "-size") == 0)
+		{
 			char *argptr;
 			size = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-nblocks") == 0) {
+		if (strcmp(argv[i], "-nblocks") == 0)
+		{
 			char *argptr;
 			nblocks = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-check") == 0) {
+		if (strcmp(argv[i], "-check") == 0)
+		{
 			check = 1;
 		}
 
-		if (strcmp(argv[i], "-display") == 0) {
+		if (strcmp(argv[i], "-display") == 0)
+		{
 			display = 1;
 		}
 
-		if (strcmp(argv[i], "-numa") == 0) {
+		if (strcmp(argv[i], "-numa") == 0)
+		{
 #ifdef STARPU_HAVE_LIBNUMA
 			numa = 1;
 #else
@@ -80,20 +86,25 @@ static void parse_args(int argc, char **argv)
 #endif
 		}
 
-		if (strcmp(argv[i], "-p") == 0) {
+		if (strcmp(argv[i], "-p") == 0)
+		{
 			char *argptr;
 			p = strtol(argv[++i], &argptr, 10);
 		}
 
-		if (strcmp(argv[i], "-q") == 0) {
+		if (strcmp(argv[i], "-q") == 0)
+		{
 			char *argptr;
 			q = strtol(argv[++i], &argptr, 10);
 		}
 
 		if (strcmp(argv[i], "-path") == 0)
+		{
 			path = argv[++i];
+		}
 
-		if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0) {
+		if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "-help") == 0 || strcmp(argv[i], "--help") == 0)
+		{
 			fprintf(stderr,"usage: %s [-size n] [-nblocks b] [-check] [-display] [-numa] [-p p] [-q q] [-path PATH]\n", argv[0]);
 			fprintf(stderr,"\np * q must be equal to the number of MPI nodes\n");
 			exit(0);
@@ -147,15 +158,18 @@ static void create_matrix()
 			}
 			snprintf(filename, filename_length, "%s/%u,%u", path, i, j);
 			fd = open(filename, O_WRONLY|O_CREAT|O_TRUNC, 0777);
-			if (fd < 0) {
+			if (fd < 0)
+			{
 				perror("open");
 				exit(1);
 			}
-			if (write(fd, blockptr, blocksize) != (starpu_ssize_t) blocksize) {
+			if (write(fd, blockptr, blocksize) != (starpu_ssize_t) blocksize)
+			{
 				fprintf(stderr,"short write");
 				exit(1);
 			}
-			if (close(fd) < 0) {
+			if (close(fd) < 0)
+			{
 				perror("close");
 				exit(1);
 			}
@@ -193,7 +207,8 @@ static void init_matrix(int rank)
 				snprintf(filename, sizeof(filename), "%u,%u", i, j);
 				/* Register it to StarPU */
 				disk_obj = starpu_disk_open(disk_node, filename, blocksize);
-				if (!disk_obj) {
+				if (!disk_obj)
+				{
 					fprintf(stderr,"could not open %s\n", filename);
 					exit(1);
 				}
@@ -201,7 +216,8 @@ static void init_matrix(int rank)
 					(uintptr_t) disk_obj, size/nblocks,
 					size/nblocks, size/nblocks, sizeof(TYPE));
 			}
-			else {
+			else
+			{
 				starpu_matrix_data_register(handleptr, -1,
 					0, size/nblocks,
 					size/nblocks, size/nblocks, sizeof(TYPE));
@@ -244,7 +260,8 @@ int main(int argc, char **argv)
 	parse_args(argc, argv);
 
 	ret = mkdir(path, 0777);
-	if (ret != 0 && errno != EEXIST) {
+	if (ret != 0 && errno != EEXIST)
+	{
 		fprintf(stderr,"%s does not exist\n", path);
 		exit(1);
 	}

mpi/examples/mpi_lu/plu_solve.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010, 2014  Université de Bordeaux
- * Copyright (C) 2010, 2016  CNRS
+ * Copyright (C) 2010, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -247,7 +247,8 @@ TYPE *STARPU_PLU(reconstruct_matrix)(unsigned size, unsigned nblocks)
 		{
 			block = STARPU_PLU(get_block)(bi, bj);
 		}
-		else {
+		else
+		{
 			MPI_Status status;
 
 			if (rank == 0)
@@ -257,7 +258,8 @@ TYPE *STARPU_PLU(reconstruct_matrix)(unsigned size, unsigned nblocks)
 				int ret = MPI_Recv(block, block_size*block_size, MPI_TYPE, block_rank, 0, MPI_COMM_WORLD, &status);
 				STARPU_ASSERT(ret == MPI_SUCCESS);
 			}
-			else if (rank == block_rank) {
+			else if (rank == block_rank)
+			{
 				block = STARPU_PLU(get_block)(bi, bj);
 				int ret = MPI_Send(block, block_size*block_size, MPI_TYPE, 0, 0, MPI_COMM_WORLD);
 				STARPU_ASSERT(ret == MPI_SUCCESS);

mpi/examples/mpi_lu/pxlu.c

@@ -58,7 +58,8 @@ static unsigned nblocks = 0;
 static int rank = -1;
 static int world_size = -1;
 
-struct callback_arg {
+struct callback_arg
+{
 	unsigned i, j, k;
 };
 
@@ -104,7 +105,8 @@ static void send_data_to_mask(starpu_data_handle_t handle, int *rank_mask, int m
 	int r;
 	for (r = 0; r < world_size; r++)
 	{
-		if (rank_mask[r]) {
+		if (rank_mask[r])
+		{
 			rank_array[cnt] = r;
 
 			comm_array[cnt] = MPI_COMM_WORLD;
@@ -120,7 +122,8 @@ static void send_data_to_mask(starpu_data_handle_t handle, int *rank_mask, int m
 		 * once */
 		starpu_tag_notify_from_apps(tag);
 	}
-	else {
+	else
+	{
 		starpu_mpi_isend_array_detached_unlock_tag(cnt, handle_array,
 				rank_array, mpi_tag_array, comm_array, tag);
 	}
@@ -129,7 +132,8 @@ static void send_data_to_mask(starpu_data_handle_t handle, int *rank_mask, int m
 /* Initiate a receive request once all dependencies are fulfilled and unlock
  * tag 'unlocked_tag' once it's done. */
 
-struct recv_when_done_callback_arg {
+struct recv_when_done_callback_arg
+{
 	int source;
 	int mpi_tag;
 	starpu_data_handle_t handle;
@@ -280,10 +284,12 @@ static void create_task_11_real(unsigned k)
 		task->priority = STARPU_MAX_PRIO;
 
 	/* enforce dependencies ... */
-	if (k > 0) {
+	if (k > 0)
+	{
 		starpu_tag_declare_deps(TAG11(k), 1, TAG22(k-1, k, k));
 	}
-	else {
+	else
+	{
 		starpu_tag_declare_deps(TAG11(k), 1, STARPU_TAG_INIT);
 	}
 
@@ -300,7 +306,8 @@ static void create_task_11(unsigned k)
 #endif
 		create_task_11_real(k);
 	}
-	else {
+	else
+	{
 		/* We don't handle the task, but perhaps we have to generate MPI transfers. */
 		int rank_mask[world_size];
 		find_nodes_using_11(k, rank_mask);
@@ -312,7 +319,8 @@ static void create_task_11(unsigned k)
 #endif
 			create_task_11_recv(k);
 		}
-		else {
+		else
+		{
 #ifdef VERBOSE_INIT
 			fprintf(stderr, "Node %d needs not 11(%u)\n", rank, k);
 #endif
@@ -450,15 +458,18 @@ static void create_task_12_real(unsigned k, unsigned j)
 	task->callback_func = callback_task_12_real;
 	task->callback_arg = arg;
 
-	if (!no_prio && (j == k+1)) {
+	if (!no_prio && (j == k+1))
+	{
 		task->priority = STARPU_MAX_PRIO;
 	}
 
 	/* enforce dependencies ... */
-	if (k > 0) {
+	if (k > 0)
+	{
 		starpu_tag_declare_deps(TAG12(k, j), 2, tag_11_dep, TAG22(k-1, k, j));
 	}
-	else {
+	else
+	{
 		starpu_tag_declare_deps(TAG12(k, j), 1, tag_11_dep);
 	}
 
@@ -475,7 +486,8 @@ static void create_task_12(unsigned k, unsigned j)
 #endif
 		create_task_12_real(k, j);
 	}
-	else {
+	else
+	{
 		/* We don't handle the task, but perhaps we have to generate MPI transfers. */
 		int rank_mask[world_size];
 		find_nodes_using_12(k, j, rank_mask);
@@ -487,7 +499,8 @@ static void create_task_12(unsigned k, unsigned j)
 #endif
 			create_task_12_recv(k, j);
 		}
-		else {
+		else
+		{
 #ifdef VERBOSE_INIT
 			fprintf(stderr, "Node %d needs not 12(k=%u, i=%u)\n", rank, k, j);
 #endif
@@ -622,15 +635,18 @@ static void create_task_21_real(unsigned k, unsigned i)
 	task->callback_func = callback_task_21_real;
 	task->callback_arg = arg;
 
-	if (!no_prio && (i == k+1)) {
+	if (!no_prio && (i == k+1))
+	{
 		task->priority = STARPU_MAX_PRIO;
 	}
 
 	/* enforce dependencies ... */
-	if (k > 0) {
+	if (k > 0)
+	{
 		starpu_tag_declare_deps(TAG21(k, i), 2, tag_11_dep, TAG22(k-1, i, k));
 	}
-	else {
+	else
+	{
 		starpu_tag_declare_deps(TAG21(k, i), 1, tag_11_dep);
 	}
 
@@ -647,7 +663,8 @@ static void create_task_21(unsigned k, unsigned i)
 #endif
 		create_task_21_real(k, i);
 	}
-	else {
+	else
+	{
 		/* We don't handle the task, but perhaps we have to generate MPI transfers. */
 		int rank_mask[world_size];
 		find_nodes_using_21(k, i, rank_mask);
@@ -659,7 +676,8 @@ static void create_task_21(unsigned k, unsigned i)
 #endif
 			create_task_21_recv(k, i);
 		}
-		else {
+		else
+		{
 #ifdef VERBOSE_INIT
 			fprintf(stderr, "Node %d needs not 21(k=%u, i=%u)\n", rank, k,i);
 #endif
@@ -742,15 +760,18 @@ static void create_task_22_real(unsigned k, unsigned i, unsigned j)
 	STARPU_ASSERT(task->handles[1] != STARPU_POISON_PTR);
 	STARPU_ASSERT(task->handles[2] != STARPU_POISON_PTR);
 
-	if (!no_prio && (i == k + 1) && (j == k +1) ) {
+	if (!no_prio && (i == k + 1) && (j == k +1) )
+	{
 		task->priority = STARPU_MAX_PRIO;
 	}
 
 	/* enforce dependencies ... */
-	if (k > 0) {
+	if (k > 0)
+	{
 		starpu_tag_declare_deps(TAG22(k, i, j), 3, TAG22(k-1, i, j), tag_12_dep, tag_21_dep);
 	}
-	else {
+	else
+	{
 		starpu_tag_declare_deps(TAG22(k, i, j), 2, tag_12_dep, tag_21_dep);
 	}
 
@@ -765,7 +786,8 @@ static void create_task_22(unsigned k, unsigned i, unsigned j)
 	//	fprintf(stderr, "CREATE real task 22(k = %d, i = %d, j = %d) on node %d\n", k, i, j, rank);
 		create_task_22_real(k, i, j);
 	}
-//	else {
+//	else
+//	{
 //		fprintf(stderr, "Node %d needs not 22(k=%d, i=%d, j = %d)\n", rank, k,i,j);
 //	}
 }

mpi/examples/mpi_lu/pxlu_implicit.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010-2011, 2013-2015, 2017  Université de Bordeaux
- * Copyright (C) 2010, 2012, 2013  CNRS
+ * Copyright (C) 2010, 2012, 2013, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -29,7 +29,8 @@ static unsigned nblocks = 0;
 static int rank = -1;
 static int world_size = -1;
 
-struct callback_arg {
+struct callback_arg
+{
 	unsigned i, j, k;
 };
 

mpi/examples/mpi_lu/pxlu_kernels.c

@@ -53,7 +53,8 @@ static inline void STARPU_PLU(common_u22)(void *descr[],
 	cudaError_t cures;
 #endif
 
-	switch (s) {
+	switch (s)
+	{
 		case 0:
 			CPU_GEMM("N", "N", dy, dx, dz,
 				(TYPE)-1.0, right, ld21, left, ld12,
@@ -96,7 +97,8 @@ static void STARPU_PLU(cublas_u22)(void *descr[], void *_args)
 }
 #endif// STARPU_USE_CUDA
 
-static struct starpu_perfmodel STARPU_PLU(model_22) = {
+static struct starpu_perfmodel STARPU_PLU(model_22) =
+{
 	.type = STARPU_HISTORY_BASED,
 #ifdef STARPU_ATLAS
 	.symbol = STARPU_PLU_STR(lu_model_22_atlas)
@@ -107,7 +109,8 @@ static struct starpu_perfmodel STARPU_PLU(model_22) = {
 #endif
 };
 
-struct starpu_codelet STARPU_PLU(cl22) = {
+struct starpu_codelet STARPU_PLU(cl22) =
+{
 	.where = STARPU_CPU|STARPU_CUDA,
 	.cpu_funcs = {STARPU_PLU(cpu_u22)},
 #ifdef STARPU_USE_CUDA
@@ -161,7 +164,8 @@ static inline void STARPU_PLU(common_u12)(void *descr[],
 #endif
 
 	/* solve L11 U12 = A12 (find U12) */
-	switch (s) {
+	switch (s)
+	{
 		case 0:
 			CPU_TRSM("L", "L", "N", "N", nx12, ny12,
 					(TYPE)1.0, sub11, ld11, sub12, ld12);
@@ -204,7 +208,8 @@ static void STARPU_PLU(cublas_u12)(void *descr[], void *_args)
 }
 #endif // STARPU_USE_CUDA
 
-static struct starpu_perfmodel STARPU_PLU(model_12) = {
+static struct starpu_perfmodel STARPU_PLU(model_12) =
+{
 	.type = STARPU_HISTORY_BASED,
 #ifdef STARPU_ATLAS
 	.symbol = STARPU_PLU_STR(lu_model_12_atlas)
@@ -215,7 +220,8 @@ static struct starpu_perfmodel STARPU_PLU(model_12) = {
 #endif
 };
 
-struct starpu_codelet STARPU_PLU(cl12) = {
+struct starpu_codelet STARPU_PLU(cl12) =
+{
 	.where = STARPU_CPU|STARPU_CUDA,
 	.cpu_funcs = {STARPU_PLU(cpu_u12)},
 #ifdef STARPU_USE_CUDA
@@ -268,7 +274,8 @@ static inline void STARPU_PLU(common_u21)(void *descr[],
 #endif
 
 
-	switch (s) {
+	switch (s)
+	{
 		case 0:
 			CPU_TRSM("R", "U", "N", "U", nx21, ny21,
 					(TYPE)1.0, sub11, ld11, sub21, ld21);
@@ -313,7 +320,8 @@ static void STARPU_PLU(cublas_u21)(void *descr[], void *_args)
 }
 #endif
 
-static struct starpu_perfmodel STARPU_PLU(model_21) = {
+static struct starpu_perfmodel STARPU_PLU(model_21) =
+{
 	.type = STARPU_HISTORY_BASED,
 #ifdef STARPU_ATLAS
 	.symbol = STARPU_PLU_STR(lu_model_21_atlas)
@@ -324,7 +332,8 @@ static struct starpu_perfmodel STARPU_PLU(model_21) = {
 #endif
 };
 
-struct starpu_codelet STARPU_PLU(cl21) = {
+struct starpu_codelet STARPU_PLU(cl21) =
+{
 	.where = STARPU_CPU|STARPU_CUDA,
 	.cpu_funcs = {STARPU_PLU(cpu_u21)},
 #ifdef STARPU_USE_CUDA
@@ -360,7 +369,8 @@ static inline void STARPU_PLU(common_u11)(void *descr[],
 	fprintf(stderr, "KERNEL 11 %d - k = %u\n", rank, info->k);
 #endif
 
-	switch (s) {
+	switch (s)
+	{
 		case 0:
 			for (z = 0; z < nx; z++)
 			{
@@ -419,7 +429,8 @@ static void STARPU_PLU(cublas_u11)(void *descr[], void *_args)
 }
 #endif// STARPU_USE_CUDA
 
-static struct starpu_perfmodel STARPU_PLU(model_11) = {
+static struct starpu_perfmodel STARPU_PLU(model_11) =
+{
 	.type = STARPU_HISTORY_BASED,
 #ifdef STARPU_ATLAS
 	.symbol = STARPU_PLU_STR(lu_model_11_atlas)
@@ -430,7 +441,8 @@ static struct starpu_perfmodel STARPU_PLU(model_11) = {
 #endif
 };
 
-struct starpu_codelet STARPU_PLU(cl11) = {
+struct starpu_codelet STARPU_PLU(cl11) =
+{
 	.where = STARPU_CPU|STARPU_CUDA,
 	.cpu_funcs = {STARPU_PLU(cpu_u11)},
 #ifdef STARPU_USE_CUDA

mpi/src/starpu_mpi_fortran.c

@@ -1,6 +1,6 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
- * Copyright (C) 2016  CNRS
+ * Copyright (C) 2016, 2017  CNRS
  * Copyright (C) 2016  Inria
  *
  * StarPU is free software; you can redistribute it and/or modify
@@ -27,9 +27,12 @@ struct _starpu_mpi_argc_argv *fstarpu_mpi_argcv_alloc(int argc, int initialize_m
 	struct _starpu_mpi_argc_argv *argcv;
 	_STARPU_MPI_CALLOC(argcv, 1,sizeof(*argcv));
 	argcv->initialize_mpi = initialize_mpi;
-	if (comm_present) {
+	if (comm_present)
+	{
 		argcv->comm = MPI_Comm_f2c(comm);
-	} else {
+	}
+	else
+	{
 		argcv->comm = MPI_COMM_WORLD;
 	}
 	argcv->fargc = argc;

mpi/tests/insert_task_owner_data.c

@@ -1,6 +1,6 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
- * Copyright (C) 2011, 2012, 2013, 2014, 2016  CNRS
+ * Copyright (C) 2011, 2012, 2013, 2014, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -105,7 +105,8 @@ int main(int argc, char **argv)
 		{
 			starpu_data_acquire(data_handles[i], STARPU_R);
 			values[i] = *((int *)starpu_data_get_local_ptr(data_handles[i]));
-			starpu_data_release(data_handles[i]);		}
+			starpu_data_release(data_handles[i]);
+		}
 	}
 	ret = 0;
 	if (rank == 0)

mpi/tests/ring_async.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2009, 2010, 2014-2016  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012, 2013, 2016  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2013, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -134,7 +134,8 @@ int main(int argc, char **argv)
 			FPRINTF(stdout, "Finished : token value %d\n", token);
 			starpu_data_release(token_handle);
 		}
-		else {
+		else
+		{
 			starpu_mpi_req req;
 			MPI_Status status;
 			starpu_mpi_isend(token_handle, &req, (rank+1)%size, tag+1, MPI_COMM_WORLD);

src/common/graph.c

@@ -386,7 +386,8 @@ void _starpu_graph_compute_descendants(void)
 
 		descendants = 0;
 		/* While we have descendants, count their descendants */
-		while (current_n) {
+		while (current_n)
+		{
 			/* Next set is initially empty */
 			next_n = 0;
 

src/common/thread.c

@@ -119,7 +119,8 @@ int starpu_pthread_mutex_lock(starpu_pthread_mutex_t *mutex)
 
 	/* Note: this is actually safe, because simgrid only preempts within
 	 * simgrid functions */
-	if (!*mutex) {
+	if (!*mutex)
+	{
 		/* Here we may get preempted */
 		xbt_mutex_t new_mutex = xbt_mutex_init();
 		if (!*mutex)
@@ -195,11 +196,13 @@ int starpu_pthread_key_create(starpu_pthread_key_t *key, void (*destr_function)
 
 	/* Note: no synchronization here, we are actually monothreaded anyway. */
 	for (i = 0; i < MAX_TSD; i++)
+	{
 		if (!used_key[i])
 		{
 			used_key[i] = 1;
 			break;
 		}
+	}
 	STARPU_ASSERT(i < MAX_TSD);
 	/* key 0 is for process pointer argument */
 	*key = i+1;
@@ -251,7 +254,8 @@ static void _starpu_pthread_cond_auto_init(starpu_pthread_cond_t *cond)
 {
 	/* Note: this is actually safe, because simgrid only preempts within
 	 * simgrid functions */
-	if (!*cond) {
+	if (!*cond)
+	{
 		/* Here we may get preempted */
 		xbt_cond_t new_cond = xbt_cond_init();
 		if (!*cond)
@@ -529,7 +533,8 @@ int starpu_pthread_barrier_init(starpu_pthread_barrier_t *restrict barrier, cons
 int starpu_pthread_barrier_destroy(starpu_pthread_barrier_t *barrier)
 {
 	starpu_pthread_mutex_lock(&barrier->mutex);
-	while (barrier->busy) {
+	while (barrier->busy)
+	{
 		starpu_pthread_cond_wait(&barrier->cond_destroy, &barrier->mutex);
 	}
 	starpu_pthread_mutex_unlock(&barrier->mutex);

src/common/utils.c

@@ -289,7 +289,8 @@ static int _starpu_warn_nolock(int err)
 		)
 	{
 		static int warn;
-		if (!warn) {
+		if (!warn)
+		{
 			warn = 1;
 			_STARPU_DISP("warning: Couldn't lock performance file, StarPU home (%s, coming from $HOME or $STARPU_HOME) is probably on some network filesystem like NFS which does not support locking.\n", _starpu_get_home_path());
 		}

src/core/disk_ops/unistd/disk_unistd_global.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2013 Corentin Salingue
- * Copyright (C) 2015, 2016 CNRS
+ * Copyright (C) 2015, 2016, 2017 CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -56,7 +56,8 @@
 static unsigned starpu_unistd_opened_files;
 
 #ifdef HAVE_AIO_H
-struct starpu_unistd_aiocb {
+struct starpu_unistd_aiocb
+{
 	struct aiocb aiocb;
 	struct starpu_unistd_global_obj *obj;
 };

src/core/sched_ctx.c

@@ -1051,7 +1051,8 @@ static void _starpu_delete_sched_ctx(struct _starpu_sched_ctx *sched_ctx)
 	for(w = 0; w < nworkers; w++)
 	{
 		STARPU_PTHREAD_MUTEX_LOCK(&sched_ctx->parallel_sect_mutex[w]);
-		while (sched_ctx->busy[w]) {
+		while (sched_ctx->busy[w])
+		{
 			STARPU_PTHREAD_COND_WAIT(&sched_ctx->parallel_sect_cond_busy[w], &sched_ctx->parallel_sect_mutex[w]);
 		}
 		STARPU_PTHREAD_MUTEX_UNLOCK(&sched_ctx->parallel_sect_mutex[w]);

src/core/simgrid.c

@@ -46,7 +46,8 @@ static int simgrid_started;
 
 static int runners_running;
 starpu_pthread_queue_t _starpu_simgrid_transfer_queue[STARPU_MAXNODES];
-static struct transfer_runner {
+static struct transfer_runner
+{
 	struct transfer *first_transfer, *last_transfer;
 	msg_sem_t sem;
 	msg_process_t runner;
@@ -54,7 +55,8 @@ static struct transfer_runner {
 static int transfer_execute(int argc STARPU_ATTRIBUTE_UNUSED, char *argv[] STARPU_ATTRIBUTE_UNUSED);
 
 starpu_pthread_queue_t _starpu_simgrid_task_queue[STARPU_NMAXWORKERS];
-static struct worker_runner {
+static struct worker_runner
+{
 	struct task *first_task, *last_task;
 	msg_sem_t sem;
 	msg_process_t runner;
@@ -429,7 +431,8 @@ static int task_execute(int argc STARPU_ATTRIBUTE_UNUSED, char *argv[] STARPU_AT
 	struct worker_runner *w = &worker_runner[workerid];
 
 	_STARPU_DEBUG("worker runner %u started\n", workerid);
-	while (1) {
+	while (1)
+	{
 		struct task *task;
 
 		MSG_sem_acquire(w->sem);
@@ -672,7 +675,8 @@ static int transfer_execute(int argc STARPU_ATTRIBUTE_UNUSED, char *argv[] STARP
 	struct transfer_runner *t = &transfer_runner[src][dst];
 
 	_STARPU_DEBUG("transfer runner %u-%u started\n", src, dst);
-	while (1) {
+	while (1)
+	{
 		struct transfer *transfer;
 
 		MSG_sem_acquire(t->sem);
@@ -991,7 +995,8 @@ void _starpu_simgrid_count_ngpus(void)
 #endif
 }
 
-typedef struct{
+typedef struct
+{
 	void_f_pvoid_t code;
 	void *userparam;
 	void *father_data;

src/core/topology.c

@@ -1372,7 +1372,8 @@ _starpu_init_machine_config(struct _starpu_machine_config *config, int no_mp_con
 		int worker_idx = topology->nworkers + openclgpu;
 		int devid = _starpu_get_next_opencl_gpuid(config);
 		if (devid == -1)
-		{ // There is no more devices left
+		{
+			// There is no more devices left
 			topology->nopenclgpus = openclgpu;
 			break;
 		}

src/datawizard/coherency.c

@@ -201,7 +201,8 @@ void _starpu_update_data_state(starpu_data_handle_t handle,
 			_starpu_memchunk_dirty(requesting_replicate->mc, requesting_replicate->memory_node);
 	}
 	else
-	{ /* read only */
+	{
+		/* read only */
 		if (requesting_replicate->state != STARPU_OWNER)
 		{
 			/* there was at least another copy of the data */

src/datawizard/interfaces/data_interface.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2009-2017  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015, 2016  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017  CNRS
  * Copyright (C) 2014, 2016  Inria
  *
  * StarPU is free software; you can redistribute it and/or modify
@@ -176,12 +176,15 @@ void _starpu_data_register_ram_pointer(starpu_data_handle_t handle, void *ptr)
 	{
 		_starpu_spin_lock(&registered_handles_lock);
 		HASH_FIND_PTR(registered_handles, &ptr, old_entry);
-		if (old_entry) {
+		if (old_entry)
+		{
 			/* Already registered this pointer, avoid undefined
 			 * behavior of duplicate in hash table */
 			_starpu_spin_unlock(&registered_handles_lock);
 			free(entry);
-		} else {
+		}
+		else
+		{
 			nregistered++;
 			if (nregistered > maxnregistered)
 				maxnregistered = nregistered;

src/debug/traces/anim.c

@@ -22,7 +22,8 @@
 #include "starpu_fxt.h"
 
 #ifdef STARPU_USE_FXT
-static struct component {
+static struct component
+{
 	UT_hash_handle hh;
 	char *name;
 	int workerid;

src/debug/traces/starpu_fxt.c

@@ -81,13 +81,15 @@ static FILE *tasks_file;
 static FILE *data_file;
 static FILE *trace_file;
 
-struct data_parameter_info {
+struct data_parameter_info
+{
 	unsigned long handle;
 	unsigned long size;
 	int mode;
 };
 
-struct task_info {
+struct task_info
+{
 	UT_hash_handle hh;
 	char *model_name;
 	char *name;
@@ -142,7 +144,8 @@ static struct task_info *get_task(unsigned long job_id, int mpi_rank)
 		task->data = NULL;
 		task->mpi_rank = mpi_rank;
 		HASH_ADD(hh, tasks_info, job_id, sizeof(task->job_id), task);
-	} else
+	}
+	else
 		STARPU_ASSERT(task->mpi_rank == mpi_rank);
 
 	return task;
@@ -191,7 +194,8 @@ static void task_dump(unsigned long job_id, int mpi_rank)
 	fprintf(tasks_file, "Footprint: %lx\n", task->footprint);
 	if (task->kflops != 0)
 		fprintf(tasks_file, "GFlop: %f\n", ((double) task->kflops) / 1000000);
-	if (task->iterations[0] != -1) {
+	if (task->iterations[0] != -1)
+	{
 		fprintf(tasks_file, "Iteration:");
 		for (i = 0; i < sizeof(task->iterations)/sizeof(task->iterations[0]); i++)
 			fprintf(tasks_file, " %ld", task->iterations[i]);
@@ -230,7 +234,8 @@ out:
 	free(task);
 }
 
-struct data_info {
+struct data_info
+{
 	UT_hash_handle hh;
 	unsigned long handle;
 	char *name;
@@ -257,7 +262,8 @@ static struct data_info *get_data(unsigned long handle, int mpi_rank)
 		data->mpi_rank = mpi_rank;
 		data->mpi_owner = mpi_rank;
 		HASH_ADD(hh, data_info, handle, sizeof(handle), data);
-	} else
+	}
+	else
 		STARPU_ASSERT(data->mpi_rank == mpi_rank);
 
 	return data;
@@ -437,11 +443,13 @@ static double current_computation_time;
 #define COMM_THREAD_STATE (1 << 2)
 #define USER_THREAD_STATE (1 << 3)
 
-static struct {
+static struct
+{
 	const char *short_name;
 	const char *long_name;
 	uint8_t flags;
-} states_list[] = {
+} states_list[] =
+{
 	{ "Fi",  "FetchingInput",		 WORKER_STATE | THREAD_STATE },
 	{ "Po",	 "PushingOutput",		 WORKER_STATE | THREAD_STATE },
 	{ "P",	 "Progressing",			 WORKER_STATE | THREAD_STATE },

src/debug/traces/starpu_fxt_mpi.c

@@ -255,7 +255,8 @@ static void display_all_transfers_from_trace(FILE *out_paje_file, unsigned n)
 			start_date = mpi_transfer_list_front(&pending_receives)->date;
 
 		src = MAX_MPI_NODES;
-		for (node = 0; node < n; node++) {
+		for (node = 0; node < n; node++)
+		{
 			if (slot[node] < mpi_sends_used[node] && mpi_sends[node][slot[node]].date < start_date)
 			{
 				/* next send for node is earlier than others */

src/drivers/cpu/driver_cpu.c

@@ -376,7 +376,8 @@ int _starpu_cpu_driver_run_once(struct _starpu_worker *cpu_worker)
 		res = _starpu_fetch_task_input(task, j, 1);
 		STARPU_ASSERT(res == 0);
 	}
-	else {
+	else
+	{
 		int ret = _starpu_cpu_driver_execute_task(cpu_worker, task, j);
 		_STARPU_TRACE_END_PROGRESS(memnode);
 		return ret;

src/drivers/cuda/starpu_cublas.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2009-2012, 2014, 2017  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -29,7 +29,8 @@ static cublasHandle_t cublas_handles[STARPU_NMAXWORKERS];
 static cublasHandle_t main_handle;
 static starpu_pthread_mutex_t mutex;
 
-static unsigned get_idx(void) {
+static unsigned get_idx(void)
+{
 	unsigned workerid = starpu_worker_get_id_check();
 	unsigned th_per_dev = _starpu_get_machine_config()->topology.cuda_th_per_dev;
 	unsigned th_per_stream = _starpu_get_machine_config()->topology.cuda_th_per_stream;

src/drivers/mpi/driver_mpi_common.c

@@ -100,15 +100,15 @@ int _starpu_mpi_common_mp_init()
 void _starpu_mpi_common_mp_deinit()
 {
         if (!extern_initialized)
-                MPI_Finalize();    
+                MPI_Finalize();
 }
 
 int _starpu_mpi_common_is_src_node()
-{   
+{
         int id_proc;
         MPI_Comm_rank(MPI_COMM_WORLD, &id_proc);
         return id_proc == src_node_id;
-} 
+}
 
 int _starpu_mpi_common_get_src_node()
 {

src/profiling/bound.c

@@ -216,12 +216,14 @@ static void initialize_duration(struct bound_task *task)
 	task->duration[STARPU_SCC_WORKER] = initialize_arch_duration(conf->topology.nsccdevices,NULL); 
 }
 
-static struct starpu_perfmodel_device device = {
+static struct starpu_perfmodel_device device =
+{
 	.type = STARPU_CPU_WORKER,
 	.devid = 0,
 	.ncores = 1,
 };
-static struct starpu_perfmodel_arch dumb_arch = {
+static struct starpu_perfmodel_arch dumb_arch =
+{
 	.ndevices = 1,
 	.devices = &device,
 };

src/profiling/profiling_helpers.c

@@ -24,7 +24,8 @@ static double convert_to_byte_units(float d, unsigned max_unit, unsigned *unit)
 	const double divisor = 1024;
 
 	*unit = 0;
-	while (d > divisor && *unit < max_unit) {
+	while (d > divisor && *unit < max_unit)
+	{
 		d /= divisor;
 		(*unit)++;
 	}

src/sched_policies/component_perfmodel_select.c

@@ -46,7 +46,8 @@ static int perfmodel_select_push_task(struct starpu_sched_component * component,
 		if(isnan(length))
 		{
 			static int warned;
-			if (!warned) {
+			if (!warned)
+			{
 				warned = 1;
 				_STARPU_DISP("Warning: performance model for %s not finished calibrating, using a dumb scheduling heuristic for now\n",starpu_task_get_name(task));
 			}

src/sched_policies/component_worker.c

@@ -220,7 +220,8 @@ static void _starpu_worker_task_list_destroy(struct _starpu_worker_task_list * l
 		/* There can be empty task grids, when we picked the last task after the front task grid */
 		struct _starpu_task_grid *t = l->first, *nextt;
 
-		while(t) {
+		while(t)
+		{
 			STARPU_ASSERT(!t->task);
 			nextt = t->up;
 			_starpu_task_grid_destroy(t);

src/sched_policies/deque_modeling_policy_data_aware.c

@@ -561,12 +561,14 @@ static int _dm_push_task(struct starpu_task *task, unsigned prio, unsigned sched
 				best_impl = nimpl;
 			}
 
-			if (isnan(local_length)) {
+			if (isnan(local_length))
+			{
 				/* we are calibrating, we want to speed-up calibration time
 				 * so we privilege non-calibrated tasks (but still
 				 * greedily distribute them to avoid dumb schedules) */
 				static int warned;
-				if (!warned) {
+				if (!warned)
+				{
 					warned = 1;
 					_STARPU_DISP("Warning: performance model for %s not finished calibrating on worker %u, using a dumb scheduling heuristic for now\n", starpu_task_get_name(task), worker);
 				}

src/sched_policies/graph_test_policy.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010-2017  Université de Bordeaux
- * Copyright (C) 2010-2013, 2016  CNRS
+ * Copyright (C) 2010-2013, 2016, 2017  CNRS
  * Copyright (C) 2011  INRIA
  *
  * StarPU is free software; you can redistribute it and/or modify
@@ -173,7 +173,8 @@ static void do_schedule_graph_test_policy(unsigned sched_ctx_id)
 	_starpu_graph_foreach(set_priority, data);
 
 	/* Now that we have priorities, move tasks from bag to priority queue */
-	while(!_starpu_fifo_empty(data->fifo)) {
+	while(!_starpu_fifo_empty(data->fifo))
+	{
 		struct starpu_task *task = _starpu_fifo_pop_task(data->fifo, -1);
 		struct _starpu_prio_deque *prio = select_prio(sched_ctx_id, data, task);
 		_starpu_prio_deque_push_back_task(prio, task);

src/sched_policies/heteroprio.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2015, 2017  INRIA
- * Copyright (C) 2016  CNRS
+ * Copyright (C) 2016, 2017  CNRS
  * Copyright (C) 2016  Uppsala University
  *
  * StarPU is free software; you can redistribute it and/or modify
@@ -454,7 +454,8 @@ static struct starpu_task *pop_task_heteroprio_policy(unsigned sched_ctx_id)
 	/* If no tasks available, no tasks in worker queue or some arch worker queue just return NULL */
 	if (!STARPU_RUNNING_ON_VALGRIND
 	    && (hp->total_tasks_in_buckets == 0 || hp->nb_remaining_tasks_per_arch_index[worker->arch_index] == 0)
-            && worker->tasks_queue->ntasks == 0 && hp->nb_prefetched_tasks_per_arch_index[worker->arch_index] == 0){
+            && worker->tasks_queue->ntasks == 0 && hp->nb_prefetched_tasks_per_arch_index[worker->arch_index] == 0)
+	{
 		return NULL;
 	}
 
@@ -566,7 +567,8 @@ static struct starpu_task *pop_task_heteroprio_policy(unsigned sched_ctx_id)
 		}
 
 		/* circular loop */
-		while (1) {
+		while (1)
+		{
 			if (!workers->has_next(workers, &it))
 			{
 				/* End of the list, restart from the beginning */
@@ -581,7 +583,8 @@ static struct starpu_task *pop_task_heteroprio_policy(unsigned sched_ctx_id)
 
 				/* If it is the same arch and there is a task to steal */
 				if(hp->workers_heteroprio[victim].arch_index == worker->arch_index
-				   && hp->workers_heteroprio[victim].tasks_queue->ntasks){
+				   && hp->workers_heteroprio[victim].tasks_queue->ntasks)
+				{
 					starpu_pthread_mutex_t *victim_sched_mutex;
 					starpu_pthread_cond_t *victim_sched_cond;
 					starpu_worker_get_sched_condition(victim, &victim_sched_mutex, &victim_sched_cond);

src/sched_policies/parallel_heft.c

@@ -375,9 +375,11 @@ static int _parallel_heft_push_task(struct starpu_task *task, unsigned prio, uns
 				nimpl_best = nimpl;
 			}
 
-			if (isnan(local_task_length[worker_ctx][nimpl])) {
+			if (isnan(local_task_length[worker_ctx][nimpl]))
+			{
 				static int warned;
-				if (!warned) {
+				if (!warned)
+				{
 					warned = 1;
 					_STARPU_DISP("Warning: performance model for %s not finished calibrating on %u, using a dumb scheduling heuristic for now\n", starpu_task_get_name(task), worker);
 				}

src/sched_policies/work_stealing_policy.c

@@ -594,7 +594,8 @@ static struct starpu_task *ws_pop_task(unsigned sched_ctx_id)
 #ifndef STARPU_NON_BLOCKING_DRIVERS
         /* While stealing, perhaps somebody actually give us a task, don't miss
          * the opportunity to take it before going to sleep. */
-	if (!task) {
+	if (!task)
+	{
 		STARPU_PTHREAD_MUTEX_LOCK(&ws->per_worker[workerid].worker_mutex);
 		task = ws_pick_task(ws, workerid, workerid);
 		if (task)

src/top/starpu_top.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2011 William Braik, Yann Courtois, Jean-Marie Couteyen, Anthony Roy
- * Copyright (C) 2011, 2012, 2013, 2016 CNRS
+ * Copyright (C) 2011, 2012, 2013, 2016, 2017 CNRS
  * Copyright (C) 2016, 2017  Inria
  *
  * StarPU is free software; you can redistribute it and/or modify
@@ -230,7 +230,8 @@ void _starpu_top_shutdown(void)
 {
 	{
 		struct starpu_top_data * cur = starpu_top_first_data, * next;
-		while (cur) {
+		while (cur)
+		{
 			next = cur->next;
 			free(cur);
 			cur = next;
@@ -240,7 +241,8 @@ void _starpu_top_shutdown(void)
 
 	{
 		struct starpu_top_param * cur = starpu_top_first_param, *next;
-		while (cur) {
+		while (cur)
+		{
 			next = cur->next;
 			free(cur);
 			cur = next;

src/util/fstarpu.c

@@ -626,7 +626,8 @@ _FSTARPU_DATA_FILTER_ALLOCATOR(block_filter_vertical_block_shadow);
 
 #undef _FSTARPU_DATA_FILTER_ALLOCATOR
 
-void fstarpu_data_filter_free(struct starpu_data_filter *filter) {
+void fstarpu_data_filter_free(struct starpu_data_filter *filter)
+{
 	memset(filter, 0, sizeof(*filter));
 	free(filter);
 }

src/util/openmp_runtime_support.c

@@ -1561,7 +1561,8 @@ void starpu_omp_task_region(const struct starpu_omp_task_region_attr *attr)
 	}
 	if (is_merged || is_included)
 	{
-		if (is_included) {
+		if (is_included)
+		{
 			/* TODO: backup current ICVs and setup new ICVs for the included task */
 		}
 		int i;
@@ -1586,7 +1587,8 @@ void starpu_omp_task_region(const struct starpu_omp_task_region_attr *attr)
 		{
 			free(attr->cl_arg);
 		}
-		if (is_included) {
+		if (is_included)
+		{
 			/* TODO: restore backuped ICVs */
 		}
 	}

src/util/openmp_runtime_support_environment.c

@@ -326,7 +326,9 @@ static void read_a_places_list(const char *str, struct starpu_omp_place *places)
 		places->abstract_name = starpu_omp_place_undefined;
 		return;
 	}
-	enum { state_split,
+	enum
+	{
+		state_split,
 		state_read_brace_prefix,
 		state_read_opening_brace,
 		state_read_numeric_prefix,

src/worker_collection/worker_tree.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2013, 2016  Université de Bordeaux
- * Copyright (C) 2012-2014, 2016  CNRS
+ * Copyright (C) 2012-2014, 2016, 2017  CNRS
  * Copyright (C) 2011-2013  INRIA
  *
  * StarPU is free software; you can redistribute it and/or modify
@@ -46,7 +46,7 @@ static unsigned tree_has_next_unblocked_worker(struct starpu_worker_collection *
 		if(!it->visited[workerids[w]] && workers->present[workerids[w]])
 		{
 			if(workers->is_unblocked[workerids[w]])
-			{	
+			{
 				id = workerids[w];
 				it->possible_value = neighbour;
 				break;
@@ -55,7 +55,7 @@ static unsigned tree_has_next_unblocked_worker(struct starpu_worker_collection *
 			{
 				it->visited[workerids[w]] = 1;
 				it->value = neighbour;
-			
+
 				return tree_has_next_unblocked_worker(workers, it);
 			}
 		}

tests/datawizard/double_parameter.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2011, 2016  Université de Bordeaux
- * Copyright (C) 2012, 2013, 2015  CNRS
+ * Copyright (C) 2012, 2013, 2015, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -29,7 +29,7 @@ void dummy_func(void *descr[] STARPU_ATTRIBUTE_UNUSED, void *arg STARPU_ATTRIBUT
 static struct starpu_codelet codelet_R_R =
 {
         .cpu_funcs = { dummy_func },
-		.cpu_funcs_name = {"dummy_func"},
+	.cpu_funcs_name = {"dummy_func"},
         .model = NULL,
         .nbuffers = 2,
 	.modes = {STARPU_R, STARPU_R}

tests/datawizard/locality.c

@@ -145,7 +145,8 @@ int main(int argc, char *argv[])
 
 	printf("domain piece that each worker has computed, over time\n");
 	loop = 0;
-	do {
+	do
+	{
 		finished = 1;
 		for (i = 0; i < starpu_worker_get_count(); i++)
 		{
@@ -159,7 +160,8 @@ int main(int argc, char *argv[])
 		}
 		loop++;
 		printf("\n");
-	} while (!finished && loop < 100);
+	}
+	while (!finished && loop < 100);
 
 	starpu_shutdown();
 	return EXIT_SUCCESS;

tests/helper.h

@@ -1,6 +1,6 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
- * Copyright (C) 2011, 2012, 2013, 2016  CNRS
+ * Copyright (C) 2011, 2012, 2013, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -106,7 +106,8 @@ static int _starpu_valgrind_print_once STARPU_ATTRIBUTE_UNUSED = 0;
 #define ANNOTATE_HAPPENS_AFTER(obj) ((void)0)
 #endif
 
-static inline void disable_coredump(void) {
+static inline void disable_coredump(void)
+{
 #ifdef HAVE_GETRLIMIT
 	struct rlimit rlim = { 0, 0 };
 	setrlimit(RLIMIT_CORE, &rlim);

tests/main/insert_task_many.c

@@ -1,6 +1,6 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
- * Copyright (C) 2011, 2012, 2013, 2014  CNRS
+ * Copyright (C) 2011, 2012, 2013, 2014, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -60,7 +60,8 @@ struct starpu_codelet codelet_toomany =
 	/* starpu_task_get_current() doesn't work on MIC */
 	/* .cpu_funcs_name = {"func_cpu"}, */
 	.nbuffers = NPARAMS,
-	.modes = {
+	.modes =
+	{
 		STARPU_R,
 		STARPU_R,
 		STARPU_RW|STARPU_COMMUTE,

tests/main/tag_task_data_deps.c

@@ -1,7 +1,7 @@
 /* StarPU --- Runtime system for heterogeneous multicore architectures.
  *
  * Copyright (C) 2010-2013, 2016-2017  Université de Bordeaux
- * Copyright (C) 2010, 2011, 2012, 2013, 2015, 2016  CNRS
+ * Copyright (C) 2010, 2011, 2012, 2013, 2015, 2016, 2017  CNRS
  *
  * StarPU is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -251,7 +251,8 @@ int main(int argc, char **argv)
 
 		ret = starpu_task_wait(taskC);
 		STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait");
-	} while(0);
+	}
+	while(0);
 
 	starpu_data_unregister(handle1);
 	starpu_data_unregister(handle2);

tests/microbenchs/parallel_dependent_homogeneous_tasks_data.c

@@ -144,8 +144,9 @@ int main(int argc, char *argv[])
 	for (j = 0; j < nb_data; j++)
 		free(vector[j]);
 
+	//test reussi ou test echoue
 	if (check && check_sup)
-	{ //test reussi ou test echoue
+	{
 		return EXIT_SUCCESS;
 	}
 	else

tests/microbenchs/parallel_independent_heterogeneous_tasks.c

@@ -129,8 +129,9 @@ int main(int argc, char *argv[])
 
 	starpu_shutdown();
 
+	//test reussi ou test echoue
 	if (check && check_sup)
-	{ //test reussi ou test echoue
+	{
 		return EXIT_SUCCESS;
 	}
 	else

tests/microbenchs/parallel_independent_heterogeneous_tasks_data.c

@@ -168,8 +168,9 @@ int main(int argc, char *argv[])
 	for (j = 0; j < nb_tasks; j++)
 		free(vector[j]);
 
+	//test reussi ou test echoue
 	if (check && check_sup)
-	{ //test reussi ou test echoue
+	{
 		return EXIT_SUCCESS;
 	}
 	else

tests/microbenchs/parallel_independent_homogeneous_tasks.c

@@ -99,8 +99,9 @@ int main(int argc, char *argv[])
 
 	starpu_shutdown();
 
+	//test reussi ou test echoue
 	if (check && check_sup)
-	{ //test reussi ou test echoue
+	{
 		return EXIT_SUCCESS;
 	}
 	else

tests/microbenchs/parallel_independent_homogeneous_tasks_data.c

@@ -138,8 +138,9 @@ int main(int argc, char *argv[])
 	for (j = 0; j < nb_tasks; j++)
 		free(vector[j]);
 
+	//test reussi ou test echoue
 	if (check && check_sup)
-	{ //test reussi ou test echoue
+	{
 		return EXIT_SUCCESS;
 	}
 	else