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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
/* -*- mode: C++; c-file-style: "gnu" -*-
qgpgmeprogresstokenmapper.cpp
This file is part of libkleopatra, the KDE keymanagement library
Copyright (c) 2004 Klar�lvdalens Datakonsult AB
Libkleopatra is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
Libkleopatra 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
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
In addition, as a special exception, the copyright holders give
permission to link the code of this program with any edition of
the TQt library by Trolltech AS, Norway (or with modified versions
of TQt that use the same license as TQt), and distribute linked
combinations including the two. You must obey the GNU General
Public License in all respects for all of the code used other than
TQt. If you modify this file, you may extend this exception to
your version of the file, but you are not obligated to do so. If
you do not wish to do so, delete this exception statement from
your version.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "qgpgmeprogresstokenmapper.h"
#include <klocale.h>
#include <tqstring.h>
#include <assert.h>
#include <map>
struct Desc {
int type; // 0 == fallback
const char * display; // add %1 for useCur ^ useTot and %1 %2 for useCur == useTot == true
bool useCur : 1;
bool useTot : 1;
};
static const struct Desc pk_dsa[] = {
{ 0, I18N_NOOP("Generating DSA key..."), false, false }
};
static const struct Desc pk_elg[] = {
{ 0, I18N_NOOP("Generating ElGamal key..."), false, false }
};
static const struct Desc primegen[] = {
// FIXME: add all type's?
{ 0, I18N_NOOP("Searching for a large prime number..."), false, false }
};
static const struct Desc need_entropy[] = {
{ 0, I18N_NOOP("Waiting for new entropy from random number generator (you might want to exercise the harddisks or move the mouse)..."), false, false }
};
static const struct Desc tick[] = {
{ 0, I18N_NOOP("Please wait..."), false, false }
};
static const struct Desc starting_agent[] = {
{ 0, I18N_NOOP("Starting gpg-agent (you should consider starting a global instance instead)..."), false, false }
};
static const struct {
const char * token;
const Desc * desc;
unsigned int numDesc;
} tokens[] = {
#define make_token(x) { #x, x, sizeof(x) / sizeof(*x) }
make_token(pk_dsa),
make_token(pk_elg),
make_token(primegen),
make_token(need_entropy),
make_token(tick),
make_token(starting_agent)
#undef make_token
};
Kleo::QGpgMEProgressTokenMapper * Kleo::QGpgMEProgressTokenMapper::mSelf = 0;
const Kleo::QGpgMEProgressTokenMapper * Kleo::QGpgMEProgressTokenMapper::instance() {
if ( !mSelf )
(void) new QGpgMEProgressTokenMapper();
return mSelf;
}
Kleo::QGpgMEProgressTokenMapper::QGpgMEProgressTokenMapper() {
mSelf = this;
}
Kleo::QGpgMEProgressTokenMapper::~QGpgMEProgressTokenMapper() {
mSelf = 0;
}
typedef std::map< TQString, std::map<int,Desc> > Map;
static const Map & makeMap() { // return a reference to a static to avoid copying
static Map map;
for ( unsigned int i = 0 ; i < sizeof tokens / sizeof *tokens ; ++i ) {
assert( tokens[i].token );
const TQString token = TQString::fromLatin1( tokens[i].token ).lower();
for ( unsigned int j = 0 ; j < tokens[i].numDesc ; ++j ) {
const Desc & desc = tokens[i].desc[j];
assert( desc.display );
map[ token ][ desc.type ] = desc;
}
}
return map;
}
TQString Kleo::QGpgMEProgressTokenMapper::map( const char * tokenUtf8, int subtoken, int cur, int tot ) const {
if ( !tokenUtf8 || !*tokenUtf8 )
return TQString();
if ( qstrcmp( tokenUtf8, "file:" ) == 0 )
return TQString(); // gpgme's job
return map( TQString::fromUtf8( tokenUtf8 ), subtoken, cur, tot );
}
TQString Kleo::QGpgMEProgressTokenMapper::map( const TQString & token, int subtoken, int cur, int tot ) const {
if ( token.startsWith( "file:" ) )
return TQString(); // gpgme's job
static const Map & tokenMap = makeMap();
const Map::const_iterator it1 = tokenMap.find( token.lower() );
if ( it1 == tokenMap.end() )
return token;
std::map<int,Desc>::const_iterator it2 = it1->second.find( subtoken );
if ( it2 == it1->second.end() )
it2 = it1->second.find( 0 );
if ( it2 == it1->second.end() )
return token;
const Desc & desc = it2->second;
TQString result = i18n( desc.display );
if ( desc.useCur )
result = result.arg( cur );
if ( desc.useTot )
result = result.arg( tot );
return result;
}
|
