Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | Use a bool return value in keymat_v1_t.get_hash_phase2() | Martin Willi | 2012-07-16 | 3 | -31/+29 | |
| | ||||||
* | Add a return value to keymat_v1_t.get_hash() | Martin Willi | 2012-07-16 | 4 | -17/+35 | |
| | ||||||
* | Add a return value to keymat_v2_t.get_auth_octets() | Martin Willi | 2012-07-16 | 3 | -17/+24 | |
| | ||||||
* | Add a return value to keymat_v2_t.get_psk_sig() | Martin Willi | 2012-07-16 | 4 | -24/+39 | |
| | ||||||
* | Add a return value to prf_t.get_bytes() | Martin Willi | 2012-07-16 | 1 | -9/+19 | |
| | ||||||
* | prf_plus_create() can return NULL on failure | Martin Willi | 2012-07-16 | 2 | -0/+20 | |
| | ||||||
* | Add a return value to prf_plus_t.allocate_bytes() | Martin Willi | 2012-07-16 | 2 | -17/+76 | |
| | ||||||
* | Add a return value to signer_t.set_key() | Martin Willi | 2012-07-16 | 2 | -5/+16 | |
| | ||||||
* | Add a return value to simaka_crypto_t.derive_keys_*() | Martin Willi | 2012-07-16 | 4 | -27/+59 | |
| | ||||||
* | Add a return value to radius_message_t.sign() | Martin Willi | 2012-07-16 | 2 | -11/+17 | |
| | ||||||
* | Add a return value to simaka_message_t.generate() | Martin Willi | 2012-07-16 | 4 | -85/+257 | |
| | ||||||
* | Add a return value to aead_t.set_key() | Martin Willi | 2012-07-16 | 2 | -3/+12 | |
| | ||||||
* | Add a return value to aead_t.encrypt() | Martin Willi | 2012-07-16 | 2 | -3/+12 | |
| | ||||||
* | Don't modify the message string passed to logger, as it gets reused | Martin Willi | 2012-07-13 | 7 | -35/+40 | |
| | ||||||
* | Log to a malloc()ed buffer if the on-stack buffer is not large enough | Martin Willi | 2012-07-13 | 1 | -3/+23 | |
| | ||||||
* | Pass opaque data to printf hooks and print_in_hook() | Martin Willi | 2012-07-13 | 2 | -15/+15 | |
| | ||||||
* | Simplify NAT-D payload creation if UDP encapsulation is forced | Tobias Brunner | 2012-07-13 | 1 | -2/+2 | |
| | | | | | We don't need any address lookups in that case as the content of the payload is generated randomly anyway. | |||||
* | updated Copyright info | Andreas Steffen | 2012-07-13 | 6 | -6/+6 | |
| | ||||||
* | restrict PA-TNC messages to maximum size | Andreas Steffen | 2012-07-12 | 4 | -12/+43 | |
| | ||||||
* | Avoid that any % characters (e.g. in %any) are evaluated when logging via stroke | Tobias Brunner | 2012-07-12 | 1 | -1/+1 | |
| | ||||||
* | removed unused variables | Andreas Steffen | 2012-07-11 | 1 | -2/+0 | |
| | ||||||
* | fixed logging of unsupported TNCCS version | Andreas Steffen | 2012-07-11 | 1 | -1/+1 | |
| | ||||||
* | PB-TNC Client sends empty CLOSE batch only in DECIDED state | Andreas Steffen | 2012-07-11 | 1 | -10/+23 | |
| | ||||||
* | have_recommendation() accepts NULL arguments | Andreas Steffen | 2012-07-11 | 1 | -4/+12 | |
| | ||||||
* | send empty SDATA batch if no recommendation is available yet, but in order ↵ | Andreas Steffen | 2012-07-11 | 4 | -3/+58 | |
| | | | | to avoid loops only if no empty CDATA batch was received | |||||
* | moved batch size calculation into pb_tnc_batch_t | Andreas Steffen | 2012-07-11 | 4 | -31/+50 | |
| | ||||||
* | make maximum PB-TNC batch size configurable | Andreas Steffen | 2012-07-11 | 1 | -2/+11 | |
| | ||||||
* | limit the size of a PB-TNC batch to the maximum EAP-TNC packet size | Andreas Steffen | 2012-07-11 | 10 | -88/+134 | |
| | ||||||
* | eliminate message length field in EAP-TNC | Andreas Steffen | 2012-07-11 | 2 | -2/+2 | |
| | ||||||
* | due to single fragment, total length does not have to be included | Andreas Steffen | 2012-07-11 | 1 | -3/+1 | |
| | ||||||
* | EAP-TNC does not support fragmentation | Andreas Steffen | 2012-07-11 | 1 | -12/+14 | |
| | ||||||
* | Send cert request based on peers configured authentication class | Martin Willi | 2012-07-10 | 1 | -3/+30 | |
| | ||||||
* | Don't send CERTREQs when initiating aggressive mode PSK | Martin Willi | 2012-07-09 | 1 | -0/+4 | |
| | ||||||
* | Refactored heavily #ifdefd capability code to its own libstrongswan class | Martin Willi | 2012-07-04 | 10 | -123/+19 | |
| | ||||||
* | Use spin locks to update IKE_SAs in controller_t | Tobias Brunner | 2012-07-04 | 1 | -4/+38 | |
| | | | | | | This ensures the listeners don't miss any events after the SAs have been checked out in the asynchronously executed jobs. This is a matter of memory visibility and not primary a matter of exclusive access. | |||||
* | Fixed job handling in controller_t | Tobias Brunner | 2012-07-04 | 1 | -110/+128 | |
| | | | | Also IKE_SAs are now checked out in the jobs and not before. | |||||
* | As a responder, don't start a TRANSACTION request if we expect one from the ↵ | Martin Willi | 2012-06-29 | 2 | -2/+4 | |
| | | | | initiator | |||||
* | IMCs and IMVs might depend on X.509 certificates or trusted public keys | Andreas Steffen | 2012-06-28 | 2 | -0/+4 | |
| | ||||||
* | Show some uname() info in "ipsec statusall" | Martin Willi | 2012-06-28 | 1 | -3/+10 | |
| | ||||||
* | libcharon also requires kernel interfaces and a socket implementation | Tobias Brunner | 2012-06-27 | 1 | -0/+3 | |
| | ||||||
* | Defer quick mode initiation if we expect a mode config request | Martin Willi | 2012-06-27 | 1 | -1/+20 | |
| | ||||||
* | Queue a mode config task as responder if we need a virtual IP | Martin Willi | 2012-06-27 | 2 | -4/+16 | |
| | ||||||
* | Add basic support for XAuth responder authentication | Martin Willi | 2012-06-27 | 2 | -8/+10 | |
| | ||||||
* | Map XAuth responder authentication methods between IKEv1 and IKEv2 | Martin Willi | 2012-06-27 | 1 | -1/+13 | |
| | ||||||
* | Show remote EAP/XAuth identity in "statusall" on a separate line | Martin Willi | 2012-06-27 | 1 | -1/+12 | |
| | ||||||
* | Use static plugin features in libcharon to define essential dependencies | Tobias Brunner | 2012-06-27 | 1 | -1/+10 | |
| | ||||||
* | Ignore a received %any virtual IP for installation | Martin Willi | 2012-06-26 | 1 | -1/+2 | |
| | ||||||
* | Also build charon's IKEv1 implementation on Android | Tobias Brunner | 2012-06-26 | 1 | -0/+23 | |
| | ||||||
* | Missing source file added to libcharon's Android.mk | Tobias Brunner | 2012-06-26 | 1 | -0/+1 | |
| | ||||||
* | Make rescheduling a job more predictable | Tobias Brunner | 2012-06-25 | 2 | -12/+5 | |
| | | | | | | | | | | | | | This avoids race conditions between calls to cancel() and jobs that like to be rescheduled. If jobs were able to reschedule themselves it would theoretically be possible that two worker threads have the same job assigned (the one currently executing the job and the one executing the same but rescheduled job if it already is time to execute it), this means that cancel() could be called twice for that job. Creating a new job based on the current one and reschedule that is also OK, but rescheduling itself is more efficient for jobs that need to be executed often. |