-/*******************************************************************************
-
- Copyright (c) 2009, Charles McGarvey
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions are met:
-
- * Redistributions of source code must retain the above copyright notice,
- this list of conditions and the following disclaimer.
- * Redistributions in binary form must reproduce the above copyright notice,
- this list of conditions and the following disclaimer in the documentation
- and/or other materials provided with the distribution.
-
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
- OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-*******************************************************************************/
-
-#include <unistd.h>
-
+/*] Copyright (c) 2009-2010, Charles McGarvey [**************************
+**] All rights reserved.
+*
+* vi:ts=4 sw=4 tw=75
+*
+* Distributable under the terms and conditions of the 2-clause BSD license;
+* see the file COPYING for a complete text of the license.
+*
+**************************************************************************/
+
+#include <boost/algorithm/string.hpp>
+
+#include "Log.hh"
#include "Resource.hh"
// static member
-std::vector<std::string> Resource::searchPaths_;
+std::vector<std::string> Resource::gSearchPaths;
-Resource::~Resource() {}
+void Resource::addSearchPaths(const std::string& paths)
+{
+ std::vector<std::string> pathList;
+ boost::split(pathList, paths, boost::is_any_of(":"));
+ addSearchPaths(pathList);
+}
-void Resource::addSearchPath(const std::string& directory)
+void Resource::addSearchPaths(const std::vector<std::string>& pathList)
{
- // add a slash if there isn't one already
- if (directory[directory.length() - 1] != '/')
+ std::vector<std::string>::const_iterator it;
+ for (it = pathList.begin(); it != pathList.end(); ++it)
{
- searchPaths_.push_back(directory + '/');
+ std::string path(*it);
+
+ ASSERT(!path.empty() && "empty search path string");
+
+ // add a slash if there isn't one already
+ if (*path.rbegin() != '/') path += '/';
+
+#if defined(_WIN32)
+ boost::replace_all(path, "/", "\\");
+#endif
+
+ gSearchPaths.push_back(path);
+ logInfo << "added search path " << path << std::endl;
}
- else
+}
+
+
+std::string Resource::getPath(const std::string& path,
+ const std::string& prefix,
+ const std::string& extension)
+{
+ std::string realPath(path);
+ if (getPath(realPath, prefix, extension)) return realPath;
+
+ return std::string();
+}
+
+bool Resource::getPath(std::string& path,
+ const std::string& prefix,
+ const std::string& extension)
+{
+ FILE* file = openFile(path, prefix, extension);
+ if (file)
{
- searchPaths_.push_back(directory);
+ fclose(file);
+ return true;
}
+
+ return false;
}
-std::string Resource::getPath(const std::string& name)
+FILE* Resource::openFile(std::string& path,
+ std::string prefix,
+ const std::string& extension,
+ const std::string& mode)
{
- std::vector<std::string>::iterator it;
+#if defined(_WIN32)
+ // Windows always has to be the odd one.
+ boost::replace_all(path, "/", "\\");
+ boost::replace_all(prefix, "/", "\\");
+#endif
+
+ std::vector<std::string> preList;
+ boost::split(preList, prefix, boost::is_any_of(":"));
+ std::vector<std::string> postList;
+ boost::split(postList, extension, boost::is_any_of(":"));
- for (it = searchPaths_.begin(); it != searchPaths_.end(); ++it)
+ std::vector<std::string>::iterator it;
+ for (it = gSearchPaths.begin(); it != gSearchPaths.end(); ++it)
{
- std::string fullPath(*it);
- fullPath += name;
+ std::vector<std::string>::iterator jt;
+ for (jt = preList.begin(); jt != preList.end(); ++jt)
+ {
+ std::vector<std::string>::iterator kt;
+ for (kt = postList.begin(); kt != postList.end(); ++kt)
+ {
+ std::string realPath(*it);
+ realPath += *jt;
+ realPath += path;
+ realPath += ".";
+ realPath += *kt;
+
+ FILE* file = fopen(realPath.c_str(), mode.c_str());
+ if (file)
+ {
+ path = realPath;
+ return file;
+ }
+ }
+ }
- // TODO this could be more portable
- if (access(fullPath.c_str(), R_OK) == 0)
+ // check path relative to search path
+ std::string realPath(*it);
+ realPath += path;
+
+ FILE* file = fopen(realPath.c_str(), mode.c_str());
+ if (file)
{
- return fullPath;
+ path = realPath;
+ return file;
}
}
- // empty string
- return std::string();
+ // last ditch effort; maybe it's already a path to a valid resource
+ return fopen(path.c_str(), mode.c_str());
}
} // namespace Mf
-/** vim: set ts=4 sw=4 tw=80: *************************************************/
-
projects / chaz / yoink / blobdiff