Skip to content

Instantly share code, notes, and snippets.

@eholk
Created July 27, 2011 18:18
Show Gist options
  • Select an option

  • Save eholk/1110024 to your computer and use it in GitHub Desktop.

Select an option

Save eholk/1110024 to your computer and use it in GitHub Desktop.
../src/comp/middle/trans.rs:1382:23:1385:11: error: mismatched types: expected rec(@rec(native llbb,obj {
fn AShr(native, native) -> native;
fn Add(native, native) -> native;
fn AddIncomingToPhi(native, &ivec[native], &ivec[native]);
fn AggregateRet(&ivec[native]) -> native;
fn Alloca(native) -> native;
fn And(native, native) -> native;
fn ArrayAlloca(native, native) -> native;
fn ArrayMalloc(native, native) -> native;
fn BinOp(native, native, native) -> native;
fn BitCast(native, native) -> native;
fn Br(native) -> native;
fn Call(native, &ivec[native]) -> native;
fn CallWithConv(native, &ivec[native], uint) -> native;
fn Cast(native, native, native, native) -> native;
fn CondBr(native, native, native) -> native;
fn ExactSDiv(native, native) -> native;
fn ExtractElement(native, native) -> native;
fn ExtractValue(native, uint) -> native;
fn FAdd(native, native) -> native;
fn FCmp(uint, native, native) -> native;
fn FDiv(native, native) -> native;
fn FMul(native, native) -> native;
fn FNeg(native) -> native;
fn FPCast(native, native) -> native;
fn FPExt(native, native) -> native;
fn FPToSI(native, native) -> native;
fn FPToUI(native, native) -> native;
fn FPTrunc(native, native) -> native;
fn FRem(native, native) -> native;
fn FSub(native, native) -> native;
fn FastCall(native, &ivec[native]) -> native;
fn Free(native) -> native;
fn GEP(native, &ivec[native]) -> native;
fn GlobalString(native) -> native;
fn GlobalStringPtr(native) -> native;
fn ICmp(uint, native, native) -> native;
fn InBoundsGEP(native, &ivec[native]) -> native;
fn IndirectBr(native, uint) -> native;
fn InsertElement(native, native, native) -> native;
fn InsertValue(native, native, uint) -> native;
fn IntCast(native, native) -> native;
fn IntToPtr(native, native) -> native;
fn Invoke(native, &ivec[native], native, native) -> native;
fn IsNotNull(native) -> native;
fn IsNull(native) -> native;
fn LShr(native, native) -> native;
fn Load(native) -> native;
fn Malloc(native) -> native;
fn Mul(native, native) -> native;
fn NSWAdd(native, native) -> native;
fn NSWMul(native, native) -> native;
fn NSWNeg(native) -> native;
fn NSWSub(native, native) -> native;
fn NUWAdd(native, native) -> native;
fn NUWMul(native, native) -> native;
fn NUWNeg(native) -> native;
fn NUWSub(native, native) -> native;
fn Neg(native) -> native;
fn Not(native) -> native;
fn Or(native, native) -> native;
fn Phi(native, &ivec[native], &ivec[native]) -> native;
fn PointerCast(native, native) -> native;
fn PtrDiff(native, native) -> native;
fn PtrToInt(native, native) -> native;
fn Ret(native) -> native;
fn RetVoid() -> native;
fn SDiv(native, native) -> native;
fn SExt(native, native) -> native;
fn SExtOrBitCast(native, native) -> native;
fn SIToFP(native, native) -> native;
fn SRem(native, native) -> native;
fn Select(native, native, native) -> native;
fn Shl(native, native) -> native;
fn ShuffleVector(native, native, native) -> native;
fn Store(native, native) -> native;
fn StructGEP(native, uint) -> native;
fn Sub(native, native) -> native;
fn Switch(native, native, uint) -> native;
fn Trap() -> native;
fn Trunc(native, native) -> native;
fn TruncOrBitCast(native, native) -> native;
fn UDiv(native, native) -> native;
fn UIToFP(native, native) -> native;
fn URem(native, native) -> native;
fn Unreachable() -> native;
fn Unwind() -> native;
fn VAArg(native, native) -> native;
fn Xor(native, native) -> native;
fn ZExt(native, native) -> native;
fn ZExtOrBitCast(native, native) -> native;
fn is_terminated() -> bool;
} build,<tag#0:356> parent,<tag#0:341> kind,mutable ivec[<tag#0:200>] cleanups,rec(uint lo,uint hi) sp,@rec(native llfn,native lltaskptr,native llenv,native llretptr,mutable native llstaticallocas,mutable native llcopyargs,mutable native llderivedtydescs_first,mutable native llderivedtydescs,mutable native lldynamicallocas,mutable <tag#1:9071>[rec(native v,uint t)] llself,mutable <tag#1:9071>[native] lliterbody,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} llargs,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} llobjfields,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} lllocals,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} llupvars,mutable ivec[native] lltydescs,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[rec(native lltydesc,bool escapes)];
fn get(&uint) -> rec(native lltydesc,bool escapes);
fn insert(&uint, &rec(native lltydesc,bool escapes)) -> bool;
iter items() -> @rec(uint key,rec(native lltydesc,bool escapes) val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[rec(native lltydesc,bool escapes)];
fn size() -> uint;
} derived_tydescs,rec(uint lo,uint hi) sp,@rec(ivec[str] path,ivec[str] module_path,ivec[str] obj_typarams,ivec[rec(<tag#0:82407> mut,@rec(<tag#0:83237> node,rec(uint lo,uint hi) span) ty,str ident,int id)] obj_fields,@rec(obj {
fn abort_if_errors();
fn bug(str) -> !;
fn err(str);
fn fatal(str) -> !;
fn get_codemap() -> @rec(mutable ivec[@rec(str name,rec(uint ch,uint byte) start_pos,mutable ivec[rec(uint ch,uint byte)] lines)] files);
fn get_cstore() -> <tag#0:130787>;
fn get_main_id() -> <tag#1:9071>[int];
fn get_opts() -> @rec(bool library,bool static,uint optimize,bool debuginfo,bool verify,bool run_typestate,bool save_temps,bool stats,bool time_passes,bool time_llvm_passes,<tag#0:120885> output_type,ivec[str] library_search_paths,str sysroot,ivec[@rec(<tag#0:82276> node,rec(uint lo,uint hi) span)] cfg,bool test,bool dps);
fn get_parse_sess() -> @rec(@rec(mutable ivec[@rec(str name,rec(uint ch,uint byte) start_pos,mutable ivec[rec(uint ch,uint byte)] lines)] files) cm,mutable int next_id);
fn get_targ_cfg() -> @rec(<tag#0:133440> os,<tag#0:133447> arch,<tag#0:83090> int_type,<tag#0:83090> uint_type,<tag#0:83090> float_type);
fn lookup_pos(uint) -> rec(str filename,uint line,uint col);
fn next_node_id() -> int;
fn note(str);
fn set_main_id(int);
fn span_bug(rec(uint lo,uint hi), str) -> !;
fn span_err(rec(uint lo,uint hi), str);
fn span_fatal(rec(uint lo,uint hi), str) -> !;
fn span_note(rec(uint lo,uint hi), str);
fn span_str(rec(uint lo,uint hi)) -> str;
fn span_unimpl(rec(uint lo,uint hi), str) -> !;
fn span_warn(rec(uint lo,uint hi), str);
fn unimpl(str) -> !;
fn warn(str);
} sess,native llmod,rec(native lltd,obj {
} dtor) td,obj {
fn associate(str, native);
fn get_name(native) -> str;
fn get_type(str) -> native;
fn name_has_type(str) -> bool;
fn type_has_name(native) -> bool;
} tn,obj {
fn contains_key(&str) -> bool;
fn find(&str) -> <tag#1:9071>[native];
fn get(&str) -> native;
fn insert(&str, &native) -> bool;
iter items() -> @rec(str key,native val);
iter keys() -> str;
fn rehash();
fn remove(&str) -> <tag#1:9071>[native];
fn size() -> uint;
} externs,obj {
fn contains_key(&str) -> bool;
fn find(&str) -> <tag#1:9071>[native];
fn get(&str) -> native;
fn insert(&str, &native) -> bool;
iter items() -> @rec(str key,native val);
iter keys() -> str;
fn rehash();
fn remove(&str) -> <tag#1:9071>[native];
fn size() -> uint;
} intrinsics,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} item_ids,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[<tag#0:50965>];
fn get(&int) -> <tag#0:50965>;
fn insert(&int, &<tag#0:50965>) -> bool;
iter items() -> @rec(int key,<tag#0:50965> val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[<tag#0:50965>];
fn size() -> uint;
} ast_map,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[str];
fn get(&int) -> str;
fn insert(&int, &str) -> bool;
iter items() -> @rec(int key,str val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[str];
fn size() -> uint;
} item_symbols,mutable <tag#1:9071>[native] main_fn,rec(str name,str vers,str extras_hash) link_meta,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[uint];
fn get(&uint) -> uint;
fn insert(&uint, &uint) -> bool;
iter items() -> @rec(uint key,uint val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[uint];
fn size() -> uint;
} tag_sizes,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} discrims,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[str];
fn get(&int) -> str;
fn insert(&int, &str) -> bool;
iter items() -> @rec(int key,str val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[str];
fn size() -> uint;
} discrim_symbols,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} fn_pairs,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[native];
fn get(&int) -> native;
fn insert(&int, &native) -> bool;
iter items() -> @rec(int key,native val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[native];
fn size() -> uint;
} consts,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[()];
fn get(&int);
fn insert(&int, &()) -> bool;
iter items() -> @rec(int key,() val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[()];
fn size() -> uint;
} obj_methods,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[@rec(uint ty,native tydesc,native size,native align,mutable <tag#1:9071>[native] copy_glue,mutable <tag#1:9071>[native] drop_glue,mutable <tag#1:9071>[native] free_glue,mutable <tag#1:9071>[native] cmp_glue,ivec[uint] ty_params)];
fn get(&uint) -> @rec(uint ty,native tydesc,native size,native align,mutable <tag#1:9071>[native] copy_glue,mutable <tag#1:9071>[native] drop_glue,mutable <tag#1:9071>[native] free_glue,mutable <tag#1:9071>[native] cmp_glue,ivec[uint] ty_params);
fn insert(&uint, &@rec(uint ty,native tydesc,native size,native align,mutable <tag#1:9071>[native] copy_glue,mutable <tag#1:9071>[native] drop_glue,mutable <tag#1:9071>[native] free_glue,mutable <tag#1:9071>[native] cmp_glue,ivec[uint] ty_params)) -> bool;
iter items() -> @rec(uint key,@rec(uint ty,native tydesc,native size,native align,mutable <tag#1:9071>[native] copy_glue,mutable <tag#1:9071>[native] drop_glue,mutable <tag#1:9071>[native] free_glue,mutable <tag#1:9071>[native] cmp_glue,ivec[uint] ty_params) val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[@rec(uint ty,native tydesc,native size,native align,mutable <tag#1:9071>[native] copy_glue,mutable <tag#1:9071>[native] drop_glue,mutable <tag#1:9071>[native] free_glue,mutable <tag#1:9071>[native] cmp_glue,ivec[uint] ty_params)];
fn size() -> uint;
} tydescs,obj {
fn contains_key(&str) -> bool;
fn find(&str) -> <tag#1:9071>[native];
fn get(&str) -> native;
fn insert(&str, &native) -> bool;
iter items() -> @rec(str key,native val);
iter keys() -> str;
fn rehash();
fn remove(&str) -> <tag#1:9071>[native];
fn size() -> uint;
} module_data,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[native];
fn get(&uint) -> native;
fn insert(&uint, &native) -> bool;
iter items() -> @rec(uint key,native val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[native];
fn size() -> uint;
} lltypes,@rec(native no_op_type_glue) glues,obj {
fn next(str) -> str;
} names,obj {
fn input(&vec[u8]);
fn input_ivec(&ivec[u8]);
fn input_str(&str);
fn reset();
fn result() -> vec[u8];
fn result_ivec() -> ivec[u8];
fn result_str() -> str;
} sha,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[str];
fn get(&uint) -> str;
fn insert(&uint, &str) -> bool;
iter items() -> @rec(uint key,str val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[str];
fn size() -> uint;
} type_sha1s,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[str];
fn get(&uint) -> str;
fn insert(&uint, &str) -> bool;
iter items() -> @rec(uint key,str val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[str];
fn size() -> uint;
} type_short_names,@rec(@rec(obj {
fn contains_key(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)) -> bool;
fn find(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)) -> <tag#1:9071>[uint];
fn get(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)) -> uint;
fn insert(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars), &uint) -> bool;
iter items() -> @rec(@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars) key,uint val);
iter keys() -> @rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars);
fn rehash();
fn remove(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)) -> <tag#1:9071>[uint];
fn size() -> uint;
} map,mutable ivec[@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)] vect,fn(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)) -> uint hasher,fn(&@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars), &@rec(<tag#0:40850> struct,<tag#1:9071>[str] cname,uint hash,bool has_params,bool has_vars)) -> bool eqer) ts,obj {
fn abort_if_errors();
fn bug(str) -> !;
fn err(str);
fn fatal(str) -> !;
fn get_codemap() -> @rec(mutable ivec[@rec(str name,rec(uint ch,uint byte) start_pos,mutable ivec[rec(uint ch,uint byte)] lines)] files);
fn get_cstore() -> <tag#0:130787>;
fn get_main_id() -> <tag#1:9071>[int];
fn get_opts() -> @rec(bool library,bool static,uint optimize,bool debuginfo,bool verify,bool run_typestate,bool save_temps,bool stats,bool time_passes,bool time_llvm_passes,<tag#0:120885> output_type,ivec[str] library_search_paths,str sysroot,ivec[@rec(<tag#0:82276> node,rec(uint lo,uint hi) span)] cfg,bool test,bool dps);
fn get_parse_sess() -> @rec(@rec(mutable ivec[@rec(str name,rec(uint ch,uint byte) start_pos,mutable ivec[rec(uint ch,uint byte)] lines)] files) cm,mutable int next_id);
fn get_targ_cfg() -> @rec(<tag#0:133440> os,<tag#0:133447> arch,<tag#0:83090> int_type,<tag#0:83090> uint_type,<tag#0:83090> float_type);
fn lookup_pos(uint) -> rec(str filename,uint line,uint col);
fn next_node_id() -> int;
fn note(str);
fn set_main_id(int);
fn span_bug(rec(uint lo,uint hi), str) -> !;
fn span_err(rec(uint lo,uint hi), str);
fn span_fatal(rec(uint lo,uint hi), str) -> !;
fn span_note(rec(uint lo,uint hi), str);
fn span_str(rec(uint lo,uint hi)) -> str;
fn span_unimpl(rec(uint lo,uint hi), str) -> !;
fn span_warn(rec(uint lo,uint hi), str);
fn unimpl(str) -> !;
fn warn(str);
} sess,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[<tag#0:82088>];
fn get(&int) -> <tag#0:82088>;
fn insert(&int, &<tag#0:82088>) -> bool;
iter items() -> @rec(int key,<tag#0:82088> val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[<tag#0:82088>];
fn size() -> uint;
} def_map,@@rec(mutable ivec[mutable <tag#1:9071>[rec(<tag#1:9071>[ivec[uint]] substs,uint ty)]] v) node_types,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[<tag#0:50965>];
fn get(&int) -> <tag#0:50965>;
fn insert(&int, &<tag#0:50965>) -> bool;
iter items() -> @rec(int key,<tag#0:50965> val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[<tag#0:50965>];
fn size() -> uint;
} items,obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[rec(obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[()];
fn get(&int);
fn insert(&int, &()) -> bool;
iter items() -> @rec(int key,() val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[()];
fn size() -> uint;
} defs,@ivec[int] uses)];
fn get(&int) -> rec(obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[()];
fn get(&int);
fn insert(&int, &()) -> bool;
iter items() -> @rec(int key,() val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[()];
fn size() -> uint;
} defs,@ivec[int] uses);
fn insert(&int, &rec(obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[()];
fn get(&int);
fn insert(&int, &()) -> bool;
iter items() -> @rec(int key,() val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[()];
fn size() -> uint;
} defs,@ivec[int] uses)) -> bool;
iter items() -> @rec(int key,rec(obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[()];
fn get(&int);
fn insert(&int, &()) -> bool;
iter items() -> @rec(int key,() val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[()];
fn size() -> uint;
} defs,@ivec[int] uses) val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[rec(obj {
fn contains_key(&int) -> bool;
fn find(&int) -> <tag#1:9071>[()];
fn get(&int);
fn insert(&int, &()) -> bool;
iter items() -> @rec(int key,() val);
iter keys() -> int;
fn rehash();
fn remove(&int) -> <tag#1:9071>[()];
fn size() -> uint;
} defs,@ivec[int] uses)];
fn size() -> uint;
} freevars,obj {
fn contains_key(&rec(int crate,int node)) -> bool;
fn find(&rec(int crate,int node)) -> <tag#1:9071>[rec(uint count,uint ty)];
fn get(&rec(int crate,int node)) -> rec(uint count,uint ty);
fn insert(&rec(int crate,int node), &rec(uint count,uint ty)) -> bool;
iter items() -> @rec(rec(int crate,int node) key,rec(uint count,uint ty) val);
iter keys() -> rec(int crate,int node);
fn rehash();
fn remove(&rec(int crate,int node)) -> <tag#1:9071>[rec(uint count,uint ty)];
fn size() -> uint;
} tcache,obj {
fn contains_key(&rec(int cnum,uint pos,uint len)) -> bool;
fn find(&rec(int cnum,uint pos,uint len)) -> <tag#1:9071>[uint];
fn get(&rec(int cnum,uint pos,uint len)) -> uint;
fn insert(&rec(int cnum,uint pos,uint len), &uint) -> bool;
iter items() -> @rec(rec(int cnum,uint pos,uint len) key,uint val);
iter keys() -> rec(int cnum,uint pos,uint len);
fn rehash();
fn remove(&rec(int cnum,uint pos,uint len)) -> <tag#1:9071>[uint];
fn size() -> uint;
} rcache,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[str];
fn get(&uint) -> str;
fn insert(&uint, &str) -> bool;
iter items() -> @rec(uint key,str val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[str];
fn size() -> uint;
} short_names_cache,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[bool];
fn get(&uint) -> bool;
fn insert(&uint, &bool) -> bool;
iter items() -> @rec(uint key,bool val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[bool];
fn size() -> uint;
} has_pointer_cache,obj {
fn contains_key(&uint) -> bool;
fn find(&uint) -> <tag#1:9071>[bool];
fn get(&uint) -> bool;
fn insert(&uint, &bool) -> bool;
iter items() -> @rec(uint key,bool val);
iter keys() -> uint;
fn rehash();
fn remove(&uint) -> <tag#1:9071>[bool];
fn size() -> uint;
} owns_heap_mem_cache,obj {
fn contains_key(&@rec(<tag#0:83237> node,rec(uint lo,uint hi) span)) -> bool;
fn find(&@rec(<tag#0:83237> node,rec(uint lo,uint hi) span)) -> <tag#1:9071>[<tag#1:9071>[uint]];
fn get(&@rec(<tag#0:83237> node,rec(uint lo,uint hi) span)) -> <tag#1:9071>[uint];
fn insert(&@rec(<tag#0:83237> node,rec(uint lo,uint hi) span), &<tag#1:9071>[uint]) -> bool;
iter items() -> @rec(@rec(<tag#0:83237> node,rec(uint lo,uint hi) span) key,<tag#1:9071>[uint] val);
iter keys() -> @rec(<tag#0:83237> node,rec(uint lo,uint hi) span);
fn rehash();
fn remove(&@rec(<tag#0:83237> node,rec(uint lo,uint hi) span)) -> <tag#1:9071>[<tag#1:9071>[uint]];
fn size() -> uint;
} ast_ty_to_ty_cache) tcx,rec(mutable uint n_static_tydescs,mutable uint n_derived_tydescs,mutable uint n_glues_created,mutable uint n_null_glues,mutable uint n_real_glues,@mutable ivec[rec(str ident,int time)] fn_times) stats,@rec(native grow_task,native log_int,native log_float,native log_double,native log_str,native log_istr,native trace_word,native trace_str,native new_port,native del_port,native new_chan,native flush_chan,native del_chan,native clone_chan,native chan_target_task,native _yield,native sleep,native send,native recv,native _fail,native kill,native exit,native malloc,native free,native shared_malloc,native shared_free,native mark,native new_str,native dup_str,native new_vec,native vec_append,native get_type_desc,native new_task,native take_task,native drop_task,native start_task,native ivec_resize,native ivec_spill,native ivec_resize_shared,native ivec_spill_shared) upcalls,native rust_object_type,native tydesc_type,native task_type) ccx) lcx) fcx) bcx,native val) but found () (types differ)
../src/comp/middle/trans.rs:1382 ty::ty_task. {
../src/comp/middle/trans.rs:1383 cx.build.Call(bcx_ccx(cx).upcalls.drop_task,
../src/comp/middle/trans.rs:1384 ~[cx.fcx.lltaskptr, v0]);
../src/comp/middle/trans.rs:1385 }
<input>:0:0:0:0: error: aborting due to previous errors
rt: ---
rt: 4951:main:main: upcall fail 'explicit failure', /Users/graydon/src/rust-tinderbox/srcdir-snap-stage1-i386-unknown-darwin/src/comp/driver/session.rs:65
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment