]> git.saurik.com Git - apt.git/blame - apt-pkg/contrib/configuration.cc
* apt-inst/deb/debfile.h:
[apt.git] / apt-pkg / contrib / configuration.cc
CommitLineData
6c139d6e
AL
1// -*- mode: cpp; mode: fold -*-
2// Description /*{{{*/
5e14c452 3// $Id: configuration.cc,v 1.28 2004/04/30 04:00:15 mdz Exp $
6c139d6e
AL
4/* ######################################################################
5
6 Configuration Class
7
8 This class provides a configuration file and command line parser
9 for a tree-oriented configuration environment. All runtime configuration
10 is stored in here.
7da2b375
AL
11
12 This source is placed in the Public Domain, do with it what you will
13 It was originally written by Jason Gunthorpe <jgg@debian.org>.
6c139d6e
AL
14
15 ##################################################################### */
16 /*}}}*/
17// Include files /*{{{*/
ea542140
DK
18#include <config.h>
19
094a497d 20#include <apt-pkg/configuration.h>
08e8f724 21#include <apt-pkg/error.h>
cdcc6d34 22#include <apt-pkg/strutl.h>
b2e465d6 23#include <apt-pkg/fileutl.h>
6c139d6e 24
b2e465d6 25#include <vector>
b2e465d6 26#include <fstream>
851a45a8 27#include <iostream>
851a45a8 28
ea542140
DK
29#include <apti18n.h>
30
851a45a8 31using namespace std;
6c139d6e 32 /*}}}*/
9c14e3d6
AL
33
34Configuration *_config = new Configuration;
6c139d6e
AL
35
36// Configuration::Configuration - Constructor /*{{{*/
37// ---------------------------------------------------------------------
38/* */
b2e465d6 39Configuration::Configuration() : ToFree(true)
6c139d6e
AL
40{
41 Root = new Item;
b2e465d6
AL
42}
43Configuration::Configuration(const Item *Root) : Root((Item *)Root), ToFree(false)
44{
45};
46
47 /*}}}*/
48// Configuration::~Configuration - Destructor /*{{{*/
49// ---------------------------------------------------------------------
50/* */
51Configuration::~Configuration()
52{
53 if (ToFree == false)
54 return;
55
56 Item *Top = Root;
57 for (; Top != 0;)
58 {
59 if (Top->Child != 0)
60 {
61 Top = Top->Child;
62 continue;
63 }
64
65 while (Top != 0 && Top->Next == 0)
66 {
67 Item *Parent = Top->Parent;
68 delete Top;
69 Top = Parent;
70 }
71 if (Top != 0)
72 {
73 Item *Next = Top->Next;
74 delete Top;
75 Top = Next;
76 }
77 }
6c139d6e
AL
78}
79 /*}}}*/
0a8a80e5 80// Configuration::Lookup - Lookup a single item /*{{{*/
6c139d6e
AL
81// ---------------------------------------------------------------------
82/* This will lookup a single item by name below another item. It is a
83 helper function for the main lookup function */
84Configuration::Item *Configuration::Lookup(Item *Head,const char *S,
ce857f32 85 unsigned long const &Len,bool const &Create)
6c139d6e
AL
86{
87 int Res = 1;
88 Item *I = Head->Child;
89 Item **Last = &Head->Child;
9c14e3d6 90
7f25bdff
AL
91 // Empty strings match nothing. They are used for lists.
92 if (Len != 0)
93 {
94 for (; I != 0; Last = &I->Next, I = I->Next)
851a45a8 95 if ((Res = stringcasecmp(I->Tag,S,S + Len)) == 0)
7f25bdff
AL
96 break;
97 }
98 else
99 for (; I != 0; Last = &I->Next, I = I->Next);
100
6c139d6e
AL
101 if (Res == 0)
102 return I;
103 if (Create == false)
104 return 0;
105
106 I = new Item;
171c75f1 107 I->Tag.assign(S,Len);
6c139d6e 108 I->Next = *Last;
9c14e3d6 109 I->Parent = Head;
6c139d6e
AL
110 *Last = I;
111 return I;
112}
113 /*}}}*/
114// Configuration::Lookup - Lookup a fully scoped item /*{{{*/
115// ---------------------------------------------------------------------
116/* This performs a fully scoped lookup of a given name, possibly creating
117 new items */
ce857f32 118Configuration::Item *Configuration::Lookup(const char *Name,bool const &Create)
6c139d6e 119{
0a8a80e5
AL
120 if (Name == 0)
121 return Root->Child;
122
6c139d6e
AL
123 const char *Start = Name;
124 const char *End = Start + strlen(Name);
125 const char *TagEnd = Name;
126 Item *Itm = Root;
7f25bdff 127 for (; End - TagEnd >= 2; TagEnd++)
6c139d6e
AL
128 {
129 if (TagEnd[0] == ':' && TagEnd[1] == ':')
130 {
131 Itm = Lookup(Itm,Start,TagEnd - Start,Create);
132 if (Itm == 0)
133 return 0;
134 TagEnd = Start = TagEnd + 2;
135 }
136 }
137
7f25bdff
AL
138 // This must be a trailing ::, we create unique items in a list
139 if (End - Start == 0)
140 {
141 if (Create == false)
142 return 0;
143 }
144
6c139d6e 145 Itm = Lookup(Itm,Start,End - Start,Create);
6c139d6e
AL
146 return Itm;
147}
148 /*}}}*/
149// Configuration::Find - Find a value /*{{{*/
150// ---------------------------------------------------------------------
151/* */
b2e465d6 152string Configuration::Find(const char *Name,const char *Default) const
6c139d6e 153{
b2e465d6 154 const Item *Itm = Lookup(Name);
6c139d6e 155 if (Itm == 0 || Itm->Value.empty() == true)
9c14e3d6
AL
156 {
157 if (Default == 0)
171c75f1 158 return "";
9c14e3d6
AL
159 else
160 return Default;
161 }
162
6c139d6e
AL
163 return Itm->Value;
164}
165 /*}}}*/
3b5421b4 166// Configuration::FindFile - Find a Filename /*{{{*/
9c14e3d6
AL
167// ---------------------------------------------------------------------
168/* Directories are stored as the base dir in the Parent node and the
3b5421b4 169 sub directory in sub nodes with the final node being the end filename
9c14e3d6 170 */
b2e465d6 171string Configuration::FindFile(const char *Name,const char *Default) const
9c14e3d6 172{
db2cca11 173 const Item *RootItem = Lookup("RootDir");
ec76891f
DK
174 std::string result = (RootItem == 0) ? "" : RootItem->Value;
175 if(result.empty() == false && result[result.size() - 1] != '/')
176 result.push_back('/');
db2cca11 177
b2e465d6 178 const Item *Itm = Lookup(Name);
9c14e3d6
AL
179 if (Itm == 0 || Itm->Value.empty() == true)
180 {
ec76891f
DK
181 if (Default != 0)
182 result.append(Default);
9c14e3d6 183 }
ec76891f 184 else
017f9fd6 185 {
ec76891f
DK
186 string val = Itm->Value;
187 while (Itm->Parent != 0)
017f9fd6 188 {
ec76891f
DK
189 if (Itm->Parent->Value.empty() == true)
190 {
191 Itm = Itm->Parent;
192 continue;
193 }
017f9fd6 194
ec76891f
DK
195 // Absolute
196 if (val.length() >= 1 && val[0] == '/')
af13d143
DK
197 {
198 if (val.compare(0, 9, "/dev/null") == 0)
199 val.erase(9);
ec76891f 200 break;
af13d143 201 }
b2e465d6 202
ec76891f
DK
203 // ~/foo or ./foo
204 if (val.length() >= 2 && (val[0] == '~' || val[0] == '.') && val[1] == '/')
205 break;
206
207 // ../foo
208 if (val.length() >= 3 && val[0] == '.' && val[1] == '.' && val[2] == '/')
209 break;
210
211 if (Itm->Parent->Value.end()[-1] != '/')
212 val.insert(0, "/");
213
214 val.insert(0, Itm->Parent->Value);
215 Itm = Itm->Parent;
216 }
217 result.append(val);
b2e465d6
AL
218 }
219
ec76891f
DK
220 // do some normalisation by removing // and /./ from the path
221 size_t found = string::npos;
222 while ((found = result.find("/./")) != string::npos)
223 result.replace(found, 3, "/");
224 while ((found = result.find("//")) != string::npos)
225 result.replace(found, 2, "/");
226
227 return result;
9c14e3d6
AL
228}
229 /*}}}*/
3b5421b4
AL
230// Configuration::FindDir - Find a directory name /*{{{*/
231// ---------------------------------------------------------------------
232/* This is like findfile execept the result is terminated in a / */
b2e465d6 233string Configuration::FindDir(const char *Name,const char *Default) const
3b5421b4
AL
234{
235 string Res = FindFile(Name,Default);
236 if (Res.end()[-1] != '/')
af13d143
DK
237 {
238 size_t const found = Res.rfind("/dev/null");
239 if (found != string::npos && found == Res.size() - 9)
240 return Res; // /dev/null returning
3b5421b4 241 return Res + '/';
af13d143 242 }
3b5421b4
AL
243 return Res;
244}
245 /*}}}*/
50c409c4
DK
246// Configuration::FindVector - Find a vector of values /*{{{*/
247// ---------------------------------------------------------------------
248/* Returns a vector of config values under the given item */
249vector<string> Configuration::FindVector(const char *Name) const
250{
251 vector<string> Vec;
252 const Item *Top = Lookup(Name);
253 if (Top == NULL)
254 return Vec;
255
256 Item *I = Top->Child;
257 while(I != NULL)
258 {
259 Vec.push_back(I->Value);
260 I = I->Next;
261 }
262 return Vec;
263}
264 /*}}}*/
6c139d6e
AL
265// Configuration::FindI - Find an integer value /*{{{*/
266// ---------------------------------------------------------------------
267/* */
ce857f32 268int Configuration::FindI(const char *Name,int const &Default) const
6c139d6e 269{
b2e465d6 270 const Item *Itm = Lookup(Name);
6c139d6e
AL
271 if (Itm == 0 || Itm->Value.empty() == true)
272 return Default;
273
274 char *End;
275 int Res = strtol(Itm->Value.c_str(),&End,0);
276 if (End == Itm->Value.c_str())
277 return Default;
278
08e8f724
AL
279 return Res;
280}
281 /*}}}*/
282// Configuration::FindB - Find a boolean type /*{{{*/
283// ---------------------------------------------------------------------
284/* */
ce857f32 285bool Configuration::FindB(const char *Name,bool const &Default) const
08e8f724 286{
b2e465d6 287 const Item *Itm = Lookup(Name);
08e8f724
AL
288 if (Itm == 0 || Itm->Value.empty() == true)
289 return Default;
290
3b5421b4 291 return StringToBool(Itm->Value,Default);
6c139d6e
AL
292}
293 /*}}}*/
b2e465d6
AL
294// Configuration::FindAny - Find an arbitrary type /*{{{*/
295// ---------------------------------------------------------------------
296/* a key suffix of /f, /d, /b or /i calls Find{File,Dir,B,I} */
297string Configuration::FindAny(const char *Name,const char *Default) const
298{
299 string key = Name;
300 char type = 0;
301
302 if (key.size() > 2 && key.end()[-2] == '/')
303 {
304 type = key.end()[-1];
305 key.resize(key.size() - 2);
306 }
307
308 switch (type)
309 {
310 // file
311 case 'f':
312 return FindFile(key.c_str(), Default);
313
314 // directory
315 case 'd':
316 return FindDir(key.c_str(), Default);
317
318 // bool
319 case 'b':
320 return FindB(key, Default) ? "true" : "false";
321
322 // int
323 case 'i':
324 {
325 char buf[16];
cc99a102 326 snprintf(buf, sizeof(buf)-1, "%d", FindI(key, Default ? atoi(Default) : 0 ));
b2e465d6
AL
327 return buf;
328 }
329 }
330
331 // fallback
332 return Find(Name, Default);
333}
334 /*}}}*/
335// Configuration::CndSet - Conditinal Set a value /*{{{*/
336// ---------------------------------------------------------------------
337/* This will not overwrite */
171c75f1 338void Configuration::CndSet(const char *Name,const string &Value)
b2e465d6
AL
339{
340 Item *Itm = Lookup(Name,true);
341 if (Itm == 0)
342 return;
343 if (Itm->Value.empty() == true)
344 Itm->Value = Value;
345}
346 /*}}}*/
78485ab2
DK
347// Configuration::Set - Set an integer value /*{{{*/
348// ---------------------------------------------------------------------
349/* */
350void Configuration::CndSet(const char *Name,int const Value)
351{
352 Item *Itm = Lookup(Name,true);
353 if (Itm == 0 || Itm->Value.empty() == false)
354 return;
355 char S[300];
356 snprintf(S,sizeof(S),"%i",Value);
357 Itm->Value = S;
358}
359 /*}}}*/
6c139d6e
AL
360// Configuration::Set - Set a value /*{{{*/
361// ---------------------------------------------------------------------
362/* */
171c75f1 363void Configuration::Set(const char *Name,const string &Value)
6c139d6e
AL
364{
365 Item *Itm = Lookup(Name,true);
366 if (Itm == 0)
367 return;
368 Itm->Value = Value;
369}
370 /*}}}*/
371// Configuration::Set - Set an integer value /*{{{*/
372// ---------------------------------------------------------------------
373/* */
0df8c3dc 374void Configuration::Set(const char *Name,int const &Value)
6c139d6e
AL
375{
376 Item *Itm = Lookup(Name,true);
377 if (Itm == 0)
378 return;
379 char S[300];
380 snprintf(S,sizeof(S),"%i",Value);
381 Itm->Value = S;
75ef8f14
MV
382}
383 /*}}}*/
384// Configuration::Clear - Clear an single value from a list /*{{{*/
385// ---------------------------------------------------------------------
386/* */
ce857f32 387void Configuration::Clear(string const &Name, int const &Value)
75ef8f14
MV
388{
389 char S[300];
390 snprintf(S,sizeof(S),"%i",Value);
391 Clear(Name, S);
392}
393 /*}}}*/
394// Configuration::Clear - Clear an single value from a list /*{{{*/
395// ---------------------------------------------------------------------
396/* */
ce857f32 397void Configuration::Clear(string const &Name, string const &Value)
75ef8f14
MV
398{
399 Item *Top = Lookup(Name.c_str(),false);
400 if (Top == 0 || Top->Child == 0)
401 return;
402
403 Item *Tmp, *Prev, *I;
404 Prev = I = Top->Child;
405
406 while(I != NULL)
407 {
408 if(I->Value == Value)
409 {
410 Tmp = I;
411 // was first element, point parent to new first element
412 if(Top->Child == Tmp)
413 Top->Child = I->Next;
414 I = I->Next;
415 Prev->Next = I;
416 delete Tmp;
417 } else {
418 Prev = I;
419 I = I->Next;
420 }
421 }
422
6c139d6e
AL
423}
424 /*}}}*/
b2e465d6
AL
425// Configuration::Clear - Clear an entire tree /*{{{*/
426// ---------------------------------------------------------------------
427/* */
ce857f32 428void Configuration::Clear(string const &Name)
b2e465d6
AL
429{
430 Item *Top = Lookup(Name.c_str(),false);
75ef8f14 431 if (Top == 0)
b2e465d6 432 return;
75ef8f14 433
171c75f1 434 Top->Value.clear();
b2e465d6
AL
435 Item *Stop = Top;
436 Top = Top->Child;
437 Stop->Child = 0;
438 for (; Top != 0;)
439 {
440 if (Top->Child != 0)
441 {
442 Top = Top->Child;
443 continue;
444 }
445
446 while (Top != 0 && Top->Next == 0)
447 {
448 Item *Tmp = Top;
449 Top = Top->Parent;
450 delete Tmp;
451
452 if (Top == Stop)
453 return;
454 }
455
456 Item *Tmp = Top;
457 if (Top != 0)
458 Top = Top->Next;
459 delete Tmp;
460 }
461}
462 /*}}}*/
08e8f724
AL
463// Configuration::Exists - Returns true if the Name exists /*{{{*/
464// ---------------------------------------------------------------------
465/* */
b2e465d6 466bool Configuration::Exists(const char *Name) const
08e8f724 467{
b2e465d6 468 const Item *Itm = Lookup(Name);
08e8f724
AL
469 if (Itm == 0)
470 return false;
471 return true;
472}
473 /*}}}*/
b2e465d6
AL
474// Configuration::ExistsAny - Returns true if the Name, possibly /*{{{*/
475// ---------------------------------------------------------------------
476/* qualified by /[fdbi] exists */
477bool Configuration::ExistsAny(const char *Name) const
478{
479 string key = Name;
480
8d998026 481 if (key.size() > 2 && key.end()[-2] == '/')
ff6bf1be 482 {
8d998026
AL
483 if (key.find_first_of("fdbi",key.size()-1) < key.size())
484 {
485 key.resize(key.size() - 2);
486 if (Exists(key.c_str()))
487 return true;
488 }
489 else
490 {
69a63027 491 _error->Warning(_("Unrecognized type abbreviation: '%c'"), key.end()[-3]);
8d998026 492 }
ff6bf1be 493 }
b2e465d6
AL
494 return Exists(Name);
495}
496 /*}}}*/
93bf083d
AL
497// Configuration::Dump - Dump the config /*{{{*/
498// ---------------------------------------------------------------------
499/* Dump the entire configuration space */
ff2a211a 500void Configuration::Dump(ostream& str)
93bf083d 501{
2f416270
DK
502 Dump(str, NULL, "%f \"%v\";\n", true);
503}
504void Configuration::Dump(ostream& str, char const * const root,
505 char const * const formatstr, bool const emptyValue)
506{
507 const Configuration::Item* Top = Tree(root);
508 if (Top == 0)
509 return;
510 const Configuration::Item* const Root = (root == NULL) ? NULL : Top;
511 std::vector<std::string> const format = VectorizeString(formatstr, '%');
512
513 /* Write out all of the configuration directives by walking the
93bf083d 514 configuration tree */
2f416270
DK
515 do {
516 if (emptyValue == true || Top->Value.empty() == emptyValue)
517 {
518 std::vector<std::string>::const_iterator f = format.begin();
519 str << *f;
520 for (++f; f != format.end(); ++f)
521 {
522 if (f->empty() == true)
523 {
524 ++f;
525 str << '%' << *f;
526 continue;
527 }
528 char const type = (*f)[0];
529 if (type == 'f')
530 str << Top->FullTag();
531 else if (type == 't')
532 str << Top->Tag;
533 else if (type == 'v')
534 str << Top->Value;
535 else if (type == 'F')
536 str << QuoteString(Top->FullTag(), "=\"\n");
537 else if (type == 'T')
538 str << QuoteString(Top->Tag, "=\"\n");
539 else if (type == 'V')
540 str << QuoteString(Top->Value, "=\"\n");
541 else if (type == 'n')
542 str << "\n";
543 else if (type == 'N')
544 str << "\t";
545 else
546 str << '%' << type;
547 str << f->c_str() + 1;
548 }
549 }
550
93bf083d
AL
551 if (Top->Child != 0)
552 {
553 Top = Top->Child;
554 continue;
555 }
2f416270 556
93bf083d
AL
557 while (Top != 0 && Top->Next == 0)
558 Top = Top->Parent;
559 if (Top != 0)
560 Top = Top->Next;
2f416270
DK
561
562 if (Root != NULL)
563 {
564 const Configuration::Item* I = Top;
565 while(I != 0)
566 {
567 if (I == Root)
568 break;
569 else
570 I = I->Parent;
571 }
572 if (I == 0)
573 break;
574 }
575 } while (Top != 0);
93bf083d
AL
576}
577 /*}}}*/
08e8f724 578
0a8a80e5
AL
579// Configuration::Item::FullTag - Return the fully scoped tag /*{{{*/
580// ---------------------------------------------------------------------
b2e465d6
AL
581/* Stop sets an optional max recursion depth if this item is being viewed as
582 part of a sub tree. */
583string Configuration::Item::FullTag(const Item *Stop) const
0a8a80e5 584{
b2e465d6 585 if (Parent == 0 || Parent->Parent == 0 || Parent == Stop)
0a8a80e5 586 return Tag;
b2e465d6 587 return Parent->FullTag(Stop) + "::" + Tag;
0a8a80e5
AL
588}
589 /*}}}*/
590
08e8f724
AL
591// ReadConfigFile - Read a configuration file /*{{{*/
592// ---------------------------------------------------------------------
593/* The configuration format is very much like the named.conf format
b2e465d6
AL
594 used in bind8, in fact this routine can parse most named.conf files.
595 Sectional config files are like bind's named.conf where there are
596 sections like 'zone "foo.org" { .. };' This causes each section to be
597 added in with a tag like "zone::foo.org" instead of being split
6df63aa6 598 tag/value. AsSectional enables Sectional parsing.*/
ce857f32
DK
599bool ReadConfigFile(Configuration &Conf,const string &FName,bool const &AsSectional,
600 unsigned const &Depth)
b2e465d6 601{
08e8f724 602 // Open the stream for reading
851a45a8 603 ifstream F(FName.c_str(),ios::in);
08e8f724 604 if (!F != 0)
b2e465d6 605 return _error->Errno("ifstream::ifstream",_("Opening configuration file %s"),FName.c_str());
3f807f6c 606
08e8f724 607 string LineBuffer;
a4e87467
AL
608 string Stack[100];
609 unsigned int StackPos = 0;
08e8f724
AL
610
611 // Parser state
612 string ParentTag;
613
614 int CurLine = 0;
615 bool InComment = false;
616 while (F.eof() == false)
617 {
3f807f6c
DB
618 // The raw input line.
619 std::string Input;
620 // The input line with comments stripped.
621 std::string Fragment;
8a27f5da
DB
622
623 // Grab the next line of F and place it in Input.
3f807f6c
DB
624 do
625 {
626 char *Buffer = new char[1024];
627
628 F.clear();
629 F.getline(Buffer,sizeof(Buffer) / 2);
630
631 Input += Buffer;
8aea8c3f 632 delete[] Buffer;
3f807f6c
DB
633 }
634 while (F.fail() && !F.eof());
635
8a27f5da
DB
636 // Expand tabs in the input line and remove leading and trailing
637 // whitespace.
3f807f6c 638 {
3f807f6c
DB
639 const int BufferSize = Input.size() * 8 + 1;
640 char *Buffer = new char[BufferSize];
641 try
642 {
643 memcpy(Buffer, Input.c_str(), Input.size() + 1);
644
645 _strtabexpand(Buffer, BufferSize);
646 _strstrip(Buffer);
647 Input = Buffer;
648 }
649 catch(...)
650 {
651 delete[] Buffer;
652 throw;
653 }
654 delete[] Buffer;
655 }
08e8f724 656 CurLine++;
5e14c452 657
8a27f5da
DB
658 // Now strip comments; if the whole line is contained in a
659 // comment, skip this line.
660
3f807f6c
DB
661 // The first meaningful character in the current fragment; will
662 // be adjusted below as we remove bytes from the front.
663 std::string::const_iterator Start = Input.begin();
664 // The last meaningful character in the current fragment.
665 std::string::const_iterator End = Input.end();
08e8f724
AL
666
667 // Multi line comment
668 if (InComment == true)
669 {
3f807f6c
DB
670 for (std::string::const_iterator I = Start;
671 I != End; ++I)
08e8f724 672 {
3f807f6c 673 if (*I == '*' && I + 1 != End && I[1] == '/')
08e8f724 674 {
3f807f6c 675 Start = I + 2;
08e8f724
AL
676 InComment = false;
677 break;
678 }
679 }
680 if (InComment == true)
681 continue;
682 }
683
684 // Discard single line comments
bfd22fc0 685 bool InQuote = false;
3f807f6c
DB
686 for (std::string::const_iterator I = Start;
687 I != End; ++I)
08e8f724 688 {
bfd22fc0
AL
689 if (*I == '"')
690 InQuote = !InQuote;
691 if (InQuote == true)
692 continue;
c914647f
DK
693
694 if ((*I == '/' && I + 1 != End && I[1] == '/') ||
695 (*I == '#' && strcmp(string(I,I+6).c_str(),"#clear") != 0 &&
696 strcmp(string(I,I+8).c_str(),"#include") != 0))
697 {
3f807f6c 698 End = I;
08e8f724
AL
699 break;
700 }
701 }
7834cb57 702
3f807f6c
DB
703 // Look for multi line comments and build up the
704 // fragment.
705 Fragment.reserve(End - Start);
7834cb57 706 InQuote = false;
3f807f6c
DB
707 for (std::string::const_iterator I = Start;
708 I != End; ++I)
08e8f724 709 {
bfd22fc0
AL
710 if (*I == '"')
711 InQuote = !InQuote;
712 if (InQuote == true)
3f807f6c
DB
713 Fragment.push_back(*I);
714 else if (*I == '/' && I + 1 != End && I[1] == '*')
08e8f724
AL
715 {
716 InComment = true;
3f807f6c
DB
717 for (std::string::const_iterator J = I;
718 J != End; ++J)
08e8f724 719 {
3f807f6c 720 if (*J == '*' && J + 1 != End && J[1] == '/')
08e8f724 721 {
3f807f6c
DB
722 // Pretend we just finished walking over the
723 // comment, and don't add anything to the output
724 // fragment.
725 I = J + 1;
08e8f724
AL
726 InComment = false;
727 break;
728 }
729 }
730
731 if (InComment == true)
3f807f6c 732 break;
08e8f724 733 }
3f807f6c
DB
734 else
735 Fragment.push_back(*I);
08e8f724 736 }
3f807f6c
DB
737
738 // Skip blank lines.
739 if (Fragment.empty())
08e8f724
AL
740 continue;
741
8a27f5da 742 // The line has actual content; interpret what it means.
7834cb57 743 InQuote = false;
3f807f6c
DB
744 Start = Fragment.begin();
745 End = Fragment.end();
746 for (std::string::const_iterator I = Start;
747 I != End; ++I)
08e8f724 748 {
7834cb57
AL
749 if (*I == '"')
750 InQuote = !InQuote;
751
752 if (InQuote == false && (*I == '{' || *I == ';' || *I == '}'))
08e8f724 753 {
b2e465d6 754 // Put the last fragment into the buffer
a4dcbf1c
DB
755 std::string::const_iterator NonWhitespaceStart = Start;
756 std::string::const_iterator NonWhitespaceStop = I;
f7f0d6c7 757 for (; NonWhitespaceStart != I && isspace(*NonWhitespaceStart) != 0; ++NonWhitespaceStart)
3f807f6c 758 ;
f7f0d6c7 759 for (; NonWhitespaceStop != NonWhitespaceStart && isspace(NonWhitespaceStop[-1]) != 0; --NonWhitespaceStop)
3f807f6c 760 ;
a4dcbf1c 761 if (LineBuffer.empty() == false && NonWhitespaceStop - NonWhitespaceStart != 0)
08e8f724 762 LineBuffer += ' ';
a4dcbf1c 763 LineBuffer += string(NonWhitespaceStart, NonWhitespaceStop);
3f807f6c
DB
764
765 // Drop this from the input string, saving the character
766 // that terminated the construct we just closed. (i.e., a
767 // brace or a semicolon)
08e8f724 768 char TermChar = *I;
3f807f6c 769 Start = I + 1;
08e8f724
AL
770
771 // Syntax Error
772 if (TermChar == '{' && LineBuffer.empty() == true)
b2e465d6 773 return _error->Error(_("Syntax error %s:%u: Block starts with no name."),FName.c_str(),CurLine);
08e8f724 774
b2e465d6 775 // No string on this line
08e8f724 776 if (LineBuffer.empty() == true)
b2e465d6
AL
777 {
778 if (TermChar == '}')
779 {
780 if (StackPos == 0)
781 ParentTag = string();
782 else
783 ParentTag = Stack[--StackPos];
784 }
08e8f724 785 continue;
b2e465d6
AL
786 }
787
08e8f724 788 // Parse off the tag
7f25bdff
AL
789 string Tag;
790 const char *Pos = LineBuffer.c_str();
791 if (ParseQuoteWord(Pos,Tag) == false)
db0db9fe 792 return _error->Error(_("Syntax error %s:%u: Malformed tag"),FName.c_str(),CurLine);
b2e465d6
AL
793
794 // Parse off the word
795 string Word;
bcae6dd4 796 bool NoWord = false;
b2e465d6
AL
797 if (ParseCWord(Pos,Word) == false &&
798 ParseQuoteWord(Pos,Word) == false)
799 {
800 if (TermChar != '{')
801 {
802 Word = Tag;
803 Tag = "";
bcae6dd4 804 }
4ae405e9
AL
805 else
806 NoWord = true;
b2e465d6
AL
807 }
808 if (strlen(Pos) != 0)
809 return _error->Error(_("Syntax error %s:%u: Extra junk after value"),FName.c_str(),CurLine);
810
08e8f724
AL
811 // Go down a level
812 if (TermChar == '{')
813 {
a4e87467
AL
814 if (StackPos <= 100)
815 Stack[StackPos++] = ParentTag;
b2e465d6
AL
816
817 /* Make sectional tags incorperate the section into the
818 tag string */
819 if (AsSectional == true && Word.empty() == false)
820 {
821 Tag += "::" ;
822 Tag += Word;
823 Word = "";
824 }
825
08e8f724
AL
826 if (ParentTag.empty() == true)
827 ParentTag = Tag;
828 else
829 ParentTag += string("::") + Tag;
830 Tag = string();
831 }
bfd22fc0 832
08e8f724
AL
833 // Generate the item name
834 string Item;
835 if (ParentTag.empty() == true)
836 Item = Tag;
837 else
838 {
7f25bdff 839 if (TermChar != '{' || Tag.empty() == false)
08e8f724 840 Item = ParentTag + "::" + Tag;
7f25bdff
AL
841 else
842 Item = ParentTag;
08e8f724
AL
843 }
844
b2e465d6
AL
845 // Specials
846 if (Tag.length() >= 1 && Tag[0] == '#')
847 {
848 if (ParentTag.empty() == false)
849 return _error->Error(_("Syntax error %s:%u: Directives can only be done at the top level"),FName.c_str(),CurLine);
850 Tag.erase(Tag.begin());
851 if (Tag == "clear")
852 Conf.Clear(Word);
853 else if (Tag == "include")
854 {
855 if (Depth > 10)
856 return _error->Error(_("Syntax error %s:%u: Too many nested includes"),FName.c_str(),CurLine);
857 if (Word.length() > 2 && Word.end()[-1] == '/')
858 {
859 if (ReadConfigDir(Conf,Word,AsSectional,Depth+1) == false)
860 return _error->Error(_("Syntax error %s:%u: Included from here"),FName.c_str(),CurLine);
861 }
862 else
863 {
864 if (ReadConfigFile(Conf,Word,AsSectional,Depth+1) == false)
865 return _error->Error(_("Syntax error %s:%u: Included from here"),FName.c_str(),CurLine);
866 }
867 }
868 else
869 return _error->Error(_("Syntax error %s:%u: Unsupported directive '%s'"),FName.c_str(),CurLine,Tag.c_str());
870 }
c3a3a1b1
DK
871 else if (Tag.empty() == true && NoWord == false && Word == "#clear")
872 return _error->Error(_("Syntax error %s:%u: clear directive requires an option tree as argument"),FName.c_str(),CurLine);
b2e465d6
AL
873 else
874 {
875 // Set the item in the configuration class
bcae6dd4
AL
876 if (NoWord == false)
877 Conf.Set(Item,Word);
b2e465d6
AL
878 }
879
08e8f724 880 // Empty the buffer
171c75f1 881 LineBuffer.clear();
b2e465d6
AL
882
883 // Move up a tag, but only if there is no bit to parse
884 if (TermChar == '}')
885 {
886 if (StackPos == 0)
171c75f1 887 ParentTag.clear();
b2e465d6
AL
888 else
889 ParentTag = Stack[--StackPos];
890 }
891
08e8f724 892 }
08e8f724
AL
893 }
894
3f807f6c
DB
895 // Store the remaining text, if any, in the current line buffer.
896
897 // NB: could change this to use string-based operations; I'm
898 // using strstrip now to ensure backwards compatibility.
899 // -- dburrows 2008-04-01
900 {
901 char *Buffer = new char[End - Start + 1];
902 try
903 {
904 std::copy(Start, End, Buffer);
905 Buffer[End - Start] = '\0';
906
907 const char *Stripd = _strstrip(Buffer);
908 if (*Stripd != 0 && LineBuffer.empty() == false)
909 LineBuffer += " ";
910 LineBuffer += Stripd;
911 }
912 catch(...)
913 {
914 delete[] Buffer;
915 throw;
916 }
917 delete[] Buffer;
918 }
08e8f724 919 }
b2e465d6
AL
920
921 if (LineBuffer.empty() == false)
922 return _error->Error(_("Syntax error %s:%u: Extra junk at end of file"),FName.c_str(),CurLine);
923 return true;
924}
925 /*}}}*/
926// ReadConfigDir - Read a directory of config files /*{{{*/
927// ---------------------------------------------------------------------
928/* */
a74cd17a 929bool ReadConfigDir(Configuration &Conf,const string &Dir,
be4eec61 930 bool const &AsSectional, unsigned const &Depth)
52643bec 931{
e29a6bb1 932 vector<string> const List = GetListOfFilesInDir(Dir, "conf", true, true);
b2e465d6
AL
933
934 // Read the files
f7f0d6c7 935 for (vector<string>::const_iterator I = List.begin(); I != List.end(); ++I)
b2e465d6
AL
936 if (ReadConfigFile(Conf,*I,AsSectional,Depth) == false)
937 return false;
08e8f724
AL
938 return true;
939}
940 /*}}}*/
1f2933a8
DK
941// MatchAgainstConfig Constructor /*{{{*/
942Configuration::MatchAgainstConfig::MatchAgainstConfig(char const * Config)
943{
944 std::vector<std::string> const strings = _config->FindVector(Config);
945 for (std::vector<std::string>::const_iterator s = strings.begin();
946 s != strings.end(); ++s)
947 {
948 regex_t *p = new regex_t;
949 if (regcomp(p, s->c_str(), REG_EXTENDED | REG_ICASE | REG_NOSUB) == 0)
950 patterns.push_back(p);
951 else
952 {
953 regfree(p);
954 delete p;
44edc41e
MV
955 _error->Warning("Invalid regular expression '%s' in configuration "
956 "option '%s' will be ignored.",
957 s->c_str(), Config);
958 continue;
1f2933a8 959 }
b093a199
DK
960 }
961 if (strings.size() == 0)
962 patterns.push_back(NULL);
1f2933a8
DK
963}
964 /*}}}*/
965// MatchAgainstConfig Destructor /*{{{*/
966Configuration::MatchAgainstConfig::~MatchAgainstConfig()
b093a199
DK
967{
968 clearPatterns();
969}
970void Configuration::MatchAgainstConfig::clearPatterns()
1f2933a8
DK
971{
972 for(std::vector<regex_t *>::const_iterator p = patterns.begin();
973 p != patterns.end(); ++p)
974 {
b093a199 975 if (*p == NULL) continue;
1f2933a8
DK
976 regfree(*p);
977 delete *p;
978 }
44edc41e 979 patterns.clear();
1f2933a8
DK
980}
981 /*}}}*/
982// MatchAgainstConfig::Match - returns true if a pattern matches /*{{{*/
983bool Configuration::MatchAgainstConfig::Match(char const * str) const
984{
985 for(std::vector<regex_t *>::const_iterator p = patterns.begin();
986 p != patterns.end(); ++p)
b093a199 987 if (*p != NULL && regexec(*p, str, 0, 0, 0) == 0)
1f2933a8
DK
988 return true;
989
990 return false;
991}
992 /*}}}*/