unity: Reference IKE_SAs by the IKEv1 COOKIEs, improving lookup performance

When handling thousands of IKE_SAs, the unique ID based lookup is rather slow,
as we have no indexing.
This commit is contained in:
Martin Willi
2015-02-20 13:34:52 +01:00
parent db80d0d2da
commit fa42367ca1
3 changed files with 17 additions and 14 deletions
+12 -10
View File
@@ -50,8 +50,8 @@ struct private_unity_handler_t {
* Traffic selector entry for networks to include under a given IKE_SA * Traffic selector entry for networks to include under a given IKE_SA
*/ */
typedef struct { typedef struct {
/** associated IKE_SA, unique ID */ /** associated IKE_SA COOKIEs */
u_int32_t sa; ike_sa_id_t *id;
/** traffic selector to include/exclude */ /** traffic selector to include/exclude */
traffic_selector_t *ts; traffic_selector_t *ts;
} entry_t; } entry_t;
@@ -61,6 +61,7 @@ typedef struct {
*/ */
static void entry_destroy(entry_t *this) static void entry_destroy(entry_t *this)
{ {
this->id->destroy(this->id);
this->ts->destroy(this->ts); this->ts->destroy(this->ts);
free(this); free(this);
} }
@@ -131,9 +132,10 @@ static bool add_include(private_unity_handler_t *this, chunk_t data)
while (list->remove_first(list, (void**)&ts) == SUCCESS) while (list->remove_first(list, (void**)&ts) == SUCCESS)
{ {
INIT(entry, INIT(entry,
.sa = ike_sa->get_unique_id(ike_sa), .id = ike_sa->get_id(ike_sa),
.ts = ts, .ts = ts,
); );
entry->id = entry->id->clone(entry->id);
this->mutex->lock(this->mutex); this->mutex->lock(this->mutex);
this->include->insert_last(this->include, entry); this->include->insert_last(this->include, entry);
@@ -171,7 +173,7 @@ static bool remove_include(private_unity_handler_t *this, chunk_t data)
enumerator = this->include->create_enumerator(this->include); enumerator = this->include->create_enumerator(this->include);
while (enumerator->enumerate(enumerator, &entry)) while (enumerator->enumerate(enumerator, &entry))
{ {
if (entry->sa == ike_sa->get_unique_id(ike_sa) && if (entry->id->equals(entry->id, ike_sa->get_id(ike_sa)) &&
ts->equals(ts, entry->ts)) ts->equals(ts, entry->ts))
{ {
this->include->remove_at(this->include, enumerator); this->include->remove_at(this->include, enumerator);
@@ -209,8 +211,7 @@ static job_requeue_t add_exclude_async(entry_t *entry)
char name[128]; char name[128];
host_t *host; host_t *host;
ike_sa = charon->ike_sa_manager->checkout_by_id(charon->ike_sa_manager, ike_sa = charon->ike_sa_manager->checkout(charon->ike_sa_manager, entry->id);
entry->sa);
if (ike_sa) if (ike_sa)
{ {
create_shunt_name(ike_sa, entry->ts, name, sizeof(name)); create_shunt_name(ike_sa, entry->ts, name, sizeof(name));
@@ -267,9 +268,10 @@ static bool add_exclude(private_unity_handler_t *this, chunk_t data)
while (list->remove_first(list, (void**)&ts) == SUCCESS) while (list->remove_first(list, (void**)&ts) == SUCCESS)
{ {
INIT(entry, INIT(entry,
.sa = ike_sa->get_unique_id(ike_sa), .id = ike_sa->get_id(ike_sa),
.ts = ts, .ts = ts,
); );
entry->id = entry->id->clone(entry->id);
/* we can't install the shunt policy yet, as we don't know the virtual IP. /* we can't install the shunt policy yet, as we don't know the virtual IP.
* Defer installation using an async callback. */ * Defer installation using an async callback. */
@@ -402,7 +404,7 @@ typedef struct {
/** mutex to unlock */ /** mutex to unlock */
mutex_t *mutex; mutex_t *mutex;
/** IKE_SA ID to filter for */ /** IKE_SA ID to filter for */
u_int32_t id; ike_sa_id_t *id;
} include_filter_t; } include_filter_t;
/** /**
@@ -411,7 +413,7 @@ typedef struct {
static bool include_filter(include_filter_t *data, static bool include_filter(include_filter_t *data,
entry_t **entry, traffic_selector_t **ts) entry_t **entry, traffic_selector_t **ts)
{ {
if ((*entry)->sa == data->id) if (data->id->equals(data->id, (*entry)->id))
{ {
*ts = (*entry)->ts; *ts = (*entry)->ts;
return TRUE; return TRUE;
@@ -429,7 +431,7 @@ static void destroy_filter(include_filter_t *data)
} }
METHOD(unity_handler_t, create_include_enumerator, enumerator_t*, METHOD(unity_handler_t, create_include_enumerator, enumerator_t*,
private_unity_handler_t *this, u_int32_t id) private_unity_handler_t *this, ike_sa_id_t *id)
{ {
include_filter_t *data; include_filter_t *data;
+3 -2
View File
@@ -21,6 +21,7 @@
#ifndef UNITY_HANDLER_H_ #ifndef UNITY_HANDLER_H_
#define UNITY_HANDLER_H_ #define UNITY_HANDLER_H_
#include <sa/ike_sa_id.h>
#include <attributes/attribute_handler.h> #include <attributes/attribute_handler.h>
typedef struct unity_handler_t unity_handler_t; typedef struct unity_handler_t unity_handler_t;
@@ -38,11 +39,11 @@ struct unity_handler_t {
/** /**
* Create an enumerator over Split-Include attributes received for an IKE_SA. * Create an enumerator over Split-Include attributes received for an IKE_SA.
* *
* @param id IKE_SA unique ID to get Split-Includes for * @param id IKE_SA ID to get Split-Includes for
* @return enumerator over traffic_selector_t* * @return enumerator over traffic_selector_t*
*/ */
enumerator_t* (*create_include_enumerator)(unity_handler_t *this, enumerator_t* (*create_include_enumerator)(unity_handler_t *this,
u_int32_t id); ike_sa_id_t *id);
/** /**
* Destroy a unity_handler_t. * Destroy a unity_handler_t.
+2 -2
View File
@@ -75,7 +75,7 @@ static void narrow_initiator(private_unity_narrow_t *this, ike_sa_t *ike_sa,
enumerator_t *enumerator; enumerator_t *enumerator;
enumerator = this->handler->create_include_enumerator(this->handler, enumerator = this->handler->create_include_enumerator(this->handler,
ike_sa->get_unique_id(ike_sa)); ike_sa->get_id(ike_sa));
while (enumerator->enumerate(enumerator, &current)) while (enumerator->enumerate(enumerator, &current))
{ {
if (orig == NULL) if (orig == NULL)
@@ -159,7 +159,7 @@ static bool has_split_includes(private_unity_narrow_t *this, ike_sa_t *ike_sa)
bool has; bool has;
enumerator = this->handler->create_include_enumerator(this->handler, enumerator = this->handler->create_include_enumerator(this->handler,
ike_sa->get_unique_id(ike_sa)); ike_sa->get_id(ike_sa));
has = enumerator->enumerate(enumerator, &ts); has = enumerator->enumerate(enumerator, &ts);
enumerator->destroy(enumerator); enumerator->destroy(enumerator);