clang format

Author: Mark

core/include/traccc/gbts_seeding/gbts_seeding_config.hpp

@@ -118,7 +118,8 @@ struct gbts_seed_extraction_params {
     // max qual = add_hit*max_length*qual_scale
     float qual_scale =
         0.01f * static_cast<float>(INT_MAX) /
-		(add_hit * static_cast<float>(traccc::device::gbts_consts::max_cca_iter));
+        (add_hit *
+         static_cast<float>(traccc::device::gbts_consts::max_cca_iter));
 
     float inv_max_curvature = 900.0f;
     float max_z0 = 160.0f;

device/cuda/src/gbts_seeding/gbts_seeding_algorithm.cu

@@ -776,7 +776,8 @@ gbts_seeding_algorithm::output_type gbts_seeding_algorithm::operator()(
     cudaMemcpyAsync(&path_sizes, &ctx.d_counters[6], 2 * sizeof(unsigned int),
                     cudaMemcpyDeviceToHost, stream);
 
-    TRACCC_DEBUG(path_sizes[0] << "size of path store | nTerminusEdges " << path_sizes[1]);
+    TRACCC_DEBUG(path_sizes[0] << "size of path store | nTerminusEdges "
+                               << path_sizes[1]);
 
     cudaMalloc(&ctx.d_path_store,
                (path_sizes[0] + path_sizes[1]) * sizeof(int2));
@@ -806,9 +807,8 @@ gbts_seeding_algorithm::output_type gbts_seeding_algorithm::operator()(
     kernels::fit_segments<<<nBlocks, nThreads, 0, stream>>>(
         ctx.d_reducedSP, ctx.d_output_graph, ctx.d_path_store,
         ctx.d_seed_proposals, ctx.d_edge_bids, ctx.d_seed_ambiguity,
-        ctx.d_levels, ctx.d_counters, path_sizes[1],
-        m_config.minLevel, m_config.max_num_neighbours,
-        m_config.seed_extraction_params);
+        ctx.d_levels, ctx.d_counters, path_sizes[1], m_config.minLevel,
+        m_config.max_num_neighbours, m_config.seed_extraction_params);
 
     unsigned int nProps = 0;
     cudaMemcpyAsync(&nProps, &ctx.d_counters[8], sizeof(unsigned int),

device/cuda/src/gbts_seeding/kernels/GbtsGraphProcessingKernels.cuh

@@ -67,13 +67,10 @@ struct Tracklet {
  *  @param[internal] d_counters[5 and 6] used for counting the last block and
  * for the number of active edges
  */
-__global__ static void CCA_IterationKernel(const int* d_output_graph,
-                                           char* d_levels, int* d_active_edges,
-                                           short2* d_outgoing_paths,
-                                           unsigned int* d_counters, int iter,
-                                           unsigned int nEdges,
-                                           unsigned int max_num_neighbours,
-                                           int minLevel) {
+__global__ static void CCA_IterationKernel(
+    const int* d_output_graph, char* d_levels, int* d_active_edges,
+    short2* d_outgoing_paths, unsigned int* d_counters, int iter,
+    unsigned int nEdges, unsigned int max_num_neighbours, int minLevel) {
 
     __shared__ unsigned int nEdgesLeft;
     unsigned int edge_size = 2 + 1 + max_num_neighbours;
@@ -554,16 +551,16 @@ inline __device__ void add_seed_proposal(const int qual, const int path_idx,
     }
 }
 
-void __global__
-fit_segments(float4* d_sp_params, int* d_output_graph, int2* d_path_store,
-             int2* d_seed_proposals, unsigned long long int* d_edge_bids,
-             char* d_seed_ambiguity, char* d_levels, unsigned int* d_counters,
-             unsigned int nTerminusEdges, int minLevel,
-             unsigned int max_num_neighbours,
-             gbts_seed_extraction_params seed_extraction_params) {
+void __global__ fit_segments(
+    float4* d_sp_params, int* d_output_graph, int2* d_path_store,
+    int2* d_seed_proposals, unsigned long long int* d_edge_bids,
+    char* d_seed_ambiguity, char* d_levels, unsigned int* d_counters,
+    unsigned int nTerminusEdges, int minLevel, unsigned int max_num_neighbours,
+    gbts_seed_extraction_params seed_extraction_params) {
 
     // take an extracted path and fit it to produce a quality score
-    unsigned int path_idx = threadIdx.x + blockIdx.x * blockDim.x + nTerminusEdges;
+    unsigned int path_idx =
+        threadIdx.x + blockIdx.x * blockDim.x + nTerminusEdges;
     if (path_idx >= d_counters[7]) {
         return;
     }
@@ -605,13 +602,12 @@ fit_segments(float4* d_sp_params, int* d_output_graph, int2* d_path_store,
     if (length < minLevel) {
         return;
     }
-	int qual = 0;
-	if(toggle) {
-		qual = static_cast<int>(seed_extraction_params.qual_scale * state2.m_J);
-	}
-	else {
-		qual = static_cast<int>(seed_extraction_params.qual_scale * state1.m_J);
-	}
+    int qual = 0;
+    if (toggle) {
+        qual = static_cast<int>(seed_extraction_params.qual_scale * state2.m_J);
+    } else {
+        qual = static_cast<int>(seed_extraction_params.qual_scale * state1.m_J);
+    }
     int prop_idx = atomicAdd(&d_counters[8], 1);
     // perform first round of bidding for disambiguation
     // only on the outermost edge