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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
// load_sortpolicy.cc
//
// Copyright (C) 2001, 2005 Daniel Burrows
//
// This program 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.
//
// This program 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; see the file COPYING. If not, write to
// the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// Loads sorting policies -- similar to grouping policies. (in fact, I did
// this with cut&paste, and think maybe I should consider trying to share
// code between the two parsers..)
#include "load_sortpolicy.h"
#include <string>
#include <vector>
#include <map>
#include <ctype.h>
#include <apt-pkg/error.h>
#include "aptitude.h"
#include "pkg_sortpolicy.h"
using namespace std;
typedef vector<string> arglist;
typedef pkg_sortpolicy * (*pkg_sortpolicy_parser)(const arglist &,
pkg_sortpolicy *,
bool);
typedef map<string, pkg_sortpolicy_parser> parser_map;
pkg_sortpolicy *parse_name_policy(const arglist &args,
pkg_sortpolicy *chain,
bool reversed)
{
if(args.size()>0)
{
_error->Error(_("By-name sorting policies take no arguments"));
return NULL;
}
return pkg_sortpolicy_name(chain, reversed);
}
pkg_sortpolicy *parse_ver_policy(const arglist &args,
pkg_sortpolicy *chain,
bool reversed)
{
if(args.size() > 0)
{
_error->Error(_("By-version sorting policies take no arguments"));
return NULL;
}
return pkg_sortpolicy_ver(chain, reversed);
}
pkg_sortpolicy *parse_installsize_policy(const arglist &args,
pkg_sortpolicy *chain,
bool reversed)
{
if(args.size()>0)
{
_error->Error(_("By-installed size sorting policies take no arguments"));
return NULL;
}
return pkg_sortpolicy_installed_size(chain, reversed);
}
pkg_sortpolicy *parse_priority_policy(const arglist &args,
pkg_sortpolicy *chain,
bool reversed)
{
if(args.size()>0)
{
_error->Error(_("By-priority sorting policies take no arguments"));
return NULL;
}
return pkg_sortpolicy_priority(chain, reversed);
}
static parser_map parse_types;
static void init_parse_types()
{
static bool initted_parse_types=false;
if(!initted_parse_types)
{
parse_types["name"]=parse_name_policy;
parse_types["version"] = parse_ver_policy;
parse_types["installsize"]=parse_installsize_policy;
parse_types["priority"]=parse_priority_policy;
initted_parse_types=true;
}
}
struct parse_atom
{
string name;
arglist args;
bool reversed;
parse_atom():reversed(false) {}
};
// Parses a chain of sorting policies from the given string and returns them.
pkg_sortpolicy *parse_sortpolicy(string s)
{
init_parse_types();
typedef vector<parse_atom> temp_parse_list;
temp_parse_list parsed;
string::size_type i=0;
while(i<s.size())
{
parse_atom current;
if(s[i]=='~')
{
current.reversed=true;
i++;
}
// Find the first name. Use tolower for nice case-insensitivity.
while(i<s.size() && s[i]!=',' && s[i]!='(')
current.name+=tolower(s[i++]);
if(current.name.size()==0)
{
_error->Error(_("Invalid zero-length sorting policy name"));
return NULL;
}
if(i<s.size() && s[i]=='(') // Parse argument list
{
while(i<s.size() && s[i]!=')')
{
++i; // Clear out the leading '(' or ','
string curarg;
while(i<s.size() && s[i]!=',' && s[i]!=')')
curarg+=s[i++];
current.args.push_back(curarg);
}
if(!(i<s.size() && s[i]==')')) // Unexpected EOT, bail
{
_error->Error(_("Unmatched '(' in sorting policy description"));
return NULL;
}
++i; // Clear out the ')'
}
parsed.push_back(current);
// Ew, takes kinda long. Probably not an issue now, but creating current
// as a new item in parsed would be faster.
if(i<s.size() && s[i]==',')
i++; // Clear out trailing commas.
}
// Now run through the parsed stuff from back-to-front and instantiate it.
pkg_sortpolicy *rval=NULL;
temp_parse_list::reverse_iterator j=parsed.rbegin();
while(j!=parsed.rend())
{
// Look up the parse function
parser_map::iterator found=parse_types.find(j->name);
// Die gracefully if it's bad.
if(found==parse_types.end())
{
_error->Error(_("Invalid sorting policy type '%s'"),
j->name.c_str());
delete rval;
return NULL;
}
// Apply it to the argument list
pkg_sortpolicy *new_rval=found->second(j->args,
rval,
j->reversed);
// Check for failure
if(!new_rval)
{
delete rval;
return NULL;
}
rval=new_rval;
++j;
}
return rval;
}
|
