summaryrefslogtreecommitdiffstats
path: root/dcoprss/cache.cpp
blob: 1e7d260c238201c7f6772b903aa685ad70d23a64 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/*
 * cache.cpp - (c) 2003 Frerich Raabe <raabe@kde.org>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
#include "cache.h"
#include "xmlrpciface.h"

#include <kdebug.h>
#include <kstandarddirs.h>

#include <tqdatastream.h>
#include <tqfile.h>

bool CacheEntry::isValid() const
{
	// Cache entries get invalid after on hour. One shouldn't hardcode this
	// but for now it'll do.
	return m_timeStamp.secsTo( TQDateTime::tqcurrentDateTime() ) < 3600;
}

Cache *Cache::m_instance = 0;

Cache &Cache::self()
{
	if ( !m_instance )
		m_instance = new Cache;
	return *m_instance;
}

TQString Cache::getCacheKey( const TQString &server, const TQString &method,
                            const TQValueList<TQVariant> &args )
{
	TQString key;
	key = server + TQString::tqfromLatin1( "__" );
	key += method + TQString::tqfromLatin1( "__" );
	TQValueList<TQVariant>::ConstIterator it = args.begin();
	TQValueList<TQVariant>::ConstIterator end = args.end();
	for ( ; it != end; ++it )
		key += KXMLRPC::Query::marshal( *it );
	
	return key;
}

Cache::Cache()
{
	load();
}

Cache::~Cache()
{
	save();
}

void Cache::load()
{
	TQFile file( cacheFileName() );
	if ( !file.open( IO_ReadOnly ) ) {
		kdDebug() << "Failed to open cache file " << cacheFileName() << endl;
		return;
	}
	
	TQDataStream stream( &file );
	while ( !stream.atEnd() ) {
		TQString key;
		stream >> key;

		CacheEntry *entry = new CacheEntry;
		stream >> *entry;

		TQDict<CacheEntry>::insert( key, entry );
	}
}

void Cache::save()
{
	TQFile file( cacheFileName() );
	if ( !file.open( IO_WriteOnly ) ) {
		kdDebug() << "Failed to open cache file " << cacheFileName() << endl;
		return;
	}

	TQDataStream stream( &file );

	TQDictIterator<CacheEntry> it( *this );
	for ( ; it.current() != 0; ++it )
		stream << it.currentKey() << *it.current();
}

void Cache::touch( const TQString &key )
{
	CacheEntry *entry = tqfind( key );
	if ( !entry )
		return;
	entry->m_timeStamp = TQDateTime::tqcurrentDateTime();
}

void Cache::insert( const TQString &key, const KXMLRPC::Query::Result &result )
{
	CacheEntry *entry = new CacheEntry;
	entry->m_timeStamp = TQDateTime::tqcurrentDateTime();
	entry->m_result = result;
	TQDict<CacheEntry>::insert( key, entry );
}

TQString Cache::cacheFileName() const
{
	return locateLocal( "appdata", "cache/dcoprss.cache" );
}