mirror of
https://github.com/ProtonMail/proton-bridge.git
synced 2025-12-16 15:16:44 +00:00
e464e11ab9
Updates go-proton-api and Gluon to includes memory reduction changes and modify the sync process to take into account how much memory is used during the sync stage. The sync process now has an extra stage which first download the message metada to ensure that we only download up to `syncMaxDownloadRequesMem` messages or 250 messages total. This allows for scaling the download request automatically to accommodate many small or few very large messages. The IDs are then sent to a download go-routine which downloads the message and its attachments. The result is then forwarded to another go-routine which builds the actual message. This stage tries to ensure that we don't use more than `syncMaxMessageBuildingMem` to build these messages. Finally the result is sent to a last go-routine which applies the changes to Gluon and waits for them to be completed. The new process is currently limited to 2GB. Dynamic scaling will be implemented in a follow up. For systems with less than 2GB of memory we limit the values to a set of values that is known to work.
99 lines
2.8 KiB
Go
99 lines
2.8 KiB
Go
// Copyright (c) 2023 Proton AG
|
|
//
|
|
// This file is part of Proton Mail Bridge.
|
|
//
|
|
// Proton Mail Bridge is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Proton Mail Bridge 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 General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Proton Mail Bridge. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
package user
|
|
|
|
import (
|
|
"fmt"
|
|
"reflect"
|
|
"runtime"
|
|
"strings"
|
|
|
|
"github.com/ProtonMail/go-proton-api"
|
|
"golang.org/x/exp/maps"
|
|
"golang.org/x/exp/slices"
|
|
)
|
|
|
|
// mapTo converts the slice to the given type.
|
|
// This is not runtime safe, so make sure the slice is of the correct type!
|
|
// (This is a workaround for the fact that slices cannot be converted to other types generically).
|
|
func mapTo[From, To any](from []From) []To {
|
|
to := make([]To, 0, len(from))
|
|
|
|
for _, from := range from {
|
|
val, ok := reflect.ValueOf(from).Convert(reflect.TypeOf(to).Elem()).Interface().(To)
|
|
if !ok {
|
|
panic(fmt.Sprintf("cannot convert %T to %T", from, *new(To))) //nolint:gocritic
|
|
}
|
|
|
|
to = append(to, val)
|
|
}
|
|
|
|
return to
|
|
}
|
|
|
|
// groupBy returns a map of the given slice grouped by the given key.
|
|
// Duplicate keys are overwritten.
|
|
func groupBy[Key comparable, Value any](items []Value, key func(Value) Key) map[Key]Value {
|
|
groups := make(map[Key]Value)
|
|
|
|
for _, item := range items {
|
|
groups[key(item)] = item
|
|
}
|
|
|
|
return groups
|
|
}
|
|
|
|
// getAddrID returns the address ID for the given email address.
|
|
func getAddrID(apiAddrs map[string]proton.Address, email string) (string, error) {
|
|
for _, addr := range apiAddrs {
|
|
if strings.EqualFold(addr.Email, sanitizeEmail(email)) {
|
|
return addr.ID, nil
|
|
}
|
|
}
|
|
|
|
return "", fmt.Errorf("address %s not found", email)
|
|
}
|
|
|
|
// getAddrIdx returns the address with the given index.
|
|
func getAddrIdx(apiAddrs map[string]proton.Address, idx int) (proton.Address, error) {
|
|
sorted := sortSlice(maps.Values(apiAddrs), func(a, b proton.Address) bool {
|
|
return a.Order < b.Order
|
|
})
|
|
|
|
if idx < 0 || idx >= len(sorted) {
|
|
return proton.Address{}, fmt.Errorf("address index %d out of range", idx)
|
|
}
|
|
|
|
return sorted[idx], nil
|
|
}
|
|
|
|
// sortSlice returns the given slice sorted by the given comparator.
|
|
func sortSlice[Item any](items []Item, less func(Item, Item) bool) []Item {
|
|
sorted := make([]Item, len(items))
|
|
|
|
copy(sorted, items)
|
|
|
|
slices.SortFunc(sorted, less)
|
|
|
|
return sorted
|
|
}
|
|
|
|
func newProtonAPIScheduler() proton.Scheduler {
|
|
return proton.NewParallelScheduler(runtime.NumCPU() / 2)
|
|
}
|