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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
|
// Compatibility shims
if (!String.prototype.trim) {
String.prototype.trim = function () {
return this.replace(/^\s+|\s+$/g,'');
};
}
if (!String.prototype.trimRight) {
String.prototype.trimRight = function () {
return this.replace(/\s+$/,'');
};
}
if (!Array.isArray) {
Array.isArray = function (vArg) {
return Object.prototype.toString.call(vArg) === "[object Array]";
};
}
const debugState = false;
/**
*
* Base64 encode / decode
* http://www.webtoolkit.info/
* From http://stackoverflow.com/questions/246801\
* /how-can-you-encode-to-base64-using-javascript
*
**/
var Base64 = {
// private property
_keyStr : "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
// public method for encoding
encode : function (input) {
var output = "";
var chr1, chr2, chr3, enc1, enc2, enc3, enc4;
var i = 0;
input = Base64._utf8_encode(input);
while (i < input.length) {
chr1 = input.charCodeAt(i++);
chr2 = input.charCodeAt(i++);
chr3 = input.charCodeAt(i++);
enc1 = chr1 >> 2;
enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
enc4 = chr3 & 63;
if (isNaN(chr2)) {
enc3 = enc4 = 64;
} else if (isNaN(chr3)) {
enc4 = 64;
}
output = output +
this._keyStr.charAt(enc1) + this._keyStr.charAt(enc2) +
this._keyStr.charAt(enc3) + this._keyStr.charAt(enc4);
}
return output;
},
// public method for decoding
decode : function (input) {
var output = "";
var chr1, chr2, chr3;
var enc1, enc2, enc3, enc4;
var i = 0;
input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
while (i < input.length) {
enc1 = this._keyStr.indexOf(input.charAt(i++));
enc2 = this._keyStr.indexOf(input.charAt(i++));
enc3 = this._keyStr.indexOf(input.charAt(i++));
enc4 = this._keyStr.indexOf(input.charAt(i++));
chr1 = (enc1 << 2) | (enc2 >> 4);
chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
chr3 = ((enc3 & 3) << 6) | enc4;
output = output + String.fromCharCode(chr1);
if (enc3 != 64) {
output = output + String.fromCharCode(chr2);
}
if (enc4 != 64) {
output = output + String.fromCharCode(chr3);
}
}
output = Base64._utf8_decode(output);
return output;
},
// private method for UTF-8 encoding
_utf8_encode : function (string) {
string = string.replace(/\r\n/g,"\n");
var utftext = "";
for (var n = 0; n < string.length; n++) {
var c = string.charCodeAt(n);
if (c < 128) {
utftext += String.fromCharCode(c);
}
else if((c > 127) && (c < 2048)) {
utftext += String.fromCharCode((c >> 6) | 192);
utftext += String.fromCharCode((c & 63) | 128);
}
else {
utftext += String.fromCharCode((c >> 12) | 224);
utftext += String.fromCharCode(((c >> 6) & 63) | 128);
utftext += String.fromCharCode((c & 63) | 128);
}
}
return utftext;
},
// private method for UTF-8 decoding
_utf8_decode : function (utftext) {
var string = "";
var i = 0;
var c = c1 = c2 = 0;
while ( i < utftext.length ) {
c = utftext.charCodeAt(i);
if (c < 128) {
string += String.fromCharCode(c);
i++;
}
else if((c > 191) && (c < 224)) {
c2 = utftext.charCodeAt(i+1);
string += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
i += 2;
}
else {
c2 = utftext.charCodeAt(i+1);
c3 = utftext.charCodeAt(i+2);
string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
i += 3;
}
}
return string;
}
};
/*
* All collected fields in my LDIF file
birthday, birthmonth, birthyear, c, cn, description, dn,
facsimiletelephonenumber, givenName, homePhone, l, mail,
mobile, modifytimestamp, mozillaHomeCountryName, mozillaHomeLocalityName,
mozillaHomePostalCode, mozillaHomeState, mozillaHomeStreet,
mozillaHomeUrl, mozillaNickname, mozillaSecondEmail,
mozillaWorkStreet2, mozillaWorkUrl, o, objectclass, ou, postalCode,
sn, st, street, telephoneNumber, title
*/
// RFC 2849 uses givenname, RFC 4519 uses givenName, we rather support
// both
const usefulFields = ["birthyear", "birthmonth", "birthday", "c", "cn",
"description", "facsimiletelephonenumber", "givenName", "homePhone", "l",
"mail", "mobile", "mozillaHomeCountryName", "mozillaHomeLocalityName",
"mozillaHomePostalCode", "mozillaHomeState", "mozillaHomeStreet",
"mozillaHomeUrl", "mozillaNickname", "mozillaSecondEmail",
"mozillaWorkStreet2", "mozillaWorkUrl", "o", "ou", "postalCode", "sn",
"st", "street", "telephoneNumber", "title", "objectclass", "givenname"
];
function debug(str) {
if (debugState) {
if (console) {
console.log(str);
}
else {
print(str);
}
}
}
/**
* parse LDIF string into JavaScript Object
*
* @inStr String
* @returns Object
*
* @todo
* Tries to follow RFC2849, but
* - doesn’t even consider change requests, only complete values
* - doesn’t include version: field (seems to be ignored by
* Thunderbird as well).
* - ignores < links
*/
function parseLDIF(inStr) {
var record = {},
key = "",
value = null,
splitLine = [],
colon_idx = 0,
out_records = [];
function handleAdding(key, value) {
value = value ? value.trim() : "";
// base64 encoded value
if (value[0] === ":") {
value = Base64.decode(value.slice(1).trim());
}
if (key && (usefulFields.indexOf(key) != -1) &&
value.length > 0) {
if (key in this) {
if (Array.isArray(this[key])) {
this[key].push(value);
}
else {
this[key] = new Array(this[key]);
this[key].push(value);
}
}
else {
this[key] = value;
}
}
key = "";
value = null;
}
record.add = handleAdding;
inStr.forEach(function (line) {
if (line != undefined) {
line = line.trim();
if (line.length == 0) {
// > 1, because we have always .add property
if (Object.keys(record).length > 1) {
record.add(key, value);
delete record.add;
if (record.objectclass &&
(record.objectclass === "person" ||
record.objectclass.indexOf("person") !== -1)) {
delete record.objectclass;
out_records.push(record);
}
}
record = {};
record.add = handleAdding;
key = "";
value = null;
}
else {
// comment line
if (line[0] === "#") {
return ;
}
else {
colon_idx = line.indexOf(":");
line = line.trim();
// Line continuation
// This is how it works in THunderbird exported LDIF
// files, but not what RFC describes ... the first character
// of continuing entry should be space, and the first line
// of value should never be empty. Hopefully, this solution
// should be at least compatible for reading of RFC LDIF
// files (so it doesn’t hurt)
if (colon_idx == -1) {
// multiline value
if (line[0] === " ") {
line = line.slice(1);
}
value += line;
}
else {
record.add(key, value);
key = line.slice(0, colon_idx);
value = line.slice(colon_idx + 1);
}
}
}
}
});
return out_records;
}
if (typeof(exports) !== "undefined") {
exports.parseLDIF = parseLDIF;
}
if ((typeof(arguments) !== "undefined") && arguments.length == 1) {
var lines = readFile(arguments[0]).replace(/\r\n/g,"\n");
print(parseLDIF(lines.split("\n")).toSource());
}
|