henrike@webrtc.org | 0e118e7 | 2013-07-10 00:45:36 +0000 | [diff] [blame] | 1 | /* |
| 2 | * libjingle |
| 3 | * Copyright 2004--2010, Google Inc. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions are met: |
| 7 | * |
| 8 | * 1. Redistributions of source code must retain the above copyright notice, |
| 9 | * this list of conditions and the following disclaimer. |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * 3. The name of the author may not be used to endorse or promote products |
| 14 | * derived from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| 17 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 18 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
| 19 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 20 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 21 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
| 22 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 23 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| 24 | * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF |
| 25 | * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #include "talk/base/versionparsing.h" |
| 29 | |
pbos@webrtc.org | b951827 | 2014-03-07 15:22:04 +0000 | [diff] [blame] | 30 | #include <stdlib.h> |
henrike@webrtc.org | 0e118e7 | 2013-07-10 00:45:36 +0000 | [diff] [blame] | 31 | |
| 32 | namespace talk_base { |
| 33 | |
| 34 | bool ParseVersionString(const std::string& version_str, |
| 35 | int num_expected_segments, |
| 36 | int version[]) { |
| 37 | size_t pos = 0; |
| 38 | for (int i = 0;;) { |
| 39 | size_t dot_pos = version_str.find('.', pos); |
| 40 | size_t n; |
| 41 | if (dot_pos == std::string::npos) { |
| 42 | // npos here is a special value meaning "to the end of the string" |
| 43 | n = std::string::npos; |
| 44 | } else { |
| 45 | n = dot_pos - pos; |
| 46 | } |
| 47 | |
| 48 | version[i] = atoi(version_str.substr(pos, n).c_str()); |
| 49 | |
| 50 | if (++i >= num_expected_segments) break; |
| 51 | |
| 52 | if (dot_pos == std::string::npos) { |
| 53 | // Previous segment was not terminated by a dot, but there's supposed to |
| 54 | // be more segments, so that's an error. |
| 55 | return false; |
| 56 | } |
| 57 | pos = dot_pos + 1; |
| 58 | } |
| 59 | return true; |
| 60 | } |
| 61 | |
| 62 | int CompareVersions(const int version1[], |
| 63 | const int version2[], |
| 64 | int num_segments) { |
| 65 | for (int i = 0; i < num_segments; ++i) { |
| 66 | int diff = version1[i] - version2[i]; |
| 67 | if (diff != 0) { |
| 68 | return diff; |
| 69 | } |
| 70 | } |
| 71 | return 0; |
| 72 | } |
| 73 | |
| 74 | } // namespace talk_base |