OLD | NEW |
(Empty) | |
| 1 // Copyright 2011, 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 "config.h" |
| 31 #include "DartFlags.h" |
| 32 #include <wtf/Vector.h> |
| 33 |
| 34 namespace WebCore { |
| 35 |
| 36 char* DartFlags::m_flags = 0; |
| 37 char** DartFlags::m_argv = 0; |
| 38 int DartFlags::m_argc = 0; |
| 39 |
| 40 void DartFlags::setFlags(const std::string& flags) |
| 41 { |
| 42 // Clear flags if set. |
| 43 if (m_flags) |
| 44 free(m_flags); |
| 45 m_flags = strdup(flags.c_str()); |
| 46 ASSERT(m_flags); |
| 47 |
| 48 // Determine split points in string. |
| 49 const char separator = ' '; |
| 50 |
| 51 Vector<int> positions; |
| 52 size_t startPos = 0; |
| 53 size_t endPos; |
| 54 |
| 55 while ((endPos = flags.find(separator, startPos)) != std::string::npos) { |
| 56 if (startPos != endPos) { |
| 57 positions.append(startPos); |
| 58 m_flags[endPos] = 0; |
| 59 } |
| 60 startPos = endPos + 1; |
| 61 } |
| 62 if (startPos != flags.length()) |
| 63 positions.append(startPos); |
| 64 |
| 65 m_argc = positions.size(); |
| 66 m_argv = new char*[m_argc]; |
| 67 for (int i = 0; i < m_argc; i++) |
| 68 m_argv[i] = &m_flags[positions[i]]; |
| 69 } |
| 70 |
| 71 } |
OLD | NEW |