Fork 0
Commit Graph

2 Commits

Author SHA1 Message Date
Harald Welte 18a74f3e38 dynamically allocate hash table buckets based on init() call
we probably should move to a more tree-like data structure than a hash
table.  But well, lookup is not the most computationally expensive part
compared to the cryptographic operations.
2012-09-14 22:09:42 +02:00
Harald Welte bfe531b549 initial import of a minimalistic AUC (authentication center) core 2012-09-14 11:11:42 +02:00