Sat, 03 Jan 2015 20:18:00 +0100
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
michael@0 | 1 | /* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
michael@0 | 5 | #ifndef nsUnicodeDecodeHelper_h__ |
michael@0 | 6 | #define nsUnicodeDecodeHelper_h__ |
michael@0 | 7 | |
michael@0 | 8 | #include "nsError.h" |
michael@0 | 9 | #include "uconvutil.h" |
michael@0 | 10 | //---------------------------------------------------------------------- |
michael@0 | 11 | // Class nsUnicodeDecodeHelper [declaration] |
michael@0 | 12 | |
michael@0 | 13 | /** |
michael@0 | 14 | * |
michael@0 | 15 | * @created 18/Mar/1998 |
michael@0 | 16 | * @author Catalin Rotaru [CATA] |
michael@0 | 17 | */ |
michael@0 | 18 | class nsUnicodeDecodeHelper |
michael@0 | 19 | { |
michael@0 | 20 | public: |
michael@0 | 21 | /** |
michael@0 | 22 | * Converts data using a lookup table and optional shift table |
michael@0 | 23 | */ |
michael@0 | 24 | static nsresult ConvertByTable(const char * aSrc, int32_t * aSrcLength, |
michael@0 | 25 | char16_t * aDest, int32_t * aDestLength, |
michael@0 | 26 | uScanClassID aScanClass, |
michael@0 | 27 | uShiftInTable * aShiftInTable, |
michael@0 | 28 | uMappingTable * aMappingTable, |
michael@0 | 29 | bool aErrorSignal = false); |
michael@0 | 30 | |
michael@0 | 31 | /** |
michael@0 | 32 | * Converts data using a set of lookup tables. |
michael@0 | 33 | */ |
michael@0 | 34 | static nsresult ConvertByMultiTable(const char * aSrc, int32_t * aSrcLength, |
michael@0 | 35 | char16_t * aDest, int32_t * aDestLength, int32_t aTableCount, |
michael@0 | 36 | const uRange * aRangeArray, uScanClassID * aScanClassArray, |
michael@0 | 37 | uMappingTable ** aMappingTable, bool aErrorSignal = false); |
michael@0 | 38 | |
michael@0 | 39 | /** |
michael@0 | 40 | * Converts data using a fast lookup table. |
michael@0 | 41 | */ |
michael@0 | 42 | static nsresult ConvertByFastTable(const char * aSrc, int32_t * aSrcLength, |
michael@0 | 43 | char16_t * aDest, int32_t * aDestLength, const char16_t * aFastTable, |
michael@0 | 44 | int32_t aTableSize, bool aErrorSignal); |
michael@0 | 45 | |
michael@0 | 46 | /** |
michael@0 | 47 | * Create a cache-like fast lookup table from a normal one. |
michael@0 | 48 | */ |
michael@0 | 49 | static nsresult CreateFastTable(uMappingTable * aMappingTable, |
michael@0 | 50 | char16_t * aFastTable, int32_t aTableSize); |
michael@0 | 51 | }; |
michael@0 | 52 | |
michael@0 | 53 | #endif // nsUnicodeDecodeHelper_h__ |
michael@0 | 54 | |
michael@0 | 55 |