/
lib.rs
467 lines (397 loc) · 13.5 KB
/
lib.rs
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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
//! Compiler plugin for Rust-PHF
//!
//! See the documentation for the `phf` crate for more details.
#![crate_name="phf_mac"]
#![crate_type="dylib"]
#![doc(html_root_url="http://sfackler.github.io/rust-phf/doc")]
#![feature(plugin_registrar, quote, default_type_params)]
extern crate rand;
extern crate syntax;
extern crate time;
extern crate rustc;
use std::collections::HashMap;
use std::gc::{Gc, GC};
use std::hash;
use std::hash::Hash;
use std::os;
use std::rc::Rc;
use syntax::ast;
use syntax::ast::{TokenTree, LitStr, LitBinary, LitByte, LitChar, Expr, ExprVec, ExprLit};
use syntax::codemap::Span;
use syntax::ext::base::{DummyResult,
ExtCtxt,
MacResult,
MacExpr};
use syntax::parse;
use syntax::parse::token::{InternedString, COMMA, EOF, FAT_ARROW};
use syntax::print::pprust;
use rand::{Rng, SeedableRng, XorShiftRng};
use rustc::plugin::Registry;
#[path="../../shared/mod.rs"]
mod phf_shared;
static DEFAULT_LAMBDA: uint = 5;
static FIXED_SEED: [u32, ..4] = [3141592653, 589793238, 462643383, 2795028841];
#[plugin_registrar]
#[doc(hidden)]
pub fn macro_registrar(reg: &mut Registry) {
reg.register_macro("phf_map", expand_phf_map);
reg.register_macro("phf_set", expand_phf_set);
reg.register_macro("phf_ordered_map", expand_phf_ordered_map);
reg.register_macro("phf_ordered_set", expand_phf_ordered_set);
}
#[deriving(PartialEq, Eq, Clone)]
enum Key {
KeyStr(InternedString),
KeyBinary(Rc<Vec<u8>>),
KeyChar(char),
KeyU8(u8),
KeyI8(i8),
KeyU16(u16),
KeyI16(i16),
KeyU32(u32),
KeyI32(i32),
KeyU64(u64),
KeyI64(i64),
KeyBool(bool),
}
impl<S: hash::Writer> Hash<S> for Key {
fn hash(&self, state: &mut S) {
match *self {
KeyStr(ref s) => s.get().hash(state),
KeyBinary(ref b) => b.hash(state),
KeyChar(c) => c.hash(state),
KeyU8(b) => b.hash(state),
KeyI8(b) => b.hash(state),
KeyU16(b) => b.hash(state),
KeyI16(b) => b.hash(state),
KeyU32(b) => b.hash(state),
KeyI32(b) => b.hash(state),
KeyU64(b) => b.hash(state),
KeyI64(b) => b.hash(state),
KeyBool(b) => b.hash(state),
}
}
}
struct Entry {
key_contents: Key,
key: Gc<Expr>,
value: Gc<Expr>
}
struct HashState {
k1: u64,
k2: u64,
disps: Vec<(uint, uint)>,
map: Vec<uint>,
}
fn expand_phf_map(cx: &mut ExtCtxt, sp: Span, tts: &[TokenTree])
-> Box<MacResult> {
let entries = match parse_map(cx, tts) {
Some(entries) => entries,
None => return DummyResult::expr(sp)
};
if has_duplicates(cx, sp, entries.as_slice()) {
return DummyResult::expr(sp);
}
let state = generate_hash(cx, sp, entries.as_slice());
create_map(cx, sp, entries, state)
}
fn expand_phf_set(cx: &mut ExtCtxt, sp: Span, tts: &[TokenTree])
-> Box<MacResult> {
let entries = match parse_set(cx, tts) {
Some(entries) => entries,
None => return DummyResult::expr(sp)
};
if has_duplicates(cx, sp, entries.as_slice()) {
return DummyResult::expr(sp);
}
let state = generate_hash(cx, sp, entries.as_slice());
create_set(cx, sp, entries, state)
}
fn expand_phf_ordered_map(cx: &mut ExtCtxt, sp: Span, tts: &[TokenTree])
-> Box<MacResult> {
let entries = match parse_map(cx, tts) {
Some(entries) => entries,
None => return DummyResult::expr(sp),
};
if has_duplicates(cx, sp, entries.as_slice()) {
return DummyResult::expr(sp);
}
let state = generate_hash(cx, sp, entries.as_slice());
create_ordered_map(cx, sp, entries, state)
}
fn expand_phf_ordered_set(cx: &mut ExtCtxt, sp: Span, tts: &[TokenTree])
-> Box<MacResult> {
let entries = match parse_set(cx, tts) {
Some(entries) => entries,
None => return DummyResult::expr(sp)
};
if has_duplicates(cx, sp, entries.as_slice()) {
return DummyResult::expr(sp);
}
let state = generate_hash(cx, sp, entries.as_slice());
create_ordered_set(cx, sp, entries, state)
}
fn parse_map(cx: &mut ExtCtxt, tts: &[TokenTree]) -> Option<Vec<Entry>> {
let mut parser = parse::new_parser_from_tts(cx.parse_sess(), cx.cfg(),
Vec::from_slice(tts));
let mut entries = Vec::new();
let mut bad = false;
while parser.token != EOF {
let key = cx.expand_expr(parser.parse_expr());
let key_contents = parse_key(cx, key).unwrap_or_else(|| {
bad = true;
KeyStr(InternedString::new(""))
});
if !parser.eat(&FAT_ARROW) {
cx.span_err(parser.span, "expected `=>`");
return None;
}
let value = parser.parse_expr();
entries.push(Entry {
key_contents: key_contents,
key: key,
value: value
});
if !parser.eat(&COMMA) && parser.token != EOF {
cx.span_err(parser.span, "expected `,`");
return None;
}
}
if entries.len() > phf_shared::MAX_SIZE {
cx.span_err(parser.span,
format!("maps with more than {} entries are not supported",
phf_shared::MAX_SIZE).as_slice());
return None;
}
if bad {
return None;
}
Some(entries)
}
fn parse_set(cx: &mut ExtCtxt, tts: &[TokenTree]) -> Option<Vec<Entry>> {
let mut parser = parse::new_parser_from_tts(cx.parse_sess(), cx.cfg(),
Vec::from_slice(tts));
let mut entries = Vec::new();
let value = quote_expr!(&*cx, ());
let mut bad = false;
while parser.token != EOF {
let key = cx.expand_expr(parser.parse_expr());
let key_contents = parse_key(cx, key).unwrap_or_else(|| {
bad = true;
KeyStr(InternedString::new(""))
});
entries.push(Entry {
key_contents: key_contents,
key: key,
value: value,
});
if !parser.eat(&COMMA) && parser.token != EOF {
cx.span_err(parser.span, "expected `,`");
return None;
}
}
if entries.len() > phf_shared::MAX_SIZE {
cx.span_err(parser.span,
format!("maps with more than {} entries are not supported",
phf_shared::MAX_SIZE).as_slice());
return None;
}
if bad {
return None;
}
Some(entries)
}
fn parse_key(cx: &mut ExtCtxt, e: &Expr) -> Option<Key> {
match e.node {
ExprLit(lit) => {
match lit.node {
ast::LitStr(ref s, _) => Some(KeyStr(s.clone())),
ast::LitBinary(ref b) => Some(KeyBinary(b.clone())),
ast::LitByte(b) => Some(KeyU8(b)),
ast::LitChar(c) => Some(KeyChar(c)),
ast::LitInt(i, ast::TyI8) => Some(KeyI8(i as i8)),
ast::LitInt(i, ast::TyI16) => Some(KeyI16(i as i16)),
ast::LitInt(i, ast::TyI32) => Some(KeyI32(i as i32)),
ast::LitInt(i, ast::TyI64) => Some(KeyI64(i as i64)),
ast::LitUint(i, ast::TyU8) => Some(KeyU8(i as u8)),
ast::LitUint(i, ast::TyU16) => Some(KeyU16(i as u16)),
ast::LitUint(i, ast::TyU32) => Some(KeyU32(i as u32)),
ast::LitUint(i, ast::TyU64) => Some(KeyU64(i as u64)),
ast::LitBool(b) => Some(KeyBool(b)),
_ => {
cx.span_err(e.span, "unsupported literal type");
None
}
}
}
_ => {
cx.span_err(e.span, "expected a literal");
None
}
}
}
fn has_duplicates(cx: &mut ExtCtxt, sp: Span, entries: &[Entry]) -> bool {
let mut dups = false;
let mut strings = HashMap::new();
for entry in entries.iter() {
let &(ref mut spans, _) = strings.find_or_insert(&entry.key_contents,
(vec![], &entry.key));
spans.push(entry.key.span);
}
for &(ref spans, key) in strings.values() {
if spans.len() == 1 {
continue;
}
dups = true;
cx.span_err(sp, format!("duplicate key {}",
pprust::expr_to_string(&**key)).as_slice());
for span in spans.iter() {
cx.span_note(*span, "one occurrence here");
}
}
dups
}
fn generate_hash(cx: &mut ExtCtxt, sp: Span, entries: &[Entry]) -> HashState {
let mut rng: XorShiftRng = SeedableRng::from_seed(FIXED_SEED);
let start = time::precise_time_s();
let state;
loop {
match try_generate_hash(entries.as_slice(), &mut rng) {
Some(s) => {
state = s;
break;
}
None => {}
}
}
let time = time::precise_time_s() - start;
if os::getenv("PHF_STATS").is_some() {
cx.span_note(sp, format!("PHF generation took {} seconds", time)
.as_slice());
}
state
}
fn try_generate_hash(entries: &[Entry], rng: &mut XorShiftRng)
-> Option<HashState> {
struct Bucket {
idx: uint,
keys: Vec<uint>,
}
struct Hashes {
g: uint,
f1: uint,
f2: uint,
}
let k1 = rng.gen();
let k2 = rng.gen();
let hashes: Vec<Hashes> = entries.iter().map(|entry| {
let (g, f1, f2) = phf_shared::hash(&entry.key_contents, k1, k2);
Hashes {
g: g,
f1: f1,
f2: f2
}
}).collect();
let buckets_len = (entries.len() + DEFAULT_LAMBDA - 1) / DEFAULT_LAMBDA;
let mut buckets = Vec::from_fn(buckets_len,
|i| Bucket { idx: i, keys: Vec::new() });
for (i, hash) in hashes.iter().enumerate() {
buckets.get_mut(hash.g % buckets_len).keys.push(i);
}
// Sort descending
buckets.sort_by(|a, b| b.keys.len().cmp(&a.keys.len()));
let table_len = entries.len();
let mut map = Vec::from_elem(table_len, None);
let mut disps = Vec::from_elem(buckets_len, (0u, 0u));
let mut try_map = HashMap::new();
'buckets: for bucket in buckets.iter() {
for d1 in range(0, table_len) {
'disps: for d2 in range(0, table_len) {
try_map.clear();
for &key in bucket.keys.iter() {
let idx = phf_shared::displace(hashes.get(key).f1,
hashes.get(key).f2,
d1,
d2) % table_len;
if map.get(idx).is_some() || try_map.find(&idx).is_some() {
continue 'disps;
}
try_map.insert(idx, key);
}
// We've picked a good set of disps
*disps.get_mut(bucket.idx) = (d1, d2);
for (&idx, &key) in try_map.iter() {
*map.get_mut(idx) = Some(key);
}
continue 'buckets;
}
}
// Unable to find displacements for a bucket
return None;
}
Some(HashState {
k1: k1,
k2: k2,
disps: disps,
map: map.move_iter().map(|i| i.unwrap()).collect(),
})
}
fn create_map(cx: &mut ExtCtxt, sp: Span, entries: Vec<Entry>, state: HashState)
-> Box<MacResult> {
let disps = state.disps.iter().map(|&(d1, d2)| {
quote_expr!(&*cx, ($d1, $d2))
}).collect();
let disps = create_slice_expr(disps, sp);
let entries = state.map.iter().map(|&idx| {
let &Entry { key, value, .. } = entries.get(idx);
quote_expr!(&*cx, ($key, $value))
}).collect();
let entries = create_slice_expr(entries, sp);
let k1 = state.k1;
let k2 = state.k2;
MacExpr::new(quote_expr!(cx, ::phf::PhfMap {
k1: $k1,
k2: $k2,
disps: &$disps,
entries: &$entries,
}))
}
fn create_set(cx: &mut ExtCtxt, sp: Span, entries: Vec<Entry>, state: HashState)
-> Box<MacResult> {
let map = create_map(cx, sp, entries, state).make_expr().unwrap();
MacExpr::new(quote_expr!(cx, ::phf::PhfSet { map: $map }))
}
fn create_ordered_map(cx: &mut ExtCtxt, sp: Span, entries: Vec<Entry>,
state: HashState) -> Box<MacResult> {
let disps = state.disps.iter().map(|&(d1, d2)| {
quote_expr!(&*cx, ($d1, $d2))
}).collect();
let disps = create_slice_expr(disps, sp);
let idxs = state.map.iter().map(|&idx| quote_expr!(&*cx, $idx)).collect();
let idxs = create_slice_expr(idxs, sp);
let entries = entries.iter().map(|&Entry { key, value, .. }| {
quote_expr!(&*cx, ($key, $value))
}).collect();
let entries = create_slice_expr(entries, sp);
let k1 = state.k1;
let k2 = state.k2;
MacExpr::new(quote_expr!(cx, ::phf::PhfOrderedMap {
k1: $k1,
k2: $k2,
disps: &$disps,
idxs: &$idxs,
entries: &$entries,
}))
}
fn create_ordered_set(cx: &mut ExtCtxt, sp: Span, entries: Vec<Entry>,
state: HashState) -> Box<MacResult> {
let map = create_ordered_map(cx, sp, entries, state).make_expr().unwrap();
MacExpr::new(quote_expr!(cx, ::phf::PhfOrderedSet { map: $map }))
}
fn create_slice_expr(vec: Vec<Gc<Expr>>, sp: Span) -> Gc<Expr> {
box (GC) Expr {
id: ast::DUMMY_NODE_ID,
node: ExprVec(vec),
span: sp
}
}