From e612d165d3ed7d49e60e7f7a9d0beb7922cdd773 Mon Sep 17 00:00:00 2001 From: Jean-Francois Dockes Date: Sun, 8 May 2011 08:06:58 +0200 Subject: [PATCH] comments --- src/utils/circache.cpp | 12 ++++++------ src/utils/circache.h | 4 ---- 2 files changed, 6 insertions(+), 10 deletions(-) diff --git a/src/utils/circache.cpp b/src/utils/circache.cpp index 00955049..d90c7169 100644 --- a/src/utils/circache.cpp +++ b/src/utils/circache.cpp @@ -1104,12 +1104,12 @@ bool CirCache::getCurrent(string& udi, string& dic, string& data) return true; } -void * -allocmem(void *cp, /* The array to grow. may be NULL */ - int sz, /* Unit size in bytes */ - int *np, /* Pointer to current allocation number */ - int min, /* Number to allocate the first time */ - int maxinc) /* Maximum increment */ +static void *allocmem( + void *cp, /* The array to grow. may be NULL */ + int sz, /* Unit size in bytes */ + int *np, /* Pointer to current allocation number */ + int min, /* Number to allocate the first time */ + int maxinc) /* Maximum increment */ { if (cp == 0) { cp = malloc(min * sz); diff --git a/src/utils/circache.h b/src/utils/circache.h index e2b11a58..ae8fb757 100644 --- a/src/utils/circache.h +++ b/src/utils/circache.h @@ -34,10 +34,6 @@ * * It is assumed that the dictionary are small (they are routinely read/parsed) * - * A problem with this approach is that repetitively storing the same - * object will evict all others. This could be somewhat optimized by reusing - * the last entry if it has the same udi as the one written, but not done - * currently. */ #include