Skip to content

Commit 647038c

Browse files
committed
---
yaml --- r: 95275 b: refs/heads/dist-snap c: 72bf201 h: refs/heads/master i: 95273: 87b6ce0 95271: c1c80ed v: v3
1 parent 671a039 commit 647038c

File tree

5 files changed

+213
-226
lines changed

5 files changed

+213
-226
lines changed

[refs]

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ refs/heads/try: c274a6888410ce3e357e014568b43310ed787d36
66
refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
77
refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
88
refs/heads/try2: 147ecfdd8221e4a4d4e090486829a06da1e0ca3c
9-
refs/heads/dist-snap: e505d4c3535d6e0af1070b1b50ec8db4c2eca827
9+
refs/heads/dist-snap: 72bf201d61ac36f058cdea6a3487a27029fb65e6
1010
refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
1111
refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503
1212
refs/heads/try3: 9387340aab40a73e8424c48fd42f0c521a4875c0

branches/dist-snap/src/librustc/middle/lint.rs

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
// Copyright 2012-2013 The Rust Project Developers. See the COPYRIGHT
1+
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
22
// file at the top-level directory of this distribution and at
33
// http://rust-lang.org/COPYRIGHT.
44
//
@@ -372,16 +372,12 @@ impl Context {
372372

373373
let mut note = None;
374374
let msg = match src {
375-
Default => {
376-
format!("{}, \\#[{}({})] on by default", msg,
377-
level_to_str(level), self.lint_to_str(lint))
378-
},
379-
CommandLine => {
380-
format!("{} [-{} {}]", msg,
381-
match level {
375+
Default | CommandLine => {
376+
format!("{} [-{} {}{}]", msg, match level {
382377
warn => 'W', deny => 'D', forbid => 'F',
383378
allow => fail2!()
384-
}, self.lint_to_str(lint).replace("_", "-"))
379+
}, self.lint_to_str(lint).replace("_", "-"),
380+
if src == Default { " (default)" } else { "" })
385381
},
386382
Node(src) => {
387383
note = Some(src);
Lines changed: 198 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,198 @@
1+
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
2+
// file at the top-level directory of this distribution and at
3+
// http://rust-lang.org/COPYRIGHT.
4+
//
5+
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6+
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7+
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8+
// option. This file may not be copied, modified, or distributed
9+
// except according to those terms.
10+
11+
//! The ISAAC random number generator.
12+
13+
use rand::{seed, Rng};
14+
use iter::{Iterator, range, range_step};
15+
use option::{None, Some};
16+
17+
use cast;
18+
use cmp;
19+
use sys;
20+
use vec;
21+
22+
static RAND_SIZE_LEN: u32 = 8;
23+
static RAND_SIZE: u32 = 1 << RAND_SIZE_LEN;
24+
25+
/// A random number generator that uses the [ISAAC
26+
/// algorithm](http://en.wikipedia.org/wiki/ISAAC_%28cipher%29).
27+
///
28+
/// The ISAAC algorithm is suitable for cryptographic purposes.
29+
pub struct IsaacRng {
30+
priv cnt: u32,
31+
priv rsl: [u32, .. RAND_SIZE],
32+
priv mem: [u32, .. RAND_SIZE],
33+
priv a: u32,
34+
priv b: u32,
35+
priv c: u32
36+
}
37+
38+
impl IsaacRng {
39+
/// Create an ISAAC random number generator with a random seed.
40+
pub fn new() -> IsaacRng {
41+
IsaacRng::new_seeded(seed(RAND_SIZE as uint * 4))
42+
}
43+
44+
/// Create an ISAAC random number generator with a seed. This can be any
45+
/// length, although the maximum number of bytes used is 1024 and any more
46+
/// will be silently ignored. A generator constructed with a given seed
47+
/// will generate the same sequence of values as all other generators
48+
/// constructed with the same seed.
49+
pub fn new_seeded(seed: &[u8]) -> IsaacRng {
50+
let mut rng = IsaacRng {
51+
cnt: 0,
52+
rsl: [0, .. RAND_SIZE],
53+
mem: [0, .. RAND_SIZE],
54+
a: 0, b: 0, c: 0
55+
};
56+
57+
let array_size = sys::size_of_val(&rng.rsl);
58+
let copy_length = cmp::min(array_size, seed.len());
59+
60+
// manually create a &mut [u8] slice of randrsl to copy into.
61+
let dest = unsafe { cast::transmute((&mut rng.rsl, array_size)) };
62+
vec::bytes::copy_memory(dest, seed, copy_length);
63+
rng.init(true);
64+
rng
65+
}
66+
67+
/// Create an ISAAC random number generator using the default
68+
/// fixed seed.
69+
pub fn new_unseeded() -> IsaacRng {
70+
let mut rng = IsaacRng {
71+
cnt: 0,
72+
rsl: [0, .. RAND_SIZE],
73+
mem: [0, .. RAND_SIZE],
74+
a: 0, b: 0, c: 0
75+
};
76+
rng.init(false);
77+
rng
78+
}
79+
80+
/// Initialises `self`. If `use_rsl` is true, then use the current value
81+
/// of `rsl` as a seed, otherwise construct one algorithmically (not
82+
/// randomly).
83+
fn init(&mut self, use_rsl: bool) {
84+
let mut a = 0x9e3779b9;
85+
let mut b = a;
86+
let mut c = a;
87+
let mut d = a;
88+
let mut e = a;
89+
let mut f = a;
90+
let mut g = a;
91+
let mut h = a;
92+
93+
macro_rules! mix(
94+
() => {{
95+
a^=b<<11; d+=a; b+=c;
96+
b^=c>>2; e+=b; c+=d;
97+
c^=d<<8; f+=c; d+=e;
98+
d^=e>>16; g+=d; e+=f;
99+
e^=f<<10; h+=e; f+=g;
100+
f^=g>>4; a+=f; g+=h;
101+
g^=h<<8; b+=g; h+=a;
102+
h^=a>>9; c+=h; a+=b;
103+
}}
104+
);
105+
106+
do 4.times { mix!(); }
107+
108+
if use_rsl {
109+
macro_rules! memloop (
110+
($arr:expr) => {{
111+
for i in range_step(0u32, RAND_SIZE, 8) {
112+
a+=$arr[i ]; b+=$arr[i+1];
113+
c+=$arr[i+2]; d+=$arr[i+3];
114+
e+=$arr[i+4]; f+=$arr[i+5];
115+
g+=$arr[i+6]; h+=$arr[i+7];
116+
mix!();
117+
self.mem[i ]=a; self.mem[i+1]=b;
118+
self.mem[i+2]=c; self.mem[i+3]=d;
119+
self.mem[i+4]=e; self.mem[i+5]=f;
120+
self.mem[i+6]=g; self.mem[i+7]=h;
121+
}
122+
}}
123+
);
124+
125+
memloop!(self.rsl);
126+
memloop!(self.mem);
127+
} else {
128+
for i in range_step(0u32, RAND_SIZE, 8) {
129+
mix!();
130+
self.mem[i ]=a; self.mem[i+1]=b;
131+
self.mem[i+2]=c; self.mem[i+3]=d;
132+
self.mem[i+4]=e; self.mem[i+5]=f;
133+
self.mem[i+6]=g; self.mem[i+7]=h;
134+
}
135+
}
136+
137+
self.isaac();
138+
}
139+
140+
/// Refills the output buffer (`self.rsl`)
141+
#[inline]
142+
fn isaac(&mut self) {
143+
self.c += 1;
144+
// abbreviations
145+
let mut a = self.a;
146+
let mut b = self.b + self.c;
147+
148+
static MIDPOINT: uint = RAND_SIZE as uint / 2;
149+
150+
macro_rules! ind (($x:expr) => {
151+
self.mem[($x >> 2) & (RAND_SIZE - 1)]
152+
});
153+
macro_rules! rngstep(
154+
($j:expr, $shift:expr) => {{
155+
let base = $j;
156+
let mix = if $shift < 0 {
157+
a >> -$shift as uint
158+
} else {
159+
a << $shift as uint
160+
};
161+
162+
let x = self.mem[base + mr_offset];
163+
a = (a ^ mix) + self.mem[base + m2_offset];
164+
let y = ind!(x) + a + b;
165+
self.mem[base + mr_offset] = y;
166+
167+
b = ind!(y >> RAND_SIZE_LEN) + x;
168+
self.rsl[base + mr_offset] = b;
169+
}}
170+
);
171+
172+
let r = [(0, MIDPOINT), (MIDPOINT, 0)];
173+
for &(mr_offset, m2_offset) in r.iter() {
174+
for i in range_step(0u, MIDPOINT, 4) {
175+
rngstep!(i + 0, 13);
176+
rngstep!(i + 1, -6);
177+
rngstep!(i + 2, 2);
178+
rngstep!(i + 3, -16);
179+
}
180+
}
181+
182+
self.a = a;
183+
self.b = b;
184+
self.cnt = RAND_SIZE;
185+
}
186+
}
187+
188+
impl Rng for IsaacRng {
189+
#[inline]
190+
fn next(&mut self) -> u32 {
191+
if self.cnt == 0 {
192+
// make some more numbers
193+
self.isaac();
194+
}
195+
self.cnt -= 1;
196+
self.rsl[self.cnt]
197+
}
198+
}

0 commit comments

Comments
 (0)