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
217
218
219
220
|
/**
* @file llurlwhitelist.cpp
* @author Callum Prentice
* @brief maintains a "white list" of acceptable URLS that are stored on disk
*
* $LicenseInfo:firstyear=2005&license=viewergpl$
*
* Copyright (c) 2005-2008, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at http://secondlifegrid.net/programs/open_source/licensing/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#include "llviewerprecompiledheaders.h"
#include "llurlwhitelist.h"
#include <iostream>
#include <fstream>
LLUrlWhiteList* LLUrlWhiteList::sInstance = 0;
///////////////////////////////////////////////////////////////////////////////
//
LLUrlWhiteList::LLUrlWhiteList () :
mLoaded ( false ),
mFilename ( "url_whitelist.ini" ),
mUrlList ( 0 ),
mCurIndex ( 0 )
{
}
///////////////////////////////////////////////////////////////////////////////
//
LLUrlWhiteList::~LLUrlWhiteList ()
{
}
///////////////////////////////////////////////////////////////////////////////
//static
void LLUrlWhiteList::initClass ()
{
if ( ! sInstance )
{
sInstance = new LLUrlWhiteList ();
}
}
//static
void LLUrlWhiteList::cleanupClass ()
{
delete sInstance;
sInstance = NULL;
}
LLUrlWhiteList* LLUrlWhiteList::getInstance ()
{
return sInstance;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::load ()
{
// don't load if we're already loaded
if ( mLoaded )
return ( true );
// remove current entries before we load over them
clear ();
// build filename for each user
LLString resolvedFilename = gDirUtilp->getExpandedFilename ( LL_PATH_PER_SL_ACCOUNT, mFilename.c_str () );
// open a file for reading
llifstream file ( resolvedFilename.c_str () );
if ( file.is_open () )
{
// add each line in the file to the list
std::string line;
while ( std::getline ( file, line ) )
{
addItem ( line, false );
};
file.close ();
// flag as loaded
mLoaded = true;
return true;
};
return false;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::save ()
{
// build filename for each user
LLString resolvedFilename = gDirUtilp->getExpandedFilename ( LL_PATH_PER_SL_ACCOUNT, mFilename.c_str () );
// open a file for writing
llofstream file ( resolvedFilename.c_str () );
if ( file.is_open () )
{
// for each entry we have
for ( string_list_t::iterator iter = mUrlList.begin (); iter != mUrlList.end (); ++iter )
{
file << ( *iter ) << std::endl;
}
file.close ();
return true;
};
return false;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::clear ()
{
mUrlList.clear ();
mCurIndex = 0;
return true;
}
LLString url_cleanup(LLString pattern)
{
LLString::trim(pattern);
S32 length = pattern.length();
S32 position = 0;
std::string::reverse_iterator it = pattern.rbegin();
++it; // skip last char, might be '/'
++position;
for (; it < pattern.rend(); ++it)
{
char c = *it;
if (c == '/')
{
// found second to last '/'
S32 desired_length = length - position;
LLString::truncate(pattern, desired_length);
break;
}
++position;
}
return pattern;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::addItem ( const LLString& itemIn, bool saveAfterAdd )
{
LLString item = url_cleanup(itemIn);
mUrlList.push_back ( item );
// use this when all you want to do is call addItem ( ... ) where necessary
if ( saveAfterAdd )
save ();
return true;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::getFirst ( LLString& valueOut )
{
if ( mUrlList.size () == 0 )
return false;
mCurIndex = 0;
valueOut = mUrlList[mCurIndex++];
return true;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::getNext ( LLString& valueOut )
{
if ( mCurIndex >= mUrlList.size () )
return false;
valueOut = mUrlList[mCurIndex++];
return true;
}
///////////////////////////////////////////////////////////////////////////////
//
bool LLUrlWhiteList::containsMatch ( const LLString& patternIn )
{
return false;
}
|
