1 // Ceres Solver - A fast non-linear least squares minimizer 2 // Copyright 2010, 2011, 2012 Google Inc. All rights reserved. 3 // http://code.google.com/p/ceres-solver/ 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 // * Redistributions of source code must retain the above copyright notice, 9 // this list of conditions and the following disclaimer. 10 // * 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 // * Neither the name of Google Inc. nor the names of its contributors may be 14 // used to endorse or promote products derived from this software without 15 // specific prior written permission. 16 // 17 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 18 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 21 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 24 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 25 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 26 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 27 // POSSIBILITY OF SUCH DAMAGE. 28 // 29 // Author: keir (at) google.com (Keir Mierle) 30 // 31 // Really simple file IO. 32 33 #include "ceres/file.h" 34 35 #include <cstdio> 36 #include "glog/logging.h" 37 38 namespace ceres { 39 namespace internal { 40 41 using std::string; 42 43 void WriteStringToFileOrDie(const string &data, const string &filename) { 44 FILE* file_descriptor = fopen(filename.c_str(), "wb"); 45 if (!file_descriptor) { 46 LOG(FATAL) << "Couldn't write to file: " << filename; 47 } 48 fwrite(data.c_str(), 1, data.size(), file_descriptor); 49 fclose(file_descriptor); 50 } 51 52 void ReadFileToStringOrDie(const string &filename, string *data) { 53 FILE* file_descriptor = fopen(filename.c_str(), "r"); 54 55 if (!file_descriptor) { 56 LOG(FATAL) << "Couldn't read file: " << filename; 57 } 58 59 // Resize the input buffer appropriately. 60 fseek(file_descriptor, 0L, SEEK_END); 61 int num_bytes = ftell(file_descriptor); 62 data->resize(num_bytes); 63 64 // Read the data. 65 fseek(file_descriptor, 0L, SEEK_SET); 66 int num_read = fread(&((*data)[0]), 67 sizeof((*data)[0]), 68 num_bytes, 69 file_descriptor); 70 if (num_read != num_bytes) { 71 LOG(FATAL) << "Couldn't read all of " << filename 72 << "expected bytes: " << num_bytes * sizeof((*data)[0]) 73 << "actual bytes: " << num_read; 74 } 75 fclose(file_descriptor); 76 } 77 78 string JoinPath(const string& dirname, const string& basename) { 79 #ifdef _WIN32 80 static const char separator = '\\'; 81 #else 82 static const char separator = '/'; 83 #endif // _WIN32 84 85 if ((!basename.empty() && basename[0] == separator) || dirname.empty()) { 86 return basename; 87 } else if (dirname[dirname.size() - 1] == separator) { 88 return dirname + basename; 89 } else { 90 return dirname + string(&separator, 1) + basename; 91 } 92 } 93 94 } // namespace internal 95 } // namespace ceres 96
