kenmirrors/asterisk
1
0
Fork 0
mirror of https://github.com/asterisk/asterisk.git synced 2025-09-30 10:33:13 +00:00
Code Issues Packages Projects Releases Wiki Activity

Disable the old, slow search for matching callno in chan_iax2 (but allow it to be reenabled for debugging)

Browse Source 
git-svn-id: https://origsvn.digium.com/svn/asterisk/branches/1.4@127133 65c4cc65-6c06-0410-ace0-fbb531ad65f3
This commit is contained in:
Tilghman Lesher
2008-07-01 20:25:37 +00:00
parent be6ac151e8
commit a904d0f74f
2 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
build_tools/cflags.xml
View File

@@ -13,6 +13,8 @@
</member> </member>
<member name="STATIC_BUILD" displayname="Build static binaries"> <member name="STATIC_BUILD" displayname="Build static binaries">
</member> </member>
<member name="IAX_OLD_FIND" displayname="Use the old, slow method of searching for IAX callnos">
</member>
<member name="LOADABLE_MODULES" displayname="Runtime module loading"> <member name="LOADABLE_MODULES" displayname="Runtime module loading">
<defaultenabled>yes</defaultenabled> <defaultenabled>yes</defaultenabled>
</member> </member>

2
channels/chan_iax2.c
View File

@@ -1563,6 +1563,7 @@ static int __find_callno(unsigned short callno, unsigned short dcallno, struct s
return res; return res;
} }
#ifdef IAX_OLD_FIND
/* If we get here, we SHOULD NOT find a call structure for this /* If we get here, we SHOULD NOT find a call structure for this
callno; if we do, it means that there is a call structure that callno; if we do, it means that there is a call structure that
has a peer callno but did NOT get entered into the hash table, has a peer callno but did NOT get entered into the hash table,
@@ -1601,6 +1602,7 @@ static int __find_callno(unsigned short callno, unsigned short dcallno, struct s
if (res) { if (res) {
ast_log(LOG_WARNING, "Old call search code found call number %d that was not in hash table!\n", res); ast_log(LOG_WARNING, "Old call search code found call number %d that was not in hash table!\n", res);
} }
#endif
} }
if (!res && (new >= NEW_ALLOW)) { if (!res && (new >= NEW_ALLOW)) {
int start, found = 0; int start, found = 0;