6 Jan
2005
6 Jan
'05
2:18 p.m.
On Thu, 6 Jan 2005 21:18:17 +0800 "Yu Zenghui" <yuzenghui@people.com.cn> wrote:
hello all: it seems that dillo doesn't use cache replace algorithms. it simply inserts new entry into the hash table. then if the program runs for a long time, it will use more and more memories. doesn't it?
exactly. there's a patch that i've been using for years, it's perfectly stable (but i'm not sure if it applies cleanly to current versions): http://lists.auriga.wearlab.de/pipermail/dillo-dev/2003-January/000073.html - Thorben