|
1 // Copyright (c) 2013 Google Inc. |
|
2 // All rights reserved. |
|
3 // |
|
4 // Redistribution and use in source and binary forms, with or without |
|
5 // modification, are permitted provided that the following conditions are |
|
6 // met: |
|
7 // |
|
8 // * Redistributions of source code must retain the above copyright |
|
9 // notice, this list of conditions and the following disclaimer. |
|
10 // * Redistributions in binary form must reproduce the above |
|
11 // copyright notice, this list of conditions and the following disclaimer |
|
12 // in the documentation and/or other materials provided with the |
|
13 // distribution. |
|
14 // * Neither the name of Google Inc. nor the names of its |
|
15 // contributors may be used to endorse or promote products derived from |
|
16 // this software without specific prior written permission. |
|
17 // |
|
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
19 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
21 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
22 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
28 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
29 |
|
30 #include <string> |
|
31 #include <map> |
|
32 |
|
33 #include <stdlib.h> |
|
34 #include <string.h> |
|
35 |
|
36 #include "common/unique_string.h" |
|
37 |
|
38 namespace google_breakpad { |
|
39 |
|
40 /////////////////////////////////////////////////////////////////// |
|
41 // UniqueString |
|
42 // |
|
43 class UniqueString { |
|
44 public: |
|
45 UniqueString(string str) { str_ = strdup(str.c_str()); } |
|
46 ~UniqueString() { free(reinterpret_cast<void*>(const_cast<char*>(str_))); } |
|
47 const char* str_; |
|
48 }; |
|
49 |
|
50 class UniqueStringUniverse { |
|
51 public: |
|
52 UniqueStringUniverse() {}; |
|
53 const UniqueString* FindOrCopy(string str) { |
|
54 std::map<string, UniqueString*>::iterator it = map_.find(str); |
|
55 if (it == map_.end()) { |
|
56 UniqueString* ustr = new UniqueString(str); |
|
57 map_[str] = ustr; |
|
58 return ustr; |
|
59 } else { |
|
60 return it->second; |
|
61 } |
|
62 } |
|
63 private: |
|
64 std::map<string, UniqueString*> map_; |
|
65 }; |
|
66 |
|
67 // |
|
68 /////////////////////////////////////////////////////////////////// |
|
69 |
|
70 |
|
71 static UniqueStringUniverse* sUSU = NULL; |
|
72 |
|
73 |
|
74 // This isn't threadsafe. |
|
75 const UniqueString* ToUniqueString(string str) { |
|
76 if (!sUSU) { |
|
77 sUSU = new UniqueStringUniverse(); |
|
78 } |
|
79 return sUSU->FindOrCopy(str); |
|
80 } |
|
81 |
|
82 // This isn't threadsafe. |
|
83 const UniqueString* ToUniqueString_n(const char* str, size_t n) { |
|
84 if (!sUSU) { |
|
85 sUSU = new UniqueStringUniverse(); |
|
86 } |
|
87 string key(str, n); |
|
88 return sUSU->FindOrCopy(key); |
|
89 } |
|
90 |
|
91 const char Index(const UniqueString* us, int ix) |
|
92 { |
|
93 return us->str_[ix]; |
|
94 } |
|
95 |
|
96 const char* const FromUniqueString(const UniqueString* ustr) |
|
97 { |
|
98 return ustr->str_; |
|
99 } |
|
100 |
|
101 int StrcmpUniqueString(const UniqueString* us1, const UniqueString* us2) { |
|
102 return strcmp(us1->str_, us2->str_); |
|
103 } |
|
104 |
|
105 bool LessThan_UniqueString(const UniqueString* us1, const UniqueString* us2) { |
|
106 int r = StrcmpUniqueString(us1, us2); |
|
107 return r < 0; |
|
108 } |
|
109 |
|
110 } // namespace google_breakpad |