tzafrir/asterisk

作者	SHA1 備註	提交日期
Corey Farrell	009b11dd8c Improved and portable ast_log recursion avoidance	10 年之前
Walter Doekes	811197a149 core: Don't allow free to mean ast_free (and malloc, etc..).	10 年之前
Richard Mudgett	6a79e2ab6b Fix utilities compilation/linking.	11 年之前
Kevin P. Fleming	53e80b252d Multiple revisions 369001-369002	12 年之前
Tilghman Lesher	710dc7501c Add MALLOC_DEBUG to various utility APIs, so that memory leaks can be tracked back to their source.	16 年之前
Sean Bright	957d5e86c5 Trailing whitespace, minor coding guideline fixes, and start beefing up the	16 年之前
Tilghman Lesher	0910306b2a Add additional memory debugging to several core APIs, and fix several memory	16 年之前
Brett Bryant	ed13697aac Fix magic Revision keywords in hashtab.c and change cdr_radius.c to use	16 年之前
Russell Bryant	71fa991b04 Make it so you don't have to cast away const in a couple places	17 年之前
Russell Bryant	851528b742 remove unnecessary casts	17 年之前
Steve Murphy	95bed295e8 A small fix from snuffy	17 年之前
Steve Murphy	cff758e1a4 closes issue #11356; Many thanks to snuffy for his code review and changes to cut down duplication. I tested this against hashtest, and it passes. I reviewed the changes, and they look reasonable. I had to remove a few const decls to make things compile on my workstation,	17 年之前
Luigi Rizzo	ff8ac85d1a remove a bunch of useless #include "options.h"	17 年之前
Steve Murphy	215a74e563 closes issue #11265; Thanks to snuffy for his work on neatening up the code and removing duplicated code.	17 年之前
Luigi Rizzo	dcb25c2a5c another bunch of include removals (errno.h and asterisk/logger.h)	17 年之前
Luigi Rizzo	47e70077d6 Start untangling header inclusion in a way that does not affect	17 年之前
Russell Bryant	c7d686b6c4 Fix up various coding guidelines issues ...	17 年之前
Steve Murphy	dd58007216 Thanks to snuff-work, who brought up that these fixes might need to be made.	17 年之前
Steve Murphy	63e27e79fb This is the perhaps the biggest, boldest, most daring change I've ever committed to trunk. Forgive me in advance any disruption this may cause, and please, report any problems via the bugtracker. The upside is that this can speed up large dialplans by 20 times (or more). Context, extension, and priority matching are all fairly constant-time searches. I introduce here my hashtables (hashtabs), and a regression for them. I would have used the ast_obj2 tables, but mine are resizeable, and don't need the object destruction capability. The hashtab stuff is well tested and stable. I introduce a data structure, a trie, for extension pattern matching, in which knowledge of all patterns is accumulated, and all matches can be found via a single traversal of the tree. This is per-context. The trie is formed on the first lookup attempt, and stored in the context for future lookups. Destruction routines are in place for hashtabs and the pattern match trie. You can see the contents of the pattern match trie by using the 'dialplan show' cli command when 'core set debug' has been done to put it in debug mode. The pattern tree traversal only traverses those parts of the tree that are interesting. It uses a scoreboard sort of approach to find the best match. The speed of the traversal is more a function of the length of the pattern than the number of patterns in the tree. The tree also contains the CID matching patterns. See the source code comments for details on how everything works. I believe the approach general enough that any issues that might come up involving fine points in the pattern matching algorithm, can be solved by just tweaking things. We shall see. The current pattern matcher is fairly involved, and replicating every nuance of it is difficult. If you find and report problems, I will try to resolve than as quickly as I can. The trie and hashtabs are added to the existing context and exten structs, and none of the old machinery has been removed for the sake of the multitude of functions that use them. In the future, we can (maybe) weed out the linked lists and save some space.	17 年之前

提交歷史 查找

提交歷史