Changeset 35 for trunk/src/kmk/suff.c

Timestamp:

Mar 18, 2003, 4:58:49 AM (22 years ago)

Author:

bird

Message:

emx is kind of working again...

File:

• trunk/src/kmk/suff.c (modified) (13 diffs)

trunk/src/kmk/suff.c

@@ -137 +137 @@
     struct _Src     *parent;    /* The Src for which this is a source */
     GNode           *node;      /* The node describing the file */
-    int             children;   /* Count of existing children (so we don't free
+    int             children;   /* Count of existing children (so we don't efree
                                  * this thing too early or never nuke it) */
 #ifdef DEBUG_SRC
@@ -359 +359 @@
     Lst_Destroy (s->searchPath, Dir_Destroy);
 
-    free ((Address)s->name);
-    free ((Address)s);
+    efree ((Address)s->name);
+    efree ((Address)s);
 }
 
@@ -614 +614 @@
          * New specification for transformation rule. Just nuke the old list
          * of commands so they can be filled in again... We don't actually
-         * free the commands themselves, because a given command can be
+         * efree the commands themselves, because a given command can be
          * attached to several different transformations.
          */
@@ -905 +905 @@
 
     Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL);
-    free(ptr);
+    efree(ptr);
     Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL);
-    free(ptr);
+    efree(ptr);
 
     Lst_Destroy(inIncludes, Dir_Destroy);
@@ -1081 +1081 @@
  *
  * Side Effects:
- *      The memory is free'd.
+ *      The memory is efree'd.
  *----------------------------------------------------------------------
  */
@@ -1105 +1105 @@
         s = (Src *) Lst_Datum (ln);
         if (s->children == 0) {
-            free ((Address)s->file);
+            efree ((Address)s->file);
             if (!s->parent)
-                free((Address)s->pref);
+                efree((Address)s->pref);
             else {
 #ifdef DEBUG_SRC
@@ -1117 +1117 @@
             }
 #ifdef DEBUG_SRC
-            printf("free: [l=%x] p=%x %d\n", l, s, s->children);
+            printf("efree: [l=%x] p=%x %d\n", l, s, s->children);
             Lst_Destroy(s->cp, NOFREE);
 #endif
             Lst_Remove(l, ln);
-            free ((Address)s);
+            efree ((Address)s);
             t |= 1;
             Lst_Close(l);
@@ -1187 +1187 @@
             printf("remove %x from %x\n", s, srcs);
 #endif
-            free(ptr);
+            efree(ptr);
             break;
         }
@@ -1268 +1268 @@
                      * Hot Damn! Create a new Src structure to describe
                      * this transformation (making sure to duplicate the
-                     * source node's name so Suff_FindDeps can free it
+                     * source node's name so Suff_FindDeps can efree it
                      * again (ick)), and return the new structure.
                      */
@@ -1401 +1401 @@
 
                         if (doFree) {
-                            free(junk);
+                            efree(junk);
                         }
                     } else if (*cp == '\\' && *cp != '\0') {
@@ -1444 +1444 @@
              * Free the result
              */
-            free((char *)cp);
+            efree((char *)cp);
         }
         /*
@@ -1603 +1603 @@
     tname = str_concat(s->name, t->name, 0);
     ln = Lst_Find(transforms, (ClientData)tname, SuffGNHasNameP);
-    free(tname);
+    efree(tname);
 
     if (ln == NILLNODE) {
@@ -2354 +2354 @@
  *
  * Side Effects:
- *      The memory is free'd.
+ *      The memory is efree'd.
  *----------------------------------------------------------------------
  */