368 lines
12 KiB
Rust
368 lines
12 KiB
Rust
/*
|
|
* SPDX-FileCopyrightText: 2020 Stalwart Labs Ltd <hello@stalw.art>
|
|
*
|
|
* SPDX-License-Identifier: AGPL-3.0-only OR LicenseRef-SEL
|
|
*/
|
|
|
|
use std::{collections::BTreeMap, sync::Arc};
|
|
|
|
use ahash::AHashMap;
|
|
use common::{NextMailboxState, listener::SessionStream};
|
|
use email::mailbox::UidMailbox;
|
|
use imap_proto::protocol::{Sequence, expunge, select::Exists};
|
|
use jmap_proto::{
|
|
object::Object,
|
|
types::{collection::Collection, property::Property, value::Value},
|
|
};
|
|
use store::{
|
|
ValueKey,
|
|
write::{ValueClass, assert::HashedValue},
|
|
};
|
|
use trc::AddContext;
|
|
|
|
use crate::core::ImapId;
|
|
|
|
use super::{ImapUidToId, MailboxId, MailboxState, SelectedMailbox, SessionData};
|
|
|
|
pub(crate) const MAX_RETRIES: usize = 10;
|
|
|
|
impl<T: SessionStream> SessionData<T> {
|
|
pub async fn fetch_messages(&self, mailbox: &MailboxId) -> trc::Result<MailboxState> {
|
|
// Obtain message ids
|
|
let message_ids = self
|
|
.server
|
|
.get_tag(
|
|
mailbox.account_id,
|
|
Collection::Email,
|
|
Property::MailboxIds,
|
|
mailbox.mailbox_id,
|
|
)
|
|
.await?
|
|
.unwrap_or_default();
|
|
|
|
// Obtain UID validity and UID next
|
|
let uid_validity = self.get_uid_validity(mailbox).await?;
|
|
let uid_next = self.get_uid_next(mailbox).await?;
|
|
|
|
// Obtain current state
|
|
let modseq = self
|
|
.server
|
|
.core
|
|
.storage
|
|
.data
|
|
.get_last_change_id(mailbox.account_id, Collection::Email)
|
|
.await
|
|
.add_context(|e| e.caused_by(trc::location!()).account_id(mailbox.account_id))?;
|
|
|
|
// Obtain all message ids
|
|
let mut uid_map = BTreeMap::new();
|
|
for (message_id, uid_mailbox) in self
|
|
.server
|
|
.get_properties::<HashedValue<Vec<UidMailbox>>, _, _>(
|
|
mailbox.account_id,
|
|
Collection::Email,
|
|
&message_ids,
|
|
Property::MailboxIds,
|
|
)
|
|
.await?
|
|
.into_iter()
|
|
{
|
|
// Make sure the message is still in this mailbox
|
|
if let Some(item) = uid_mailbox
|
|
.inner
|
|
.iter()
|
|
.find(|item| item.mailbox_id == mailbox.mailbox_id)
|
|
{
|
|
debug_assert!(item.uid != 0, "UID is zero for message {item:?}");
|
|
if uid_map.insert(item.uid, message_id).is_some() {
|
|
trc::event!(
|
|
Store(trc::StoreEvent::UnexpectedError),
|
|
AccountId = mailbox.account_id,
|
|
Collection = Collection::Mailbox,
|
|
MailboxId = mailbox.mailbox_id,
|
|
MessageId = message_id,
|
|
SpanId = self.session_id,
|
|
Details = "Duplicate IMAP UID"
|
|
);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Obtain UID next and assign UIDs
|
|
let mut uid_max = 0;
|
|
let mut id_to_imap = AHashMap::with_capacity(uid_map.len());
|
|
let mut uid_to_id = AHashMap::with_capacity(uid_map.len());
|
|
|
|
for (seqnum, (uid, message_id)) in uid_map.into_iter().enumerate() {
|
|
if uid > uid_max {
|
|
uid_max = uid;
|
|
}
|
|
id_to_imap.insert(
|
|
message_id,
|
|
ImapId {
|
|
uid,
|
|
seqnum: seqnum as u32 + 1,
|
|
},
|
|
);
|
|
uid_to_id.insert(uid, message_id);
|
|
}
|
|
|
|
let mut state = MailboxState {
|
|
uid_next,
|
|
uid_validity,
|
|
total_messages: id_to_imap.len(),
|
|
id_to_imap,
|
|
uid_to_id,
|
|
uid_max,
|
|
modseq,
|
|
next_state: None,
|
|
obj_size: 0,
|
|
};
|
|
state.obj_size = state.calculate_weight();
|
|
|
|
Ok(state)
|
|
}
|
|
|
|
pub async fn synchronize_messages(
|
|
&self,
|
|
mailbox: &SelectedMailbox,
|
|
) -> trc::Result<Option<u64>> {
|
|
// Obtain current modseq
|
|
let modseq = self.get_modseq(mailbox.id.account_id).await?;
|
|
if mailbox.state.lock().modseq != modseq {
|
|
// Synchronize messages
|
|
let new_state = self.fetch_messages(&mailbox.id).await?;
|
|
let mut current_state = mailbox.state.lock();
|
|
|
|
// Add missing uids
|
|
let mut deletions = current_state
|
|
.next_state
|
|
.take()
|
|
.map(|state| state.deletions)
|
|
.unwrap_or_default();
|
|
let mut id_to_imap = AHashMap::with_capacity(current_state.id_to_imap.len());
|
|
for (id, imap_id) in std::mem::take(&mut current_state.id_to_imap) {
|
|
if !new_state.uid_to_id.contains_key(&imap_id.uid) {
|
|
// Add to deletions
|
|
deletions.push(imap_id);
|
|
|
|
// Invalidate entries
|
|
current_state.uid_to_id.remove(&imap_id.uid);
|
|
} else {
|
|
id_to_imap.insert(id, imap_id);
|
|
}
|
|
}
|
|
current_state.id_to_imap = id_to_imap;
|
|
|
|
// Update cache
|
|
self.server
|
|
.inner
|
|
.cache
|
|
.mailbox
|
|
.insert(mailbox.id, Arc::new(new_state.clone()));
|
|
|
|
// Update state
|
|
current_state.modseq = new_state.modseq;
|
|
current_state.next_state = Some(Box::new(NextMailboxState {
|
|
next_state: new_state,
|
|
deletions,
|
|
}));
|
|
}
|
|
|
|
Ok(modseq)
|
|
}
|
|
|
|
pub async fn write_mailbox_changes(
|
|
&self,
|
|
mailbox: &SelectedMailbox,
|
|
is_qresync: bool,
|
|
) -> trc::Result<Option<u64>> {
|
|
// Resync mailbox
|
|
let modseq = self.synchronize_messages(mailbox).await?;
|
|
let mut buf = Vec::new();
|
|
{
|
|
let mut current_state = mailbox.state.lock();
|
|
if let Some(next_state) = current_state.next_state.take() {
|
|
if !next_state.deletions.is_empty() {
|
|
let mut ids = next_state
|
|
.deletions
|
|
.into_iter()
|
|
.map(|id| if is_qresync { id.uid } else { id.seqnum })
|
|
.collect::<Vec<u32>>();
|
|
ids.sort_unstable();
|
|
expunge::Response { is_qresync, ids }.serialize_to(&mut buf);
|
|
}
|
|
if !buf.is_empty()
|
|
|| next_state
|
|
.next_state
|
|
.uid_max
|
|
.saturating_sub(current_state.uid_max)
|
|
> 0
|
|
{
|
|
Exists {
|
|
total_messages: next_state.next_state.total_messages,
|
|
}
|
|
.serialize(&mut buf);
|
|
}
|
|
*current_state = next_state.next_state;
|
|
}
|
|
}
|
|
if !buf.is_empty() {
|
|
self.write_bytes(buf).await?;
|
|
}
|
|
|
|
Ok(modseq)
|
|
}
|
|
|
|
pub async fn get_modseq(&self, account_id: u32) -> trc::Result<Option<u64>> {
|
|
// Obtain current modseq
|
|
self.server
|
|
.core
|
|
.storage
|
|
.data
|
|
.get_last_change_id(account_id, Collection::Email)
|
|
.await
|
|
.add_context(|e| {
|
|
e.caused_by(trc::location!())
|
|
.account_id(account_id)
|
|
.collection(Collection::Email)
|
|
})
|
|
}
|
|
|
|
pub async fn get_uid_validity(&self, mailbox: &MailboxId) -> trc::Result<u32> {
|
|
self.server
|
|
.get_property::<Object<Value>>(
|
|
mailbox.account_id,
|
|
Collection::Mailbox,
|
|
mailbox.mailbox_id,
|
|
&Property::Value,
|
|
)
|
|
.await?
|
|
.and_then(|obj| obj.get(&Property::Cid).as_uint())
|
|
.ok_or_else(|| {
|
|
trc::ImapEvent::Error
|
|
.caused_by(trc::location!())
|
|
.details("Mailbox unavailable")
|
|
.account_id(mailbox.account_id)
|
|
.collection(Collection::Mailbox)
|
|
.document_id(mailbox.mailbox_id)
|
|
})
|
|
.map(|v| v as u32)
|
|
}
|
|
|
|
pub async fn get_uid_next(&self, mailbox: &MailboxId) -> trc::Result<u32> {
|
|
self.server
|
|
.core
|
|
.storage
|
|
.data
|
|
.get_counter(ValueKey {
|
|
account_id: mailbox.account_id,
|
|
collection: Collection::Mailbox.into(),
|
|
document_id: mailbox.mailbox_id,
|
|
class: ValueClass::Property(Property::EmailIds.into()),
|
|
})
|
|
.await
|
|
.map(|v| (v + 1) as u32)
|
|
}
|
|
}
|
|
|
|
impl SelectedMailbox {
|
|
pub async fn sequence_to_ids(
|
|
&self,
|
|
sequence: &Sequence,
|
|
is_uid: bool,
|
|
) -> trc::Result<AHashMap<u32, ImapId>> {
|
|
if !sequence.is_saved_search() {
|
|
let mut ids = AHashMap::new();
|
|
let state = self.state.lock();
|
|
if state.id_to_imap.is_empty() {
|
|
return Ok(ids);
|
|
}
|
|
|
|
if is_uid {
|
|
for (id, imap_id) in &state.id_to_imap {
|
|
if sequence.contains(imap_id.uid, state.uid_max) {
|
|
ids.insert(*id, *imap_id);
|
|
}
|
|
}
|
|
} else {
|
|
for (id, imap_id) in &state.id_to_imap {
|
|
if sequence.contains(imap_id.seqnum, state.total_messages as u32) {
|
|
ids.insert(*id, *imap_id);
|
|
}
|
|
}
|
|
}
|
|
|
|
Ok(ids)
|
|
} else {
|
|
let saved_ids = self.get_saved_search().await.ok_or_else(|| {
|
|
trc::ImapEvent::Error
|
|
.into_err()
|
|
.details("No saved search found.")
|
|
})?;
|
|
let mut ids = AHashMap::with_capacity(saved_ids.len());
|
|
let state = self.state.lock();
|
|
|
|
for imap_id in saved_ids.iter() {
|
|
if let Some(id) = state.uid_to_id.get(&imap_id.uid) {
|
|
ids.insert(*id, *imap_id);
|
|
}
|
|
}
|
|
|
|
Ok(ids)
|
|
}
|
|
}
|
|
|
|
pub async fn sequence_expand_missing(&self, sequence: &Sequence, is_uid: bool) -> Vec<u32> {
|
|
let mut deleted_ids = Vec::new();
|
|
if !sequence.is_saved_search() {
|
|
let state = self.state.lock();
|
|
if is_uid {
|
|
for uid in sequence.expand(state.uid_max) {
|
|
if !state.uid_to_id.contains_key(&uid) {
|
|
deleted_ids.push(uid);
|
|
}
|
|
}
|
|
} else {
|
|
for seqnum in sequence.expand(state.total_messages as u32) {
|
|
if seqnum > state.total_messages as u32 {
|
|
deleted_ids.push(seqnum);
|
|
}
|
|
}
|
|
}
|
|
} else if let Some(saved_ids) = self.get_saved_search().await {
|
|
let state = self.state.lock();
|
|
for id in saved_ids.iter() {
|
|
if !state.uid_to_id.contains_key(&id.uid) {
|
|
deleted_ids.push(if is_uid { id.uid } else { id.seqnum });
|
|
}
|
|
}
|
|
}
|
|
deleted_ids.sort_unstable();
|
|
deleted_ids
|
|
}
|
|
|
|
pub fn append_messages(&self, ids: Vec<ImapUidToId>, modseq: Option<u64>) -> u32 {
|
|
let mut mailbox = self.state.lock();
|
|
if modseq.unwrap_or(0) > mailbox.modseq.unwrap_or(0) {
|
|
let mut uid_max = 0;
|
|
for id in ids {
|
|
mailbox.total_messages += 1;
|
|
let seqnum = mailbox.total_messages as u32;
|
|
mailbox.uid_to_id.insert(id.uid, id.uid);
|
|
mailbox.id_to_imap.insert(
|
|
id.id,
|
|
ImapId {
|
|
uid: id.uid,
|
|
seqnum,
|
|
},
|
|
);
|
|
uid_max = id.uid;
|
|
}
|
|
mailbox.uid_max = uid_max;
|
|
mailbox.uid_next = uid_max + 1;
|
|
}
|
|
mailbox.uid_validity
|
|
}
|
|
}
|