Tue, 06 Jan 2015 21:39:09 +0100
Conditionally force memory storage according to privacy.thirdparty.isolate;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.
michael@0 | 1 | // Copyright 2010 the V8 project authors. All rights reserved. |
michael@0 | 2 | // Redistribution and use in source and binary forms, with or without |
michael@0 | 3 | // modification, are permitted provided that the following conditions are |
michael@0 | 4 | // met: |
michael@0 | 5 | // |
michael@0 | 6 | // * Redistributions of source code must retain the above copyright |
michael@0 | 7 | // notice, this list of conditions and the following disclaimer. |
michael@0 | 8 | // * Redistributions in binary form must reproduce the above |
michael@0 | 9 | // copyright notice, this list of conditions and the following |
michael@0 | 10 | // disclaimer in the documentation and/or other materials provided |
michael@0 | 11 | // with the distribution. |
michael@0 | 12 | // * Neither the name of Google Inc. nor the names of its |
michael@0 | 13 | // contributors may be used to endorse or promote products derived |
michael@0 | 14 | // from this software without specific prior written permission. |
michael@0 | 15 | // |
michael@0 | 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
michael@0 | 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
michael@0 | 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
michael@0 | 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
michael@0 | 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
michael@0 | 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
michael@0 | 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
michael@0 | 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
michael@0 | 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
michael@0 | 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
michael@0 | 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
michael@0 | 27 | |
michael@0 | 28 | #ifndef DOUBLE_CONVERSION_FIXED_DTOA_H_ |
michael@0 | 29 | #define DOUBLE_CONVERSION_FIXED_DTOA_H_ |
michael@0 | 30 | |
michael@0 | 31 | #include "utils.h" |
michael@0 | 32 | |
michael@0 | 33 | namespace double_conversion { |
michael@0 | 34 | |
michael@0 | 35 | // Produces digits necessary to print a given number with |
michael@0 | 36 | // 'fractional_count' digits after the decimal point. |
michael@0 | 37 | // The buffer must be big enough to hold the result plus one terminating null |
michael@0 | 38 | // character. |
michael@0 | 39 | // |
michael@0 | 40 | // The produced digits might be too short in which case the caller has to fill |
michael@0 | 41 | // the gaps with '0's. |
michael@0 | 42 | // Example: FastFixedDtoa(0.001, 5, ...) is allowed to return buffer = "1", and |
michael@0 | 43 | // decimal_point = -2. |
michael@0 | 44 | // Halfway cases are rounded towards +/-Infinity (away from 0). The call |
michael@0 | 45 | // FastFixedDtoa(0.15, 2, ...) thus returns buffer = "2", decimal_point = 0. |
michael@0 | 46 | // The returned buffer may contain digits that would be truncated from the |
michael@0 | 47 | // shortest representation of the input. |
michael@0 | 48 | // |
michael@0 | 49 | // This method only works for some parameters. If it can't handle the input it |
michael@0 | 50 | // returns false. The output is null-terminated when the function succeeds. |
michael@0 | 51 | bool FastFixedDtoa(double v, int fractional_count, |
michael@0 | 52 | Vector<char> buffer, int* length, int* decimal_point); |
michael@0 | 53 | |
michael@0 | 54 | } // namespace double_conversion |
michael@0 | 55 | |
michael@0 | 56 | #endif // DOUBLE_CONVERSION_FIXED_DTOA_H_ |