rust/src/test/run-pass/hashmap-memory.rs

98 lines
2.8 KiB
Rust
Raw Normal View History

// xfail-fast
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
#[feature(managed_boxes)];
/**
A somewhat reduced test case to expose some Valgrind issues.
This originally came from the word-count benchmark.
*/
pub fn map(filename: ~str, emit: map_reduce::putter) { emit(filename, ~"1"); }
mod map_reduce {
use std::hashmap::HashMap;
use std::str;
use std::task;
pub type putter<'a> = 'a |~str, ~str|;
pub type mapper = extern fn(~str, putter);
2012-08-15 21:10:46 +00:00
enum ctrl_proto { find_reducer(~[u8], Chan<int>), mapper_done, }
2013-01-29 07:54:39 +00:00
fn start_mappers(ctrl: SharedChan<ctrl_proto>, inputs: ~[~str]) {
for i in inputs.iter() {
2013-01-29 07:54:39 +00:00
let ctrl = ctrl.clone();
2013-03-15 22:27:15 +00:00
let i = i.clone();
task::spawn(proc() map_task(ctrl.clone(), i.clone()) );
2012-01-05 05:14:53 +00:00
}
}
2013-01-29 07:54:39 +00:00
fn map_task(ctrl: SharedChan<ctrl_proto>, input: ~str) {
let intermediates = @mut HashMap::new();
2013-03-24 01:22:00 +00:00
2013-12-06 02:19:06 +00:00
fn emit(im: &mut HashMap<~str, int>,
ctrl: SharedChan<ctrl_proto>, key: ~str,
2013-03-24 01:22:00 +00:00
_val: ~str) {
if im.contains_key(&key) {
return;
}
2013-12-06 02:19:06 +00:00
let (pp, cc) = Chan::new();
error!("sending find_reducer");
ctrl.send(find_reducer(key.as_bytes().to_owned(), cc));
error!("receiving");
2013-03-24 01:22:00 +00:00
let c = pp.recv();
error!("{:?}", c);
2013-03-24 01:22:00 +00:00
im.insert(key, c);
}
2013-01-29 07:54:39 +00:00
let ctrl_clone = ctrl.clone();
::map(input, |a,b| emit(intermediates, ctrl.clone(), a, b) );
ctrl_clone.send(mapper_done);
}
pub fn map_reduce(inputs: ~[~str]) {
2013-12-06 02:19:06 +00:00
let (ctrl_port, ctrl_chan) = SharedChan::new();
// This task becomes the master control task. It spawns others
// to do the rest.
let mut reducers: HashMap<~str, int>;
reducers = HashMap::new();
2013-03-15 22:27:15 +00:00
start_mappers(ctrl_chan, inputs.clone());
2013-05-14 09:52:12 +00:00
let mut num_mappers = inputs.len() as int;
2011-07-27 12:19:39 +00:00
while num_mappers > 0 {
2013-01-29 07:54:39 +00:00
match ctrl_port.recv() {
2012-08-04 02:59:04 +00:00
mapper_done => { num_mappers -= 1; }
find_reducer(k, cc) => {
2013-12-06 02:19:06 +00:00
let mut c;
2013-12-16 02:17:43 +00:00
match reducers.find(&str::from_utf8(k).to_owned()) {
2013-12-06 02:19:06 +00:00
Some(&_c) => { c = _c; }
None => { c = 0; }
}
2013-01-29 07:54:39 +00:00
cc.send(c);
2011-07-27 12:19:39 +00:00
}
}
}
}
}
pub fn main() {
map_reduce::map_reduce(~[~"../src/test/run-pass/hashmap-memory.rs"]);
}