Mercurial > pidgin.yaz
view src/protocols/zephyr/ZMakeAscii.c @ 12233:02833a0ae716
[gaim-migrate @ 14535]
SF Patch #1367116 from Michael Carlson
"In profiling gaim, I noticed that on simply starting
CVS gaim, xmlnode_insert_child is using up by far the
most CPU time. After some testing, I realized the
reason why: xmlnode_insert_child is called some 18,000
times on startup, and it is inserting the child at the
end of the list each time, simply by traversing through
the entire linked list. Sometimes this list can have as
many as 800 elements.
This patch adds a variable to the _xmlnode struct,
lastchild, which simply keeps track of the last node in
the list of children. This is then used by
xmlnode_insert_child to insert at the end of the list,
instead of traversing through the whole list each time.
The two relevant functions in xmlnode.c that need to be
updated to keep track of this function appropriately
have been updated.
Running 3 times with and without the change, the
results from oprofile say it all. Here are the measured
number of clock cycles / % of total clock cycles /
function used to simply start and close gaim before the
change:
204 60.7143 xmlnode_insert_child
210 61.4035 xmlnode_insert_child
230 61.8280 xmlnode_insert_child
And after (note that one time no clock cycles were
caught at all)
3 2.5862 xmlnode_insert_child
3 2.5641 xmlnode_insert_child
This affects other areas of the program than just
starting up, but this seems to be the most noticeable
place."
Speed is good. As I was verifying this patch, I added some g_return_val_if_fail() checks.
committer: Tailor Script <tailor@pidgin.im>
author | Richard Laager <rlaager@wiktel.com> |
---|---|
date | Sun, 27 Nov 2005 03:42:39 +0000 |
parents | 26e316f9e136 |
children |
line wrap: on
line source
/* This file is part of the Project Athena Zephyr Notification System. * It contains source for the ZMakeAscii function. * * Created by: Robert French * * Copyright (c) 1987 by the Massachusetts Institute of Technology. * For copying and distribution information, see the file * "mit-copyright.h". */ #include "internal.h" static char *itox_chars = "0123456789ABCDEF"; Code_t ZMakeAscii(ptr, len, field, num) register char *ptr; int len; unsigned char *field; int num; { int i; for (i=0;i<num;i++) { /* we need to add "0x" if we are between 4 byte pieces */ if ((i & 3) == 0) { if (len < (i?4:3)) return ZERR_FIELDLEN; /* except at the beginning, put a space in before the "0x" */ if (i) { *ptr++ = ' '; len--; } *ptr++ = '0'; *ptr++ = 'x'; len -= 2; } if (len < 3) return ZERR_FIELDLEN; *ptr++ = itox_chars[(int) (field[i] >> 4)]; *ptr++ = itox_chars[(int) (field[i] & 0xf)]; len -= 2; } *ptr = '\0'; return ZERR_NONE; } Code_t ZMakeAscii32(ptr, len, value) register char *ptr; int len; unsigned long value; { if (len < 11) return ZERR_FIELDLEN; *ptr++ = '0'; *ptr++ = 'x'; *ptr++ = itox_chars[(value >> 28) & 0xf]; *ptr++ = itox_chars[(value >> 24) & 0xf]; *ptr++ = itox_chars[(value >> 20) & 0xf]; *ptr++ = itox_chars[(value >> 16) & 0xf]; *ptr++ = itox_chars[(value >> 12) & 0xf]; *ptr++ = itox_chars[(value >> 8) & 0xf]; *ptr++ = itox_chars[(value >> 4) & 0xf]; *ptr++ = itox_chars[(value >> 0) & 0xf]; *ptr = 0; return ZERR_NONE; } Code_t ZMakeAscii16(ptr, len, value) register char *ptr; int len; unsigned int value; { if (len < 7) return ZERR_FIELDLEN; *ptr++ = '0'; *ptr++ = 'x'; *ptr++ = itox_chars[(value >> 12) & 0xf]; *ptr++ = itox_chars[(value >> 8) & 0xf]; *ptr++ = itox_chars[(value >> 4) & 0xf]; *ptr++ = itox_chars[(value >> 0) & 0xf]; *ptr = 0; return ZERR_NONE; }