comparison lib-src/etags.c @ 95479:9588c3703f38

remove useless if-before-free tests * lib-src/ebrowse.c (xfree): Likewise. * lib-src/etags.c (process_file_name, free_tree, free_fdesc): Likewise. (popclass_above, Prolog_functions, Erlang_functions): Likewise. * lib-src/pop.c (pop_quit): Likewise. * lwlib/lwlib-Xm.c (xm_update_one_value): Likewise. * lwlib/lwlib.c (safe_free_str, free_widget_value_tree): Likewise. * src/editfns.c (Fset_time_zone_rule): Likewise. * src/lread.c (nosuffix): Likewise. * src/ralloc.c (get_bloc): Likewise. * src/regex.c (reg_free): Likewise. * src/xftfont.c (xftfont_open, xftfont_close): Likewise. * src/xrdb.c (get_user_app, get_environ_db, x_load_resources): Likewise. * src/xsmfns.c (smc_save_yourself_CB): Likewise.
author Jim Meyering <jim@meyering.net>
date Mon, 02 Jun 2008 06:00:54 +0000
parents c6d82cbe67bc
children 93f1eb58d905
comparison
equal deleted inserted replaced
95478:e21a3997eb7c 95479:9588c3703f38
1797 retval = fclose (inf); 1797 retval = fclose (inf);
1798 if (retval < 0) 1798 if (retval < 0)
1799 pfatal (file); 1799 pfatal (file);
1800 1800
1801 cleanup: 1801 cleanup:
1802 if (compressed_name) free (compressed_name); 1802 free (compressed_name);
1803 if (uncompressed_name) free (uncompressed_name); 1803 free (uncompressed_name);
1804 last_node = NULL; 1804 last_node = NULL;
1805 curfdp = NULL; 1805 curfdp = NULL;
1806 return; 1806 return;
1807 } 1807 }
1808 1808
2177 { 2177 {
2178 while (np) 2178 while (np)
2179 { 2179 {
2180 register node *node_right = np->right; 2180 register node *node_right = np->right;
2181 free_tree (np->left); 2181 free_tree (np->left);
2182 if (np->name != NULL) 2182 free (np->name);
2183 free (np->name);
2184 free (np->regex); 2183 free (np->regex);
2185 free (np); 2184 free (np);
2186 np = node_right; 2185 np = node_right;
2187 } 2186 }
2188 } 2187 }
2193 */ 2192 */
2194 static void 2193 static void
2195 free_fdesc (fdp) 2194 free_fdesc (fdp)
2196 register fdesc *fdp; 2195 register fdesc *fdp;
2197 { 2196 {
2198 if (fdp->infname != NULL) free (fdp->infname); 2197 free (fdp->infname);
2199 if (fdp->infabsname != NULL) free (fdp->infabsname); 2198 free (fdp->infabsname);
2200 if (fdp->infabsdir != NULL) free (fdp->infabsdir); 2199 free (fdp->infabsdir);
2201 if (fdp->taggedfname != NULL) free (fdp->taggedfname); 2200 free (fdp->taggedfname);
2202 if (fdp->prop != NULL) free (fdp->prop); 2201 free (fdp->prop);
2203 free (fdp); 2202 free (fdp);
2204 } 2203 }
2205 2204
2206 /* 2205 /*
2207 * add_node () 2206 * add_node ()
2842 2841
2843 for (nl = cstack.nl - 1; 2842 for (nl = cstack.nl - 1;
2844 nl >= 0 && cstack.bracelev[nl] >= bracelev; 2843 nl >= 0 && cstack.bracelev[nl] >= bracelev;
2845 nl--) 2844 nl--)
2846 { 2845 {
2847 if (cstack.cname[nl] != NULL) 2846 free (cstack.cname[nl]);
2848 free (cstack.cname[nl]);
2849 cstack.nl = nl; 2847 cstack.nl = nl;
2850 } 2848 }
2851 } 2849 }
2852 2850
2853 static void 2851 static void
5519 allocated = len + 1; 5517 allocated = len + 1;
5520 strncpy (last, cp, len); 5518 strncpy (last, cp, len);
5521 last[len] = '\0'; 5519 last[len] = '\0';
5522 } 5520 }
5523 } 5521 }
5524 if (last != NULL) 5522 free (last);
5525 free (last);
5526 } 5523 }
5527 5524
5528 5525
5529 static void 5526 static void
5530 prolog_skip_comment (plb, inf) 5527 prolog_skip_comment (plb, inf)
5698 allocated = len + 1; 5695 allocated = len + 1;
5699 strncpy (last, cp, len); 5696 strncpy (last, cp, len);
5700 last[len] = '\0'; 5697 last[len] = '\0';
5701 } 5698 }
5702 } 5699 }
5703 if (last != NULL) 5700 free (last);
5704 free (last);
5705 } 5701 }
5706 5702
5707 5703
5708 /* 5704 /*
5709 * A function definition is added if it matches: 5705 * A function definition is added if it matches: