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@google.com (Keir Mierle)
30 //
31 // Really simple file IO.
32
33 #include <cstdio>
34 #include "glog/logging.h"
35
36 namespace ceres {
37 namespace internal {
38
39 using std::string;
40
WriteStringToFileOrDie(const string & data,const string & filename)41 void WriteStringToFileOrDie(const string &data, const string &filename) {
42 FILE* file_descriptor = fopen(filename.c_str(), "wb");
43 if (!file_descriptor) {
44 LOG(FATAL) << "Couldn't write to file: " << filename;
45 }
46 fwrite(data.c_str(), 1, data.size(), file_descriptor);
47 fclose(file_descriptor);
48 }
49
ReadFileToStringOrDie(const string & filename,string * data)50 void ReadFileToStringOrDie(const string &filename, string *data) {
51 FILE* file_descriptor = fopen(filename.c_str(), "r");
52
53 if (!file_descriptor) {
54 LOG(FATAL) << "Couldn't read file: " << filename;
55 }
56
57 // Resize the input buffer appropriately.
58 fseek(file_descriptor, 0L, SEEK_END);
59 int num_bytes = ftell(file_descriptor);
60 data->resize(num_bytes);
61
62 // Read the data.
63 fseek(file_descriptor, 0L, SEEK_SET);
64 int num_read = fread(&((*data)[0]),
65 sizeof((*data)[0]),
66 num_bytes,
67 file_descriptor);
68 if (num_read != num_bytes) {
69 LOG(FATAL) << "Couldn't read all of " << filename
70 << "expected bytes: " << num_bytes * sizeof((*data)[0])
71 << "actual bytes: " << num_read;
72 }
73 fclose(file_descriptor);
74 }
75
JoinPath(const string & dirname,const string & basename)76 string JoinPath(const string& dirname, const string& basename) {
77 #ifdef _WIN32
78 static const char separator = '\\';
79 #else
80 static const char separator = '/';
81 #endif // _WIN32
82
83 if ((!basename.empty() && basename[0] == separator) || dirname.empty()) {
84 return basename;
85 } else if (dirname[dirname.size() - 1] == separator) {
86 return dirname + basename;
87 } else {
88 return dirname + string(&separator, 1) + basename;
89 }
90 }
91
92 } // namespace internal
93 } // namespace ceres
94