Commit Graph

87 Commits (96e4e31eeb728c89a971b63a140506ddce3c0305)

Author SHA1 Message Date
Kevin P. Fleming 96e4e31eeb Merged revisions 207647 via svnmerge from
16 years ago
Kevin P. Fleming 6c5987811c Redesigned 'optional API' support.
17 years ago
Eliel C. Sardanons 5d8d1545d8 Do not add say.o in a separate line.
17 years ago
Eliel C. Sardanons 7ef2d7bca7 Filter the say.o object, it is being added later.
17 years ago
Eliel C. Sardanons 43dcf1001b Simplify the Makefile and avoid needing to specify each object file.
17 years ago
Russell Bryant cba19c8a67 Convert the ast_channel data structure over to the astobj2 framework.
17 years ago
Tilghman Lesher 8f28bfc63e Merged revisions 187300-187301 via svnmerge from
17 years ago
Joshua Colp 63de834395 Merge in the RTP engine API.
17 years ago
Russell Bryant 0bdd99ad64 Merged revisions 182810 via svnmerge from
17 years ago
Kevin P. Fleming ab3e9ddad1 Merged revisions 182808 via svnmerge from
17 years ago
Joshua Colp 4c9ab0df8c Merge phase 1 support for the new bridging architecture.
17 years ago
Steve Murphy b5a8a85d35 Merged revisions 177540 via svnmerge from
17 years ago
Russell Bryant bb03ef8d47 Add an implementation of the heap data structure.
17 years ago
Tilghman Lesher c8223fc957 Merge ast_str_opaque branch (discontinue usage of ast_str internals)
17 years ago
Kevin P. Fleming 9a7c28cd5a we can now build with -Wformat=2, which found a couple of real bugs
17 years ago
Eliel C. Sardanons 23adb8e509 Move all the XML documentation API from pbx.c to xmldoc.c.
17 years ago
Sean Bright bc1629a9e8 Fix build errors.
17 years ago
Russell Bryant 5b168ee34b Merge changes from team/group/appdocsxml
17 years ago
Kevin P. Fleming 629861a705 Merged revisions 144924-144925 via svnmerge from
17 years ago
Kevin P. Fleming 7df8b8b848 make datastore creation and destruction a generic API since it is not really channel related, and add the ability to add/find/remove datastores to manager sessions
17 years ago
Sean Bright 6cf6d9eca5 Merge in changes that allow Asterisk to be built against the Hoard
17 years ago
Mark Michelson 99db9f65b5 This commit compensates for buggy poll(2)
17 years ago
Russell Bryant c87f901cfd Remove libresample from the Asterisk source tree. It is now available in its
17 years ago
Kevin P. Fleming 9a08061ea3 Merged revisions 131921 via svnmerge from
17 years ago
Kevin P. Fleming fd4a60c459 Merged revisions 125132 via svnmerge from
18 years ago
Kevin P. Fleming 191081e45f add infrastructure so that timing source can be a loadable module... next steps are to convert channel.c and chan_iax2.c to use this new API, and to move all the DAHDI-specific timing source code into a new res_timing_dahdi module
18 years ago
Joshua Colp 5ec16b6d6b Merged revisions 116352 via svnmerge from
18 years ago
Dwayne M. Hubbard b0b72e89a8 A taskprocessor is an object that has a name, a task queue, and an event processing thread. Modules reference a taskprocessor, push tasks into the taskprocessor as needed, and unreference the taskprocessor when the taskprocessor is no longer needed.
18 years ago
Joshua Colp b7b2e732f0 Merged revisions 112711 via svnmerge from
18 years ago
Terry Wilson e727d15d34 Replace minimime with superior GMime library so that the entire contents of an http post are not read into memory.
18 years ago
Kevin P. Fleming c7eebb3db8 Merged revisions 107408 via svnmerge from
18 years ago
Kevin P. Fleming 79c3038ee5 Merged revisions 107352 via svnmerge from
18 years ago
Tilghman Lesher 7d564048ed Merged revisions 104868 via svnmerge from
18 years ago
Russell Bryant 793edbecd0 Merged revisions 100932 via svnmerge from
18 years ago
Jason Parker 3bd33214b9 Move code from res_features into (new file) main/features.c
18 years ago
Russell Bryant b995c78c31 Merge changes from team/group/sip-tcptls
18 years ago
Steve Murphy 33fadcc67c Merged revisions 97849 via svnmerge from
18 years ago
Russell Bryant 54bc2c20b6 Now that the version.h file was getting properly regenerated every time the svn
18 years ago
Russell Bryant 6cfd6009b1 For some odd reason, the last set of libresample build changes from Kevin did
18 years ago
Kevin P. Fleming 04a10c145b go back to including libresample in the main Asterisk binary, but this time including a small hack to ensure that it does get linked in (and also modify the strip_nonapi script to leave the resample_<foo> symbols alone)
18 years ago
Russell Bryant 78f4b28552 Instead of linking libresample into the main Asterisk binary, build it as
18 years ago
Russell Bryant 21cb767db7 Merge changes from team/russell/codec_resample
18 years ago
Russell Bryant adf3b12e55 Fix a silly little typo :)
18 years ago
Mark Michelson c52d8a1cd5 Merged revisions 90735 via svnmerge from
18 years ago
Luigi Rizzo a7a0ca9f93 initial makefile changes to build loadable modules under cygwin
18 years ago
Luigi Rizzo a9395206f9 conditional targets for building the windows version
18 years ago
Luigi Rizzo 7cd78079ae more cygwin/mingw32 compatibility fixes
18 years ago
Luigi Rizzo 5862c55451 use poll as detected by configure
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
Luigi Rizzo b80dc41707 Move the last instance of AST_LIBS to the only place it is used,
18 years ago