Mercurial > pidgin
comparison src/gtkimhtml.c @ 12229:18f0dadb29cf
[gaim-migrate @ 14531]
SF Patch #1366481 from Michael Carlson
"The function gtk_smiley_tree_insert() in gtkimhtml.c is
using up (on my system) the most CPU of all the
functions in gaim whenever the preferences box is
opened (tested by opening the preferences box 50 times
and measuring with oprofile).
The function is called some 297 times each time the
prefs box is opened, and each time we call strlen() on
a (usually 3 or 4) character string to see if the
string is empty or not.
I've eliminated the unnecessary call to strlen by
checking the first element, and I've changed the while
{} loop to a do {} while loop, because since we return
if the string is empty at the beginning of the
function, the same check on the first iteration of the
loop is unnecessary.
I believe it's faster for every case, even if only by a
little bit."
I don't know how necessary this is, but it doesn't hurt and it doesn't negatively impact the readability of the code.
I also fixed an existing piece of code for which the compiler issued a warning.
committer: Tailor Script <tailor@pidgin.im>
author | Richard Laager <rlaager@wiktel.com> |
---|---|
date | Sat, 26 Nov 2005 17:09:29 +0000 |
parents | 1f8bab186e80 |
children | 423323aa0dbe |
comparison
equal
deleted
inserted
replaced
12228:f28e51bf9be8 | 12229:18f0dadb29cf |
---|---|
332 GtkIMHtmlSmiley *smiley) | 332 GtkIMHtmlSmiley *smiley) |
333 { | 333 { |
334 GtkSmileyTree *t = tree; | 334 GtkSmileyTree *t = tree; |
335 const gchar *x = smiley->smile; | 335 const gchar *x = smiley->smile; |
336 | 336 |
337 if (!strlen (x)) | 337 if (!(*x)) |
338 return; | 338 return; |
339 | 339 |
340 while (*x) { | 340 do { |
341 gchar *pos; | 341 gchar *pos; |
342 gint index; | 342 gint index; |
343 | 343 |
344 if (!t->values) | 344 if (!t->values) |
345 t->values = g_string_new (""); | 345 t->values = g_string_new (""); |
354 index = GPOINTER_TO_INT(pos) - GPOINTER_TO_INT(t->values->str); | 354 index = GPOINTER_TO_INT(pos) - GPOINTER_TO_INT(t->values->str); |
355 | 355 |
356 t = t->children [index]; | 356 t = t->children [index]; |
357 | 357 |
358 x++; | 358 x++; |
359 } | 359 } while (*x); |
360 | 360 |
361 t->image = smiley; | 361 t->image = smiley; |
362 } | 362 } |
363 | 363 |
364 | 364 |
367 { | 367 { |
368 GSList *list = g_slist_prepend (NULL, tree); | 368 GSList *list = g_slist_prepend (NULL, tree); |
369 | 369 |
370 while (list) { | 370 while (list) { |
371 GtkSmileyTree *t = list->data; | 371 GtkSmileyTree *t = list->data; |
372 gint i; | 372 gsize i; |
373 list = g_slist_remove(list, t); | 373 list = g_slist_remove(list, t); |
374 if (t && t->values) { | 374 if (t && t->values) { |
375 for (i = 0; i < t->values->len; i++) | 375 for (i = 0; i < t->values->len; i++) |
376 list = g_slist_prepend (list, t->children [i]); | 376 list = g_slist_prepend (list, t->children [i]); |
377 g_string_free (t->values, TRUE); | 377 g_string_free (t->values, TRUE); |