aboutsummaryrefslogtreecommitdiffstats
path: root/src/libstrongswan/collections
Commit message (Collapse)AuthorAgeFilesLines
* array: Fix compilation on FreeBSDTobias Brunner2014-02-131-2/+2
|
* array: Add fallback for qsort_r using thread-local valueTobias Brunner2014-02-122-2/+46
| | | | Cygwin for example does not support qsort_r.
* array: Add array_bsearch functionTobias Brunner2014-02-122-0/+75
|
* array: Add array_sort functionTobias Brunner2014-02-122-1/+77
|
* array: Add an array_get() functionMartin Willi2014-01-222-1/+26
|
* array: Number of items in get_size() is unsignedTobias Brunner2013-07-251-1/+1
| | | | | | Otherwise, array->esize is promoted to int and if array->esize * num results in a value > 0x7fffffff the return value would be incorrect due the implicit sign extension when getting cast to size_t.
* Fix various API doc issues and typosTobias Brunner2013-07-181-2/+3
| | | | Partially based on an old patch by Adrian-Ken Rueegsegger.
* hashtable: add common hashtable hash/equals functions for pointer/string keysMartin Willi2013-07-182-3/+68
|
* linked-list: Remove barely used has_more() methodTobias Brunner2013-07-172-20/+0
| | | | | | | | This required some refactoring when handling encrypted payloads. Also changed log messages so that "encrypted payload" is logged instead of "encryption payload" (even if we internally still call it that) as that's the name used in RFC 5996.
* linked-list: Don't require an argument for the item when enumeratingTobias Brunner2013-07-171-1/+4
|
* linked-list: Remove unused clone_function() methodTobias Brunner2013-07-172-24/+0
|
* linked-list: Remove barely used find_last() methodTobias Brunner2013-07-172-44/+0
|
* linked-list: Remove unused replace() methodTobias Brunner2013-07-172-25/+0
| | | | | | Its functionality can be replicated by calling insert_before() followed by remove_at(). Not the other way around, though, because remove_at() changes the enumerator position.
* array: introduce an array collection storing elements very efficientlyMartin Willi2013-07-172-0/+610
| | | | | | | | | | | | | | | | | | | | | | | | | | Currently we use the very versatile linked-list collection to store elements with variable count. This is fine, but very inefficient: Due to the many methods in the linked list, on 64-bit platforms an empty list alone is more than 200 bytes. As we currently have about 50 lists per IKE_SA/CHILD_SA pair, this takes up to 10KB just for managing the empty lists. This is about the half of memory used by an IKE_SA/CHILD_SA pair, and obviously way too much. The new array type is not an object, but a collection of functions on an abstract type. The following lists are per IKE_SA and should be considered for a replacement with more efficient arrays (this uses load-testers on-demand created dynamic configurations, other scenarios have different lists): 14 -> ike_sa_create() @ src/libcharon/sa/ike_sa.c:2198 10 -> auth_cfg_create() @ src/libstrongswan/credentials/auth_cfg.c:1088 6 -> task_manager_v2_create() @ src/libcharon/sa/ikev2/task_manager_v2.c:1505 6 -> proposal_create() @ src/libcharon/config/proposal.c:592 5 -> peer_cfg_create() @ src/libcharon/config/peer_cfg.c:657 4 -> child_sa_create() @ src/libcharon/sa/child_sa.c:1090 2 -> child_cfg_create() @ src/libcharon/config/child_cfg.c:536 1 -> ike_cfg_create() @ src/libcharon/config/ike_cfg.c:330 1 -> put_connected_peers() @ src/libcharon/sa/ike_sa_manager.c:854
* Remove dead code in token enumeratorTobias Brunner2013-06-111-12/+2
| | | | | | Since we always search for the nearest separator (and strip them from the front of the next token) there can't be any separators left at the end of a token.
* Some minor Doxygen fixes for linked_list_tTobias Brunner2013-06-111-2/+5
|
* Moved utils.[ch] to utils folderTobias Brunner2012-10-241-1/+1
|
* Moved debug.[ch] to utils folderTobias Brunner2012-10-241-1/+1
|
* Moved data structures to new collections subfolderTobias Brunner2012-10-248-0/+2461