Source/core/css/invalidation/DescendantInvalidationSet.h - Issue 946993002: Avoid style invalidation for empty sets.

Side by Side Diff: Source/core/css/invalidation/DescendantInvalidationSet.h

Issue 946993002: Avoid style invalidation for empty sets. (Closed) Base URL: https://chromium.googlesource.com/chromium/blink.git@master

Patch Set: Added dummy selectors to tests to force descendant invalidation Created 5 years, 10 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

« no previous file with comments | « LayoutTests/inspector/tracing/timeline-style-recalc-with-invalidator-invalidations.html ('k') | Source/core/css/invalidation/DescendantInvalidationSet.cpp » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

OLD	NEW
1 /*	1 /*

2 * Copyright (C) 2014 Google Inc. All rights reserved.	2 * Copyright (C) 2014 Google Inc. All rights reserved.

3 *	3 *

4 * Redistribution and use in source and binary forms, with or without	4 * Redistribution and use in source and binary forms, with or without

5 * modification, are permitted provided that the following conditions are	5 * modification, are permitted provided that the following conditions are

6 * met:	6 * met:

7 *	7 *

8 * * Redistributions of source code must retain the above copyright	8 * * Redistributions of source code must retain the above copyright

9 * notice, this list of conditions and the following disclaimer.	9 * notice, this list of conditions and the following disclaimer.

10 * * Redistributions in binary form must reproduce the above	10 * * Redistributions in binary form must reproduce the above

(...skipping 58 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
69	69

70 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; }	70 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; }

71 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; }	71 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; }

72	72

73 void setInsertionPointCrossing() { m_insertionPointCrossing = true; }	73 void setInsertionPointCrossing() { m_insertionPointCrossing = true; }

74 bool insertionPointCrossing() const { return m_insertionPointCrossing; }	74 bool insertionPointCrossing() const { return m_insertionPointCrossing; }

75	75

76 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; }	76 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; }

77 bool customPseudoInvalid() const { return m_customPseudoInvalid; }	77 bool customPseudoInvalid() const { return m_customPseudoInvalid; }

78	78

79 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr ibutes; }	79 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr ibutes && !m_customPseudoInvalid; }

80	80

81 void trace(Visitor*);	81 void trace(Visitor*);

82	82

83 void toTracedValue(TracedValue*) const;	83 void toTracedValue(TracedValue*) const;

84	84

85 #ifndef NDEBUG	85 #ifndef NDEBUG

86 void show() const;	86 void show() const;

87 #endif	87 #endif

88	88

89 private:	89 private:

(...skipping 19 matching lines...) Expand all Loading...
109 // If true, the invalidation must traverse into ShadowRoots with this set.	109 // If true, the invalidation must traverse into ShadowRoots with this set.

110 unsigned m_treeBoundaryCrossing : 1;	110 unsigned m_treeBoundaryCrossing : 1;

111	111

112 // If true, insertion point descendants must be invalidated.	112 // If true, insertion point descendants must be invalidated.

113 unsigned m_insertionPointCrossing : 1;	113 unsigned m_insertionPointCrossing : 1;

114 };	114 };

115	115

116 } // namespace blink	116 } // namespace blink

117	117

118 #endif // DescendantInvalidationSet_h	118 #endif // DescendantInvalidationSet_h

OLD	NEW