2011-02-23 10:52:22 +00:00
|
|
|
/*
|
2007-12-20 10:27:13 +00:00
|
|
|
* 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
|
2008-01-07 19:13:47 +00:00
|
|
|
* of the License, or (at your option) any later version.
|
2007-12-20 10:27:13 +00:00
|
|
|
*
|
|
|
|
|
* 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,
|
2010-02-12 13:34:04 +00:00
|
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
2007-12-20 10:27:13 +00:00
|
|
|
*/
|
|
|
|
|
|
2019-02-18 08:08:12 +11:00
|
|
|
/** \file
|
|
|
|
|
* \ingroup bli
|
2011-02-27 20:37:56 +00:00
|
|
|
*/
|
|
|
|
|
|
2011-10-27 03:40:12 +00:00
|
|
|
/* TODO,
|
2012-03-18 07:38:51 +00:00
|
|
|
* currently there are some cases we don't support.
|
2011-10-27 03:40:12 +00:00
|
|
|
* - passing output paths to the visitor?, like render out.
|
|
|
|
|
* - passing sequence strips with many images.
|
2012-03-18 07:38:51 +00:00
|
|
|
* - passing directory paths - visitors don't know which path is a dir or a file.
|
2011-10-27 03:40:12 +00:00
|
|
|
* */
|
2011-02-27 20:37:56 +00:00
|
|
|
|
2009-09-06 13:20:05 +00:00
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
2010-12-05 23:14:48 +00:00
|
|
|
#include <assert.h>
|
2009-09-06 13:20:05 +00:00
|
|
|
|
2012-03-12 23:56:11 +00:00
|
|
|
/* path/file handling stuff */
|
2009-09-06 13:20:05 +00:00
|
|
|
#ifndef WIN32
|
2012-03-11 23:47:41 +00:00
|
|
|
# include <dirent.h>
|
|
|
|
|
# include <unistd.h>
|
2009-09-06 13:20:05 +00:00
|
|
|
#else
|
2012-03-11 23:47:41 +00:00
|
|
|
# include <io.h>
|
|
|
|
|
# include "BLI_winstuff.h"
|
2009-09-06 13:20:05 +00:00
|
|
|
#endif
|
|
|
|
|
|
2008-12-15 05:21:44 +00:00
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
|
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "DNA_brush_types.h"
|
Basic Alembic support
All in all, this patch adds an Alembic importer, an Alembic exporter,
and a new CacheFile data block which, for now, wraps around an Alembic
archive. This data block is made available through a new modifier ("Mesh
Sequence Cache") as well as a new constraint ("Transform Cache") to
somewhat properly support respectively geometric and transformation data
streaming from alembic caches.
A more in-depth documentation is to be found on the wiki, as well as a
guide to compile alembic: https://wiki.blender.org/index.php/
User:Kevindietrich/AlembicBasicIo.
Many thanks to everyone involved in this little project, and huge shout
out to "cgstrive" for the thorough testings with Maya, 3ds Max, Houdini
and Realflow as well as @fjuhec, @jensverwiebe and @jasperge for the
custom builds and compile fixes.
Reviewers: sergey, campbellbarton, mont29
Reviewed By: sergey, campbellbarton, mont29
Differential Revision: https://developer.blender.org/D2060
2016-08-06 06:20:37 +02:00
|
|
|
#include "DNA_cachefile_types.h"
|
2010-08-04 04:01:27 +00:00
|
|
|
#include "DNA_image_types.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "DNA_mesh_types.h"
|
|
|
|
|
#include "DNA_modifier_types.h"
|
2011-12-04 17:16:22 +00:00
|
|
|
#include "DNA_movieclip_types.h"
|
2018-02-07 11:14:08 +11:00
|
|
|
#include "DNA_object_fluidsim_types.h"
|
|
|
|
|
#include "DNA_object_force_types.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "DNA_object_types.h"
|
|
|
|
|
#include "DNA_particle_types.h"
|
2008-04-25 16:09:16 +00:00
|
|
|
#include "DNA_sequence_types.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "DNA_sound_types.h"
|
|
|
|
|
#include "DNA_text_types.h"
|
2012-11-27 16:19:52 +00:00
|
|
|
#include "DNA_material_types.h"
|
|
|
|
|
#include "DNA_node_types.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "DNA_texture_types.h"
|
2010-01-28 18:20:28 +00:00
|
|
|
#include "DNA_vfont_types.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "DNA_scene_types.h"
|
|
|
|
|
#include "DNA_smoke_types.h"
|
2013-03-23 03:00:37 +00:00
|
|
|
#include "DNA_freestyle_types.h"
|
2007-12-20 10:27:13 +00:00
|
|
|
|
2008-12-15 05:21:44 +00:00
|
|
|
#include "BLI_blenlib.h"
|
2011-01-07 18:36:47 +00:00
|
|
|
#include "BLI_utildefines.h"
|
2007-12-20 10:27:13 +00:00
|
|
|
|
2012-08-03 22:12:57 +00:00
|
|
|
#include "BKE_font.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "BKE_library.h"
|
2010-12-06 00:52:30 +00:00
|
|
|
#include "BKE_main.h"
|
2012-11-27 16:19:52 +00:00
|
|
|
#include "BKE_node.h"
|
2010-01-11 10:48:41 +00:00
|
|
|
#include "BKE_report.h"
|
2011-10-27 03:40:12 +00:00
|
|
|
#include "BKE_sequencer.h"
|
2013-09-02 14:23:42 +00:00
|
|
|
#include "BKE_image.h"
|
2008-04-25 16:09:16 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
#include "BKE_bpath.h" /* own include */
|
2012-12-15 15:59:25 +00:00
|
|
|
|
2019-02-01 12:44:19 +11:00
|
|
|
#include "CLG_log.h"
|
|
|
|
|
|
2015-04-11 00:42:35 +10:00
|
|
|
#ifndef _MSC_VER
|
|
|
|
|
# include "BLI_strict_flags.h"
|
|
|
|
|
#endif
|
2015-04-10 22:01:10 +10:00
|
|
|
|
2019-02-01 12:44:19 +11:00
|
|
|
static CLG_LogRef LOG = {"bke.bpath"};
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
static bool checkMissingFiles_visit_cb(void *userdata,
|
|
|
|
|
char *UNUSED(path_dst),
|
|
|
|
|
const char *path_src)
|
2011-05-19 13:50:53 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
ReportList *reports = (ReportList *)userdata;
|
2010-12-05 23:14:48 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
if (!BLI_exists(path_src)) {
|
|
|
|
|
BKE_reportf(reports, RPT_WARNING, "Path '%s' not found", path_src);
|
|
|
|
|
}
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
return false;
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2011-10-27 01:25:07 +00:00
|
|
|
/* high level function */
|
2012-12-15 15:31:50 +00:00
|
|
|
void BKE_bpath_missing_files_check(Main *bmain, ReportList *reports)
|
2011-01-18 00:10:11 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_bpath_traverse_main(bmain,
|
|
|
|
|
checkMissingFiles_visit_cb,
|
|
|
|
|
BKE_BPATH_TRAVERSE_ABS | BKE_BPATH_TRAVERSE_SKIP_PACKED,
|
|
|
|
|
reports);
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
|
|
|
|
|
2012-03-11 23:47:41 +00:00
|
|
|
typedef struct BPathRemap_Data {
|
2019-04-17 06:17:24 +02:00
|
|
|
const char *basedir;
|
|
|
|
|
ReportList *reports;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
int count_tot;
|
|
|
|
|
int count_changed;
|
|
|
|
|
int count_failed;
|
2011-10-27 01:25:07 +00:00
|
|
|
} BPathRemap_Data;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2014-08-06 02:48:37 +10:00
|
|
|
static bool bpath_relative_convert_visit_cb(void *userdata, char *path_dst, const char *path_src)
|
2009-01-28 22:36:34 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
BPathRemap_Data *data = (BPathRemap_Data *)userdata;
|
|
|
|
|
|
|
|
|
|
data->count_tot++;
|
|
|
|
|
|
|
|
|
|
if (BLI_path_is_rel(path_src)) {
|
|
|
|
|
return false; /* already relative */
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
strcpy(path_dst, path_src);
|
|
|
|
|
BLI_path_rel(path_dst, data->basedir);
|
|
|
|
|
if (BLI_path_is_rel(path_dst)) {
|
|
|
|
|
data->count_changed++;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
BKE_reportf(data->reports, RPT_WARNING, "Path '%s' cannot be made relative", path_src);
|
|
|
|
|
data->count_failed++;
|
|
|
|
|
}
|
|
|
|
|
return true;
|
|
|
|
|
}
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
|
|
|
|
|
2012-12-15 15:31:50 +00:00
|
|
|
void BKE_bpath_relative_convert(Main *bmain, const char *basedir, ReportList *reports)
|
2007-12-20 10:27:13 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
BPathRemap_Data data = {NULL};
|
|
|
|
|
const int flag = BKE_BPATH_TRAVERSE_SKIP_LIBRARY;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
if (basedir[0] == '\0') {
|
|
|
|
|
CLOG_ERROR(&LOG, "basedir='', this is a bug");
|
|
|
|
|
return;
|
|
|
|
|
}
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
data.basedir = basedir;
|
|
|
|
|
data.reports = reports;
|
2010-01-08 17:50:55 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_bpath_traverse_main(bmain, bpath_relative_convert_visit_cb, flag, (void *)&data);
|
2010-01-08 17:50:55 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_reportf(reports,
|
|
|
|
|
data.count_failed ? RPT_WARNING : RPT_INFO,
|
|
|
|
|
"Total files %d | Changed %d | Failed %d",
|
|
|
|
|
data.count_tot,
|
|
|
|
|
data.count_changed,
|
|
|
|
|
data.count_failed);
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
|
|
|
|
|
2014-08-06 02:48:37 +10:00
|
|
|
static bool bpath_absolute_convert_visit_cb(void *userdata, char *path_dst, const char *path_src)
|
2011-09-28 05:53:40 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
BPathRemap_Data *data = (BPathRemap_Data *)userdata;
|
|
|
|
|
|
|
|
|
|
data->count_tot++;
|
|
|
|
|
|
|
|
|
|
if (BLI_path_is_rel(path_src) == false) {
|
|
|
|
|
return false; /* already absolute */
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
strcpy(path_dst, path_src);
|
|
|
|
|
BLI_path_abs(path_dst, data->basedir);
|
|
|
|
|
if (BLI_path_is_rel(path_dst) == false) {
|
|
|
|
|
data->count_changed++;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
BKE_reportf(data->reports, RPT_WARNING, "Path '%s' cannot be made absolute", path_src);
|
|
|
|
|
data->count_failed++;
|
|
|
|
|
}
|
|
|
|
|
return true;
|
|
|
|
|
}
|
2007-12-24 17:07:52 +00:00
|
|
|
}
|
|
|
|
|
|
2012-12-15 15:31:50 +00:00
|
|
|
/* similar to BKE_bpath_relative_convert - keep in sync! */
|
|
|
|
|
void BKE_bpath_absolute_convert(Main *bmain, const char *basedir, ReportList *reports)
|
2010-01-08 17:50:55 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
BPathRemap_Data data = {NULL};
|
|
|
|
|
const int flag = BKE_BPATH_TRAVERSE_SKIP_LIBRARY;
|
2011-05-18 05:21:44 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
if (basedir[0] == '\0') {
|
|
|
|
|
CLOG_ERROR(&LOG, "basedir='', this is a bug");
|
|
|
|
|
return;
|
|
|
|
|
}
|
2011-05-18 05:21:44 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
data.basedir = basedir;
|
|
|
|
|
data.reports = reports;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_bpath_traverse_main(bmain, bpath_absolute_convert_visit_cb, flag, (void *)&data);
|
2010-01-08 17:50:55 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_reportf(reports,
|
|
|
|
|
data.count_failed ? RPT_WARNING : RPT_INFO,
|
|
|
|
|
"Total files %d | Changed %d | Failed %d",
|
|
|
|
|
data.count_tot,
|
|
|
|
|
data.count_changed,
|
|
|
|
|
data.count_failed);
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
|
|
|
|
|
2012-07-30 16:42:26 +00:00
|
|
|
/**
|
|
|
|
|
* find this file recursively, use the biggest file so thumbnails don't get used by mistake
|
2012-10-20 20:36:51 +00:00
|
|
|
* \param filename_new: the path will be copied here, caller must initialize as empty string.
|
2012-07-30 16:42:26 +00:00
|
|
|
* \param dirname: subdir to search
|
|
|
|
|
* \param filename: set this filename
|
|
|
|
|
* \param filesize: filesize for the file
|
2012-01-31 18:00:41 +00:00
|
|
|
*
|
2012-07-30 16:42:26 +00:00
|
|
|
* \returns found: 1/0.
|
2012-01-31 18:00:41 +00:00
|
|
|
*/
|
2007-12-20 10:27:13 +00:00
|
|
|
#define MAX_RECUR 16
|
2019-04-17 06:17:24 +02:00
|
|
|
static bool missing_files_find__recursive(char *filename_new,
|
|
|
|
|
const char *dirname,
|
|
|
|
|
const char *filename,
|
|
|
|
|
int64_t *r_filesize,
|
|
|
|
|
int *r_recur_depth)
|
2007-12-20 10:27:13 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
/* file searching stuff */
|
|
|
|
|
DIR *dir;
|
|
|
|
|
struct dirent *de;
|
|
|
|
|
BLI_stat_t status;
|
|
|
|
|
char path[FILE_MAX];
|
|
|
|
|
int64_t size;
|
|
|
|
|
bool found = false;
|
|
|
|
|
|
|
|
|
|
dir = opendir(dirname);
|
|
|
|
|
|
2019-04-22 09:39:35 +10:00
|
|
|
if (dir == NULL) {
|
2019-04-17 06:17:24 +02:00
|
|
|
return found;
|
2019-04-22 09:39:35 +10:00
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
2019-04-22 09:39:35 +10:00
|
|
|
if (*r_filesize == -1) {
|
2019-04-17 06:17:24 +02:00
|
|
|
*r_filesize = 0; /* dir opened fine */
|
2019-04-22 09:39:35 +10:00
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
|
|
|
|
while ((de = readdir(dir)) != NULL) {
|
|
|
|
|
|
2019-04-22 09:39:35 +10:00
|
|
|
if (FILENAME_IS_CURRPAR(de->d_name)) {
|
2019-04-17 06:17:24 +02:00
|
|
|
continue;
|
2019-04-22 09:39:35 +10:00
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
|
|
|
|
BLI_join_dirfile(path, sizeof(path), dirname, de->d_name);
|
|
|
|
|
|
2019-04-22 09:39:35 +10:00
|
|
|
if (BLI_stat(path, &status) == -1) {
|
2019-04-17 06:17:24 +02:00
|
|
|
continue; /* cant stat, don't bother with this file, could print debug info here */
|
2019-04-22 09:39:35 +10:00
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
|
|
|
|
if (S_ISREG(status.st_mode)) { /* is file */
|
|
|
|
|
if (BLI_path_ncmp(filename, de->d_name, FILE_MAX) == 0) { /* name matches */
|
|
|
|
|
/* open the file to read its size */
|
|
|
|
|
size = status.st_size;
|
|
|
|
|
if ((size > 0) && (size > *r_filesize)) { /* find the biggest file */
|
|
|
|
|
*r_filesize = size;
|
|
|
|
|
BLI_strncpy(filename_new, path, FILE_MAX);
|
|
|
|
|
found = true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else if (S_ISDIR(status.st_mode)) { /* is subdir */
|
|
|
|
|
if (*r_recur_depth <= MAX_RECUR) {
|
|
|
|
|
(*r_recur_depth)++;
|
|
|
|
|
found |= missing_files_find__recursive(
|
|
|
|
|
filename_new, path, filename, r_filesize, r_recur_depth);
|
|
|
|
|
(*r_recur_depth)--;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
closedir(dir);
|
|
|
|
|
return found;
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
|
|
|
|
|
2012-03-11 23:47:41 +00:00
|
|
|
typedef struct BPathFind_Data {
|
2019-04-17 06:17:24 +02:00
|
|
|
const char *basedir;
|
|
|
|
|
const char *searchdir;
|
|
|
|
|
ReportList *reports;
|
|
|
|
|
bool find_all;
|
2011-10-27 01:25:07 +00:00
|
|
|
} BPathFind_Data;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2015-04-10 22:01:10 +10:00
|
|
|
static bool missing_files_find__visit_cb(void *userdata, char *path_dst, const char *path_src)
|
2011-10-27 01:25:07 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
BPathFind_Data *data = (BPathFind_Data *)userdata;
|
|
|
|
|
char filename_new[FILE_MAX];
|
|
|
|
|
|
|
|
|
|
int64_t filesize = -1;
|
|
|
|
|
int recur_depth = 0;
|
|
|
|
|
bool found;
|
|
|
|
|
|
|
|
|
|
if (data->find_all == false) {
|
|
|
|
|
if (BLI_exists(path_src)) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
filename_new[0] = '\0';
|
|
|
|
|
|
|
|
|
|
found = missing_files_find__recursive(
|
|
|
|
|
filename_new, data->searchdir, BLI_path_basename(path_src), &filesize, &recur_depth);
|
|
|
|
|
|
|
|
|
|
if (filesize == -1) { /* could not open dir */
|
|
|
|
|
BKE_reportf(data->reports,
|
|
|
|
|
RPT_WARNING,
|
|
|
|
|
"Could not open directory '%s'",
|
|
|
|
|
BLI_path_basename(data->searchdir));
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
else if (found == false) {
|
|
|
|
|
BKE_reportf(data->reports,
|
|
|
|
|
RPT_WARNING,
|
|
|
|
|
"Could not find '%s' in '%s'",
|
|
|
|
|
BLI_path_basename(path_src),
|
|
|
|
|
data->searchdir);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
bool was_relative = BLI_path_is_rel(path_dst);
|
|
|
|
|
|
|
|
|
|
BLI_strncpy(path_dst, filename_new, FILE_MAX);
|
|
|
|
|
|
|
|
|
|
/* keep path relative if the previous one was relative */
|
2019-04-22 09:39:35 +10:00
|
|
|
if (was_relative) {
|
2019-04-17 06:17:24 +02:00
|
|
|
BLI_path_rel(path_dst, data->basedir);
|
2019-04-22 09:39:35 +10:00
|
|
|
}
|
2019-04-17 06:17:24 +02:00
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
2011-10-27 01:25:07 +00:00
|
|
|
}
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
void BKE_bpath_missing_files_find(Main *bmain,
|
|
|
|
|
const char *searchpath,
|
|
|
|
|
ReportList *reports,
|
2013-06-24 02:57:06 +00:00
|
|
|
const bool find_all)
|
2011-10-27 01:25:07 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
struct BPathFind_Data data = {NULL};
|
|
|
|
|
const int flag = BKE_BPATH_TRAVERSE_ABS | BKE_BPATH_TRAVERSE_RELOAD_EDITED;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
data.basedir = BKE_main_blendfile_path(bmain);
|
|
|
|
|
data.reports = reports;
|
|
|
|
|
data.searchdir = searchpath;
|
|
|
|
|
data.find_all = find_all;
|
2011-05-19 13:50:53 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_bpath_traverse_main(bmain, missing_files_find__visit_cb, flag, (void *)&data);
|
2007-12-20 10:27:13 +00:00
|
|
|
}
|
2011-10-23 17:52:20 +00:00
|
|
|
|
|
|
|
|
/* Run a visitor on a string, replacing the contents of the string as needed. */
|
2019-04-17 06:17:24 +02:00
|
|
|
static bool rewrite_path_fixed(char *path,
|
|
|
|
|
BPathVisitor visit_cb,
|
|
|
|
|
const char *absbase,
|
|
|
|
|
void *userdata)
|
2011-10-26 21:22:35 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
char path_src_buf[FILE_MAX];
|
|
|
|
|
const char *path_src;
|
|
|
|
|
char path_dst[FILE_MAX];
|
|
|
|
|
|
|
|
|
|
if (absbase) {
|
|
|
|
|
BLI_strncpy(path_src_buf, path, sizeof(path_src_buf));
|
|
|
|
|
BLI_path_abs(path_src_buf, absbase);
|
|
|
|
|
path_src = path_src_buf;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
path_src = path;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* so functions can check old value */
|
|
|
|
|
BLI_strncpy(path_dst, path, FILE_MAX);
|
|
|
|
|
|
|
|
|
|
if (visit_cb(userdata, path_dst, path_src)) {
|
|
|
|
|
BLI_strncpy(path, path_dst, FILE_MAX);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
2011-10-26 22:46:06 +00:00
|
|
|
}
|
|
|
|
|
|
2013-06-24 03:06:32 +00:00
|
|
|
static bool rewrite_path_fixed_dirfile(char path_dir[FILE_MAXDIR],
|
|
|
|
|
char path_file[FILE_MAXFILE],
|
|
|
|
|
BPathVisitor visit_cb,
|
|
|
|
|
const char *absbase,
|
|
|
|
|
void *userdata)
|
2011-10-26 22:46:06 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
char path_src[FILE_MAX];
|
|
|
|
|
char path_dst[FILE_MAX];
|
2011-10-26 22:46:06 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BLI_join_dirfile(path_src, sizeof(path_src), path_dir, path_file);
|
2011-10-26 22:46:06 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
/* so functions can check old value */
|
|
|
|
|
BLI_strncpy(path_dst, path_src, FILE_MAX);
|
2015-05-06 02:22:00 +10:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
if (absbase) {
|
|
|
|
|
BLI_path_abs(path_src, absbase);
|
|
|
|
|
}
|
2011-10-27 01:25:07 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
if (visit_cb(userdata, path_dst, (const char *)path_src)) {
|
|
|
|
|
BLI_split_dirfile(path_dst, path_dir, path_file, FILE_MAXDIR, FILE_MAXFILE);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
2011-10-26 22:46:06 +00:00
|
|
|
}
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
static bool rewrite_path_alloc(char **path,
|
|
|
|
|
BPathVisitor visit_cb,
|
|
|
|
|
const char *absbase,
|
|
|
|
|
void *userdata)
|
2011-10-26 22:46:06 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
char path_src_buf[FILE_MAX];
|
|
|
|
|
const char *path_src;
|
|
|
|
|
char path_dst[FILE_MAX];
|
|
|
|
|
|
|
|
|
|
if (absbase) {
|
|
|
|
|
BLI_strncpy(path_src_buf, *path, sizeof(path_src_buf));
|
|
|
|
|
BLI_path_abs(path_src_buf, absbase);
|
|
|
|
|
path_src = path_src_buf;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
path_src = *path;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (visit_cb(userdata, path_dst, path_src)) {
|
|
|
|
|
MEM_freeN(*path);
|
|
|
|
|
(*path) = BLI_strdup(path_dst);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
2011-10-23 17:52:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Run visitor function 'visit' on all paths contained in 'id'. */
|
2019-04-17 06:17:24 +02:00
|
|
|
void BKE_bpath_traverse_id(
|
|
|
|
|
Main *bmain, ID *id, BPathVisitor visit_cb, const int flag, void *bpath_user_data)
|
2011-10-26 21:22:35 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
const char *absbase = (flag & BKE_BPATH_TRAVERSE_ABS) ? ID_BLEND_PATH(bmain, id) : NULL;
|
|
|
|
|
|
|
|
|
|
if ((flag & BKE_BPATH_TRAVERSE_SKIP_LIBRARY) && ID_IS_LINKED(id)) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (GS(id->name)) {
|
|
|
|
|
case ID_IM: {
|
|
|
|
|
Image *ima;
|
|
|
|
|
ima = (Image *)id;
|
|
|
|
|
if (BKE_image_has_packedfile(ima) == false || (flag & BKE_BPATH_TRAVERSE_SKIP_PACKED) == 0) {
|
2018-03-04 22:45:22 +01:00
|
|
|
/* Skip empty file paths, these are typically from generated images and
|
|
|
|
|
* don't make sense to add directories to until the image has been saved
|
|
|
|
|
* once to give it a meaningful value. */
|
Add support for tiled images and the UDIM naming scheme
This patch contains the work that I did during my week at the Code Quest - adding support for tiled images to Blender.
With this patch, images now contain a list of tiles. By default, this just contains one tile, but if the source type is set to Tiled, the user can add additional tiles. When acquiring an ImBuf, the tile to be loaded is specified in the ImageUser.
Therefore, code that is not yet aware of tiles will just access the default tile as usual.
The filenames of the additional tiles are derived from the original filename according to the UDIM naming scheme - the filename contains an index that is calculated as (1001 + 10*<y coordinate of the tile> + <x coordinate of the tile>), where the x coordinate never goes above 9.
Internally, the various tiles are stored in a cache just like sequences. When acquired for the first time, the code will try to load the corresponding file from disk. Alternatively, a new operator can be used to initialize the tile similar to the New Image operator.
The following features are supported so far:
- Automatic detection and loading of all tiles when opening the first tile (1001)
- Saving all tiles
- Adding and removing tiles
- Filling tiles with generated images
- Drawing all tiles in the Image Editor
- Viewing a tiled grid even if no image is selected
- Rendering tiled images in Eevee
- Rendering tiled images in Cycles (in SVM mode)
- Automatically skipping loading of unused tiles in Cycles
- 2D texture painting (also across tiles)
- 3D texture painting (also across tiles, only limitation: individual faces can not cross tile borders)
- Assigning custom labels to individual tiles (drawn in the Image Editor instead of the ID)
- Different resolutions between tiles
There still are some missing features that will be added later (see T72390):
- Workbench engine support
- Packing/Unpacking support
- Baking support
- Cycles OSL support
- many other Blender features that rely on images
Thanks to Brecht for the review and to all who tested the intermediate versions!
Differential Revision: https://developer.blender.org/D3509
2019-12-12 16:06:08 +01:00
|
|
|
if (ELEM(ima->source, IMA_SRC_FILE, IMA_SRC_MOVIE, IMA_SRC_SEQUENCE, IMA_SRC_TILED) &&
|
|
|
|
|
ima->name[0]) {
|
2019-04-17 06:17:24 +02:00
|
|
|
if (rewrite_path_fixed(ima->name, visit_cb, absbase, bpath_user_data)) {
|
|
|
|
|
if (flag & BKE_BPATH_TRAVERSE_RELOAD_EDITED) {
|
|
|
|
|
if (!BKE_image_has_packedfile(ima) &&
|
|
|
|
|
/* image may have been painted onto (and not saved, T44543) */
|
|
|
|
|
!BKE_image_is_dirty(ima)) {
|
|
|
|
|
BKE_image_signal(bmain, ima, NULL, IMA_SIGNAL_RELOAD);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_BR: {
|
|
|
|
|
Brush *brush = (Brush *)id;
|
|
|
|
|
if (brush->icon_filepath[0]) {
|
|
|
|
|
rewrite_path_fixed(brush->icon_filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_OB: {
|
|
|
|
|
Object *ob = (Object *)id;
|
|
|
|
|
ModifierData *md;
|
|
|
|
|
ParticleSystem *psys;
|
|
|
|
|
|
|
|
|
|
#define BPATH_TRAVERSE_POINTCACHE(ptcaches) \
|
|
|
|
|
{ \
|
|
|
|
|
PointCache *cache; \
|
|
|
|
|
for (cache = (ptcaches).first; cache; cache = cache->next) { \
|
|
|
|
|
if (cache->flag & PTCACHE_DISK_CACHE) { \
|
|
|
|
|
rewrite_path_fixed(cache->path, visit_cb, absbase, bpath_user_data); \
|
|
|
|
|
} \
|
|
|
|
|
} \
|
|
|
|
|
} \
|
|
|
|
|
(void)0
|
|
|
|
|
|
|
|
|
|
for (md = ob->modifiers.first; md; md = md->next) {
|
|
|
|
|
if (md->type == eModifierType_Fluidsim) {
|
|
|
|
|
FluidsimModifierData *fluidmd = (FluidsimModifierData *)md;
|
|
|
|
|
if (fluidmd->fss) {
|
|
|
|
|
rewrite_path_fixed(fluidmd->fss->surfdataPath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else if (md->type == eModifierType_Smoke) {
|
|
|
|
|
SmokeModifierData *smd = (SmokeModifierData *)md;
|
|
|
|
|
if (smd->type & MOD_SMOKE_TYPE_DOMAIN) {
|
|
|
|
|
BPATH_TRAVERSE_POINTCACHE(smd->domain->ptcaches[0]);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else if (md->type == eModifierType_Cloth) {
|
|
|
|
|
ClothModifierData *clmd = (ClothModifierData *)md;
|
|
|
|
|
BPATH_TRAVERSE_POINTCACHE(clmd->ptcaches);
|
|
|
|
|
}
|
|
|
|
|
else if (md->type == eModifierType_Ocean) {
|
|
|
|
|
OceanModifierData *omd = (OceanModifierData *)md;
|
|
|
|
|
rewrite_path_fixed(omd->cachepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
else if (md->type == eModifierType_MeshCache) {
|
|
|
|
|
MeshCacheModifierData *mcmd = (MeshCacheModifierData *)md;
|
|
|
|
|
rewrite_path_fixed(mcmd->filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (ob->soft) {
|
|
|
|
|
BPATH_TRAVERSE_POINTCACHE(ob->soft->shared->ptcaches);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (psys = ob->particlesystem.first; psys; psys = psys->next) {
|
|
|
|
|
BPATH_TRAVERSE_POINTCACHE(psys->ptcaches);
|
|
|
|
|
}
|
2012-11-27 16:19:52 +00:00
|
|
|
|
2011-10-27 03:40:12 +00:00
|
|
|
#undef BPATH_TRAVERSE_POINTCACHE
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_SO: {
|
|
|
|
|
bSound *sound = (bSound *)id;
|
|
|
|
|
if (sound->packedfile == NULL || (flag & BKE_BPATH_TRAVERSE_SKIP_PACKED) == 0) {
|
|
|
|
|
rewrite_path_fixed(sound->name, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_TXT:
|
|
|
|
|
if (((Text *)id)->name) {
|
|
|
|
|
rewrite_path_alloc(&((Text *)id)->name, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
case ID_VF: {
|
|
|
|
|
VFont *vfont = (VFont *)id;
|
|
|
|
|
if (vfont->packedfile == NULL || (flag & BKE_BPATH_TRAVERSE_SKIP_PACKED) == 0) {
|
|
|
|
|
if (BKE_vfont_is_builtin(vfont) == false) {
|
|
|
|
|
rewrite_path_fixed(((VFont *)id)->name, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_MA: {
|
|
|
|
|
Material *ma = (Material *)id;
|
|
|
|
|
bNodeTree *ntree = ma->nodetree;
|
|
|
|
|
|
|
|
|
|
if (ntree) {
|
|
|
|
|
bNode *node;
|
|
|
|
|
|
|
|
|
|
for (node = ntree->nodes.first; node; node = node->next) {
|
|
|
|
|
if (node->type == SH_NODE_SCRIPT) {
|
|
|
|
|
NodeShaderScript *nss = (NodeShaderScript *)node->storage;
|
|
|
|
|
rewrite_path_fixed(nss->filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
else if (node->type == SH_NODE_TEX_IES) {
|
|
|
|
|
NodeShaderTexIES *ies = (NodeShaderTexIES *)node->storage;
|
|
|
|
|
rewrite_path_fixed(ies->filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_NT: {
|
|
|
|
|
bNodeTree *ntree = (bNodeTree *)id;
|
|
|
|
|
bNode *node;
|
|
|
|
|
|
|
|
|
|
if (ntree->type == NTREE_SHADER) {
|
|
|
|
|
/* same as lines above */
|
|
|
|
|
for (node = ntree->nodes.first; node; node = node->next) {
|
|
|
|
|
if (node->type == SH_NODE_SCRIPT) {
|
|
|
|
|
NodeShaderScript *nss = (NodeShaderScript *)node->storage;
|
|
|
|
|
rewrite_path_fixed(nss->filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
else if (node->type == SH_NODE_TEX_IES) {
|
|
|
|
|
NodeShaderTexIES *ies = (NodeShaderTexIES *)node->storage;
|
|
|
|
|
rewrite_path_fixed(ies->filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_SCE: {
|
|
|
|
|
Scene *scene = (Scene *)id;
|
|
|
|
|
if (scene->ed) {
|
|
|
|
|
Sequence *seq;
|
|
|
|
|
|
|
|
|
|
SEQ_BEGIN (scene->ed, seq) {
|
|
|
|
|
if (SEQ_HAS_PATH(seq)) {
|
|
|
|
|
StripElem *se = seq->strip->stripdata;
|
|
|
|
|
|
|
|
|
|
if (ELEM(seq->type, SEQ_TYPE_MOVIE, SEQ_TYPE_SOUND_RAM) && se) {
|
|
|
|
|
rewrite_path_fixed_dirfile(
|
|
|
|
|
seq->strip->dir, se->name, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
else if ((seq->type == SEQ_TYPE_IMAGE) && se) {
|
|
|
|
|
/* might want an option not to loop over all strips */
|
|
|
|
|
unsigned int len = (unsigned int)MEM_allocN_len(se) / (unsigned int)sizeof(*se);
|
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
|
|
if (flag & BKE_BPATH_TRAVERSE_SKIP_MULTIFILE) {
|
|
|
|
|
/* only operate on one path */
|
|
|
|
|
len = MIN2(1u, len);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < len; i++, se++) {
|
|
|
|
|
rewrite_path_fixed_dirfile(
|
|
|
|
|
seq->strip->dir, se->name, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
/* simple case */
|
|
|
|
|
rewrite_path_fixed(seq->strip->dir, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
SEQ_END;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_ME: {
|
|
|
|
|
Mesh *me = (Mesh *)id;
|
|
|
|
|
if (me->ldata.external) {
|
|
|
|
|
rewrite_path_fixed(me->ldata.external->filename, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_LI: {
|
|
|
|
|
Library *lib = (Library *)id;
|
|
|
|
|
/* keep packedfile paths always relative to the blend */
|
|
|
|
|
if (lib->packedfile == NULL) {
|
|
|
|
|
if (rewrite_path_fixed(lib->name, visit_cb, absbase, bpath_user_data)) {
|
|
|
|
|
BKE_library_filepath_set(bmain, lib, lib->name);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_MC: {
|
|
|
|
|
MovieClip *clip = (MovieClip *)id;
|
|
|
|
|
rewrite_path_fixed(clip->name, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case ID_CF: {
|
|
|
|
|
CacheFile *cache_file = (CacheFile *)id;
|
|
|
|
|
rewrite_path_fixed(cache_file->filepath, visit_cb, absbase, bpath_user_data);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
/* Nothing to do for other IDs that don't contain file paths. */
|
|
|
|
|
break;
|
|
|
|
|
}
|
2011-10-23 17:52:20 +00:00
|
|
|
}
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
void BKE_bpath_traverse_id_list(
|
|
|
|
|
Main *bmain, ListBase *lb, BPathVisitor visit_cb, const int flag, void *bpath_user_data)
|
2011-10-27 01:25:07 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
ID *id;
|
|
|
|
|
for (id = lb->first; id; id = id->next) {
|
|
|
|
|
BKE_bpath_traverse_id(bmain, id, visit_cb, flag, bpath_user_data);
|
|
|
|
|
}
|
2011-10-27 01:25:07 +00:00
|
|
|
}
|
|
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
void BKE_bpath_traverse_main(Main *bmain,
|
|
|
|
|
BPathVisitor visit_cb,
|
|
|
|
|
const int flag,
|
|
|
|
|
void *bpath_user_data)
|
2011-10-27 01:25:07 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
ListBase *lbarray[MAX_LIBARRAY];
|
|
|
|
|
int a = set_listbasepointers(bmain, lbarray);
|
|
|
|
|
while (a--) {
|
|
|
|
|
BKE_bpath_traverse_id_list(bmain, lbarray[a], visit_cb, flag, bpath_user_data);
|
|
|
|
|
}
|
2011-10-27 01:25:07 +00:00
|
|
|
}
|
|
|
|
|
|
2011-10-23 17:52:20 +00:00
|
|
|
/* Rewrites a relative path to be relative to the main file - unless the path is
|
2012-03-03 20:19:11 +00:00
|
|
|
* absolute, in which case it is not altered. */
|
2013-06-24 03:06:32 +00:00
|
|
|
bool BKE_bpath_relocate_visitor(void *pathbase_v, char *path_dst, const char *path_src)
|
2011-10-26 21:22:35 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
/* be sure there is low chance of the path being too short */
|
|
|
|
|
char filepath[(FILE_MAXDIR * 2) + FILE_MAXFILE];
|
|
|
|
|
const char *base_new = ((char **)pathbase_v)[0];
|
|
|
|
|
const char *base_old = ((char **)pathbase_v)[1];
|
|
|
|
|
|
|
|
|
|
if (BLI_path_is_rel(base_old)) {
|
|
|
|
|
CLOG_ERROR(&LOG, "old base path '%s' is not absolute.", base_old);
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Make referenced file absolute. This would be a side-effect of
|
|
|
|
|
* BLI_cleanup_file, but we do it explicitly so we know if it changed. */
|
|
|
|
|
BLI_strncpy(filepath, path_src, FILE_MAX);
|
|
|
|
|
if (BLI_path_abs(filepath, base_old)) {
|
|
|
|
|
/* Path was relative and is now absolute. Remap.
|
|
|
|
|
* Important BLI_cleanup_dir runs before the path is made relative
|
|
|
|
|
* because it wont work for paths that start with "//../" */
|
|
|
|
|
BLI_cleanup_file(base_new, filepath);
|
|
|
|
|
BLI_path_rel(filepath, base_new);
|
|
|
|
|
BLI_strncpy(path_dst, filepath, FILE_MAX);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
/* Path was not relative to begin with. */
|
|
|
|
|
return false;
|
|
|
|
|
}
|
2011-10-23 17:52:20 +00:00
|
|
|
}
|
2012-11-07 04:13:03 +00:00
|
|
|
|
|
|
|
|
/* -------------------------------------------------------------------- */
|
|
|
|
|
/**
|
|
|
|
|
* Backup/Restore/Free functions,
|
2014-06-09 11:01:51 +10:00
|
|
|
* \note These functions assume the data won't change order.
|
2012-11-07 04:13:03 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
struct PathStore {
|
2019-04-17 06:17:24 +02:00
|
|
|
struct PathStore *next, *prev;
|
2013-03-24 12:13:13 +00:00
|
|
|
};
|
2012-11-07 04:13:03 +00:00
|
|
|
|
2013-06-24 03:06:32 +00:00
|
|
|
static bool bpath_list_append(void *userdata, char *UNUSED(path_dst), const char *path_src)
|
2012-11-07 04:13:03 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
/* store the path and string in a single alloc */
|
|
|
|
|
ListBase *ls = userdata;
|
|
|
|
|
size_t path_size = strlen(path_src) + 1;
|
|
|
|
|
struct PathStore *path_store = MEM_mallocN(sizeof(struct PathStore) + path_size, __func__);
|
|
|
|
|
char *filepath = (char *)(path_store + 1);
|
|
|
|
|
|
|
|
|
|
memcpy(filepath, path_src, path_size);
|
|
|
|
|
BLI_addtail(ls, path_store);
|
|
|
|
|
return false;
|
2012-11-07 04:13:03 +00:00
|
|
|
}
|
|
|
|
|
|
2013-06-24 03:06:32 +00:00
|
|
|
static bool bpath_list_restore(void *userdata, char *path_dst, const char *path_src)
|
2012-11-07 04:13:03 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
/* assume ls->first wont be NULL because the number of paths can't change!
|
|
|
|
|
* (if they do caller is wrong) */
|
|
|
|
|
ListBase *ls = userdata;
|
|
|
|
|
struct PathStore *path_store = ls->first;
|
|
|
|
|
const char *filepath = (char *)(path_store + 1);
|
|
|
|
|
bool ret;
|
|
|
|
|
|
|
|
|
|
if (STREQ(path_src, filepath)) {
|
|
|
|
|
ret = false;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
BLI_strncpy(path_dst, filepath, FILE_MAX);
|
|
|
|
|
ret = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
BLI_freelinkN(ls, path_store);
|
|
|
|
|
return ret;
|
2012-11-07 04:13:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* return ls_handle */
|
2012-12-15 15:31:50 +00:00
|
|
|
void *BKE_bpath_list_backup(Main *bmain, const int flag)
|
2012-11-07 04:13:03 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
ListBase *ls = MEM_callocN(sizeof(ListBase), __func__);
|
2012-11-07 04:13:03 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_bpath_traverse_main(bmain, bpath_list_append, flag, ls);
|
2012-11-07 04:13:03 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
return ls;
|
2012-11-07 04:13:03 +00:00
|
|
|
}
|
|
|
|
|
|
2012-12-15 15:31:50 +00:00
|
|
|
void BKE_bpath_list_restore(Main *bmain, const int flag, void *ls_handle)
|
2012-11-07 04:13:03 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
ListBase *ls = ls_handle;
|
2012-11-07 04:13:03 +00:00
|
|
|
|
2019-04-17 06:17:24 +02:00
|
|
|
BKE_bpath_traverse_main(bmain, bpath_list_restore, flag, ls);
|
2012-11-07 04:13:03 +00:00
|
|
|
}
|
|
|
|
|
|
2012-12-15 15:31:50 +00:00
|
|
|
void BKE_bpath_list_free(void *ls_handle)
|
2012-11-07 04:13:03 +00:00
|
|
|
{
|
2019-04-17 06:17:24 +02:00
|
|
|
ListBase *ls = ls_handle;
|
|
|
|
|
BLI_assert(BLI_listbase_is_empty(ls)); /* assumes we were used */
|
|
|
|
|
BLI_freelistN(ls);
|
|
|
|
|
MEM_freeN(ls);
|
2012-11-07 04:13:03 +00:00
|
|
|
}
|