toolkit/crashreporter/google-breakpad/src/common/mac/SimpleStringDictionary.mm@129ffea94266 (annotated)
toolkit/crashreporter/google-breakpad/src/common/mac/SimpleStringDictionary.mm
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
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 | // Copyright (c) 2007, Google Inc. |
| michael@0 | 2 | // All rights reserved. |
| michael@0 | 3 | // |
| michael@0 | 4 | // Redistribution and use in source and binary forms, with or without |
| michael@0 | 5 | // modification, are permitted provided that the following conditions are |
| michael@0 | 6 | // met: |
| michael@0 | 7 | // |
| michael@0 | 8 | // * Redistributions of source code must retain the above copyright |
| michael@0 | 9 | // notice, this list of conditions and the following disclaimer. |
| michael@0 | 10 | // * Redistributions in binary form must reproduce the above |
| michael@0 | 11 | // copyright notice, this list of conditions and the following disclaimer |
| michael@0 | 12 | // in the documentation and/or other materials provided with the |
| michael@0 | 13 | // distribution. |
| michael@0 | 14 | // * Neither the name of Google Inc. nor the names of its |
| michael@0 | 15 | // contributors may be used to endorse or promote products derived from |
| michael@0 | 16 | // this software without specific prior written permission. |
| michael@0 | 17 | // |
| michael@0 | 18 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| michael@0 | 19 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| michael@0 | 20 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| michael@0 | 21 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| michael@0 | 22 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| michael@0 | 23 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| michael@0 | 24 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| michael@0 | 25 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| michael@0 | 26 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| michael@0 | 27 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| michael@0 | 28 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 29 | // |
| michael@0 | 30 | // SimpleStringDictionary.mm |
| michael@0 | 31 | // Simple string dictionary that does not allocate memory |
| michael@0 | 32 | // |
| michael@0 | 33 | |
| michael@0 | 34 | #include <assert.h> |
| michael@0 | 35 | |
| michael@0 | 36 | #import "SimpleStringDictionary.h" |
| michael@0 | 37 | |
| michael@0 | 38 | namespace google_breakpad { |
| michael@0 | 39 | |
| michael@0 | 40 | //============================================================================== |
| michael@0 | 41 | const KeyValueEntry *SimpleStringDictionary::GetEntry(int i) const { |
| michael@0 | 42 | return (i >= 0 && i < MAX_NUM_ENTRIES) ? &entries_[i] : NULL; |
| michael@0 | 43 | } |
| michael@0 | 44 | |
| michael@0 | 45 | //============================================================================== |
| michael@0 | 46 | int SimpleStringDictionary::GetCount() const { |
| michael@0 | 47 | int count = 0; |
| michael@0 | 48 | for (int i = 0; i < MAX_NUM_ENTRIES; ++i) { |
| michael@0 | 49 | if (entries_[i].IsActive() ) { |
| michael@0 | 50 | ++count; |
| michael@0 | 51 | } |
| michael@0 | 52 | } |
| michael@0 | 53 | |
| michael@0 | 54 | return count; |
| michael@0 | 55 | } |
| michael@0 | 56 | |
| michael@0 | 57 | //============================================================================== |
| michael@0 | 58 | const char *SimpleStringDictionary::GetValueForKey(const char *key) const { |
| michael@0 | 59 | assert(key); |
| michael@0 | 60 | if (!key) |
| michael@0 | 61 | return NULL; |
| michael@0 | 62 | |
| michael@0 | 63 | for (int i = 0; i < MAX_NUM_ENTRIES; ++i) { |
| michael@0 | 64 | const KeyValueEntry &entry = entries_[i]; |
| michael@0 | 65 | if (entry.IsActive() && !strcmp(entry.GetKey(), key)) { |
| michael@0 | 66 | return entry.GetValue(); |
| michael@0 | 67 | } |
| michael@0 | 68 | } |
| michael@0 | 69 | |
| michael@0 | 70 | return NULL; |
| michael@0 | 71 | } |
| michael@0 | 72 | |
| michael@0 | 73 | //============================================================================== |
| michael@0 | 74 | void SimpleStringDictionary::SetKeyValue(const char *key, |
| michael@0 | 75 | const char *value) { |
| michael@0 | 76 | if (!value) { |
| michael@0 | 77 | RemoveKey(key); |
| michael@0 | 78 | return; |
| michael@0 | 79 | } |
| michael@0 | 80 | |
| michael@0 | 81 | // key must not be NULL |
| michael@0 | 82 | assert(key); |
| michael@0 | 83 | if (!key) |
| michael@0 | 84 | return; |
| michael@0 | 85 | |
| michael@0 | 86 | // key must not be empty string |
| michael@0 | 87 | assert(key[0] != '\0'); |
| michael@0 | 88 | if (key[0] == '\0') |
| michael@0 | 89 | return; |
| michael@0 | 90 | |
| michael@0 | 91 | int free_index = -1; |
| michael@0 | 92 | |
| michael@0 | 93 | // check if key already exists |
| michael@0 | 94 | for (int i = 0; i < MAX_NUM_ENTRIES; ++i) { |
| michael@0 | 95 | KeyValueEntry &entry = entries_[i]; |
| michael@0 | 96 | |
| michael@0 | 97 | if (entry.IsActive()) { |
| michael@0 | 98 | if (!strcmp(entry.GetKey(), key)) { |
| michael@0 | 99 | entry.SetValue(value); |
| michael@0 | 100 | return; |
| michael@0 | 101 | } |
| michael@0 | 102 | } else { |
| michael@0 | 103 | // Make a note of an empty slot |
| michael@0 | 104 | if (free_index == -1) { |
| michael@0 | 105 | free_index = i; |
| michael@0 | 106 | } |
| michael@0 | 107 | } |
| michael@0 | 108 | } |
| michael@0 | 109 | |
| michael@0 | 110 | // check if we've run out of space |
| michael@0 | 111 | assert(free_index != -1); |
| michael@0 | 112 | |
| michael@0 | 113 | // Put new key into an empty slot (if found) |
| michael@0 | 114 | if (free_index != -1) { |
| michael@0 | 115 | entries_[free_index].SetKeyValue(key, value); |
| michael@0 | 116 | } |
| michael@0 | 117 | } |
| michael@0 | 118 | |
| michael@0 | 119 | //============================================================================== |
| michael@0 | 120 | void SimpleStringDictionary::RemoveKey(const char *key) { |
| michael@0 | 121 | assert(key); |
| michael@0 | 122 | if (!key) |
| michael@0 | 123 | return; |
| michael@0 | 124 | |
| michael@0 | 125 | for (int i = 0; i < MAX_NUM_ENTRIES; ++i) { |
| michael@0 | 126 | if (!strcmp(entries_[i].GetKey(), key)) { |
| michael@0 | 127 | entries_[i].Clear(); |
| michael@0 | 128 | return; |
| michael@0 | 129 | } |
| michael@0 | 130 | } |
| michael@0 | 131 | } |
| michael@0 | 132 | |
| michael@0 | 133 | } // namespace google_breakpad |
