// Functions dealing with attributes and meta_items import std::vec; import std::str; import std::map; import std::option; import syntax::ast; import util::common; import driver::session; export attr_metas; export find_linkage_metas; export find_attrs_by_name; export find_meta_items_by_name; export contains; export sort_meta_items; export remove_meta_items_by_name; export require_unique_names; export get_attr_name; export mk_name_value_item; export mk_list_item; export mk_word_item; export mk_attr; // From a list of crate attributes get only the meta_items that impact crate // linkage fn find_linkage_metas(vec[ast::attribute] attrs) -> vec[@ast::meta_item] { let vec[@ast::meta_item] metas = []; for (ast::attribute attr in find_attrs_by_name(attrs, "link")) { alt (attr.node.value.node) { case (ast::meta_list(_, ?items)) { metas += items; } case (_) { log "ignoring link attribute that has incorrect type"; } } } ret metas; } // Search a list of attributes and return only those with a specific name fn find_attrs_by_name(vec[ast::attribute] attrs, ast::ident name) -> vec[ast::attribute] { auto filter = bind fn(&ast::attribute a, ast::ident name) -> option::t[ast::attribute] { if (get_attr_name(a) == name) { option::some(a) } else { option::none } } (_, name); ret vec::filter_map(filter, attrs); } fn get_attr_name(&ast::attribute attr) -> ast::ident { get_meta_item_name(@attr.node.value) } fn find_meta_items_by_name(vec[@ast::meta_item] metas, ast::ident name) -> vec[@ast::meta_item] { auto filter = bind fn(&@ast::meta_item m, ast::ident name) -> option::t[@ast::meta_item] { if (get_meta_item_name(m) == name) { option::some(m) } else { option::none } } (_, name); ret vec::filter_map(filter, metas); } fn get_meta_item_name(&@ast::meta_item meta) -> ast::ident { alt (meta.node) { case (ast::meta_word(?n)) { n } case (ast::meta_name_value(?n, _)) { n } case (ast::meta_list(?n, _)) { n } } } fn attr_meta(&ast::attribute attr) -> @ast::meta_item { @attr.node.value } // Get the meta_items from inside an attribute fn attr_metas(&vec[ast::attribute] attrs) -> vec[@ast::meta_item] { ret vec::map(attr_meta, attrs); } fn eq(@ast::meta_item a, @ast::meta_item b) -> bool { ret alt (a.node) { case (ast::meta_word(?na)) { alt (b.node) { case(ast::meta_word(?nb)) { na == nb } case(_) { false } } } case (ast::meta_name_value(?na, ?va)) { alt (b.node) { case (ast::meta_name_value(?nb, ?vb)) { na == nb && va == vb } case (_) { false } } } case (ast::meta_list(?na, ?la)) { // FIXME (#607): Needs implementing // This involves probably sorting the list by name and // meta_item variant fail "unimplemented meta_item variant" } } } fn contains(&vec[@ast::meta_item] haystack, @ast::meta_item needle) -> bool { log #fmt("looking for %s", syntax::print::pprust::meta_item_to_str(*needle)); for (@ast::meta_item item in haystack) { log #fmt("looking in %s", syntax::print::pprust::meta_item_to_str(*item)); if (eq(item, needle)) { log "found it!"; ret true; } } log "found it not :("; ret false; } // FIXME: This needs to sort by meta_item variant in addition to the item name fn sort_meta_items(&vec[@ast::meta_item] items) -> vec[@ast::meta_item] { fn lteq(&@ast::meta_item ma, &@ast::meta_item mb) -> bool { fn key(&@ast::meta_item m) -> ast::ident { alt (m.node) { case (ast::meta_word(?name)) { name } case (ast::meta_name_value(?name, _)) { name } case (ast::meta_list(?name, _)) { name } } } ret key(ma) <= key(mb); } // This is sort of stupid here, converting to a vec of mutables and back let vec[mutable @ast::meta_item] v = [mutable ]; for (@ast::meta_item mi in items) { v += [mutable mi]; } std::sort::quick_sort(lteq, v); let vec[@ast::meta_item] v2 = []; for (@ast::meta_item mi in v) { v2 += [mi] } ret v2; } fn remove_meta_items_by_name(&vec[@ast::meta_item] items, str name) -> vec[@ast::meta_item] { auto filter = bind fn(&@ast::meta_item item, str name) -> option::t[@ast::meta_item] { if (get_meta_item_name(item) != name) { option::some(item) } else { option::none } } (_, name); ret vec::filter_map(filter, items); } fn require_unique_names(&session::session sess, &vec[@ast::meta_item] metas) { auto map = map::mk_hashmap[str, ()](str::hash, str::eq); for (@ast::meta_item meta in metas) { auto name = get_meta_item_name(meta); if (map.contains_key(name)) { sess.span_fatal(meta.span, #fmt("duplicate meta item `%s`", name)); } map.insert(name, ()); } } fn span[T](&T item) -> ast::spanned[T] { ret rec(node=item, span=rec(lo=0u, hi=0u)); } fn mk_name_value_item(ast::ident name, str value) -> @ast::meta_item { ret @span(ast::meta_name_value(name, value)); } fn mk_list_item(ast::ident name, &vec[@ast::meta_item] items) -> @ast::meta_item { ret @span(ast::meta_list(name, items)); } fn mk_word_item(ast::ident name) -> @ast::meta_item { ret @span(ast::meta_word(name)); } fn mk_attr(@ast::meta_item item) -> ast::attribute { ret span(rec(style = ast::attr_inner, value = *item)); } // // Local Variables: // mode: rust // fill-column: 78; // indent-tabs-mode: nil // c-basic-offset: 4 // buffer-file-coding-system: utf-8-unix // compile-command: "make -k -C $RBUILD 2>&1 | sed -e 's/\\/x\\//x:\\//g'"; // End: //