/* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ //! Selector matching. use {Atom, LocalName}; use dom::PresentationalHintsSynthetizer; use element_state::*; use error_reporting::StdoutErrorReporter; use keyframes::KeyframesAnimation; use media_queries::{Device, MediaType}; use parking_lot::RwLock; use properties::{self, CascadeFlags, ComputedValues, INHERIT_ALL, Importance}; use properties::{PropertyDeclaration, PropertyDeclarationBlock}; use quickersort::sort_by; use restyle_hints::{RestyleHint, DependencySet}; use rule_tree::{RuleTree, StrongRuleNode, StyleSource}; use selector_impl::{ElementExt, TheSelectorImpl, PseudoElement, Snapshot}; use selectors::Element; use selectors::bloom::BloomFilter; use selectors::matching::{AFFECTED_BY_STYLE_ATTRIBUTE, AFFECTED_BY_PRESENTATIONAL_HINTS}; use selectors::matching::{MatchingReason, StyleRelations, matches_complex_selector}; use selectors::parser::{Selector, SimpleSelector, LocalName as LocalNameSelector, ComplexSelector}; use sink::Push; use smallvec::VecLike; use std::borrow::Borrow; use std::collections::HashMap; use std::fmt; use std::hash::BuildHasherDefault; use std::hash::Hash; use std::slice; use std::sync::Arc; use style_traits::viewport::ViewportConstraints; use stylesheets::{CssRule, Origin, StyleRule, Stylesheet, UserAgentStylesheets}; use viewport::{self, MaybeNew, ViewportRule}; pub type FnvHashMap = HashMap>; /// This structure holds all the selectors and device characteristics /// for a given document. The selectors are converted into `Rule`s /// (defined in rust-selectors), and introduced in a `SelectorMap` /// depending on the pseudo-element (see `PerPseudoElementSelectorMap`), /// and stylesheet origin (see the fields of `PerPseudoElementSelectorMap`). /// /// This structure is effectively created once per pipeline, in the /// LayoutThread corresponding to that pipeline. #[cfg_attr(feature = "servo", derive(HeapSizeOf))] pub struct Stylist { /// Device that the stylist is currently evaluating against. pub device: Device, /// Viewport constraints based on the current device. viewport_constraints: Option, /// If true, the quirks-mode stylesheet is applied. quirks_mode: bool, /// If true, the device has changed, and the stylist needs to be updated. is_device_dirty: bool, /// The current selector maps, after evaluating media /// rules against the current device. element_map: PerPseudoElementSelectorMap, /// The rule tree, that stores the results of selector matching. /// /// FIXME(emilio): Not `pub`! pub rule_tree: RuleTree, /// The selector maps corresponding to a given pseudo-element /// (depending on the implementation) pseudos_map: FnvHashMap, /// A map with all the animations indexed by name. animations: FnvHashMap, /// Applicable declarations for a given non-eagerly cascaded pseudo-element. /// These are eagerly computed once, and then used to resolve the new /// computed values on the fly on layout. /// /// FIXME(emilio): Use the rule tree! precomputed_pseudo_element_decls: FnvHashMap>, rules_source_order: usize, /// Selector dependencies used to compute restyle hints. state_deps: DependencySet, /// Selectors in the page affecting siblings #[cfg_attr(feature = "servo", ignore_heap_size_of = "Arc")] sibling_affecting_selectors: Vec>, /// Selectors in the page matching elements with non-common style-affecting /// attributes. #[cfg_attr(feature = "servo", ignore_heap_size_of = "Arc")] non_common_style_affecting_attributes_selectors: Vec>, } impl Stylist { #[inline] pub fn new(device: Device) -> Self { let mut stylist = Stylist { viewport_constraints: None, device: device, is_device_dirty: true, quirks_mode: false, element_map: PerPseudoElementSelectorMap::new(), pseudos_map: Default::default(), animations: Default::default(), precomputed_pseudo_element_decls: Default::default(), rules_source_order: 0, rule_tree: RuleTree::new(), state_deps: DependencySet::new(), // XXX remember resetting them! sibling_affecting_selectors: vec![], non_common_style_affecting_attributes_selectors: vec![] }; TheSelectorImpl::each_eagerly_cascaded_pseudo_element(|pseudo| { stylist.pseudos_map.insert(pseudo, PerPseudoElementSelectorMap::new()); }); // FIXME: Add iso-8859-9.css when the document’s encoding is ISO-8859-8. stylist } pub fn update(&mut self, doc_stylesheets: &[Arc], ua_stylesheets: Option<&UserAgentStylesheets>, stylesheets_changed: bool) -> bool { if !(self.is_device_dirty || stylesheets_changed) { return false; } self.element_map = PerPseudoElementSelectorMap::new(); self.pseudos_map = Default::default(); self.animations = Default::default(); TheSelectorImpl::each_eagerly_cascaded_pseudo_element(|pseudo| { self.pseudos_map.insert(pseudo, PerPseudoElementSelectorMap::new()); }); self.precomputed_pseudo_element_decls = Default::default(); self.rules_source_order = 0; self.state_deps.clear(); self.sibling_affecting_selectors.clear(); self.non_common_style_affecting_attributes_selectors.clear(); if let Some(ua_stylesheets) = ua_stylesheets { for stylesheet in &ua_stylesheets.user_or_user_agent_stylesheets { self.add_stylesheet(&stylesheet); } if self.quirks_mode { self.add_stylesheet(&ua_stylesheets.quirks_mode_stylesheet); } } for ref stylesheet in doc_stylesheets.iter() { self.add_stylesheet(stylesheet); } self.is_device_dirty = false; true } fn add_stylesheet(&mut self, stylesheet: &Stylesheet) { if !stylesheet.is_effective_for_device(&self.device) { return; } // Work around borrowing all of `self` if `self.something` is used in it // instead of just `self.something` macro_rules! borrow_self_field { ($($x: ident),+) => { $( let $x = &mut self.$x; )+ } } borrow_self_field!(pseudos_map, element_map, state_deps, sibling_affecting_selectors, non_common_style_affecting_attributes_selectors, rules_source_order, animations, precomputed_pseudo_element_decls); stylesheet.effective_rules(&self.device, |rule| { match *rule { CssRule::Style(ref style_rule) => { let guard = style_rule.read(); for selector in &guard.selectors { let map = if let Some(ref pseudo) = selector.pseudo_element { pseudos_map .entry(pseudo.clone()) .or_insert_with(PerPseudoElementSelectorMap::new) .borrow_for_origin(&stylesheet.origin) } else { element_map.borrow_for_origin(&stylesheet.origin) }; map.insert(Rule { selector: selector.complex_selector.clone(), style_rule: style_rule.clone(), specificity: selector.specificity, source_order: *rules_source_order, }); } *rules_source_order += 1; for selector in &guard.selectors { state_deps.note_selector(&selector.complex_selector); if selector.affects_siblings() { sibling_affecting_selectors.push(selector.clone()); } if selector.matches_non_common_style_affecting_attribute() { non_common_style_affecting_attributes_selectors.push(selector.clone()); } } } CssRule::Keyframes(ref keyframes_rule) => { let keyframes_rule = keyframes_rule.read(); debug!("Found valid keyframes rule: {:?}", *keyframes_rule); if let Some(animation) = KeyframesAnimation::from_keyframes(&keyframes_rule.keyframes) { debug!("Found valid keyframe animation: {:?}", animation); animations.insert(keyframes_rule.name.clone(), animation); } else { // If there's a valid keyframes rule, even if it doesn't // produce an animation, should shadow other animations // with the same name. animations.remove(&keyframes_rule.name); } } // We don't care about any other rule. _ => {} } }); debug!("Stylist stats:"); debug!(" - Got {} sibling-affecting selectors", sibling_affecting_selectors.len()); debug!(" - Got {} non-common-style-attribute-affecting selectors", non_common_style_affecting_attributes_selectors.len()); debug!(" - Got {} deps for style-hint calculation", state_deps.len()); TheSelectorImpl::each_precomputed_pseudo_element(|pseudo| { // TODO: Consider not doing this and just getting the rules on the // fly. It should be a bit slower, but we'd take rid of the // extra field, and avoid this precomputation entirely. if let Some(map) = pseudos_map.remove(&pseudo) { let mut declarations = vec![]; map.user_agent.get_universal_rules(&mut declarations); precomputed_pseudo_element_decls.insert(pseudo, declarations); } }) } /// Computes the style for a given "precomputed" pseudo-element, taking the /// universal rules and applying them. /// /// If `inherit_all` is true, then all properties are inherited from the parent; otherwise, /// non-inherited properties are reset to their initial values. The flow constructor uses this /// flag when constructing anonymous flows. pub fn precomputed_values_for_pseudo(&self, pseudo: &PseudoElement, parent: Option<&Arc>, inherit_all: bool) -> Option<(Arc, StrongRuleNode)> { debug_assert!(TheSelectorImpl::pseudo_element_cascade_type(pseudo).is_precomputed()); if let Some(declarations) = self.precomputed_pseudo_element_decls.get(pseudo) { // FIXME(emilio): When we've taken rid of the cascade we can just // use into_iter. let rule_node = self.rule_tree.insert_ordered_rules( declarations.iter().map(|a| (a.source.clone(), a.importance))); let mut flags = CascadeFlags::empty(); if inherit_all { flags.insert(INHERIT_ALL) } let computed = properties::cascade(self.device.au_viewport_size(), &rule_node, parent.map(|p| &**p), None, Box::new(StdoutErrorReporter), flags); Some((Arc::new(computed), rule_node)) } else { parent.map(|p| (p.clone(), self.rule_tree.root())) } } /// Returns the style for an anonymous box of the given type. #[cfg(feature = "servo")] pub fn style_for_anonymous_box(&self, pseudo: &PseudoElement, parent_style: &Arc) -> Arc { // For most (but not all) pseudo-elements, we inherit all values from the parent. let inherit_all = match *pseudo { PseudoElement::ServoInputText => false, PseudoElement::ServoAnonymousBlock | PseudoElement::ServoAnonymousTable | PseudoElement::ServoAnonymousTableCell | PseudoElement::ServoAnonymousTableRow | PseudoElement::ServoAnonymousTableWrapper | PseudoElement::ServoTableWrapper => true, PseudoElement::Before | PseudoElement::After | PseudoElement::Selection | PseudoElement::DetailsSummary | PseudoElement::DetailsContent => { unreachable!("That pseudo doesn't represent an anonymous box!") } }; self.precomputed_values_for_pseudo(&pseudo, Some(parent_style), inherit_all) .expect("style_for_anonymous_box(): No precomputed values for that pseudo!") .0 } pub fn lazily_compute_pseudo_element_style(&self, element: &E, pseudo: &PseudoElement, parent: &Arc) -> Option<(Arc, StrongRuleNode)> where E: Element + fmt::Debug + PresentationalHintsSynthetizer { debug_assert!(TheSelectorImpl::pseudo_element_cascade_type(pseudo).is_lazy()); if self.pseudos_map.get(pseudo).is_none() { return None; } let mut declarations = vec![]; self.push_applicable_declarations(element, None, None, Some(pseudo), &mut declarations, MatchingReason::ForStyling); let rule_node = self.rule_tree.insert_ordered_rules(declarations.into_iter().map(|a| (a.source.clone(), a.importance))); let computed = properties::cascade(self.device.au_viewport_size(), &rule_node, Some(&**parent), None, Box::new(StdoutErrorReporter), CascadeFlags::empty()); Some((Arc::new(computed), rule_node)) } pub fn set_device(&mut self, mut device: Device, stylesheets: &[Arc]) { let cascaded_rule = ViewportRule { declarations: viewport::Cascade::from_stylesheets(stylesheets, &device).finish(), }; self.viewport_constraints = ViewportConstraints::maybe_new(device.viewport_size, &cascaded_rule); if let Some(ref constraints) = self.viewport_constraints { device = Device::new(MediaType::Screen, constraints.size); } fn mq_eval_changed(rules: &[CssRule], before: &Device, after: &Device) -> bool { for rule in rules { if rule.with_nested_rules_and_mq(|rules, mq| { if let Some(mq) = mq { if mq.evaluate(before) != mq.evaluate(after) { return true } } mq_eval_changed(rules, before, after) }) { return true } } false } self.is_device_dirty |= stylesheets.iter().any(|stylesheet| { mq_eval_changed(&stylesheet.rules, &self.device, &device) }); self.device = device; } pub fn viewport_constraints(&self) -> &Option { &self.viewport_constraints } pub fn set_quirks_mode(&mut self, enabled: bool) { self.quirks_mode = enabled; } /// Returns the applicable CSS declarations for the given element. /// This corresponds to `ElementRuleCollector` in WebKit. /// /// The returned boolean indicates whether the style is *shareable*; /// that is, whether the matched selectors are simple enough to allow the /// matching logic to be reduced to the logic in /// `css::matching::PrivateMatchMethods::candidate_element_allows_for_style_sharing`. #[allow(unsafe_code)] pub fn push_applicable_declarations( &self, element: &E, parent_bf: Option<&BloomFilter>, style_attribute: Option<&Arc>>, pseudo_element: Option<&PseudoElement>, applicable_declarations: &mut V, reason: MatchingReason) -> StyleRelations where E: Element + fmt::Debug + PresentationalHintsSynthetizer, V: Push + VecLike { debug_assert!(!self.is_device_dirty); debug_assert!(style_attribute.is_none() || pseudo_element.is_none(), "Style attributes do not apply to pseudo-elements"); debug_assert!(pseudo_element.is_none() || !TheSelectorImpl::pseudo_element_cascade_type(pseudo_element.as_ref().unwrap()) .is_precomputed()); let map = match pseudo_element { Some(ref pseudo) => self.pseudos_map.get(pseudo).unwrap(), None => &self.element_map, }; let mut relations = StyleRelations::empty(); debug!("Determining if style is shareable: pseudo: {}", pseudo_element.is_some()); // Step 1: Normal user-agent rules. map.user_agent.get_all_matching_rules(element, parent_bf, applicable_declarations, &mut relations, reason, Importance::Normal); debug!("UA normal: {:?}", relations); // Step 2: Presentational hints. let length = applicable_declarations.len(); element.synthesize_presentational_hints_for_legacy_attributes(applicable_declarations); if applicable_declarations.len() != length { // Never share style for elements with preshints relations |= AFFECTED_BY_PRESENTATIONAL_HINTS; } debug!("preshints: {:?}", relations); // Step 3: User and author normal rules. map.user.get_all_matching_rules(element, parent_bf, applicable_declarations, &mut relations, reason, Importance::Normal); debug!("user normal: {:?}", relations); map.author.get_all_matching_rules(element, parent_bf, applicable_declarations, &mut relations, reason, Importance::Normal); debug!("author normal: {:?}", relations); // Step 4: Normal style attributes. if let Some(sa) = style_attribute { if sa.read().any_normal() { relations |= AFFECTED_BY_STYLE_ATTRIBUTE; Push::push( applicable_declarations, ApplicableDeclarationBlock::from_declarations(sa.clone(), Importance::Normal)); } } debug!("style attr: {:?}", relations); // Step 5: Author-supplied `!important` rules. map.author.get_all_matching_rules(element, parent_bf, applicable_declarations, &mut relations, reason, Importance::Important); debug!("author important: {:?}", relations); // Step 6: `!important` style attributes. if let Some(sa) = style_attribute { if sa.read().any_important() { relations |= AFFECTED_BY_STYLE_ATTRIBUTE; Push::push( applicable_declarations, ApplicableDeclarationBlock::from_declarations(sa.clone(), Importance::Important)); } } debug!("style attr important: {:?}", relations); // Step 7: User and UA `!important` rules. map.user.get_all_matching_rules(element, parent_bf, applicable_declarations, &mut relations, reason, Importance::Important); debug!("user important: {:?}", relations); map.user_agent.get_all_matching_rules(element, parent_bf, applicable_declarations, &mut relations, reason, Importance::Important); debug!("UA important: {:?}", relations); debug!("push_applicable_declarations: shareable: {:?}", relations); relations } #[inline] pub fn is_device_dirty(&self) -> bool { self.is_device_dirty } #[inline] pub fn animations(&self) -> &FnvHashMap { &self.animations } pub fn match_same_not_common_style_affecting_attributes_rules(&self, element: &E, candidate: &E) -> bool where E: ElementExt { use selectors::matching::StyleRelations; use selectors::matching::matches_complex_selector; // TODO(emilio): we can probably do better, the candidate should already // know what rules it matches. Also, we should only match until we find // a descendant combinator, the rest should be ok, since the parent is // the same. // // TODO(emilio): Use the bloom filter, since they contain the element's // ancestor chain and it's correct for the candidate too. for ref selector in self.non_common_style_affecting_attributes_selectors.iter() { let element_matches = matches_complex_selector(&selector.complex_selector, element, None, &mut StyleRelations::empty(), MatchingReason::Other); let candidate_matches = matches_complex_selector(&selector.complex_selector, candidate, None, &mut StyleRelations::empty(), MatchingReason::Other); if element_matches != candidate_matches { return false; } } true } #[inline] pub fn rule_tree_root(&self) -> StrongRuleNode { self.rule_tree.root() } pub fn match_same_sibling_affecting_rules(&self, element: &E, candidate: &E) -> bool where E: ElementExt { use selectors::matching::StyleRelations; use selectors::matching::matches_complex_selector; // TODO(emilio): we can probably do better, the candidate should already // know what rules it matches. // // TODO(emilio): Use the bloom filter, since they contain the element's // ancestor chain and it's correct for the candidate too. for ref selector in self.sibling_affecting_selectors.iter() { let element_matches = matches_complex_selector(&selector.complex_selector, element, None, &mut StyleRelations::empty(), MatchingReason::Other); let candidate_matches = matches_complex_selector(&selector.complex_selector, candidate, None, &mut StyleRelations::empty(), MatchingReason::Other); if element_matches != candidate_matches { debug!("match_same_sibling_affecting_rules: Failure due to {:?}", selector.complex_selector); return false; } } true } pub fn compute_restyle_hint(&self, element: &E, snapshot: &Snapshot, // NB: We need to pass current_state as an argument because // selectors::Element doesn't provide access to ElementState // directly, and computing it from the ElementState would be // more expensive than getting it directly from the caller. current_state: ElementState) -> RestyleHint where E: ElementExt + Clone { self.state_deps.compute_hint(element, snapshot, current_state) } } /// Map that contains the CSS rules for a specific PseudoElement /// (or lack of PseudoElement). #[cfg_attr(feature = "servo", derive(HeapSizeOf))] struct PerPseudoElementSelectorMap { /// Rules from user agent stylesheets user_agent: SelectorMap, /// Rules from author stylesheets author: SelectorMap, /// Rules from user stylesheets user: SelectorMap, } impl PerPseudoElementSelectorMap { #[inline] fn new() -> Self { PerPseudoElementSelectorMap { user_agent: SelectorMap::new(), author: SelectorMap::new(), user: SelectorMap::new(), } } #[inline] fn borrow_for_origin(&mut self, origin: &Origin) -> &mut SelectorMap { match *origin { Origin::UserAgent => &mut self.user_agent, Origin::Author => &mut self.author, Origin::User => &mut self.user, } } } /// Map element data to Rules whose last simple selector starts with them. /// /// e.g., /// "p > img" would go into the set of Rules corresponding to the /// element "img" /// "a .foo .bar.baz" would go into the set of Rules corresponding to /// the class "bar" /// /// Because we match Rules right-to-left (i.e., moving up the tree /// from an element), we need to compare the last simple selector in the /// Rule with the element. /// /// So, if an element has ID "id1" and classes "foo" and "bar", then all /// the rules it matches will have their last simple selector starting /// either with "#id1" or with ".foo" or with ".bar". /// /// Hence, the union of the rules keyed on each of element's classes, ID, /// element name, etc. will contain the Rules that actually match that /// element. #[cfg_attr(feature = "servo", derive(HeapSizeOf))] pub struct SelectorMap { // TODO: Tune the initial capacity of the HashMap pub id_hash: FnvHashMap>, pub class_hash: FnvHashMap>, pub local_name_hash: FnvHashMap>, /// Same as local_name_hash, but keys are lower-cased. /// For HTML elements in HTML documents. pub lower_local_name_hash: FnvHashMap>, /// Rules that don't have ID, class, or element selectors. pub other_rules: Vec, /// Whether this hash is empty. pub empty: bool, } #[inline] fn sort_by_key K, K: Ord>(v: &mut [T], f: F) { sort_by(v, &|a, b| f(a).cmp(&f(b))) } impl SelectorMap { pub fn new() -> Self { SelectorMap { id_hash: HashMap::default(), class_hash: HashMap::default(), local_name_hash: HashMap::default(), lower_local_name_hash: HashMap::default(), other_rules: Vec::new(), empty: true, } } /// Append to `rule_list` all Rules in `self` that match element. /// /// Extract matching rules as per element's ID, classes, tag name, etc.. /// Sort the Rules at the end to maintain cascading order. pub fn get_all_matching_rules(&self, element: &E, parent_bf: Option<&BloomFilter>, matching_rules_list: &mut V, relations: &mut StyleRelations, reason: MatchingReason, importance: Importance) where E: Element, V: VecLike { if self.empty { return } // At the end, we're going to sort the rules that we added, so remember where we began. let init_len = matching_rules_list.len(); if let Some(id) = element.get_id() { SelectorMap::get_matching_rules_from_hash(element, parent_bf, &self.id_hash, &id, matching_rules_list, relations, reason, importance) } element.each_class(|class| { SelectorMap::get_matching_rules_from_hash(element, parent_bf, &self.class_hash, class, matching_rules_list, relations, reason, importance); }); let local_name_hash = if element.is_html_element_in_html_document() { &self.lower_local_name_hash } else { &self.local_name_hash }; SelectorMap::get_matching_rules_from_hash(element, parent_bf, local_name_hash, element.get_local_name(), matching_rules_list, relations, reason, importance); SelectorMap::get_matching_rules(element, parent_bf, &self.other_rules, matching_rules_list, relations, reason, importance); // Sort only the rules we just added. sort_by_key(&mut matching_rules_list[init_len..], |block| (block.specificity, block.source_order)); } /// Append to `rule_list` all universal Rules (rules with selector `*|*`) in /// `self` sorted by specifity and source order. #[allow(unsafe_code)] pub fn get_universal_rules(&self, matching_rules_list: &mut V) where V: VecLike { if self.empty { return } let init_len = matching_rules_list.len(); for rule in self.other_rules.iter() { if rule.selector.compound_selector.is_empty() && rule.selector.next.is_none() { let guard = rule.style_rule.read(); let block = guard.block.read(); if block.any_normal() { matching_rules_list.push( rule.to_applicable_declaration_block(Importance::Normal)); } if block.any_important() { matching_rules_list.push( rule.to_applicable_declaration_block(Importance::Important)); } } } sort_by_key(&mut matching_rules_list[init_len..], |block| (block.specificity, block.source_order)); } fn get_matching_rules_from_hash( element: &E, parent_bf: Option<&BloomFilter>, hash: &FnvHashMap>, key: &BorrowedStr, matching_rules: &mut Vector, relations: &mut StyleRelations, reason: MatchingReason, importance: Importance) where E: Element, Str: Borrow + Eq + Hash, BorrowedStr: Eq + Hash, Vector: VecLike { if let Some(rules) = hash.get(key) { SelectorMap::get_matching_rules(element, parent_bf, rules, matching_rules, relations, reason, importance) } } /// Adds rules in `rules` that match `element` to the `matching_rules` list. #[allow(unsafe_code)] fn get_matching_rules(element: &E, parent_bf: Option<&BloomFilter>, rules: &[Rule], matching_rules: &mut V, relations: &mut StyleRelations, reason: MatchingReason, importance: Importance) where E: Element, V: VecLike { for rule in rules.iter() { let guard = rule.style_rule.read(); let block = guard.block.read(); let any_declaration_for_importance = if importance.important() { block.any_important() } else { block.any_normal() }; if any_declaration_for_importance && matches_complex_selector(&*rule.selector, element, parent_bf, relations, reason) { matching_rules.push( rule.to_applicable_declaration_block(importance)); } } } /// Insert rule into the correct hash. /// Order in which to try: id_hash, class_hash, local_name_hash, other_rules. pub fn insert(&mut self, rule: Rule) { self.empty = false; if let Some(id_name) = SelectorMap::get_id_name(&rule) { find_push(&mut self.id_hash, id_name, rule); return; } if let Some(class_name) = SelectorMap::get_class_name(&rule) { find_push(&mut self.class_hash, class_name, rule); return; } if let Some(LocalNameSelector { name, lower_name }) = SelectorMap::get_local_name(&rule) { find_push(&mut self.local_name_hash, name, rule.clone()); find_push(&mut self.lower_local_name_hash, lower_name, rule); return; } self.other_rules.push(rule); } /// Retrieve the first ID name in Rule, or None otherwise. pub fn get_id_name(rule: &Rule) -> Option { for ss in &rule.selector.compound_selector { // TODO(pradeep): Implement case-sensitivity based on the // document type and quirks mode. if let SimpleSelector::ID(ref id) = *ss { return Some(id.clone()); } } None } /// Retrieve the FIRST class name in Rule, or None otherwise. pub fn get_class_name(rule: &Rule) -> Option { for ss in &rule.selector.compound_selector { // TODO(pradeep): Implement case-sensitivity based on the // document type and quirks mode. if let SimpleSelector::Class(ref class) = *ss { return Some(class.clone()); } } None } /// Retrieve the name if it is a type selector, or None otherwise. pub fn get_local_name(rule: &Rule) -> Option> { for ss in &rule.selector.compound_selector { if let SimpleSelector::LocalName(ref n) = *ss { return Some(LocalNameSelector { name: n.name.clone(), lower_name: n.lower_name.clone(), }) } } None } } #[cfg_attr(feature = "servo", derive(HeapSizeOf))] #[derive(Clone, Debug)] pub struct Rule { // This is an Arc because Rule will essentially be cloned for every element // that it matches. Selector contains an owned vector (through // ComplexSelector) and we want to avoid the allocation. #[cfg_attr(feature = "servo", ignore_heap_size_of = "Arc")] pub selector: Arc>, #[cfg_attr(feature = "servo", ignore_heap_size_of = "Arc")] pub style_rule: Arc>, pub source_order: usize, pub specificity: u32, } impl Rule { fn to_applicable_declaration_block(&self, importance: Importance) -> ApplicableDeclarationBlock { ApplicableDeclarationBlock { source: StyleSource::Style(self.style_rule.clone()), importance: importance, source_order: self.source_order, specificity: self.specificity, } } } /// A property declaration together with its precedence among rules of equal specificity so that /// we can sort them. #[cfg_attr(feature = "servo", derive(HeapSizeOf))] #[derive(Debug, Clone)] pub struct ApplicableDeclarationBlock { #[cfg_attr(feature = "servo", ignore_heap_size_of = "Arc")] pub source: StyleSource, pub importance: Importance, pub source_order: usize, pub specificity: u32, } impl ApplicableDeclarationBlock { #[inline] pub fn from_declarations(declarations: Arc>, importance: Importance) -> Self { ApplicableDeclarationBlock { source: StyleSource::Declarations(declarations), source_order: 0, specificity: 0, importance: importance, } } } pub struct ApplicableDeclarationBlockIter<'a> { iter: slice::Iter<'a, (PropertyDeclaration, Importance)>, importance: Importance, } impl<'a> Iterator for ApplicableDeclarationBlockIter<'a> { type Item = &'a PropertyDeclaration; #[inline] fn next(&mut self) -> Option { while let Some(&(ref declaration, importance)) = self.iter.next() { if importance == self.importance { return Some(declaration) } } None } } impl<'a> DoubleEndedIterator for ApplicableDeclarationBlockIter<'a> { #[inline] fn next_back(&mut self) -> Option { while let Some(&(ref declaration, importance)) = self.iter.next_back() { if importance == self.importance { return Some(declaration) } } None } } #[inline] fn find_push(map: &mut FnvHashMap>, key: Str, value: Rule) { map.entry(key).or_insert_with(Vec::new).push(value) }