summaryrefslogtreecommitdiffstats
path: root/tdeio/kssl/ksslx509map.cc
blob: 7896fdfcff76b0ba2e41de396b2b5e22af548b87 (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
/* This file is part of the KDE project
 *
 * Copyright (C) 2000 George Staikos <staikos@kde.org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public License
 * along with this library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA.
 */

#include "ksslx509map.h"
#include <tqstringlist.h>
#include <tqregexp.h>

KSSLX509Map::KSSLX509Map(const TQString& name) {
  parse(name);
}


KSSLX509Map::~KSSLX509Map() {

}


void KSSLX509Map::setValue(const TQString& key, const TQString& value) {
	m_pairs.replace(key, value);
}


TQString KSSLX509Map::getValue(const TQString& key) const {
	if (!m_pairs.contains(key)) {
		return TQString::null;
	}

	return m_pairs[key];
}

static TQStringList tokenizeBy(const TQString& str, const TQRegExp& tok, bool keepEmpties = false) {
TQStringList tokens;
unsigned int head, tail;
const char *chstr = str.ascii();
unsigned int length = str.length();
 
	if (length < 1) {
		return tokens;
	}

	if (length == 1) {
		tokens.append(str);
		return tokens;
	}

	for(head = 0, tail = 0; tail < length-1; head = tail+1) {
		TQString thisline;

		tail = str.find(tok, head);

		if (tail > length)           // last token - none at end
			tail = length;

		if (tail-head > 0 || keepEmpties) {    // it has to be at least 1 long!
			thisline = &(chstr[head]);
			thisline.truncate(tail-head);
			tokens.append(thisline);
		}
	}
	return tokens;
}


void KSSLX509Map::parse(const TQString& name) {
TQStringList vl = tokenizeBy(name, TQRegExp("/[A-Za-z]+="), false);

	m_pairs.clear();

	for (TQStringList::Iterator j = vl.begin(); j != vl.end(); ++j) {
		TQStringList apair = tokenizeBy(*j, TQRegExp("="), false);
		if (m_pairs.contains(apair[0])) {
			TQString oldValue = m_pairs[apair[0]];
			oldValue += "\n";
			oldValue += apair[1];
			m_pairs.replace(apair[0], oldValue);
		} else {
			m_pairs.insert(apair[0], apair[1]);
		}
	}
}


void KSSLX509Map::reset(const TQString& name) {
	parse(name);
}