aboutsummaryrefslogtreecommitdiffstats
path: root/OpenKeychain/src/main/java/org/sufficientlysecure/keychain/util/ParcelableCache.java
blob: 75bdee00a60c5838a056a30441a90e639a6b6c92 (plain)
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
/*
 * Copyright (C) 2015 Dominik Schürmann <dominik@dominikschuermann.de>
 *
 * This program 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.
 *
 * This program 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 this program.  If not, see <http://www.gnu.org/licenses/>.
 */

package org.sufficientlysecure.keychain.util;

import android.os.Parcel;

import java.util.UUID;
import java.util.concurrent.ConcurrentHashMap;

/**
 * If Parcelables are above 1 MB, Android OS fails to send them via the Binder IPC:
 * JavaBinder  E  !!! FAILED BINDER TRANSACTION !!!
 * To overcome this issue this class allows to cache Parcelables, mapped by unique UUIDs,
 * which are written to the parcel instead of the whole Parcelable.
 */
public class ParcelableCache<E> {

    private static final UUID NULL_UUID = new UUID(0, 0);

    /**
     * A HashMap of UUID:Object
     * This is used such that when we become parceled, we are
     * well below the 1 MB boundary that is specified.
     */
    private ConcurrentHashMap<UUID, E> objectCache = new ConcurrentHashMap<>();

    /**
     * Dehydrate a Parcelable (such that it is available after deparcelization)
     * Returns the NULL uuid (0) if you hand it null.
     *
     * @param parcelable A Parcelable to dehydrate
     * @return a UUID, the ticket for your dehydrated Parcelable
     */
    private UUID dehydrateParcelable(E parcelable) {
        if (parcelable == null) {
            return NULL_UUID;
        } else {
            UUID uuid = UUID.randomUUID();
            objectCache.put(uuid, parcelable);
            return uuid;
        }
    }

    /**
     * Rehydrate a Parcelable after going through parcelization,
     * invalidating its place in the dehydration pool.
     * This is used such that when parcelized, the Parcelable is no larger than 1 MB.
     *
     * @param uuid A UUID ticket that identifies the log in question.
     * @return An OperationLog.
     */
    private E rehydrateParcelable(UUID uuid) {
        // UUID.equals isn't well documented; we use compareTo instead.
        if (NULL_UUID.compareTo(uuid) == 0) {
            return null;
        } else {
            E parcelable = objectCache.get(uuid);
            objectCache.remove(uuid);
            return parcelable;
        }
    }

    public E readFromParcelAndGetFromCache(Parcel source) {
        long mostSig = source.readLong();
        long leastSig = source.readLong();
        UUID mTicket = new UUID(mostSig, leastSig);
        // fetch the dehydrated parcelable out of storage (this removes it from the dehydration pool)
        return rehydrateParcelable(mTicket);
    }

    public void cacheAndWriteToParcel(E parcelable, Parcel dest) {
        // Get a ticket for our parcelable.
        UUID mTicket = dehydrateParcelable(parcelable);
        // And write out the UUID most and least significant bits.
        dest.writeLong(mTicket.getMostSignificantBits());
        dest.writeLong(mTicket.getLeastSignificantBits());
    }

}