Changed multi-line C comments into another style.

The left side doesn't look unbalanced.

src/ca65/span.c

@@ -61,9 +61,9 @@ static const void* HT_GetKey (const void* Entry);
 
 static int HT_Compare (const void* Key1, const void* Key2);
 /* Compare two keys. The function must return a value less than zero if
- * Key1 is smaller than Key2, zero if both are equal, and a value greater
- * than zero if Key1 is greater then Key2.
- */
+** Key1 is smaller than Key2, zero if both are equal, and a value greater
+** than zero if Key1 is greater then Key2.
+*/
 
 
 
@@ -113,9 +113,9 @@ static const void* HT_GetKey (const void* Entry)
 
 static int HT_Compare (const void* Key1, const void* Key2)
 /* Compare two keys. The function must return a value less than zero if
- * Key1 is smaller than Key2, zero if both are equal, and a value greater
- * than zero if Key1 is greater then Key2.
- */
+** Key1 is smaller than Key2, zero if both are equal, and a value greater
+** than zero if Key1 is greater then Key2.
+*/
 {
     /* Convert both parameters to Span pointers */
     const Span* S1 = Key1;
@@ -144,8 +144,8 @@ static int HT_Compare (const void* Key1, const void* Key2)
 
 static Span* NewSpan (Segment* Seg, unsigned long Start, unsigned long End)
 /* Create a new span. The segment is set to Seg, Start and End are set to the
- * current PC of the segment.
- */
+** current PC of the segment.
+*/
 {
     /* Allocate memory */
     Span* S = xmalloc (sizeof (Span));
@@ -174,13 +174,13 @@ static void FreeSpan (Span* S)
 
 static Span* MergeSpan (Span* S)
 /* Check if we have a span with the same data as S already. If so, free S and
- * return the already existing one. If not, remember S and return it.
- */
+** return the already existing one. If not, remember S and return it.
+*/
 {
     /* Check if we have such a span already. If so use the existing
-     * one and free the one from the collection. If not, add the one to
-     * the hash table and return it.
-     */
+    ** one and free the one from the collection. If not, add the one to
+    ** the hash table and return it.
+    */
     Span* E = HT_Find (&SpanTab, S);
     if (E) {
         /* If S has a type and E not, move the type */
@@ -223,9 +223,9 @@ Span* OpenSpan (void)
 
 Span* CloseSpan (Span* S)
 /* Close the given span. Be sure to replace the passed span by the one
- * returned, since the span will get deleted if it is empty or may be
- * replaced if a duplicate exists.
- */
+** returned, since the span will get deleted if it is empty or may be
+** replaced if a duplicate exists.
+*/
 {
     /* Set the end offset */
     if (S->Start == S->Seg->PC) {
@@ -237,9 +237,9 @@ Span* CloseSpan (Span* S)
         S->End = S->Seg->PC;
 
         /* Check if we have such a span already. If so use the existing
-         * one and free the one from the collection. If not, add the one to
-         * the hash table and return it.
-         */
+        ** one and free the one from the collection. If not, add the one to
+        ** the hash table and return it.
+        */
         return MergeSpan (S);
     }
 }
@@ -248,9 +248,9 @@ Span* CloseSpan (Span* S)
 
 void OpenSpanList (Collection* Spans)
 /* Open a list of spans for all existing segments to the given collection of
- * spans. The currently active segment will be inserted first with all others
- * following.
- */
+** spans. The currently active segment will be inserted first with all others
+** following.
+*/
 {
     unsigned I;
 
@@ -275,8 +275,8 @@ void OpenSpanList (Collection* Spans)
 
 void CloseSpanList (Collection* Spans)
 /* Close a list of spans. This will add new segments to the list, mark the end
- * of existing ones, and remove empty spans from the list.
- */
+** of existing ones, and remove empty spans from the list.
+*/
 {
     unsigned I, J;
 
@@ -385,9 +385,9 @@ void WriteSpans (void)
             CHECK (S->End > S->Start);
 
             /* Write data for the span We will write the size instead of the
-             * end offset to save some bytes, since most spans are expected
-             * to be rather small.
-             */
+            ** end offset to save some bytes, since most spans are expected
+            ** to be rather small.
+            */
             ObjWriteVar (S->Seg->Num);
             ObjWriteVar (S->Start);
             ObjWriteVar (S->End - S->Start);