← Back to branch summary

~snaggen/rhythmbox/bpm

« back to all changes in this revision

Viewing changes to rhythmdb/rhythmdb-query-model.c

  • Committer: James Livingston
  • Author(s): James Livingston
  • Date: 2007-11-25 07:24:57 UTC
  • Revision ID: git-v1:b15d7482ba708af8778d80e83ec24fc7eb5c503b
fix some memory leaks. patch partially by John Daiker.

2007-11-25  James Livingston  <doclivingston@gmail.com>

        * bindings/python/rb.defs:
        * metadata/rb-metadata-dbus-service.c: (main):
        * plugins/rb-plugins-engine.c: (rb_plugins_engine_load),
        (rb_plugins_engine_load_cb):
        * plugins/sample-vala/rb-sample-vala-plugin.vala:
        * plugins/visualizer/rb-visualizer-plugin.c: (get_vis_plugin_list):
        * shell/rb-shell.c: (rb_shell_finalize), (construct_widgets):
        * shell/rb-tray-icon.c: (rb_tray_icon_init):
        * tools/massif.sh:
        * widgets/rb-entry-view.c: (rb_entry_view_get_sorting_type):
        * widgets/rb-entry-view.h: fix some memory leaks. patch partially by
        John Daiker.

svn path=/trunk/; revision=5456

Show diffs side-by-side

added added

removed removed

Lines of Context:
rhythmdb/rhythmdb-query-model.c
1323
1323
        }
1324
1324
 
1325
1325
        length = g_sequence_get_length (model->priv->entries);
1326
 
        reorder_map = malloc (length * sizeof(gint));
 
1326
        reorder_map = g_malloc (length * sizeof(gint));
1327
1327
 
1328
1328
        if (new_pos > old_pos) {
1329
1329
                /* it has mover further down the list */
1352
1352
                                       path, &iter,
1353
1353
                                       reorder_map);
1354
1354
        gtk_tree_path_free (path);
1355
 
        free (reorder_map);
 
1355
        g_free (reorder_map);
1356
1356
        return TRUE;
1357
1357
}
1358
1358
 
2152
2152
 
2153
2153
        length = g_sequence_get_length (new_entries);
2154
2154
        /* generate resort map and rebuild reverse map */
2155
 
        reorder_map = malloc (length * sizeof(gint));
 
2155
        reorder_map = g_malloc (length * sizeof(gint));
2156
2156
 
2157
2157
        ptr = g_sequence_get_begin_iter (new_entries);
2158
2158
        for (i = 0; i < length; i++) {
2176
2176
                                       reorder_map);
2177
2177
 
2178
2178
        gtk_tree_path_free (path);
2179
 
        free (reorder_map);
 
2179
        g_free (reorder_map);
2180
2180
}
2181
2181
 
2182
2182
void