| LEFT | RIGHT |
| 1 /* | 1 /* |
| 2 * This file is part of Adblock Plus <https://adblockplus.org/>, | 2 * This file is part of Adblock Plus <https://adblockplus.org/>, |
| 3 * Copyright (C) 2006-present eyeo GmbH | 3 * Copyright (C) 2006-present eyeo GmbH |
| 4 * | 4 * |
| 5 * Adblock Plus is free software: you can redistribute it and/or modify | 5 * Adblock Plus is free software: you can redistribute it and/or modify |
| 6 * it under the terms of the GNU General Public License version 3 as | 6 * it under the terms of the GNU General Public License version 3 as |
| 7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
| 8 * | 8 * |
| 9 * Adblock Plus is distributed in the hope that it will be useful, | 9 * Adblock Plus is distributed in the hope that it will be useful, |
| 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| (...skipping 18 matching lines...) Expand all Loading... |
| 29 */ | 29 */ |
| 30 function positionInParent(node) | 30 function positionInParent(node) |
| 31 { | 31 { |
| 32 let {children} = node.parentNode; | 32 let {children} = node.parentNode; |
| 33 for (let i = 0; i < children.length; i++) | 33 for (let i = 0; i < children.length; i++) |
| 34 if (children[i] == node) | 34 if (children[i] == node) |
| 35 return i + 1; | 35 return i + 1; |
| 36 return 0; | 36 return 0; |
| 37 } | 37 } |
| 38 | 38 |
| 39 function isShadowRoot(node) |
| 40 { |
| 41 return typeof ShadowRoot != "undefined" && node instanceof ShadowRoot; |
| 42 } |
| 43 |
| 39 function makeSelector(node, selector) | 44 function makeSelector(node, selector) |
| 40 { | 45 { |
| 41 if (node == null) | 46 if (node == null) |
| 42 return null; | 47 return null; |
| 43 | 48 |
| 44 // If this is the topmost element in a shadow DOM, climb up one more level | 49 // If this is the topmost element in a shadow DOM, climb up one more level |
| 45 // and then use a ":host" prefix. | 50 // and then use a ":host" prefix. |
| 46 if (!node.parentElement && !(node.parentNode instanceof ShadowRoot)) | 51 if (!node.parentElement && !isShadowRoot(node.parentNode)) |
| 47 { | 52 { |
| 48 let newSelector = node instanceof ShadowRoot ? ":host" : ":root"; | 53 let newSelector = isShadowRoot(node) ? ":host" : ":root"; |
| 49 if (selector) | 54 if (selector) |
| 50 newSelector += " > " + selector; | 55 newSelector += " > " + selector; |
| 51 return newSelector; | 56 return newSelector; |
| 52 } | 57 } |
| 53 let idx = positionInParent(node); | 58 let idx = positionInParent(node); |
| 54 if (idx > 0) | 59 if (idx > 0) |
| 55 { | 60 { |
| 56 let newSelector = `${node.tagName}:nth-child(${idx})`; | 61 let newSelector = `${node.tagName}:nth-child(${idx})`; |
| 57 if (selector) | 62 if (selector) |
| 58 newSelector += " > " + selector; | 63 newSelector += " > " + selector; |
| (...skipping 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 139 yield null; | 144 yield null; |
| 140 else | 145 else |
| 141 yield* evaluate(chain, index + 1, selector, element, styles); | 146 yield* evaluate(chain, index + 1, selector, element, styles); |
| 142 } | 147 } |
| 143 // Just in case the getSelectors() generator above had to run some heavy | 148 // Just in case the getSelectors() generator above had to run some heavy |
| 144 // document.querySelectorAll() call which didn't produce any results, make | 149 // document.querySelectorAll() call which didn't produce any results, make |
| 145 // sure there is at least one point where execution can pause. | 150 // sure there is at least one point where execution can pause. |
| 146 yield null; | 151 yield null; |
| 147 } | 152 } |
| 148 | 153 |
| 149 function removeRedundantNodes(nodes) | 154 function isDescendantOf(node, subtrees) |
| 150 { | 155 { |
| 151 let nodesInfo = []; | 156 return subtrees.some(subtree => subtree.contains(node)); |
| 152 for (let node of nodes) | 157 } |
| 153 { | 158 |
| 154 let nodeInfo = {node}; | 159 function* extractAddedSubtrees(mutations) |
| 155 nodesInfo.push(nodeInfo); | 160 { |
| 156 | 161 let knownSubtrees = []; |
| 157 let link = node; | 162 |
| 158 while (link = link.parentNode) | 163 for (let mutation of mutations) |
| 159 { | 164 { |
| 160 // Since a node's ancestors are always added to the DOM before it, they | 165 for (let node of mutation.addedNodes) |
| 161 // will likely also appear before it in the list (at least on Chromium). | 166 { |
| 162 // If we encounter an ancestor here that has already been marked | 167 if (node instanceof Element && !isDescendantOf(node, knownSubtrees)) |
| 163 // redundant, we can mark this node redundant too. This is an | 168 { |
| 164 // optimization that saves us having to do a lookup in the set and keep | 169 knownSubtrees.push(node); |
| 165 // walking up the tree. | 170 yield node; |
| 166 if (link.redundant || nodes.has(link)) | |
| 167 { | |
| 168 nodeInfo.redundant = true; | |
| 169 break; | |
| 170 } | 171 } |
| 171 } | 172 } |
| 172 } | 173 } |
| 173 | |
| 174 for (let nodeInfo of nodesInfo) | |
| 175 { | |
| 176 if (nodeInfo.redundant) | |
| 177 nodes.delete(nodeInfo.node); | |
| 178 } | |
| 179 | |
| 180 return nodes; | |
| 181 } | 174 } |
| 182 | 175 |
| 183 function* traverse(nodes) | 176 function* traverse(nodes) |
| 184 { | 177 { |
| 185 for (let node of nodes) | 178 for (let node of nodes) |
| 186 { | 179 { |
| 187 yield* traverse(node.children); | 180 yield* traverse(node.children); |
| 188 yield node; | 181 yield node; |
| 189 } | 182 } |
| 190 } | 183 } |
| (...skipping 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 362 yield [selector, subtree]; | 355 yield [selector, subtree]; |
| 363 } | 356 } |
| 364 }; | 357 }; |
| 365 | 358 |
| 366 function isSelectorHidingOnlyPattern(pattern) | 359 function isSelectorHidingOnlyPattern(pattern) |
| 367 { | 360 { |
| 368 return pattern.selectors.some(s => s.preferHideWithSelector) && | 361 return pattern.selectors.some(s => s.preferHideWithSelector) && |
| 369 !pattern.selectors.some(s => s.requiresHiding); | 362 !pattern.selectors.some(s => s.requiresHiding); |
| 370 } | 363 } |
| 371 | 364 |
| 372 function ElemHideEmulation(document, root, addSelectorsFunc, hideElemsFunc) | 365 function ElemHideEmulation(document, root, addSelectorsFunc, hideElemsFunc, |
| 366 shadowAttachedEventType) |
| 373 { | 367 { |
| 374 this.document = document; | 368 this.document = document; |
| 375 this.root = root || document; | 369 this.root = root || document; |
| 376 this.addSelectorsFunc = addSelectorsFunc; | 370 this.addSelectorsFunc = addSelectorsFunc; |
| 377 this.hideElemsFunc = hideElemsFunc; | 371 this.hideElemsFunc = hideElemsFunc; |
| 372 this.shadowAttachedEventType = shadowAttachedEventType; |
| 378 this.patterns = []; | 373 this.patterns = []; |
| 379 this.observer = new MutationObserver(this.observe.bind(this)); | 374 this.observer = new MutationObserver(this.observe.bind(this)); |
| 380 this.shadowEmulations = new WeakMap(); | 375 this.shadowEmulations = new WeakMap(); |
| 381 | 376 |
| 377 if (shadowAttachedEventType) |
| 378 { |
| 379 this.root.addEventListener(shadowAttachedEventType, |
| 380 this.onShadowAttached.bind(this), true); |
| 381 } |
| 382 |
| 382 if (this.root == this.document) | 383 if (this.root == this.document) |
| 383 { | |
| 384 this.document.addEventListener("load", this.onLoad.bind(this), true); | 384 this.document.addEventListener("load", this.onLoad.bind(this), true); |
| 385 this.document.addEventListener("shadowAttached", | 385 else |
| 386 this.onShadowAttached.bind(this), true); | 386 this.findShadowRoots(this.root.children); |
| 387 } | |
| 388 } | 387 } |
| 389 | 388 |
| 390 ElemHideEmulation.prototype = { | 389 ElemHideEmulation.prototype = { |
| 391 isSameOrigin(stylesheet) | 390 isSameOrigin(stylesheet) |
| 392 { | 391 { |
| 393 try | 392 try |
| 394 { | 393 { |
| 395 return new URL(stylesheet.href).origin == this.document.location.origin; | 394 return new URL(stylesheet.href).origin == this.document.location.origin; |
| 396 } | 395 } |
| 397 catch (e) | 396 catch (e) |
| (...skipping 232 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 630 } | 629 } |
| 631 else | 630 else |
| 632 { | 631 { |
| 633 this._filteringInProgress = true; | 632 this._filteringInProgress = true; |
| 634 this._addSelectors(stylesheets, completion); | 633 this._addSelectors(stylesheets, completion); |
| 635 } | 634 } |
| 636 }, | 635 }, |
| 637 | 636 |
| 638 onLoad(event) | 637 onLoad(event) |
| 639 { | 638 { |
| 639 this.findShadowRoots(this.root.children); |
| 640 |
| 640 if (this.patterns.length == 0) | 641 if (this.patterns.length == 0) |
| 641 return; | 642 return; |
| 642 | 643 |
| 643 let stylesheet = event.target.sheet; | 644 let stylesheet = event.target.sheet; |
| 644 if (stylesheet) | 645 if (stylesheet) |
| 645 this.queueFiltering([stylesheet]); | 646 this.queueFiltering([stylesheet]); |
| 646 }, | 647 }, |
| 647 | 648 |
| 648 onShadowAttached(event) | 649 onShadowAttached(event) |
| 649 { | 650 { |
| (...skipping 10 matching lines...) Expand all Loading... |
| 660 this.addShadowRoot(shadowRoot); | 661 this.addShadowRoot(shadowRoot); |
| 661 }, | 662 }, |
| 662 | 663 |
| 663 addShadowRoot(shadowRoot) | 664 addShadowRoot(shadowRoot) |
| 664 { | 665 { |
| 665 if (!this.shadowEmulations.has(shadowRoot)) | 666 if (!this.shadowEmulations.has(shadowRoot)) |
| 666 { | 667 { |
| 667 let emulation = new ElemHideEmulation(this.document, | 668 let emulation = new ElemHideEmulation(this.document, |
| 668 shadowRoot, | 669 shadowRoot, |
| 669 this.addSelectorsFunc, | 670 this.addSelectorsFunc, |
| 670 this.hideElemsFunc); | 671 this.hideElemsFunc, |
| 672 this.shadowAttachedEventType); |
| 671 this.shadowEmulations.set(shadowRoot, emulation); | 673 this.shadowEmulations.set(shadowRoot, emulation); |
| 672 emulation.apply(this.patterns, true); | 674 emulation.apply(this.patterns, true); |
| 673 } | 675 } |
| 674 }, | 676 }, |
| 675 | 677 |
| 676 observe(mutations) | 678 findShadowRoots(nodes) |
| 677 { | 679 { |
| 678 let allAddedElements = new Set(); | 680 niceLoop(traverse(nodes), node => |
| 679 for (let mutation of mutations) | |
| 680 { | |
| 681 for (let node of mutation.addedNodes) | |
| 682 { | |
| 683 if (node instanceof Element) | |
| 684 allAddedElements.add(node); | |
| 685 } | |
| 686 } | |
| 687 | |
| 688 // Find any preattached shadows. | |
| 689 niceLoop(traverse(removeRedundantNodes(allAddedElements)), node => | |
| 690 { | 681 { |
| 691 let shadowRoot = node.shadowRoot; | 682 let shadowRoot = node.shadowRoot; |
| 692 if (shadowRoot) | 683 if (shadowRoot) |
| 693 this.addShadowRoot(shadowRoot); | 684 this.addShadowRoot(shadowRoot); |
| 694 }); | 685 }); |
| 686 }, |
| 687 |
| 688 observe(mutations) |
| 689 { |
| 690 if (typeof ShadowRoot != "undefined") |
| 691 { |
| 692 // Find any preattached shadows. |
| 693 this.findShadowRoots(extractAddedSubtrees(mutations)); |
| 694 } |
| 695 | 695 |
| 696 this.queueFiltering(); | 696 this.queueFiltering(); |
| 697 }, | 697 }, |
| 698 | 698 |
| 699 apply(patterns, parsed) | 699 apply(patterns, parsed) |
| 700 { | 700 { |
| 701 if (parsed) | 701 if (parsed) |
| 702 { | 702 { |
| 703 this.patterns = patterns; | 703 this.patterns = patterns; |
| 704 } | 704 } |
| (...skipping 18 matching lines...) Expand all Loading... |
| 723 attributes: true, | 723 attributes: true, |
| 724 characterData: true, | 724 characterData: true, |
| 725 subtree: true | 725 subtree: true |
| 726 } | 726 } |
| 727 ); | 727 ); |
| 728 } | 728 } |
| 729 } | 729 } |
| 730 }; | 730 }; |
| 731 | 731 |
| 732 exports.ElemHideEmulation = ElemHideEmulation; | 732 exports.ElemHideEmulation = ElemHideEmulation; |
| LEFT | RIGHT |