Asterisk
/
asterisk
mirror of https://github.com/asterisk/asterisk
1
0
Fork 0
Code Issues Releases Wiki Activity
34101 Commits
140 Branches
1555 Tags
334 MiB
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Commit Graph

26 Commits (master)

Author SHA1 Message Date
Richard Mudgett c711e4076a core: Remove ABI effects of MALLOC_DEBUG.
7 years ago
Corey Farrell 841ac3ded6 hashtab: Use ast_free.
8 years ago
Corey Farrell a6e5bae3ef Remove ASTERISK_REGISTER_FILE.
9 years ago
Corey Farrell 55ccdf93c3 Fix checks for allocation debugging.
9 years ago
Joshua Colp a1fcf6f7b2 hashtab: Add NULL check when destroying iterator.
10 years ago
Corey Farrell 478fb4a388 MALLOC_DEBUG: Replace WRAP_LIBC_MALLOC with ASTMM_LIBC.
10 years ago
Matt Jordan 4a58261694 git migration: Refactor the ASTERISK_FILE_VERSION macro
10 years ago
Corey Farrell 28e3bd0af7 Improved and portable ast_log recursion avoidance
10 years ago
Walter Doekes 37179a2b1f core: Don't allow free to mean ast_free (and malloc, etc..).
11 years ago
Richard Mudgett a847e65b2c Fix utilities compilation/linking.
12 years ago
Kevin P. Fleming 166b4e2b30 Multiple revisions 369001-369002
13 years ago
Tilghman Lesher bfc0d3b795 Add MALLOC_DEBUG to various utility APIs, so that memory leaks can be tracked back to their source.
16 years ago
Sean Bright 935185ce8a Trailing whitespace, minor coding guideline fixes, and start beefing up the
16 years ago
Tilghman Lesher d5837ba8c2 Add additional memory debugging to several core APIs, and fix several memory
17 years ago
Brett Bryant 86e5bb8b7d Fix magic Revision keywords in hashtab.c and change cdr_radius.c to use
17 years ago
Russell Bryant 7205c1f23c Make it so you don't have to cast away const in a couple places
17 years ago
Russell Bryant 83002989a9 remove unnecessary casts
17 years ago
Steve Murphy 72cafad6a2 A small fix from snuffy
18 years ago
Steve Murphy d3209e2ef2 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,
18 years ago
Luigi Rizzo e0ff5fef5c remove a bunch of useless #include "options.h"
18 years ago
Steve Murphy 4670e38aac closes issue #11265; Thanks to snuffy for his work on neatening up the code and removing duplicated code.
18 years ago
Luigi Rizzo 9335ace850 another bunch of include removals (errno.h and asterisk/logger.h)
18 years ago
Luigi Rizzo fdb7f7ba3d Start untangling header inclusion in a way that does not affect
18 years ago
Russell Bryant d3414c7552 Fix up various coding guidelines issues ...
18 years ago
Steve Murphy fd1fbb0223 Thanks to snuff-work, who brought up that these fixes might need to be made.
18 years ago
Steve Murphy a897556f7f 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.
18 years ago