1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
|
/*
* Copyright (C) Research In Motion Limited 2010. All rights reserved.
* Copyright (C) 2006 Apple Computer, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "third_party/blink/renderer/core/page/frame_tree.h"
#include "base/compiler_specific.h"
#include "third_party/blink/renderer/core/dom/document.h"
#include "third_party/blink/renderer/core/frame/frame_client.h"
#include "third_party/blink/renderer/core/frame/local_dom_window.h"
#include "third_party/blink/renderer/core/frame/local_frame.h"
#include "third_party/blink/renderer/core/frame/local_frame_client.h"
#include "third_party/blink/renderer/core/frame/local_frame_view.h"
#include "third_party/blink/renderer/core/frame/remote_frame.h"
#include "third_party/blink/renderer/core/frame/remote_frame_view.h"
#include "third_party/blink/renderer/core/loader/frame_load_request.h"
#include "third_party/blink/renderer/core/page/chrome_client.h"
#include "third_party/blink/renderer/core/page/create_window.h"
#include "third_party/blink/renderer/core/page/page.h"
#include "third_party/blink/renderer/platform/instrumentation/use_counter.h"
#include "third_party/blink/renderer/platform/wtf/text/string_builder.h"
namespace blink {
namespace {
const unsigned kInvalidChildCount = ~0U;
} // namespace
FrameTree::FrameTree(Frame* this_frame)
: this_frame_(this_frame), scoped_child_count_(kInvalidChildCount) {}
FrameTree::~FrameTree() = default;
const AtomicString& FrameTree::GetName() const {
// TODO(andypaicu): remove this once we have gathered the data
if (experimental_set_nulled_name_) {
auto* frame = DynamicTo<LocalFrame>(this_frame_.Get());
if (!frame)
frame = DynamicTo<LocalFrame>(&Top());
if (frame) {
UseCounter::Count(frame->GetDocument(),
WebFeature::kCrossOriginMainFrameNulledNameAccessed);
if (!name_.empty()) {
UseCounter::Count(
frame->GetDocument(),
WebFeature::kCrossOriginMainFrameNulledNonEmptyNameAccessed);
}
}
}
if (cross_site_cross_browsing_context_group_set_nulled_name_) {
auto* frame = DynamicTo<LocalFrame>(this_frame_.Get());
if (frame && frame->IsOutermostMainFrame() && !name_.empty()) {
UseCounter::Count(
frame->GetDocument(),
WebFeature::
kCrossBrowsingContextGroupMainFrameNulledNonEmptyNameAccessed);
}
}
return name_;
}
// TODO(andypaicu): remove this once we have gathered the data
void FrameTree::ExperimentalSetNulledName() {
experimental_set_nulled_name_ = true;
}
// TODO(shuuran): remove this once we have gathered the data
void FrameTree::CrossSiteCrossBrowsingContextGroupSetNulledName() {
cross_site_cross_browsing_context_group_set_nulled_name_ = true;
}
void FrameTree::SetName(const AtomicString& name,
ReplicationPolicy replication) {
if (replication == kReplicate) {
// Avoid calling out to notify the embedder if the browsing context name
// didn't change. This is important to avoid violating the browser
// assumption that the unique name doesn't change if the browsing context
// name doesn't change.
// TODO(dcheng): This comment is indicative of a problematic layering
// violation. The browser should not be relying on the renderer to get this
// correct; unique name calculation should be moved up into the browser.
if (name != name_) {
// TODO(lukasza): https://crbug.com/660485: Eventually we need to also
// support replication of name changes that originate in a *remote* frame.
To<LocalFrame>(this_frame_.Get())->Client()->DidChangeName(name);
}
}
// TODO(andypaicu): remove this once we have gathered the data
experimental_set_nulled_name_ = false;
auto* frame = DynamicTo<LocalFrame>(this_frame_.Get());
if (frame && frame->IsOutermostMainFrame() && !name.empty()) {
// TODO(shuuran): remove this once we have gathered the data
cross_site_cross_browsing_context_group_set_nulled_name_ = false;
}
name_ = name;
}
DISABLE_CFI_PERF
Frame* FrameTree::Parent() const {
return this_frame_->Parent();
}
Frame& FrameTree::Top() const {
return *this_frame_->Top();
}
Frame* FrameTree::NextSibling() const {
return this_frame_->NextSibling();
}
Frame* FrameTree::FirstChild() const {
return this_frame_->FirstChild();
}
Frame* FrameTree::ScopedChild(unsigned index) const {
unsigned scoped_index = 0;
for (Frame* child = FirstChild(); child;
child = child->Tree().NextSibling()) {
if (child->Client()->InShadowTree())
continue;
if (scoped_index == index)
return child;
scoped_index++;
}
return nullptr;
}
Frame* FrameTree::ScopedChild(const AtomicString& name) const {
if (name.empty())
return nullptr;
for (Frame* child = FirstChild(); child;
child = child->Tree().NextSibling()) {
if (child->Client()->InShadowTree())
continue;
if (child->Tree().GetName() == name)
return child;
}
return nullptr;
}
unsigned FrameTree::ScopedChildCount() const {
if (scoped_child_count_ == kInvalidChildCount) {
unsigned scoped_count = 0;
for (Frame* child = FirstChild(); child;
child = child->Tree().NextSibling()) {
if (child->Client()->InShadowTree())
continue;
scoped_count++;
}
scoped_child_count_ = scoped_count;
}
return scoped_child_count_;
}
void FrameTree::InvalidateScopedChildCount() {
scoped_child_count_ = kInvalidChildCount;
}
unsigned FrameTree::ChildCount() const {
unsigned count = 0;
for (Frame* result = FirstChild(); result;
result = result->Tree().NextSibling())
++count;
return count;
}
Frame* FrameTree::FindFrameByName(const AtomicString& name) const {
// Named frame lookup should always be relative to a local frame.
DCHECK(IsA<LocalFrame>(this_frame_.Get()));
LocalFrame* current_frame = To<LocalFrame>(this_frame_.Get());
Frame* frame = FindFrameForNavigationInternal(name, KURL());
if (frame && !current_frame->CanNavigate(*frame)) {
frame = nullptr;
}
return frame;
}
FrameTree::FindResult FrameTree::FindOrCreateFrameForNavigation(
FrameLoadRequest& request,
const AtomicString& name) const {
// Named frame lookup should always be relative to a local frame.
DCHECK(IsA<LocalFrame>(this_frame_.Get()));
LocalFrame* current_frame = To<LocalFrame>(this_frame_.Get());
// A GetNavigationPolicy() value other than kNavigationPolicyCurrentTab at
// this point indicates that a user event modified the navigation policy
// (e.g., a ctrl-click). Let the user's action override any target attribute.
if (request.GetNavigationPolicy() != kNavigationPolicyCurrentTab)
return FindResult(current_frame, false);
const KURL& url = request.GetResourceRequest().Url();
Frame* frame = FindFrameForNavigationInternal(name, url, &request);
bool new_window = false;
if (!frame) {
frame = CreateNewWindow(*current_frame, request, name);
new_window = true;
// CreateNewWindow() might have modified NavigationPolicy.
// Set it back now that the new window is known to be the right one.
request.SetNavigationPolicy(kNavigationPolicyCurrentTab);
} else if (!current_frame->CanNavigate(*frame, url)) {
frame = nullptr;
}
if (frame && !new_window) {
if (frame->GetPage() != current_frame->GetPage())
frame->FocusPage(current_frame);
// Focusing can fire onblur, so check for detach.
if (!frame->GetPage())
frame = nullptr;
}
return FindResult(frame, new_window);
}
Frame* FrameTree::FindFrameForNavigationInternal(
const AtomicString& name,
const KURL& url,
FrameLoadRequest* request) const {
LocalFrame* current_frame = To<LocalFrame>(this_frame_.Get());
if (EqualIgnoringASCIICase(name, "_current")) {
UseCounter::Count(current_frame->GetDocument(), WebFeature::kTargetCurrent);
}
if (EqualIgnoringASCIICase(name, "_self") ||
EqualIgnoringASCIICase(name, "_current") || name.empty()) {
return current_frame;
}
if (EqualIgnoringASCIICase(name, "_top")) {
return &Top();
}
if (EqualIgnoringASCIICase(name, "_unfencedTop")) {
// In fenced frames, we set a flag that will later indicate to the browser
// that this is an _unfencedTop navigation, and return the current frame
// so that the renderer-side checks will succeed.
// TODO(crbug.com/1315802): Refactor MPArch _unfencedTop handling.
if (current_frame->IsInFencedFrameTree() && request != nullptr) {
request->SetIsUnfencedTopNavigation(true);
return current_frame;
}
}
if (EqualIgnoringASCIICase(name, "_parent")) {
return Parent() ? Parent() : current_frame;
}
// Since "_blank" should never be any frame's name, the following just amounts
// to an optimization.
if (EqualIgnoringASCIICase(name, "_blank")) {
return nullptr;
}
// Search subtree starting with this frame first.
for (Frame* frame = current_frame; frame;
frame = frame->Tree().TraverseNext(current_frame)) {
if (frame->Tree().GetName() == name &&
current_frame->CanNavigate(*frame, url)) {
return frame;
}
}
// Search the entire tree for this page next.
Page* page = current_frame->GetPage();
// The frame could have been detached from the page, so check it.
if (!page) {
return nullptr;
}
for (Frame *top = ¤t_frame->Tree().Top(), *frame = top; frame;
frame = frame->Tree().TraverseNext(top)) {
// Skip descendants of this frame that were searched above to avoid
// showing duplicate console messages if a frame is found by name
// but access is blocked.
if (frame->Tree().GetName() == name &&
!frame->Tree().IsDescendantOf(current_frame) &&
current_frame->CanNavigate(*frame, url)) {
return frame;
}
}
// In fenced frames, only resolve target names using the above lookup methods
// (keywords, descendants, and the rest of the frame tree within the fence).
// TODO(crbug.com/1262022): Remove this early return when we get rid of
// ShadowDOM fenced frames, because it is unnecessary in MPArch.
if (current_frame->IsInFencedFrameTree()) {
return nullptr;
}
// Search the entire tree of each of the other pages in this namespace.
for (const Page* other_page : page->RelatedPages()) {
if (other_page == page || other_page->IsClosing()) {
continue;
}
for (Frame* frame = other_page->MainFrame(); frame;
frame = frame->Tree().TraverseNext(nullptr)) {
if (frame->Tree().GetName() == name &&
current_frame->CanNavigate(*frame, url)) {
return frame;
}
}
}
// Ask the embedder as a fallback.
Frame* named_frame = current_frame->Client()->FindFrame(name);
// The embedder can return a frame from another agent cluster. Make sure
// that the returned frame, if any, has explicitly allowed cross-agent
// cluster access.
DCHECK(!named_frame || current_frame->DomWindow()
->GetSecurityOrigin()
->IsGrantedCrossAgentClusterAccess());
return named_frame;
}
bool FrameTree::IsDescendantOf(const Frame* ancestor) const {
if (!ancestor)
return false;
if (this_frame_->GetPage() != ancestor->GetPage())
return false;
for (Frame* frame = this_frame_; frame; frame = frame->Tree().Parent()) {
if (frame == ancestor)
return true;
}
return false;
}
DISABLE_CFI_PERF
Frame* FrameTree::TraverseNext(const Frame* stay_within) const {
Frame* child = FirstChild();
if (child) {
DCHECK(!stay_within || child->Tree().IsDescendantOf(stay_within));
return child;
}
if (this_frame_ == stay_within)
return nullptr;
Frame* sibling = NextSibling();
if (sibling) {
DCHECK(!stay_within || sibling->Tree().IsDescendantOf(stay_within));
return sibling;
}
Frame* frame = this_frame_;
while (!sibling && (!stay_within || frame->Tree().Parent() != stay_within)) {
frame = frame->Tree().Parent();
if (!frame)
return nullptr;
sibling = frame->Tree().NextSibling();
}
if (frame) {
DCHECK(!stay_within || !sibling ||
sibling->Tree().IsDescendantOf(stay_within));
return sibling;
}
return nullptr;
}
void FrameTree::Trace(Visitor* visitor) const {
visitor->Trace(this_frame_);
}
} // namespace blink
#if DCHECK_IS_ON()
static void PrintIndent(int indent) {
for (int i = 0; i < indent; ++i)
printf(" ");
}
static void PrintFrames(const blink::Frame* frame,
const blink::Frame* targetFrame,
int indent) {
if (frame == targetFrame) {
printf("--> ");
PrintIndent(indent - 1);
} else {
PrintIndent(indent);
}
auto* local_frame = blink::DynamicTo<blink::LocalFrame>(frame);
blink::LocalFrameView* view = local_frame ? local_frame->View() : nullptr;
printf("Frame %p %dx%d\n", frame, view ? view->Width() : 0,
view ? view->Height() : 0);
PrintIndent(indent);
printf(" owner=%p\n", frame->Owner());
PrintIndent(indent);
printf(" frameView=%p\n", view);
PrintIndent(indent);
printf(" document=%p\n", local_frame ? local_frame->GetDocument() : nullptr);
PrintIndent(indent);
UNSAFE_TODO(
printf(" uri=%s\n\n",
local_frame && local_frame->GetDocument()
? local_frame->GetDocument()->Url().GetString().Utf8().c_str()
: nullptr));
for (blink::Frame* child = frame->Tree().FirstChild(); child;
child = child->Tree().NextSibling())
PrintFrames(child, targetFrame, indent + 1);
}
void ShowFrameTree(const blink::Frame* frame) {
if (!frame) {
printf("Null input frame\n");
return;
}
PrintFrames(&frame->Tree().Top(), frame, 0);
}
#endif // DCHECK_IS_ON()
|