Mercurial > hg > dmlib

changeset 2277:026c3aa0e48f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Rename two functions.
author Matti Hamalainen <ccr@tnsp.org>
date Tue, 18 Jun 2019 12:11:16 +0300
parents b613715bb57a
children 40ccc09f09be
files tools/xm2jss.c
diffstat 1 files changed, 4 insertions(+), 4 deletions(-) [+]
line wrap: on
line diff
--- a/tools/xm2jss.c	Tue Jun 18 12:10:21 2019 +0300
+++ b/tools/xm2jss.c	Tue Jun 18 12:11:16 2019 +0300
@@ -783,7 +783,7 @@
 
 /* Check if two given patterns are dupes
  */
-BOOL comparePattern(const JSSPattern *pat1, const JSSPattern *pat2)
+BOOL jssComparePattern(const JSSPattern *pat1, const JSSPattern *pat2)
 {
     return
         pat1->nrows     == pat2->nrows &&
@@ -794,7 +794,7 @@
 
 /* Optimize a given module
  */
-JSSModule *optimizeModule(JSSModule *m)
+JSSModule *jssOptimizeModule(JSSModule *m)
 {
     BOOL usedPatterns[jsetMaxPatterns + 1],
          usedInstruments[jsetMaxInstruments + 1],
@@ -951,7 +951,7 @@
         for (int pat2 = 0; pat2 < m->npatterns; pat2++)
         if (pat1 != pat2 && m->patterns[pat2] != NULL &&
             dupPatterns[pat2] == jsetNotSet &&
-            comparePattern(m->patterns[pat1], m->patterns[pat2]))
+            jssComparePattern(m->patterns[pat1], m->patterns[pat2]))
         {
             dmPrint(1, " * %d and %d are dupes.\n", pat1, pat2);
             dupPatterns[pat2] = pat1;
@@ -1252,7 +1252,7 @@
     if (optOptimize)
     {
         dmMsg(1, "Optimizing module data...\n");
-        dm = optimizeModule(sm);
+        dm = jssOptimizeModule(sm);
     } else
         dm = sm;