/usr/share/ada/adainclude/gnatcoll/gnatcoll-email-mailboxes.adb is in libgnatcoll1.6-dev 1.6gpl2014-9.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 | ------------------------------------------------------------------------------
-- G N A T C O L L --
-- --
-- Copyright (C) 2006-2014, AdaCore --
-- --
-- This library is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 3, 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 MERCHAN- --
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
------------------------------------------------------------------------------
with Ada.Calendar; use Ada.Calendar;
with Ada.Containers.Indefinite_Hashed_Maps;
with Ada.IO_Exceptions;
with Ada.Strings.Hash;
with Ada.Unchecked_Deallocation;
with GNATCOLL.Boyer_Moore; use GNATCOLL.Boyer_Moore;
with GNATCOLL.Email.Parser; use GNATCOLL.Email.Parser;
with GNATCOLL.Email.Utils; use GNATCOLL.Email.Utils;
with GNATCOLL.Mmap; use GNATCOLL.Mmap;
with GNATCOLL.VFS; use GNATCOLL.VFS;
with GNAT.Strings; use GNAT.Strings;
package body GNATCOLL.Email.Mailboxes is
use Message_Info_List, Cursor_List;
From_Pattern : GNATCOLL.Boyer_Moore.Pattern;
-- An efficient search pattern for the From_ lines that separate messages
-- in a mbox
procedure Internal_Search_Start
(Self : Mbox'Class;
Buffer : String;
From : in out Integer);
-- Search the start of the next message after the position From.
-- It should return -1 if no further message exists.
-- This is for the implementation of new mailbox types only, and is not
-- needed when using standard mailboxes.
function Earlier_Than
(Left, Right : Abstract_Message_Info'Class) return Boolean;
-- Compare two elements by date
type Container;
type Container_Access is access Container;
type Container is record
Msg : Message;
Parent : Container_Access;
Child : Container_Access;
Next : Container_Access;
end record;
package Container_Hash is new Ada.Containers.Indefinite_Hashed_Maps
(Key_Type => String,
Element_Type => Container_Access,
Hash => Ada.Strings.Hash,
Equivalent_Keys => "=");
use Container_Hash;
procedure Unchecked_Free is new Ada.Unchecked_Deallocation
(Container, Container_Access);
------------------
-- Earlier_Than --
------------------
function Earlier_Than
(Left, Right : Abstract_Message_Info'Class) return Boolean
is
Date1 : constant Time := Get_Date (Left.Msg);
Date2 : constant Time := Get_Date (Right.Msg);
begin
return Date1 < Date2;
end Earlier_Than;
package Pkg_Sort_By_Date is new Message_Info_List.Generic_Sorting
("<" => Earlier_Than);
-----------------
-- Free_String --
-----------------
procedure Free_String (Str : in out GNAT.Strings.String_Access) is
begin
GNAT.Strings.Free (Str);
end Free_String;
----------------
-- Set_Parser --
----------------
procedure Set_Parser
(Self : in out Cursor;
Factory : Message_Factory := Email.Parser.Parse'Access)
is
begin
Self.Factory := Factory;
end Set_Parser;
----------
-- Open --
----------
procedure Open
(Self : in out Mbox;
Fp : access String;
On_Close : Destructor := Free_String'Access) is
begin
Self.Fp := GNAT.Strings.String_Access (Fp);
Self.On_Close := On_Close;
end Open;
----------
-- Open --
----------
procedure Open
(Self : in out Mbox;
Filename : Virtual_File) is
begin
Self.Fp := Read_File (Filename);
Self.On_Close := Free_String'Access;
if Self.Fp = null then
raise Ada.IO_Exceptions.Name_Error;
end if;
end Open;
-----------
-- First --
-----------
function First (Self : Mbox) return Cursor'Class is
begin
declare
Cur : Cursor'Class := Mbox_Cursor'
(Cursor with
Max => Self.Fp'Last,
Start => Self.Fp'First,
Stop => 0,
Current => Null_Message);
begin
Next (Cur, Self);
return Cur;
end;
end First;
-----------------
-- Has_Element --
-----------------
function Has_Element (Self : Mbox_Cursor) return Boolean is
begin
return Self.Stop <= Self.Max;
end Has_Element;
-----------------
-- Get_Message --
-----------------
procedure Get_Message
(Self : in out Mbox_Cursor;
Box : Mailbox'Class;
Msg : out Message)
is
Buffer : Str_Access;
begin
-- Already cached ?
if Self.Current /= Null_Message then
Msg := Self.Current;
-- Already past the end ?
elsif Self.Stop > Self.Max
or else Self.Factory = null
then
Msg := Null_Message;
else
if Mbox (Box).Fp /= null then
Buffer := To_Str_Access (Mbox (Box).Fp);
end if;
Self.Factory
(String (Buffer (Self.Start .. Self.Stop)), Self.Current);
Msg := Self.Current;
end if;
end Get_Message;
----------
-- Next --
----------
procedure Next
(Self : in out Mbox_Cursor;
Box : Mailbox'Class)
is
Buffer : Str_Access;
First : Integer;
Skip_Separating_Newline : constant Integer := 2;
-- Number of characters to move backward from a "From_" substring to
-- find the end of the previous message. This includes skipping over the
-- newline character that must separate messages.
begin
Self.Current := Null_Message;
-- Already past the end ?
if Self.Stop >= Self.Max then
Self.Stop := Self.Max + 1;
return;
end if;
if Mbox (Box).Fp /= null then
Buffer := To_Str_Access (Mbox (Box).Fp);
First := Mbox (Box).Fp'First;
else
return; -- Nothing to parse
end if;
-- Find start of first message if needed. If we are past this first
-- message, we know we left the pointer to the start of a message, no
-- need to check again.
if Self.Stop = 0 then
if String (Buffer (First .. 5)) /= "From " then
Self.Stop := First;
Internal_Search_Start
(Mbox'Class (Box),
String (Buffer (First .. Self.Max)),
Self.Stop);
if Self.Stop = -1 then
Self.Stop := Integer'Last;
Self.Current := Null_Message;
return;
else
Self.Stop := Self.Stop - Skip_Separating_Newline;
end if;
else
Self.Stop := First - Skip_Separating_Newline;
end if;
end if;
-- At this point Self.Stop points to the first character before the
-- beginning of the next message
if Self.Stop >= Self.Max then
return;
end if;
Self.Start := Self.Stop + Skip_Separating_Newline;
-- Search end of message
-- Skip current From_ line
Self.Stop := Self.Start + 5; -- "From_"'Length
Internal_Search_Start
(Mbox'Class (Box),
String (Buffer (Self.Stop .. Self.Max)),
Self.Stop);
if Self.Stop < 0 then
-- No message after this one => it extends till the end of the buffer
Self.Stop := Self.Max;
else
Self.Stop := Self.Stop - Skip_Separating_Newline;
end if;
end Next;
---------------------------
-- Internal_Search_Start --
---------------------------
procedure Internal_Search_Start
(Self : Mbox'Class;
Buffer : String;
From : in out Integer)
is
pragma Unreferenced (Self);
Tmp : Integer;
begin
-- We might match a "From " line that is in fact part of the body, so
-- put in place a heuristic
loop
From := Search (From_Pattern, Buffer (From .. Buffer'Last));
-- We should also check the format of the line itself, so that if a
-- message contains lines starting with "From", they are not taken
-- into account. Unfortunately, this format is not precisely defined,
-- and may vary depending on the MUA used by the sender. One partial
-- solution is to check that the next line is a proper mail header.
if From = -1 then
return;
end if;
Tmp := From + 1;
loop
if Tmp > Buffer'Last then
From := -1;
return;
end if;
-- No following header, so not the start of a new message
exit when Buffer (Tmp) = ASCII.LF;
if Buffer (Tmp) = ':' then
-- The From_ line was followed by a header, so probably starts
-- a new message.
-- Skip ASCII.LF
From := From + 1;
return;
end if;
Tmp := Tmp + 1;
end loop;
-- Skip ASCII.LF & "From "
From := From + 5;
end loop;
end Internal_Search_Start;
--------------
-- Finalize --
--------------
procedure Finalize (Self : in out Mailbox) is
pragma Unreferenced (Self);
begin
null;
end Finalize;
--------------
-- Finalize --
--------------
procedure Finalize (Self : in out Mbox) is
begin
if Self.On_Close /= null and then Self.Fp /= null then
Self.On_Close (Self.Fp);
Self.Fp := null;
end if;
end Finalize;
-----------
-- Store --
-----------
procedure Store
(Self : out Stored_Mailbox;
Box : in out Mailbox'Class;
Factory : Message_Factory := Email.Parser.Parse'Access)
is
begin
Store (Self, Box, Factory, First (Box));
end Store;
-----------
-- Store --
-----------
procedure Store
(Self : out Stored_Mailbox;
Box : in out Mailbox'Class;
Factory : Message_Factory := Email.Parser.Parse'Access;
From : Cursor'Class)
is
Msg : Message;
Curs : Cursor'Class := From;
begin
Set_Parser (Curs, Factory);
while Has_Element (Curs) loop
Get_Message (Curs, Box, Msg);
if Msg /= Null_Message then
Append (Self, Msg);
end if;
Next (Curs, Box);
end loop;
end Store;
------------
-- Append --
------------
procedure Append (Self : in out Stored_Mailbox; Msg : Message) is
begin
Append
(Self.Messages,
Message_Info'(Msg => Msg, Children => Message_Info_List.Empty_List));
Self.Sorted_By := Sort_None;
end Append;
-----------
-- First --
-----------
function First (Self : Stored_Mailbox) return Cursor'Class is
begin
return First (Self, Recurse => False);
end First;
-----------
-- First --
-----------
function First
(Self : Stored_Mailbox; Recurse : Boolean)
return Stored_Mailbox_Cursor'Class
is
L : Stored_Mailbox_Cursor;
begin
L.Recurse := Recurse;
L.Thread_Level := 1;
if not Is_Empty (Self.Messages) then
Append (L.Cursors, First (Self.Messages));
end if;
return L;
end First;
---------------------
-- First_In_Thread --
---------------------
function First_In_Thread
(Self : Stored_Mailbox; Parent : Stored_Mailbox_Cursor'Class)
return Stored_Mailbox_Cursor'Class
is
L : Stored_Mailbox_Cursor;
procedure Get_First (M : Abstract_Message_Info'Class);
procedure Get_First (M : Abstract_Message_Info'Class) is
begin
if Has_Element (First (Message_Info (M).Children)) then
Append (L.Cursors, First (Message_Info (M).Children));
else
L.Cursors := Cursor_List.Empty_List;
end if;
end Get_First;
begin
if Self.Threaded
and then not Is_Empty (Parent.Cursors)
and then Has_Element (Element (Last (Parent.Cursors)))
then
L.Recurse := False;
L.Thread_Level := Parent.Thread_Level + 1;
Query_Element
(Element (Last (Parent.Cursors)),
Get_First'Unrestricted_Access);
return L;
else
L.Cursors := Cursor_List.Empty_List;
return L;
end if;
end First_In_Thread;
-----------------
-- Has_Element --
-----------------
function Has_Element
(Self : Stored_Mailbox_Cursor) return Boolean
is
begin
return not Is_Empty (Self.Cursors);
end Has_Element;
-----------------
-- Get_Message --
-----------------
procedure Get_Message
(Self : in out Stored_Mailbox_Cursor;
Box : Mailbox'Class;
Msg : out Message)
is
pragma Unreferenced (Box);
Saved : Message_Info_List.Cursor;
begin
if Is_Empty (Self.Cursors) then
Msg := Null_Message;
else
Saved := Element (Last (Self.Cursors));
Msg := Message_Info (Element (Saved)).Msg;
end if;
end Get_Message;
----------------------
-- Get_Thread_Level --
----------------------
function Get_Thread_Level (Iter : Stored_Mailbox_Cursor) return Positive is
begin
if Is_Empty (Iter.Cursors) then
return 1;
else
return Iter.Thread_Level;
end if;
end Get_Thread_Level;
----------
-- Next --
----------
procedure Next
(Self : in out Stored_Mailbox_Cursor;
Box : Mailbox'Class)
is
pragma Unreferenced (Box);
M : Message_Info;
Saved : Message_Info_List.Cursor;
procedure Move_To_Next (C : in out Message_Info_List.Cursor);
procedure Move_To_Next (C : in out Message_Info_List.Cursor) is
begin
Next (C);
end Move_To_Next;
begin
if not Is_Empty (Self.Cursors) then
Saved := Element (Last (Self.Cursors));
M := Message_Info (Element (Saved));
-- If we have children for the current element, return these next
if Self.Recurse and then not Is_Empty (M.Children) then
declare
procedure Get_First (M : Abstract_Message_Info'Class);
procedure Get_First (M : Abstract_Message_Info'Class) is
begin
Append (Self.Cursors, First (Message_Info (M).Children));
end Get_First;
begin
Self.Thread_Level := Self.Thread_Level + 1;
Query_Element (Saved, Get_First'Unrestricted_Access);
end;
else
-- Otherwise move to the next element at the same level if there's
-- one. Or move to the next element at the parent level,
-- recursively
Update_Element
(Self.Cursors, Last (Self.Cursors),
Move_To_Next'Unrestricted_Access);
if Self.Recurse then
while not Has_Element (Element (Last (Self.Cursors))) loop
-- Else move to the next element at the parent level,
-- recursively
Delete_Last (Self.Cursors);
exit when Is_Empty (Self.Cursors);
Self.Thread_Level := Self.Thread_Level - 1;
Update_Element
(Self.Cursors, Last (Self.Cursors),
Move_To_Next'Unrestricted_Access);
end loop;
elsif not Has_Element (Element (Last (Self.Cursors))) then
Self.Cursors := Cursor_List.Empty_List;
end if;
end if;
end if;
end Next;
--------------------
-- Remove_Threads --
--------------------
procedure Remove_Threads (Stored : in out Stored_Mailbox) is
begin
if Stored.Threaded then
declare
Iter : Stored_Mailbox_Cursor'Class :=
First (Stored, Recurse => True);
Tmp : Message_Info_List.List;
Msg : Message;
begin
while Has_Element (Iter) loop
Get_Message (Iter, Stored, Msg);
if Msg /= Null_Message then
Append
(Tmp,
Message_Info'(Msg => Msg,
Children => Message_Info_List.Empty_List));
end if;
Next (Iter, Stored);
end loop;
Move (Target => Stored.Messages, Source => Tmp);
Stored.Threaded := False;
Stored.Sorted_By := Sort_None;
end;
end if;
end Remove_Threads;
------------------
-- Sort_By_Date --
------------------
procedure Sort_By_Date (Self : in out Stored_Mailbox) is
procedure Sort_Level (List : in out Message_Info_List.List);
procedure Sort_Info (Info : in out Abstract_Message_Info'Class);
-- Sort List, and all children
procedure Sort_Info (Info : in out Abstract_Message_Info'Class) is
begin
Sort_Level (Message_Info (Info).Children);
end Sort_Info;
procedure Sort_Level (List : in out Message_Info_List.List) is
C : Message_Info_List.Cursor;
begin
Pkg_Sort_By_Date.Sort (List);
C := First (List);
while Has_Element (C) loop
if not Is_Empty (Message_Info (Element (C)).Children) then
Update_Element (List, C, Sort_Info'Unrestricted_Access);
end if;
Next (C);
end loop;
end Sort_Level;
begin
if Self.Sorted_By /= Sort_Date then
if Self.Threaded then
Sort_Level (Self.Messages);
else
Pkg_Sort_By_Date.Sort (Self.Messages);
end if;
Self.Sorted_By := Sort_Date;
end if;
end Sort_By_Date;
---------------------
-- Thread_Messages --
---------------------
procedure Thread_Messages (Self : in out Stored_Mailbox) is
Ids : Container_Hash.Map;
procedure Store_Parent_Of
(Parent_Cont : in out Container_Access; Id : String);
-- Memorize that Parent_Cont is the parent of the message whose
-- Message-ID is Id.
-- On exit, Parent_Cont is set to the container used for the message
-- itself.
procedure Set_Parent_For_All_Ids
(Parent_Cont : in out Container_Access;
H : Header);
-- For each message-id found in H, call Store_Parent_Of. This
-- sets a list of dependencies between mail messages.
procedure Set_Parent_Of
(Cont : Container_Access;
Parent_Cont : Container_Access;
Override : Boolean := False);
-- Set the parent of Cont to be Parent_Cont.
-- If Cont already has a parent and Override is True, it is replaced.
-- This is only needed when processing the last item in the References:
-- field, which we know is the real parent. Previous parents might have
-- been set while processing References: fields in other messages.
-- This also update child links
procedure Put_Threads_In_Message
(Parent : in out Message_Info_List.List;
Root : Container_Access;
Root_Level : Boolean);
-- Put Root in Parent, and all its children recursively
function Is_Reachable (A, B : Container_Access) return Boolean;
-- Return True if B is part of the descendant of A. This doesn't test
-- that A /= B.
------------------
-- Is_Reachable --
------------------
function Is_Reachable (A, B : Container_Access) return Boolean is
C : Container_Access := A.Child;
C2 : Container_Access;
begin
if A = B then
return True;
end if;
while C /= null loop
if C = B then
return True;
end if;
C2 := C.Child;
while C2 /= null loop
if Is_Reachable (C2, B) then
return True;
end if;
C2 := C2.Next;
end loop;
C := C.Next;
end loop;
return False;
end Is_Reachable;
-------------------
-- Set_Parent_Of --
-------------------
procedure Set_Parent_Of
(Cont : Container_Access;
Parent_Cont : Container_Access;
Override : Boolean := False)
is
C : Container_Access;
begin
if Parent_Cont = null or else Parent_Cont = Cont then
return;
end if;
if Cont.Parent /= null and then not Override then
return;
end if;
-- Check we do not introduce a loop A -> B -> A. This must be done
-- before removing the old parent
if Is_Reachable (Cont, Parent_Cont)
or else Is_Reachable (Parent_Cont, Cont)
then
return;
end if;
-- Set the new parent (remove the old one, since if we reach here
-- with an old parent, we are in Override mode)
if Cont.Parent /= null then
if Cont.Parent.Child = Cont then
Cont.Parent.Child := Cont.Next;
else
C := Cont.Parent.Child;
while C.Next /= null loop
if C.Next = Cont then
C.Next := Cont.Next;
exit;
end if;
C := C.Next;
end loop;
end if;
Cont.Parent := null;
Cont.Next := null;
end if;
Cont.Parent := Parent_Cont;
if Parent_Cont /= null then
if Parent_Cont.Child = null then
Parent_Cont.Child := Cont;
else
C := Parent_Cont.Child;
while C.Next /= null loop
C := C.Next;
end loop;
C.Next := Cont;
end if;
end if;
Cont.Next := null;
end Set_Parent_Of;
---------------------
-- Store_Parent_Of --
---------------------
procedure Store_Parent_Of
(Parent_Cont : in out Container_Access; Id : String)
is
Id_C : Container_Hash.Cursor;
Cont : Container_Access;
begin
Id_C := Find (Ids, Id);
if Has_Element (Id_C) then
Cont := Element (Id_C);
else
Cont := new Container; -- Null_Message;
Insert (Ids, Id, Cont);
end if;
if Parent_Cont /= null
and then Cont.Parent = null
then
Set_Parent_Of (Cont => Cont, Parent_Cont => Parent_Cont);
end if;
Parent_Cont := Cont;
end Store_Parent_Of;
----------------------------
-- Set_Parent_For_All_Ids --
----------------------------
procedure Set_Parent_For_All_Ids
(Parent_Cont : in out Container_Access;
H : Header)
is
Flat : Unbounded_String;
Index : Natural;
Stop : Natural;
begin
if H /= Null_Header then
Flatten (Get_Value (H), Flat);
declare
StrA : constant String := To_String (Flat);
begin
Index := StrA'First;
while Index <= StrA'Last loop
Index := Next_Occurrence (StrA (Index .. StrA'Last), '<');
Stop := Next_Occurrence (StrA (Index + 1 .. StrA'Last), '>');
Store_Parent_Of (Parent_Cont => Parent_Cont,
Id => StrA (Index + 1 .. Stop - 1));
Index := Stop + 1;
end loop;
end;
end if;
end Set_Parent_For_All_Ids;
----------------------------
-- Put_Threads_In_Message --
----------------------------
procedure Put_Threads_In_Message
(Parent : in out Message_Info_List.List;
Root : Container_Access;
Root_Level : Boolean)
is
C : Container_Access;
M : Message_Info;
begin
-- Do not insert dummy containers
if Root.Msg = Null_Message then
if Root.Child = null then
return;
end if;
-- Promote the children one level up
C := Root.Child;
while C /= null loop
Put_Threads_In_Message (Parent, C, Root_Level);
C := C.Next;
end loop;
return;
else
M.Msg := Root.Msg;
Append (Parent, M);
C := Root.Child;
end if;
while C /= null loop
declare
procedure Add_Child (MI : in out Abstract_Message_Info'Class);
procedure Add_Child (MI : in out Abstract_Message_Info'Class) is
begin
Put_Threads_In_Message
(Message_Info (MI).Children, C, False);
end Add_Child;
begin
Update_Element
(Parent, Last (Parent), Add_Child'Unrestricted_Access);
end;
C := C.Next;
end loop;
end Put_Threads_In_Message;
C : Message_Info_List.Cursor;
Msg : Message;
Msg_Cont : Container_Access;
Parent_Cont : Container_Access;
Id_C : Container_Hash.Cursor;
Dummy_Id : Natural := 0;
-- For those messages that have no Message-Id: field, so that we don't
-- lose any...
begin
-- See algorithm at http://www.jwz.org/doc/threading.html
if not Self.Threaded then
C := First (Self.Messages);
while Has_Element (C) loop
Msg := Element (C).Msg;
-- Store a new container for this message-id in the table
declare
Id : constant String := Get_Message_Id (Msg);
begin
Msg_Cont := null;
Store_Parent_Of (Parent_Cont => Msg_Cont,
Id => Id);
-- If there was already such a message-id (in theory not
-- possible, in practice we might have messages with no
-- Message-Id: header, and we still want to keep all messages.
-- We create a dummy, unique, invalid ID containing a space.
while Msg_Cont.Msg /= Null_Message loop
Msg_Cont := null;
Store_Parent_Of
(Parent_Cont => Msg_Cont,
Id => Id & Integer'Image (Dummy_Id));
Dummy_Id := Dummy_Id + 1;
end loop;
end;
Msg_Cont.Msg := Element (C).Msg;
-- For each of the References: id:
Parent_Cont := null;
Set_Parent_For_All_Ids
(Parent_Cont => Parent_Cont,
H => Get_Header (Msg, "References"));
-- Take into account the In-Reply-To field. In most cases, this
-- should duplicate the last element of References:, but some
-- mailers do not behave correctly, so it doesn't harm to
-- do the work again
Set_Parent_For_All_Ids
(Parent_Cont => Parent_Cont,
H => Get_Header (Msg, "In-Reply-To"));
Set_Parent_Of
(Msg_Cont, Parent_Cont => Parent_Cont, Override => True);
Next (C);
end loop;
-- Prune empty containers. These come from invalid references in
-- the headers
-- ??? Nothing do do in fact, we'll just ignore these when putting
-- messages back in Self.Messages.
-- We would also promote the child of empty containers with one child
-- and no parent to the root set.
-- Find all elements of the root set
-- ??? Not needed, we do it when we put messages back in
-- Self.Messages
-- Sort messages by Subject, to find additional threads
-- ??? Disabled for now
Clear (Self.Messages);
Id_C := First (Ids);
while Has_Element (Id_C) loop
if Element (Id_C).Parent = null then
Put_Threads_In_Message
(Parent => Self.Messages,
Root => Element (Id_C),
Root_Level => True);
end if;
Next (Id_C);
end loop;
-- Free memory
Id_C := First (Ids);
while Has_Element (Id_C) loop
Msg_Cont := Element (Id_C);
Unchecked_Free (Msg_Cont);
Next (Id_C);
end loop;
Self.Threaded := True;
case Self.Sorted_By is
when Sort_None => null;
when Sort_Date =>
Self.Sorted_By := Sort_None;
Sort_By_Date (Self);
end case;
end if;
end Thread_Messages;
-----------------
-- Is_Threaded --
-----------------
function Is_Threaded (Self : Stored_Mailbox) return Boolean is
begin
return Self.Threaded;
end Is_Threaded;
begin
-- Can't include two ASCII.LF, since officially mboxes should even use
-- ASCII.CR & ASCII.LF, although most don't
Compile (From_Pattern, ASCII.LF & "From ");
end GNATCOLL.Email.Mailboxes;
|