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
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* 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 "msgCore.h"
#include "nsMsgQuickSearchDBView.h"
#include "nsMsgFolderFlags.h"
#include "nsIMsgHdr.h"
#include "nsMsgBaseCID.h"
#include "nsIMsgImapMailFolder.h"
#include "nsImapCore.h"
#include "nsIMsgHdr.h"
#include "nsIDBFolderInfo.h"
#include "nsArrayEnumerator.h"
#include "nsMsgMessageFlags.h"
#include "nsIMutableArray.h"
#include "nsMsgUtils.h"
nsMsgQuickSearchDBView::nsMsgQuickSearchDBView()
{
m_usingCachedHits = false;
m_cacheEmpty = true;
}
nsMsgQuickSearchDBView::~nsMsgQuickSearchDBView()
{
}
NS_IMPL_ISUPPORTS_INHERITED(nsMsgQuickSearchDBView, nsMsgDBView, nsIMsgDBView, nsIMsgSearchNotify)
NS_IMETHODIMP nsMsgQuickSearchDBView::Open(nsIMsgFolder *folder, nsMsgViewSortTypeValue sortType, nsMsgViewSortOrderValue sortOrder, nsMsgViewFlagsTypeValue viewFlags, int32_t *pCount)
{
nsresult rv = nsMsgDBView::Open(folder, sortType, sortOrder, viewFlags, pCount);
NS_ENSURE_SUCCESS(rv, rv);
if (!m_db)
return NS_ERROR_NULL_POINTER;
if (pCount)
*pCount = 0;
m_viewFolder = nullptr;
return InitThreadedView(pCount);
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::CloneDBView(nsIMessenger *aMessengerInstance,
nsIMsgWindow *aMsgWindow,
nsIMsgDBViewCommandUpdater *aCmdUpdater,
nsIMsgDBView **_retval)
{
nsMsgQuickSearchDBView* newMsgDBView = new nsMsgQuickSearchDBView();
if (!newMsgDBView)
return NS_ERROR_OUT_OF_MEMORY;
nsresult rv = CopyDBView(newMsgDBView, aMessengerInstance, aMsgWindow, aCmdUpdater);
NS_ENSURE_SUCCESS(rv, rv);
NS_IF_ADDREF(*_retval = newMsgDBView);
return NS_OK;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::CopyDBView(nsMsgDBView *aNewMsgDBView,
nsIMessenger *aMessengerInstance,
nsIMsgWindow *aMsgWindow,
nsIMsgDBViewCommandUpdater *aCmdUpdater)
{
nsMsgThreadedDBView::CopyDBView(aNewMsgDBView, aMessengerInstance, aMsgWindow, aCmdUpdater);
nsMsgQuickSearchDBView* newMsgDBView = (nsMsgQuickSearchDBView *) aNewMsgDBView;
// now copy all of our private member data
newMsgDBView->m_origKeys = m_origKeys;
return NS_OK;
}
nsresult nsMsgQuickSearchDBView::DeleteMessages(nsIMsgWindow *window, nsMsgViewIndex *indices, int32_t numIndices, bool deleteStorage)
{
for (nsMsgViewIndex i = 0; i < (nsMsgViewIndex) numIndices; i++)
{
nsCOMPtr<nsIMsgDBHdr> msgHdr;
(void) GetMsgHdrForViewIndex(indices[i],getter_AddRefs(msgHdr));
if (msgHdr)
RememberDeletedMsgHdr(msgHdr);
}
return nsMsgDBView::DeleteMessages(window, indices, numIndices, deleteStorage);
}
NS_IMETHODIMP nsMsgQuickSearchDBView::DoCommand(nsMsgViewCommandTypeValue aCommand)
{
if (aCommand == nsMsgViewCommandType::markAllRead)
{
nsresult rv = NS_OK;
m_folder->EnableNotifications(nsIMsgFolder::allMessageCountNotifications, false, true /*dbBatching*/);
for (uint32_t i = 0; NS_SUCCEEDED(rv) && i < GetSize(); i++)
{
nsCOMPtr<nsIMsgDBHdr> msgHdr;
m_db->GetMsgHdrForKey(m_keys[i],getter_AddRefs(msgHdr));
rv = m_db->MarkHdrRead(msgHdr, true, nullptr);
}
m_folder->EnableNotifications(nsIMsgFolder::allMessageCountNotifications, true, true /*dbBatching*/);
nsCOMPtr<nsIMsgImapMailFolder> imapFolder = do_QueryInterface(m_folder);
if (NS_SUCCEEDED(rv) && imapFolder)
rv = imapFolder->StoreImapFlags(kImapMsgSeenFlag, true, m_keys.Elements(),
m_keys.Length(), nullptr);
m_db->SetSummaryValid(true);
return rv;
}
else
return nsMsgDBView::DoCommand(aCommand);
}
NS_IMETHODIMP nsMsgQuickSearchDBView::GetViewType(nsMsgViewTypeValue *aViewType)
{
NS_ENSURE_ARG_POINTER(aViewType);
*aViewType = nsMsgViewType::eShowQuickSearchResults;
return NS_OK;
}
nsresult nsMsgQuickSearchDBView::AddHdr(nsIMsgDBHdr *msgHdr, nsMsgViewIndex *resultIndex)
{
nsMsgKey msgKey;
msgHdr->GetMessageKey(&msgKey);
// protect against duplication.
if (m_origKeys.BinaryIndexOf(msgKey) == m_origKeys.NoIndex)
{
nsMsgViewIndex insertIndex = GetInsertIndexHelper(msgHdr, m_origKeys, nullptr,
nsMsgViewSortOrder::ascending, nsMsgViewSortType::byId);
m_origKeys.InsertElementAt(insertIndex, msgKey);
}
if (m_viewFlags & (nsMsgViewFlagsType::kGroupBySort|
nsMsgViewFlagsType::kThreadedDisplay))
{
nsMsgKey parentKey;
msgHdr->GetThreadParent(&parentKey);
return nsMsgThreadedDBView::OnNewHeader(msgHdr, parentKey, true);
}
else
return nsMsgDBView::AddHdr(msgHdr, resultIndex);
}
nsresult nsMsgQuickSearchDBView::OnNewHeader(nsIMsgDBHdr *newHdr, nsMsgKey aParentKey, bool ensureListed)
{
if (newHdr)
{
bool match=false;
nsCOMPtr <nsIMsgSearchSession> searchSession = do_QueryReferent(m_searchSession);
if (searchSession)
searchSession->MatchHdr(newHdr, m_db, &match);
if (match)
{
// put the new header in m_origKeys, so that expanding a thread will
// show the newly added header.
nsMsgKey newKey;
(void) newHdr->GetMessageKey(&newKey);
nsMsgViewIndex insertIndex = GetInsertIndexHelper(newHdr, m_origKeys, nullptr,
nsMsgViewSortOrder::ascending, nsMsgViewSortType::byId);
m_origKeys.InsertElementAt(insertIndex, newKey);
nsMsgThreadedDBView::OnNewHeader(newHdr, aParentKey, ensureListed); // do not add a new message if there isn't a match.
}
}
return NS_OK;
}
NS_IMETHODIMP nsMsgQuickSearchDBView::OnHdrFlagsChanged(nsIMsgDBHdr *aHdrChanged, uint32_t aOldFlags,
uint32_t aNewFlags, nsIDBChangeListener *aInstigator)
{
nsresult rv = nsMsgGroupView::OnHdrFlagsChanged(aHdrChanged, aOldFlags, aNewFlags, aInstigator);
if (m_viewFolder &&
(m_viewFolder != m_folder) &&
(aOldFlags & nsMsgMessageFlags::Read) != (aNewFlags & nsMsgMessageFlags::Read))
{
// if we're displaying a single folder virtual folder for an imap folder,
// the search criteria might be on message body, and we might not have the
// message body offline, in which case we can't tell if the message
// matched or not. But if the unread flag changed, we need to update the
// unread counts. Normally, VirtualFolderChangeListener::OnHdrFlagsChanged will
// handle this, but it won't work for body criteria when we don't have the
// body offline.
nsCOMPtr<nsIMsgImapMailFolder> imapFolder = do_QueryInterface(m_viewFolder);
if (imapFolder)
{
nsMsgViewIndex hdrIndex = FindHdr(aHdrChanged);
if (hdrIndex != nsMsgViewIndex_None)
{
nsCOMPtr <nsIMsgSearchSession> searchSession = do_QueryReferent(m_searchSession);
if (searchSession)
{
bool oldMatch, newMatch;
rv = searchSession->MatchHdr(aHdrChanged, m_db, &newMatch);
aHdrChanged->SetFlags(aOldFlags);
rv = searchSession->MatchHdr(aHdrChanged, m_db, &oldMatch);
aHdrChanged->SetFlags(aNewFlags);
// if it doesn't match the criteria, VirtualFolderChangeListener::OnHdrFlagsChanged
// won't tweak the read/unread counts. So do it here:
if (!oldMatch && !newMatch)
{
nsCOMPtr <nsIMsgDatabase> virtDatabase;
nsCOMPtr <nsIDBFolderInfo> dbFolderInfo;
rv = m_viewFolder->GetDBFolderInfoAndDB(getter_AddRefs(dbFolderInfo), getter_AddRefs(virtDatabase));
NS_ENSURE_SUCCESS(rv, rv);
dbFolderInfo->ChangeNumUnreadMessages((aOldFlags & nsMsgMessageFlags::Read) ? 1 : -1);
m_viewFolder->UpdateSummaryTotals(true); // force update from db.
virtDatabase->Commit(nsMsgDBCommitType::kLargeCommit);
}
}
}
}
}
return rv;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::OnHdrPropertyChanged(nsIMsgDBHdr *aHdrChanged, bool aPreChange,
uint32_t *aStatus, nsIDBChangeListener *aInstigator)
{
// If the junk mail plugin just activated on a message, then
// we'll allow filters to remove from view.
// Otherwise, just update the view line.
//
// Note this will not add newly matched headers to the view. This is
// probably a bug that needs fixing.
NS_ENSURE_ARG_POINTER(aStatus);
NS_ENSURE_ARG_POINTER(aHdrChanged);
nsMsgViewIndex index = FindHdr(aHdrChanged);
if (index == nsMsgViewIndex_None) // message does not appear in view
return NS_OK;
nsCString originStr;
(void) aHdrChanged->GetStringProperty("junkscoreorigin", getter_Copies(originStr));
// check for "plugin" with only first character for performance
bool plugin = (originStr.get()[0] == 'p');
if (aPreChange)
{
// first call, done prior to the change
*aStatus = plugin;
return NS_OK;
}
// second call, done after the change
bool wasPlugin = *aStatus;
bool match = true;
nsCOMPtr<nsIMsgSearchSession> searchSession(do_QueryReferent(m_searchSession));
if (searchSession)
searchSession->MatchHdr(aHdrChanged, m_db, &match);
if (!match && plugin && !wasPlugin)
RemoveByIndex(index); // remove hdr from view
else
NoteChange(index, 1, nsMsgViewNotificationCode::changed);
return NS_OK;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::GetSearchSession(nsIMsgSearchSession* *aSession)
{
NS_ASSERTION(false, "GetSearchSession method is not implemented");
return NS_ERROR_NOT_IMPLEMENTED;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::SetSearchSession(nsIMsgSearchSession *aSession)
{
m_searchSession = do_GetWeakReference(aSession);
return NS_OK;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::OnSearchHit(nsIMsgDBHdr* aMsgHdr, nsIMsgFolder *folder)
{
NS_ENSURE_ARG(aMsgHdr);
if (!m_db)
return NS_ERROR_NULL_POINTER;
// remember search hit and when search is done, reconcile cache
// with new hits;
m_hdrHits.AppendObject(aMsgHdr);
nsMsgKey key;
aMsgHdr->GetMessageKey(&key);
// Is FindKey going to be expensive here? A lot of hits could make
// it a little bit slow to search through the view for every hit.
if (m_cacheEmpty || FindKey(key, false) == nsMsgViewIndex_None)
return AddHdr(aMsgHdr);
else
return NS_OK;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::OnSearchDone(nsresult status)
{
// We're a single-folder virtual folder if viewFolder != folder, and that is
// the only case in which we want to be messing about with a results cache
// or unread counts.
if (m_db && m_viewFolder && m_viewFolder != m_folder)
{
nsTArray<nsMsgKey> keyArray;
nsCString searchUri;
m_viewFolder->GetURI(searchUri);
uint32_t count = m_hdrHits.Count();
// Build up message keys. The hits are in descending order but the cache
// expects them to be in ascending key order.
for (uint32_t i = count; i > 0; i--)
{
nsMsgKey key;
m_hdrHits[i-1]->GetMessageKey(&key);
keyArray.AppendElement(key);
}
nsMsgKey *staleHits;
uint32_t numBadHits;
if (m_db)
{
nsresult rv = m_db->RefreshCache(searchUri.get(), m_hdrHits.Count(),
keyArray.Elements(), &numBadHits, &staleHits);
NS_ENSURE_SUCCESS(rv, rv);
nsCOMPtr<nsIMsgDBHdr> hdrDeleted;
for (uint32_t i = 0; i < numBadHits; i++)
{
m_db->GetMsgHdrForKey(staleHits[i], getter_AddRefs(hdrDeleted));
if (hdrDeleted)
OnHdrDeleted(hdrDeleted, nsMsgKey_None, 0, this);
}
delete [] staleHits;
}
nsCOMPtr<nsIMsgDatabase> virtDatabase;
nsCOMPtr<nsIDBFolderInfo> dbFolderInfo;
nsresult rv = m_viewFolder->GetDBFolderInfoAndDB(getter_AddRefs(dbFolderInfo), getter_AddRefs(virtDatabase));
NS_ENSURE_SUCCESS(rv, rv);
uint32_t numUnread = 0;
size_t numTotal = m_origKeys.Length();
for (size_t i = 0; i < m_origKeys.Length(); i++)
{
bool isRead;
m_db->IsRead(m_origKeys[i], &isRead);
if (!isRead)
numUnread++;
}
dbFolderInfo->SetNumUnreadMessages(numUnread);
dbFolderInfo->SetNumMessages(numTotal);
m_viewFolder->UpdateSummaryTotals(true); // force update from db.
virtDatabase->Commit(nsMsgDBCommitType::kLargeCommit);
}
if (m_sortType != nsMsgViewSortType::byThread)//we do not find levels for the results.
{
m_sortValid = false; //sort the results
Sort(m_sortType, m_sortOrder);
}
if (m_viewFolder && (m_viewFolder != m_folder))
SetMRUTimeForFolder(m_viewFolder);
return NS_OK;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::OnNewSearch()
{
int32_t oldSize = GetSize();
m_keys.Clear();
m_levels.Clear();
m_flags.Clear();
m_hdrHits.Clear();
// this needs to happen after we remove all the keys, since RowCountChanged() will call our GetRowCount()
if (mTree)
mTree->RowCountChanged(0, -oldSize);
uint32_t folderFlags = 0;
if (m_viewFolder)
m_viewFolder->GetFlags(&folderFlags);
// check if it's a virtual folder - if so, we should get the cached hits
// from the db, and set a flag saying that we're using cached values.
if (folderFlags & nsMsgFolderFlags::Virtual)
{
nsCOMPtr<nsISimpleEnumerator> cachedHits;
nsCString searchUri;
m_viewFolder->GetURI(searchUri);
m_db->GetCachedHits(searchUri.get(), getter_AddRefs(cachedHits));
if (cachedHits)
{
bool hasMore;
m_usingCachedHits = true;
cachedHits->HasMoreElements(&hasMore);
m_cacheEmpty = !hasMore;
if (mTree)
mTree->BeginUpdateBatch();
while (hasMore)
{
nsCOMPtr <nsISupports> supports;
nsresult rv = cachedHits->GetNext(getter_AddRefs(supports));
NS_ASSERTION(NS_SUCCEEDED(rv), "nsMsgDBEnumerator broken");
nsCOMPtr <nsIMsgDBHdr> pHeader = do_QueryInterface(supports);
if (pHeader && NS_SUCCEEDED(rv))
AddHdr(pHeader);
else
break;
cachedHits->HasMoreElements(&hasMore);
}
if (mTree)
mTree->EndUpdateBatch();
}
}
return NS_OK;
}
nsresult nsMsgQuickSearchDBView::GetFirstMessageHdrToDisplayInThread(nsIMsgThread *threadHdr, nsIMsgDBHdr **result)
{
uint32_t numChildren;
nsresult rv = NS_OK;
uint8_t minLevel = 0xff;
threadHdr->GetNumChildren(&numChildren);
nsMsgKey threadRootKey;
nsCOMPtr<nsIMsgDBHdr> rootParent;
int32_t rootIndex;
threadHdr->GetRootHdr(&rootIndex, getter_AddRefs(rootParent));
if (rootParent)
rootParent->GetMessageKey(&threadRootKey);
else
threadHdr->GetThreadKey(&threadRootKey);
nsCOMPtr <nsIMsgDBHdr> retHdr;
// iterate over thread, finding mgsHdr in view with the lowest level.
for (uint32_t childIndex = 0; childIndex < numChildren; childIndex++)
{
nsCOMPtr <nsIMsgDBHdr> child;
rv = threadHdr->GetChildHdrAt(childIndex, getter_AddRefs(child));
if (NS_SUCCEEDED(rv) && child)
{
nsMsgKey msgKey;
child->GetMessageKey(&msgKey);
// this works because we've already sorted m_keys by id.
nsMsgViewIndex keyIndex = m_origKeys.BinaryIndexOf(msgKey);
if (keyIndex != nsMsgViewIndex_None)
{
// this is the root, so it's the best we're going to do.
if (msgKey == threadRootKey)
{
retHdr = child;
break;
}
uint8_t level = 0;
nsMsgKey parentId;
child->GetThreadParent(&parentId);
nsCOMPtr <nsIMsgDBHdr> parent;
// count number of ancestors - that's our level
while (parentId != nsMsgKey_None)
{
rv = m_db->GetMsgHdrForKey(parentId, getter_AddRefs(parent));
if (parent)
{
nsMsgKey saveParentId = parentId;
parent->GetThreadParent(&parentId);
// message is it's own parent - bad, let's break out of here.
// Or we've got some circular ancestry.
if (parentId == saveParentId || level > numChildren)
break;
level++;
}
else // if we can't find the parent, don't loop forever.
break;
}
if (level < minLevel)
{
minLevel = level;
retHdr = child;
}
}
}
}
NS_IF_ADDREF(*result = retHdr);
return NS_OK;
}
nsresult nsMsgQuickSearchDBView::SortThreads(nsMsgViewSortTypeValue sortType, nsMsgViewSortOrderValue sortOrder)
{
// don't need to sort by threads for group view.
if (m_viewFlags & nsMsgViewFlagsType::kGroupBySort)
return NS_OK;
// iterate over the messages in the view, getting the thread id's
// sort m_keys so we can quickly find if a key is in the view.
m_keys.Sort();
// array of the threads' root hdr keys.
nsTArray<nsMsgKey> threadRootIds;
nsCOMPtr <nsIMsgDBHdr> rootHdr;
nsCOMPtr <nsIMsgDBHdr> msgHdr;
nsCOMPtr <nsIMsgThread> threadHdr;
for (uint32_t i = 0; i < m_keys.Length(); i++)
{
GetMsgHdrForViewIndex(i, getter_AddRefs(msgHdr));
m_db->GetThreadContainingMsgHdr(msgHdr, getter_AddRefs(threadHdr));
if (threadHdr)
{
nsMsgKey rootKey;
threadHdr->GetChildKeyAt(0, &rootKey);
nsMsgViewIndex threadRootIndex = threadRootIds.BinaryIndexOf(rootKey);
// if we already have that id in top level threads, ignore this msg.
if (threadRootIndex != nsMsgViewIndex_None)
continue;
// it would be nice if GetInsertIndexHelper always found the hdr, but it doesn't.
threadHdr->GetChildHdrAt(0, getter_AddRefs(rootHdr));
if (!rootHdr)
continue;
threadRootIndex = GetInsertIndexHelper(rootHdr, threadRootIds, nullptr,
nsMsgViewSortOrder::ascending,
nsMsgViewSortType::byId);
threadRootIds.InsertElementAt(threadRootIndex, rootKey);
}
}
m_sortType = nsMsgViewSortType::byNone; // sort from scratch
// need to sort the top level threads now by sort order, if it's not by id
// and ascending (which is the order per above).
if (!(sortType == nsMsgViewSortType::byId &&
sortOrder == nsMsgViewSortOrder::ascending))
{
m_keys.SwapElements(threadRootIds);
nsMsgDBView::Sort(sortType, sortOrder);
threadRootIds.SwapElements(m_keys);
}
m_keys.Clear();
m_levels.Clear();
m_flags.Clear();
// now we've build up the list of thread ids - need to build the view
// from that. So for each thread id, we need to list the messages in the thread.
uint32_t numThreads = threadRootIds.Length();
for (uint32_t threadIndex = 0; threadIndex < numThreads; threadIndex++)
{
m_db->GetMsgHdrForKey(threadRootIds[threadIndex], getter_AddRefs(rootHdr));
if (rootHdr)
{
nsCOMPtr <nsIMsgDBHdr> displayRootHdr;
m_db->GetThreadContainingMsgHdr(rootHdr, getter_AddRefs(threadHdr));
if (threadHdr)
{
nsMsgKey rootKey;
uint32_t rootFlags;
GetFirstMessageHdrToDisplayInThread(threadHdr, getter_AddRefs(displayRootHdr));
if (!displayRootHdr)
continue;
displayRootHdr->GetMessageKey(&rootKey);
displayRootHdr->GetFlags(&rootFlags);
rootFlags |= MSG_VIEW_FLAG_ISTHREAD;
m_keys.AppendElement(rootKey);
m_flags.AppendElement(rootFlags);
m_levels.AppendElement(0);
nsMsgViewIndex startOfThreadViewIndex = m_keys.Length();
nsMsgViewIndex rootIndex = startOfThreadViewIndex - 1;
uint32_t numListed = 0;
ListIdsInThreadOrder(threadHdr, rootKey, 1, &startOfThreadViewIndex, &numListed);
if (numListed > 0)
m_flags[rootIndex] = rootFlags | MSG_VIEW_FLAG_HASCHILDREN;
}
}
}
// The thread state is left expanded (despite viewFlags) so at least reflect
// the correct state.
m_viewFlags |= nsMsgViewFlagsType::kExpandAll;
return NS_OK;
}
nsresult
nsMsgQuickSearchDBView::ListCollapsedChildren(nsMsgViewIndex viewIndex,
nsIMutableArray *messageArray)
{
nsCOMPtr<nsIMsgThread> threadHdr;
nsresult rv = GetThreadContainingIndex(viewIndex, getter_AddRefs(threadHdr));
NS_ENSURE_SUCCESS(rv, rv);
uint32_t numChildren;
threadHdr->GetNumChildren(&numChildren);
nsCOMPtr<nsIMsgDBHdr> rootHdr;
nsMsgKey rootKey;
GetMsgHdrForViewIndex(viewIndex, getter_AddRefs(rootHdr));
rootHdr->GetMessageKey(&rootKey);
// group threads can have the root key twice, one for the dummy row.
bool rootKeySkipped = false;
for (uint32_t i = 0; i < numChildren; i++)
{
nsCOMPtr<nsIMsgDBHdr> msgHdr;
threadHdr->GetChildHdrAt(i, getter_AddRefs(msgHdr));
if (msgHdr)
{
nsMsgKey msgKey;
msgHdr->GetMessageKey(&msgKey);
if (msgKey != rootKey || (GroupViewUsesDummyRow() && rootKeySkipped))
{
// if this hdr is in the original view, add it to new view.
if (m_origKeys.BinaryIndexOf(msgKey) != m_origKeys.NoIndex)
messageArray->AppendElement(msgHdr, false);
}
else
{
rootKeySkipped = true;
}
}
}
return NS_OK;
}
nsresult nsMsgQuickSearchDBView::ListIdsInThread(nsIMsgThread *threadHdr, nsMsgViewIndex startOfThreadViewIndex, uint32_t *pNumListed)
{
if (m_viewFlags & nsMsgViewFlagsType::kThreadedDisplay && ! (m_viewFlags & nsMsgViewFlagsType::kGroupBySort))
{
nsMsgKey parentKey = m_keys[startOfThreadViewIndex++];
return ListIdsInThreadOrder(threadHdr, parentKey, 1, &startOfThreadViewIndex, pNumListed);
}
uint32_t numChildren;
threadHdr->GetNumChildren(&numChildren);
uint32_t i;
uint32_t viewIndex = startOfThreadViewIndex + 1;
nsCOMPtr<nsIMsgDBHdr> rootHdr;
nsMsgKey rootKey;
uint32_t rootFlags = m_flags[startOfThreadViewIndex];
*pNumListed = 0;
GetMsgHdrForViewIndex(startOfThreadViewIndex, getter_AddRefs(rootHdr));
rootHdr->GetMessageKey(&rootKey);
// group threads can have the root key twice, one for the dummy row.
bool rootKeySkipped = false;
for (i = 0; i < numChildren; i++)
{
nsCOMPtr<nsIMsgDBHdr> msgHdr;
threadHdr->GetChildHdrAt(i, getter_AddRefs(msgHdr));
if (msgHdr != nullptr)
{
nsMsgKey msgKey;
msgHdr->GetMessageKey(&msgKey);
if (msgKey != rootKey || (GroupViewUsesDummyRow() && rootKeySkipped))
{
nsMsgViewIndex threadRootIndex = m_origKeys.BinaryIndexOf(msgKey);
// if this hdr is in the original view, add it to new view.
if (threadRootIndex != nsMsgViewIndex_None)
{
uint32_t childFlags;
msgHdr->GetFlags(&childFlags);
InsertMsgHdrAt(viewIndex, msgHdr, msgKey, childFlags,
FindLevelInThread(msgHdr, startOfThreadViewIndex, viewIndex));
if (! (rootFlags & MSG_VIEW_FLAG_HASCHILDREN))
m_flags[startOfThreadViewIndex] = rootFlags | MSG_VIEW_FLAG_HASCHILDREN;
viewIndex++;
(*pNumListed)++;
}
}
else
{
rootKeySkipped = true;
}
}
}
return NS_OK;
}
nsresult
nsMsgQuickSearchDBView::ListIdsInThreadOrder(nsIMsgThread *threadHdr,
nsMsgKey parentKey, uint32_t level,
uint32_t callLevel,
nsMsgKey keyToSkip,
nsMsgViewIndex *viewIndex,
uint32_t *pNumListed)
{
nsCOMPtr <nsISimpleEnumerator> msgEnumerator;
nsresult rv = threadHdr->EnumerateMessages(parentKey, getter_AddRefs(msgEnumerator));
NS_ENSURE_SUCCESS(rv, rv);
// We use the numChildren as a sanity check on the thread structure.
uint32_t numChildren;
(void) threadHdr->GetNumChildren(&numChildren);
bool hasMore;
nsCOMPtr <nsISupports> supports;
nsCOMPtr <nsIMsgDBHdr> msgHdr;
while (NS_SUCCEEDED(rv) && NS_SUCCEEDED(rv = msgEnumerator->HasMoreElements(&hasMore)) &&
hasMore)
{
rv = msgEnumerator->GetNext(getter_AddRefs(supports));
if (NS_SUCCEEDED(rv) && supports)
{
msgHdr = do_QueryInterface(supports);
nsMsgKey msgKey;
msgHdr->GetMessageKey(&msgKey);
if (msgKey == keyToSkip)
continue;
// If we discover depths of more than numChildren, it means we have
// some sort of circular thread relationship and we bail out of the
// while loop before overflowing the stack with recursive calls.
// Technically, this is an error, but forcing a database rebuild
// is too destructive so we just return.
if (*pNumListed > numChildren || callLevel > numChildren)
{
NS_ERROR("loop in message threading while listing children");
return NS_OK;
}
int32_t childLevel = level;
if (m_origKeys.BinaryIndexOf(msgKey) != m_origKeys.NoIndex)
{
uint32_t msgFlags;
msgHdr->GetFlags(&msgFlags);
InsertMsgHdrAt(*viewIndex, msgHdr, msgKey, msgFlags & ~MSG_VIEW_FLAGS, level);
(*pNumListed)++;
(*viewIndex)++;
childLevel++;
}
rv = ListIdsInThreadOrder(threadHdr, msgKey, childLevel, callLevel + 1,
keyToSkip, viewIndex, pNumListed);
}
}
return rv;
}
nsresult
nsMsgQuickSearchDBView::ListIdsInThreadOrder(nsIMsgThread *threadHdr,
nsMsgKey parentKey, uint32_t level,
nsMsgViewIndex *viewIndex,
uint32_t *pNumListed)
{
nsresult rv = ListIdsInThreadOrder(threadHdr, parentKey, level, level,
nsMsgKey_None, viewIndex, pNumListed);
// Because a quick search view might not have the actual thread root
// as its root, and thus might have a message that potentially has siblings
// as its root, and the enumerator will miss the siblings, we might need to
// make a pass looking for the siblings of the non-root root. We'll put
// those after the potential children of the root. So we will list the children
// of the faux root's parent, ignoring the faux root.
if (level == 1)
{
nsCOMPtr<nsIMsgDBHdr> root;
nsCOMPtr<nsIMsgDBHdr> rootParent;
nsMsgKey rootKey;
int32_t rootIndex;
threadHdr->GetRootHdr(&rootIndex, getter_AddRefs(rootParent));
if (rootParent)
{
rootParent->GetMessageKey(&rootKey);
if (rootKey != parentKey)
rv = ListIdsInThreadOrder(threadHdr, rootKey, level, level, parentKey,
viewIndex, pNumListed);
}
}
return rv;
}
nsresult nsMsgQuickSearchDBView::ExpansionDelta(nsMsgViewIndex index, int32_t *expansionDelta)
{
*expansionDelta = 0;
if (index >= ((nsMsgViewIndex) m_keys.Length()))
return NS_MSG_MESSAGE_NOT_FOUND;
char flags = m_flags[index];
if (!(m_viewFlags & nsMsgViewFlagsType::kThreadedDisplay))
return NS_OK;
nsCOMPtr<nsIMsgThread> threadHdr;
nsresult rv = GetThreadContainingIndex(index, getter_AddRefs(threadHdr));
NS_ENSURE_SUCCESS(rv, rv);
uint32_t numChildren;
threadHdr->GetNumChildren(&numChildren);
nsCOMPtr<nsIMsgDBHdr> rootHdr;
nsMsgKey rootKey;
GetMsgHdrForViewIndex(index, getter_AddRefs(rootHdr));
rootHdr->GetMessageKey(&rootKey);
// group threads can have the root key twice, one for the dummy row.
bool rootKeySkipped = false;
for (uint32_t i = 0; i < numChildren; i++)
{
nsCOMPtr<nsIMsgDBHdr> msgHdr;
threadHdr->GetChildHdrAt(i, getter_AddRefs(msgHdr));
if (msgHdr)
{
nsMsgKey msgKey;
msgHdr->GetMessageKey(&msgKey);
if (msgKey != rootKey || (GroupViewUsesDummyRow() && rootKeySkipped))
{
// if this hdr is in the original view, add it to new view.
if (m_origKeys.BinaryIndexOf(msgKey) != m_origKeys.NoIndex)
(*expansionDelta)++;
}
else
{
rootKeySkipped = true;
}
}
}
if (! (flags & nsMsgMessageFlags::Elided))
*expansionDelta = - (*expansionDelta);
return NS_OK;
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::OpenWithHdrs(nsISimpleEnumerator *aHeaders,
nsMsgViewSortTypeValue aSortType,
nsMsgViewSortOrderValue aSortOrder,
nsMsgViewFlagsTypeValue aViewFlags,
int32_t *aCount)
{
if (aViewFlags & nsMsgViewFlagsType::kGroupBySort)
return nsMsgGroupView::OpenWithHdrs(aHeaders, aSortType, aSortOrder,
aViewFlags, aCount);
m_sortType = aSortType;
m_sortOrder = aSortOrder;
m_viewFlags = aViewFlags;
bool hasMore;
nsCOMPtr<nsISupports> supports;
nsCOMPtr<nsIMsgDBHdr> msgHdr;
nsresult rv = NS_OK;
while (NS_SUCCEEDED(rv = aHeaders->HasMoreElements(&hasMore)) && hasMore)
{
rv = aHeaders->GetNext(getter_AddRefs(supports));
if (NS_SUCCEEDED(rv) && supports)
{
msgHdr = do_QueryInterface(supports);
AddHdr(msgHdr);
}
else
break;
}
*aCount = m_keys.Length();
return rv;
}
NS_IMETHODIMP nsMsgQuickSearchDBView::SetViewFlags(nsMsgViewFlagsTypeValue aViewFlags)
{
nsresult rv = NS_OK;
// if the grouping has changed, rebuild the view
if ((m_viewFlags & nsMsgViewFlagsType::kGroupBySort) ^
(aViewFlags & nsMsgViewFlagsType::kGroupBySort))
rv = RebuildView(aViewFlags);
nsMsgDBView::SetViewFlags(aViewFlags);
return rv;
}
nsresult
nsMsgQuickSearchDBView::GetMessageEnumerator(nsISimpleEnumerator **enumerator)
{
return GetViewEnumerator(enumerator);
}
NS_IMETHODIMP
nsMsgQuickSearchDBView::OnHdrDeleted(nsIMsgDBHdr *aHdrDeleted,
nsMsgKey aParentKey,
int32_t aFlags,
nsIDBChangeListener *aInstigator)
{
NS_ENSURE_ARG_POINTER(aHdrDeleted);
nsMsgKey msgKey;
aHdrDeleted->GetMessageKey(&msgKey);
size_t keyIndex = m_origKeys.BinaryIndexOf(msgKey);
if (keyIndex != m_origKeys.NoIndex)
m_origKeys.RemoveElementAt(keyIndex);
return nsMsgThreadedDBView::OnHdrDeleted(aHdrDeleted, aParentKey, aFlags,
aInstigator);
}
NS_IMETHODIMP nsMsgQuickSearchDBView::GetNumMsgsInView(int32_t *aNumMsgs)
{
NS_ENSURE_ARG_POINTER(aNumMsgs);
*aNumMsgs = m_origKeys.Length();
return NS_OK;
}
|