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
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* 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/. */
#include "nsFrameList.h"
#include "mozilla/ArenaObjectID.h"
#include "mozilla/PresShell.h"
#include "nsBidiPresUtils.h"
#include "nsContainerFrame.h"
#include "nsGkAtoms.h"
#include "nsILineIterator.h"
#include "nsLayoutUtils.h"
#include "nsPresContext.h"
using namespace mozilla;
namespace mozilla {
namespace layout {
namespace detail {
const AlignedFrameListBytes gEmptyFrameListBytes = {0};
} // namespace detail
} // namespace layout
} // namespace mozilla
void* nsFrameList::operator new(size_t sz, mozilla::PresShell* aPresShell) {
return aPresShell->AllocateByObjectID(eArenaObjectID_nsFrameList, sz);
}
void nsFrameList::Delete(mozilla::PresShell* aPresShell) {
MOZ_ASSERT(this != &EmptyList(), "Shouldn't Delete() this list");
NS_ASSERTION(IsEmpty(), "Shouldn't Delete() a non-empty list");
aPresShell->FreeByObjectID(eArenaObjectID_nsFrameList, this);
}
void nsFrameList::DestroyFrames() {
while (nsIFrame* frame = RemoveFirstChild()) {
frame->Destroy();
}
mLastChild = nullptr;
}
void nsFrameList::DestroyFramesFrom(
nsIFrame* aDestructRoot, layout::PostFrameDestroyData& aPostDestroyData) {
MOZ_ASSERT(aDestructRoot, "Missing destruct root");
while (nsIFrame* frame = RemoveFirstChild()) {
frame->DestroyFrom(aDestructRoot, aPostDestroyData);
}
mLastChild = nullptr;
}
void nsFrameList::SetFrames(nsIFrame* aFrameList) {
MOZ_ASSERT(!mFirstChild, "Losing frames");
mFirstChild = aFrameList;
mLastChild = nsLayoutUtils::GetLastSibling(mFirstChild);
}
void nsFrameList::RemoveFrame(nsIFrame* aFrame) {
MOZ_ASSERT(aFrame, "null ptr");
#ifdef DEBUG_FRAME_LIST
// ContainsFrame is O(N)
MOZ_ASSERT(ContainsFrame(aFrame), "wrong list");
#endif
nsIFrame* nextFrame = aFrame->GetNextSibling();
if (aFrame == mFirstChild) {
mFirstChild = nextFrame;
aFrame->SetNextSibling(nullptr);
if (!nextFrame) {
mLastChild = nullptr;
}
} else {
nsIFrame* prevSibling = aFrame->GetPrevSibling();
NS_ASSERTION(prevSibling && prevSibling->GetNextSibling() == aFrame,
"Broken frame linkage");
prevSibling->SetNextSibling(nextFrame);
aFrame->SetNextSibling(nullptr);
if (!nextFrame) {
mLastChild = prevSibling;
}
}
}
nsFrameList nsFrameList::RemoveFramesAfter(nsIFrame* aAfterFrame) {
if (!aAfterFrame) {
nsFrameList result;
result.InsertFrames(nullptr, nullptr, *this);
return result;
}
MOZ_ASSERT(NotEmpty(), "illegal operation on empty list");
#ifdef DEBUG_FRAME_LIST
MOZ_ASSERT(ContainsFrame(aAfterFrame), "wrong list");
#endif
nsIFrame* tail = aAfterFrame->GetNextSibling();
// if (!tail) return EmptyList(); -- worth optimizing this case?
nsIFrame* oldLastChild = mLastChild;
mLastChild = aAfterFrame;
aAfterFrame->SetNextSibling(nullptr);
return nsFrameList(tail, tail ? oldLastChild : nullptr);
}
nsIFrame* nsFrameList::RemoveFirstChild() {
if (mFirstChild) {
nsIFrame* firstChild = mFirstChild;
RemoveFrame(firstChild);
return firstChild;
}
return nullptr;
}
void nsFrameList::DestroyFrame(nsIFrame* aFrame) {
MOZ_ASSERT(aFrame, "null ptr");
RemoveFrame(aFrame);
aFrame->Destroy();
}
nsFrameList::Slice nsFrameList::InsertFrames(nsContainerFrame* aParent,
nsIFrame* aPrevSibling,
nsFrameList& aFrameList) {
MOZ_ASSERT(aFrameList.NotEmpty(), "Unexpected empty list");
if (aParent) {
aFrameList.ApplySetParent(aParent);
}
NS_ASSERTION(IsEmpty() || FirstChild()->GetParent() ==
aFrameList.FirstChild()->GetParent(),
"frame to add has different parent");
NS_ASSERTION(!aPrevSibling || aPrevSibling->GetParent() ==
aFrameList.FirstChild()->GetParent(),
"prev sibling has different parent");
#ifdef DEBUG_FRAME_LIST
// ContainsFrame is O(N)
NS_ASSERTION(!aPrevSibling || ContainsFrame(aPrevSibling),
"prev sibling is not on this list");
#endif
nsIFrame* firstNewFrame = aFrameList.FirstChild();
nsIFrame* nextSibling;
if (aPrevSibling) {
nextSibling = aPrevSibling->GetNextSibling();
aPrevSibling->SetNextSibling(firstNewFrame);
} else {
nextSibling = mFirstChild;
mFirstChild = firstNewFrame;
}
nsIFrame* lastNewFrame = aFrameList.LastChild();
lastNewFrame->SetNextSibling(nextSibling);
if (!nextSibling) {
mLastChild = lastNewFrame;
}
VerifyList();
aFrameList.Clear();
return Slice(*this, firstNewFrame, nextSibling);
}
nsFrameList nsFrameList::ExtractHead(FrameLinkEnumerator& aLink) {
MOZ_ASSERT(&aLink.List() == this, "Unexpected list");
MOZ_ASSERT(!aLink.PrevFrame() ||
aLink.PrevFrame()->GetNextSibling() == aLink.NextFrame(),
"Unexpected PrevFrame()");
MOZ_ASSERT(aLink.PrevFrame() || aLink.NextFrame() == FirstChild(),
"Unexpected NextFrame()");
MOZ_ASSERT(!aLink.PrevFrame() || aLink.NextFrame() != FirstChild(),
"Unexpected NextFrame()");
MOZ_ASSERT(aLink.mEnd == nullptr,
"Unexpected mEnd for frame link enumerator");
nsIFrame* prev = aLink.PrevFrame();
nsIFrame* newFirstFrame = nullptr;
if (prev) {
// Truncate the list after |prev| and hand the first part to our new list.
prev->SetNextSibling(nullptr);
newFirstFrame = mFirstChild;
mFirstChild = aLink.NextFrame();
if (!mFirstChild) { // we handed over the whole list
mLastChild = nullptr;
}
// Now make sure aLink doesn't point to a frame we no longer have.
aLink.mPrev = nullptr;
}
// else aLink is pointing to before our first frame. Nothing to do.
return nsFrameList(newFirstFrame, prev);
}
nsFrameList nsFrameList::ExtractTail(FrameLinkEnumerator& aLink) {
MOZ_ASSERT(&aLink.List() == this, "Unexpected list");
MOZ_ASSERT(!aLink.PrevFrame() ||
aLink.PrevFrame()->GetNextSibling() == aLink.NextFrame(),
"Unexpected PrevFrame()");
MOZ_ASSERT(aLink.PrevFrame() || aLink.NextFrame() == FirstChild(),
"Unexpected NextFrame()");
MOZ_ASSERT(!aLink.PrevFrame() || aLink.NextFrame() != FirstChild(),
"Unexpected NextFrame()");
MOZ_ASSERT(aLink.mEnd == nullptr,
"Unexpected mEnd for frame link enumerator");
nsIFrame* prev = aLink.PrevFrame();
nsIFrame* newFirstFrame;
nsIFrame* newLastFrame;
if (prev) {
// Truncate the list after |prev| and hand the second part to our new list
prev->SetNextSibling(nullptr);
newFirstFrame = aLink.NextFrame();
newLastFrame = newFirstFrame ? mLastChild : nullptr;
mLastChild = prev;
} else {
// Hand the whole list over to our new list
newFirstFrame = mFirstChild;
newLastFrame = mLastChild;
Clear();
}
// Now make sure aLink doesn't point to a frame we no longer have.
aLink.mFrame = nullptr;
MOZ_ASSERT(aLink.AtEnd(), "What's going on here?");
return nsFrameList(newFirstFrame, newLastFrame);
}
nsIFrame* nsFrameList::FrameAt(int32_t aIndex) const {
MOZ_ASSERT(aIndex >= 0, "invalid arg");
if (aIndex < 0) return nullptr;
nsIFrame* frame = mFirstChild;
while ((aIndex-- > 0) && frame) {
frame = frame->GetNextSibling();
}
return frame;
}
int32_t nsFrameList::IndexOf(nsIFrame* aFrame) const {
int32_t count = 0;
for (nsIFrame* f = mFirstChild; f; f = f->GetNextSibling()) {
if (f == aFrame) return count;
++count;
}
return -1;
}
bool nsFrameList::ContainsFrame(const nsIFrame* aFrame) const {
MOZ_ASSERT(aFrame, "null ptr");
nsIFrame* frame = mFirstChild;
while (frame) {
if (frame == aFrame) {
return true;
}
frame = frame->GetNextSibling();
}
return false;
}
int32_t nsFrameList::GetLength() const {
int32_t count = 0;
nsIFrame* frame = mFirstChild;
while (frame) {
count++;
frame = frame->GetNextSibling();
}
return count;
}
void nsFrameList::ApplySetParent(nsContainerFrame* aParent) const {
NS_ASSERTION(aParent, "null ptr");
for (nsIFrame* f = FirstChild(); f; f = f->GetNextSibling()) {
f->SetParent(aParent);
}
}
/* static */
void nsFrameList::UnhookFrameFromSiblings(nsIFrame* aFrame) {
MOZ_ASSERT(aFrame->GetPrevSibling() && aFrame->GetNextSibling());
nsIFrame* const nextSibling = aFrame->GetNextSibling();
nsIFrame* const prevSibling = aFrame->GetPrevSibling();
aFrame->SetNextSibling(nullptr);
prevSibling->SetNextSibling(nextSibling);
MOZ_ASSERT(!aFrame->GetPrevSibling() && !aFrame->GetNextSibling());
}
#ifdef DEBUG_FRAME_DUMP
void nsFrameList::List(FILE* out) const {
fprintf_stderr(out, "<\n");
for (nsIFrame* frame = mFirstChild; frame; frame = frame->GetNextSibling()) {
frame->List(out, " ");
}
fprintf_stderr(out, ">\n");
}
#endif
nsIFrame* nsFrameList::GetPrevVisualFor(nsIFrame* aFrame) const {
if (!mFirstChild) return nullptr;
nsIFrame* parent = mFirstChild->GetParent();
if (!parent) return aFrame ? aFrame->GetPrevSibling() : LastChild();
nsBidiDirection paraDir = nsBidiPresUtils::ParagraphDirection(mFirstChild);
nsAutoLineIterator iter = parent->GetLineIterator();
if (!iter) {
// Parent is not a block Frame
if (parent->IsLineFrame()) {
// Line frames are not bidi-splittable, so need to consider bidi
// reordering
if (paraDir == NSBIDI_LTR) {
return nsBidiPresUtils::GetFrameToLeftOf(aFrame, mFirstChild, -1);
} else { // RTL
return nsBidiPresUtils::GetFrameToRightOf(aFrame, mFirstChild, -1);
}
} else {
// Just get the next or prev sibling, depending on block and frame
// direction.
if (nsBidiPresUtils::IsFrameInParagraphDirection(mFirstChild)) {
return aFrame ? aFrame->GetPrevSibling() : LastChild();
} else {
return aFrame ? aFrame->GetNextSibling() : mFirstChild;
}
}
}
// Parent is a block frame, so use the LineIterator to find the previous
// visual sibling on this line, or the last one on the previous line.
int32_t thisLine;
if (aFrame) {
thisLine = iter->FindLineContaining(aFrame);
if (thisLine < 0) return nullptr;
} else {
thisLine = iter->GetNumLines();
}
nsIFrame* frame = nullptr;
if (aFrame) {
auto line = iter->GetLine(thisLine).unwrap();
if (paraDir == NSBIDI_LTR) {
frame = nsBidiPresUtils::GetFrameToLeftOf(aFrame, line.mFirstFrameOnLine,
line.mNumFramesOnLine);
} else { // RTL
frame = nsBidiPresUtils::GetFrameToRightOf(aFrame, line.mFirstFrameOnLine,
line.mNumFramesOnLine);
}
}
if (!frame && thisLine > 0) {
// Get the last frame of the previous line
auto line = iter->GetLine(thisLine - 1).unwrap();
if (paraDir == NSBIDI_LTR) {
frame = nsBidiPresUtils::GetFrameToLeftOf(nullptr, line.mFirstFrameOnLine,
line.mNumFramesOnLine);
} else { // RTL
frame = nsBidiPresUtils::GetFrameToRightOf(
nullptr, line.mFirstFrameOnLine, line.mNumFramesOnLine);
}
}
return frame;
}
nsIFrame* nsFrameList::GetNextVisualFor(nsIFrame* aFrame) const {
if (!mFirstChild) return nullptr;
nsIFrame* parent = mFirstChild->GetParent();
if (!parent) return aFrame ? aFrame->GetPrevSibling() : mFirstChild;
nsBidiDirection paraDir = nsBidiPresUtils::ParagraphDirection(mFirstChild);
nsAutoLineIterator iter = parent->GetLineIterator();
if (!iter) {
// Parent is not a block Frame
if (parent->IsLineFrame()) {
// Line frames are not bidi-splittable, so need to consider bidi
// reordering
if (paraDir == NSBIDI_LTR) {
return nsBidiPresUtils::GetFrameToRightOf(aFrame, mFirstChild, -1);
} else { // RTL
return nsBidiPresUtils::GetFrameToLeftOf(aFrame, mFirstChild, -1);
}
} else {
// Just get the next or prev sibling, depending on block and frame
// direction.
if (nsBidiPresUtils::IsFrameInParagraphDirection(mFirstChild)) {
return aFrame ? aFrame->GetNextSibling() : mFirstChild;
} else {
return aFrame ? aFrame->GetPrevSibling() : LastChild();
}
}
}
// Parent is a block frame, so use the LineIterator to find the next visual
// sibling on this line, or the first one on the next line.
int32_t thisLine;
if (aFrame) {
thisLine = iter->FindLineContaining(aFrame);
if (thisLine < 0) return nullptr;
} else {
thisLine = -1;
}
nsIFrame* frame = nullptr;
if (aFrame) {
auto line = iter->GetLine(thisLine).unwrap();
if (paraDir == NSBIDI_LTR) {
frame = nsBidiPresUtils::GetFrameToRightOf(aFrame, line.mFirstFrameOnLine,
line.mNumFramesOnLine);
} else { // RTL
frame = nsBidiPresUtils::GetFrameToLeftOf(aFrame, line.mFirstFrameOnLine,
line.mNumFramesOnLine);
}
}
int32_t numLines = iter->GetNumLines();
if (!frame && thisLine < numLines - 1) {
// Get the first frame of the next line
auto line = iter->GetLine(thisLine + 1).unwrap();
if (paraDir == NSBIDI_LTR) {
frame = nsBidiPresUtils::GetFrameToRightOf(
nullptr, line.mFirstFrameOnLine, line.mNumFramesOnLine);
} else { // RTL
frame = nsBidiPresUtils::GetFrameToLeftOf(nullptr, line.mFirstFrameOnLine,
line.mNumFramesOnLine);
}
}
return frame;
}
#ifdef DEBUG_FRAME_LIST
void nsFrameList::VerifyList() const {
NS_ASSERTION((mFirstChild == nullptr) == (mLastChild == nullptr),
"bad list state");
if (IsEmpty()) {
return;
}
// Simple algorithm to find a loop in a linked list -- advance pointers
// through it at speeds of 1 and 2, and if they ever get to be equal bail
NS_ASSERTION(!mFirstChild->GetPrevSibling(), "bad prev sibling pointer");
nsIFrame *first = mFirstChild, *second = mFirstChild;
for (;;) {
first = first->GetNextSibling();
second = second->GetNextSibling();
if (!second) {
break;
}
NS_ASSERTION(second->GetPrevSibling()->GetNextSibling() == second,
"bad prev sibling pointer");
second = second->GetNextSibling();
if (first == second) {
// Loop detected! Since second advances faster, they can't both be null;
// we would have broken out of the loop long ago.
NS_ERROR("loop in frame list. This will probably hang soon.");
return;
}
if (!second) {
break;
}
NS_ASSERTION(second->GetPrevSibling()->GetNextSibling() == second,
"bad prev sibling pointer");
}
NS_ASSERTION(mLastChild == nsLayoutUtils::GetLastSibling(mFirstChild),
"bogus mLastChild");
// XXX we should also assert that all GetParent() are either null or
// the same non-null value, but nsCSSFrameConstructor::nsFrameItems
// prevents that, e.g. table captions.
}
#endif
namespace mozilla {
AutoFrameListPtr::~AutoFrameListPtr() {
if (mFrameList) {
mFrameList->Delete(mPresContext->PresShell());
}
}
} // namespace mozilla
|