- Some reindentation. Nothing interesting, just syntax.

src/cost.c

@@ -12,7 +12,8 @@
 // Private methods
 //************************************************************************
 
-int selfInitiator(const System sys, const int run)
+int
+selfInitiator (const System sys, const int run)
 {
   int self_initiator;
 
@@ -47,7 +48,8 @@ int selfInitiator(const System sys, const int run)
 }
 
 //! Count the number of any self-initiators
-int selfInitiators(const System sys)
+int
+selfInitiators (const System sys)
 {
   int count;
   int run;
@@ -77,14 +79,15 @@ int selfInitiators(const System sys)
  *
  * A lower value (closer to 0) is a more feasible attack.
  */
-int attackCost(const System sys)
+int
+attackCost (const System sys)
 {
   int cost;
 
   cost = 0;
 
-  cost += get_semitrace_length();
-  cost += 5 * selfInitiators(sys);
+  cost += get_semitrace_length ();
+  cost += 5 * selfInitiators (sys);
 
   return cost;
 }

src/cost.h

@@ -1,6 +1,6 @@
 #ifndef COST
 #define COST
 
-int attackCost(const System sys);
+int attackCost (const System sys);
 
 #endif

src/dotout.c

@@ -349,7 +349,8 @@ dotSemiState (const System sys)
   // Third, the intruder node (if needed)
   if (from_intruder_count > 0)
     {
-      eprintf ("\tintruder [label=\"Initial intruder knowledge\", color=red];\n");
+      eprintf
+	("\tintruder [label=\"Initial intruder knowledge\", color=red];\n");
     }
 
   // Fourth, all ranking info
@@ -413,4 +414,3 @@ dotSemiState (const System sys)
   // close graph
   eprintf ("};\n\n");
 }
-

src/output.c

@@ -609,7 +609,7 @@ graphNode (const System sys)
   // Print step 
   printf ("%i:", sys->runs[run].step - 1);
 
-  if (rd->type == CLAIM && (!isRunTrusted(sys,run)))
+  if (rd->type == CLAIM && (!isRunTrusted (sys, run)))
     {
       printf ("Skip claim in #%i\"", run);
     }