summaryrefslogtreecommitdiffstats
blob: 0a25befae12af42cdefde0cab2ae5fa744f7586b (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
/*
 * Copyright (c) 2010 Remko Tronçon
 * Licensed under the GNU General Public License v3.
 * See Documentation/Licenses/GPLv3.txt for more information.
 */

#include <Swiften/Disco/JIDDiscoInfoResponder.h>
#include <Swiften/Queries/IQRouter.h>
#include <Swiften/Elements/DiscoInfo.h>

namespace Swift {

JIDDiscoInfoResponder::JIDDiscoInfoResponder(IQRouter* router) : GetResponder<DiscoInfo>(router) {
}

void JIDDiscoInfoResponder::clearDiscoInfo(const JID& jid) {
	info.erase(jid);
}

void JIDDiscoInfoResponder::setDiscoInfo(const JID& jid, const DiscoInfo& discoInfo) {
	JIDDiscoInfoMap::iterator i = info.insert(std::make_pair(jid, JIDDiscoInfo())).first;
	i->second.discoInfo = discoInfo;
}

void JIDDiscoInfoResponder::setDiscoInfo(const JID& jid, const std::string& node, const DiscoInfo& discoInfo) {
	JIDDiscoInfoMap::iterator i = info.insert(std::make_pair(jid, JIDDiscoInfo())).first;
	DiscoInfo newInfo(discoInfo);
	newInfo.setNode(node);
	i->second.nodeDiscoInfo[node] = newInfo;
}

bool JIDDiscoInfoResponder::handleGetRequest(const JID& from, const JID& to, const std::string& id, boost::shared_ptr<DiscoInfo> discoInfo) {
	JIDDiscoInfoMap::const_iterator i = info.find(to);
	if (i != info.end()) {
		if (discoInfo->getNode().empty()) {
			sendResponse(from, to, id, boost::shared_ptr<DiscoInfo>(new DiscoInfo(i->second.discoInfo)));
		}
		else {
			std::map<std::string,DiscoInfo>::const_iterator j = i->second.nodeDiscoInfo.find(discoInfo->getNode());
			if (j != i->second.nodeDiscoInfo.end()) {
				sendResponse(from, to, id, boost::shared_ptr<DiscoInfo>(new DiscoInfo(j->second)));
			}
			else {
				sendError(from, to, id, ErrorPayload::ItemNotFound, ErrorPayload::Cancel);
			}
		}
	}
	else {
		sendError(from, to, id, ErrorPayload::ItemNotFound, ErrorPayload::Cancel);
	}
	return true;
}

}