da376e0237
Cycles uses code from some great open source projects, many thanks them: * BVH building and traversal code from NVidia's "Understanding the Efficiency of Ray Traversal on GPUs": http://code.google.com/p/understanding-the-efficiency-of-ray-traversal-on-gpus/ * Open Shading Language for a large part of the shading system: http://code.google.com/p/openshadinglanguage/ * Blender for procedural textures and a few other nodes. * Approximate Catmull Clark subdivision from NVidia Mesh tools: http://code.google.com/p/nvidia-mesh-tools/ * Sobol direction vectors from: http://web.maths.unsw.edu.au/~fkuo/sobol/ * Film response functions from: http://www.cs.columbia.edu/CAVE/software/softlib/dorf.php
93 lines
2.0 KiB
C++
93 lines
2.0 KiB
C++
/*
|
|
* Copyright 2011, Blender Foundation.
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version 2
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#include <stdarg.h>
|
|
#include <stdio.h>
|
|
|
|
#include <boost/algorithm/string.hpp>
|
|
|
|
#include "util_foreach.h"
|
|
#include "util_string.h"
|
|
|
|
#ifdef _WIN32
|
|
#ifndef vsnprintf
|
|
#define vsnprintf _vsnprintf
|
|
#endif
|
|
#endif
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
string string_printf(const char *format, ...)
|
|
{
|
|
vector<char> str(128, 0);
|
|
|
|
while(1) {
|
|
va_list args;
|
|
int result;
|
|
|
|
va_start(args, format);
|
|
result = vsnprintf(&str[0], str.size(), format, args);
|
|
va_end(args);
|
|
|
|
if(result == -1) {
|
|
/* not enough space or formatting error */
|
|
if(str.size() > 65536) {
|
|
assert(0);
|
|
return string("");
|
|
}
|
|
|
|
str.resize(str.size()*2, 0);
|
|
continue;
|
|
}
|
|
else if(result >= (int)str.size()) {
|
|
/* not enough space */
|
|
str.resize(result + 1, 0);
|
|
continue;
|
|
}
|
|
|
|
return string(&str[0]);
|
|
}
|
|
}
|
|
|
|
bool string_iequals(const string& a, const string& b)
|
|
{
|
|
if(a.size() == b.size()) {
|
|
for(size_t i = 0; i < a.size(); i++)
|
|
if(toupper(a[i]) != toupper(b[i]))
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
void string_split(vector<string>& tokens, const string& str)
|
|
{
|
|
vector<string> split;
|
|
|
|
boost::split(split, str, boost::is_any_of("\t "), boost::token_compress_on);
|
|
|
|
foreach(const string& token, split)
|
|
if(token != "")
|
|
tokens.push_back(token);
|
|
}
|
|
|
|
CCL_NAMESPACE_END
|
|
|