Hi all, as you probably know, dynafiles keep a cache of the n most recently used files open. This is done in order to speed up processing. I wonder how many files you usually expect to be open. The root of my question is that I think about the algorithm that finds cache entries. So far, a simple linked list is used, but I wonder if something more efficient (like a binary tree) would be useful. On the other hand, if the cache size is really small, there is not much difference between O(n) and O(log n), so it may not justify added code complexity.
Feedback appreciated. Rainer _______________________________________________ rsyslog mailing list http://lists.adiscon.net/mailman/listinfo/rsyslog http://www.rsyslog.com
