source/blender/blenloader/intern/readfile.c

   1 /*
   2  * ***** BEGIN GPL LICENSE BLOCK *****
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public License
   6  * as published by the Free Software Foundation; either version 2
   7  * of the License, or (at your option) any later version.
   8  *
   9  * This program is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12  * GNU General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU General Public License
  15  * along with this program; if not, write to the Free Software Foundation,
  16  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  17  *
  18  * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
  19  * All rights reserved.
  20  *
  21  *
  22  * Contributor(s): Blender Foundation
  23  *
  24  * ***** END GPL LICENSE BLOCK *****
  25  *
  26  */
  27
  28 /** \file blender/blenloader/intern/readfile.c
  29  *  \ingroup blenloader
  30  */
  31
  32
  33 #include "zlib.h"
  34
  35 #include <limits.h>
  36 #include <stdio.h> // for printf fopen fwrite fclose sprintf FILE
  37 #include <stdlib.h> // for getenv atoi
  38 #include <stddef.h> // for offsetof
  39 #include <fcntl.h> // for open
  40 #include <string.h> // for strrchr strncmp strstr
  41 #include <math.h> // for fabs
  42 #include <stdarg.h> /* for va_start/end */
  43 #include <time.h> /* for gmtime */
  44 #include <ctype.h> /* for isdigit */
  45
  46 #include "BLI_utildefines.h"
  47 #ifndef WIN32
  48 #  include <unistd.h> // for read close
  49 #else
  50 #  include <io.h> // for open close read
  51 #  include "winsock2.h"
  52 #  include "BLI_winstuff.h"
  53 #endif
  54
  55 /* allow readfile to use deprecated functionality */
  56 #define DNA_DEPRECATED_ALLOW
  57
  58 #include "DNA_anim_types.h"
  59 #include "DNA_armature_types.h"
  60 #include "DNA_actuator_types.h"
  61 #include "DNA_brush_types.h"
  62 #include "DNA_camera_types.h"
  63 #include "DNA_cachefile_types.h"
  64 #include "DNA_cloth_types.h"
  65 #include "DNA_controller_types.h"
  66 #include "DNA_constraint_types.h"
  67 #include "DNA_dynamicpaint_types.h"
  68 #include "DNA_effect_types.h"
  69 #include "DNA_fileglobal_types.h"
  70 #include "DNA_genfile.h"
  71 #include "DNA_group_types.h"
  72 #include "DNA_gpencil_types.h"
  73 #include "DNA_ipo_types.h"
  74 #include "DNA_key_types.h"
  75 #include "DNA_lattice_types.h"
  76 #include "DNA_lamp_types.h"
  77 #include "DNA_linestyle_types.h"
  78 #include "DNA_meta_types.h"
  79 #include "DNA_material_types.h"
  80 #include "DNA_mesh_types.h"
  81 #include "DNA_meshdata_types.h"
  82 #include "DNA_nla_types.h"
  83 #include "DNA_node_types.h"
  84 #include "DNA_object_fluidsim_types.h"
  85 #include "DNA_object_types.h"
  86 #include "DNA_packedFile_types.h"
  87 #include "DNA_particle_types.h"
  88 #include "DNA_property_types.h"
  89 #include "DNA_rigidbody_types.h"
  90 #include "DNA_text_types.h"
  91 #include "DNA_view3d_types.h"
  92 #include "DNA_screen_types.h"
  93 #include "DNA_sensor_types.h"
  94 #include "DNA_sdna_types.h"
  95 #include "DNA_scene_types.h"
  96 #include "DNA_sequence_types.h"
  97 #include "DNA_smoke_types.h"
  98 #include "DNA_speaker_types.h"
  99 #include "DNA_sound_types.h"
 100 #include "DNA_space_types.h"
 101 #include "DNA_vfont_types.h"
 102 #include "DNA_world_types.h"
 103 #include "DNA_movieclip_types.h"
 104 #include "DNA_mask_types.h"
 105
 106 #include "MEM_guardedalloc.h"
 107
 108 #include "BLI_endian_switch.h"
 109 #include "BLI_blenlib.h"
 110 #include "BLI_math.h"
 111 #include "BLI_threads.h"
 112 #include "BLI_mempool.h"
 113
 114 #include "BLT_translation.h"
 115
 116 #include "BKE_action.h"
 117 #include "BKE_armature.h"
 118 #include "BKE_brush.h"
 119 #include "BKE_cachefile.h"
 120 #include "BKE_cloth.h"
 121 #include "BKE_constraint.h"
 122 #include "BKE_context.h"
 123 #include "BKE_curve.h"
 124 #include "BKE_depsgraph.h"
 125 #include "BKE_effect.h"
 126 #include "BKE_fcurve.h"
 127 #include "BKE_global.h" // for G
 128 #include "BKE_group.h"
 129 #include "BKE_library.h" // for which_libbase
 130 #include "BKE_library_idmap.h"
 131 #include "BKE_library_query.h"
 132 #include "BKE_idcode.h"
 133 #include "BKE_idprop.h"
 134 #include "BKE_material.h"
 135 #include "BKE_main.h" // for Main
 136 #include "BKE_mesh.h" // for ME_ defines (patching)
 137 #include "BKE_modifier.h"
 138 #include "BKE_multires.h"
 139 #include "BKE_node.h" // for tree type defines
 140 #include "BKE_object.h"
 141 #include "BKE_paint.h"
 142 #include "BKE_particle.h"
 143 #include "BKE_pointcache.h"
 144 #include "BKE_report.h"
 145 #include "BKE_sca.h" // for init_actuator
 146 #include "BKE_scene.h"
 147 #include "BKE_screen.h"
 148 #include "BKE_sequencer.h"
 149 #include "BKE_outliner_treehash.h"
 150 #include "BKE_sound.h"
 151 #include "BKE_colortools.h"
 152
 153 #include "NOD_common.h"
 154 #include "NOD_socket.h"
 155
 156 #include "BLO_readfile.h"
 157 #include "BLO_undofile.h"
 158 #include "BLO_blend_defs.h"
 159
 160 #include "RE_engine.h"
 161
 162 #include "readfile.h"
 163
 164
 165 #include <errno.h>
 166
 167 /**
 168  * READ
 169  * ====
 170  *
 171  * - Existing Library (#Main) push or free
 172  * - allocate new #Main
 173  * - load file
 174  * - read #SDNA
 175  * - for each LibBlock
 176  *   - read LibBlock
 177  *   - if a Library
 178  *     - make a new #Main
 179  *     - attach ID's to it
 180  *   - else
 181  *     - read associated 'direct data'
 182  *     - link direct data (internal and to LibBlock)
 183  * - read #FileGlobal
 184  * - read #USER data, only when indicated (file is ``~/X.XX/startup.blend``)
 185  * - free file
 186  * - per Library (per #Main)
 187  *   - read file
 188  *   - read #SDNA
 189  *   - find LibBlocks and attach #ID's to #Main
 190  *     - if external LibBlock
 191  *       - search all #Main's
 192  *         - or it's already read,
 193  *         - or not read yet
 194  *         - or make new #Main
 195  *   - per LibBlock
 196  *     - read recursive
 197  *     - read associated direct data
 198  *     - link direct data (internal and to LibBlock)
 199  *   - free file
 200  * - per Library with unread LibBlocks
 201  *   - read file
 202  *   - read #SDNA
 203  *   - per LibBlock
 204  *     - read recursive
 205  *     - read associated direct data
 206  *     - link direct data (internal and to LibBlock)
 207  *   - free file
 208  * - join all #Main's
 209  * - link all LibBlocks and indirect pointers to libblocks
 210  * - initialize #FileGlobal and copy pointers to #Global
 211  *
 212  * \note Still a weak point is the new-address function, that doesnt solve reading from
 213  * multiple files at the same time.
 214  * (added remark: oh, i thought that was solved? will look at that... (ton).
 215  */
 216
 217 /* use GHash for BHead name-based lookups (speeds up linking) */
 218 #define USE_GHASH_BHEAD
 219
 220 /* Use GHash for restoring pointers by name */
 221 #define USE_GHASH_RESTORE_POINTER
 222
 223 /* Define this to have verbose debug prints. */
 224 #define USE_DEBUG_PRINT
 225
 226 #ifdef USE_DEBUG_PRINT
 227 #  define DEBUG_PRINTF(...) printf(__VA_ARGS__)
 228 #else
 229 #  define DEBUG_PRINTF(...)
 230 #endif
 231
 232 /***/
 233
 234 typedef struct OldNew {
 235         const void *old;
 236         void *newp;
 237         int nr;
 238 } OldNew;
 239
 240 typedef struct OldNewMap {
 241         OldNew *entries;
 242         int nentries, entriessize;
 243         bool sorted;
 244         int lasthit;
 245 } OldNewMap;
 246
 247
 248 /* local prototypes */
 249 static void *read_struct(FileData *fd, BHead *bh, const char *blockname);
 250 static void direct_link_modifiers(FileData *fd, ListBase *lb);
 251 static void convert_tface_mt(FileData *fd, Main *main);
 252 static BHead *find_bhead_from_code_name(FileData *fd, const short idcode, const char *name);
 253 static BHead *find_bhead_from_idname(FileData *fd, const char *idname);
 254
 255 /* this function ensures that reports are printed,
 256  * in the case of libraray linking errors this is important!
 257  *
 258  * bit kludge but better then doubling up on prints,
 259  * we could alternatively have a versions of a report function which forces printing - campbell
 260  */
 261
 262 void blo_reportf_wrap(ReportList *reports, ReportType type, const char *format, ...)
 263 {
 264         char fixed_buf[1024]; /* should be long enough */
 265
 266         va_list args;
 267
 268         va_start(args, format);
 269         vsnprintf(fixed_buf, sizeof(fixed_buf), format, args);
 270         va_end(args);
 271
 272         fixed_buf[sizeof(fixed_buf) - 1] = '\0';
 273
 274         BKE_report(reports, type, fixed_buf);
 275
 276         if (G.background == 0) {
 277                 printf("%s: %s\n", BKE_report_type_str(type), fixed_buf);
 278         }
 279 }
 280
 281 /* for reporting linking messages */
 282 static const char *library_parent_filepath(Library *lib)
 283 {
 284         return lib->parent ? lib->parent->filepath : "<direct>";
 285 }
 286
 287 static OldNewMap *oldnewmap_new(void)
 288 {
 289         OldNewMap *onm= MEM_callocN(sizeof(*onm), "OldNewMap");
 290
 291         onm->entriessize = 1024;
 292         onm->entries = MEM_malloc_arrayN(onm->entriessize, sizeof(*onm->entries), "OldNewMap.entries");
 293
 294         return onm;
 295 }
 296
 297 static int verg_oldnewmap(const void *v1, const void *v2)
 298 {
 299         const struct OldNew *x1=v1, *x2=v2;
 300
 301         if (x1->old > x2->old) return 1;
 302         else if (x1->old < x2->old) return -1;
 303         return 0;
 304 }
 305
 306
 307 static void oldnewmap_sort(FileData *fd)
 308 {
 309         BLI_assert(fd->libmap->sorted == false);
 310         qsort(fd->libmap->entries, fd->libmap->nentries, sizeof(OldNew), verg_oldnewmap);
 311         fd->libmap->sorted = 1;
 312 }
 313
 314 /* nr is zero for data, and ID code for libdata */
 315 static void oldnewmap_insert(OldNewMap *onm, const void *oldaddr, void *newaddr, int nr)
 316 {
 317         OldNew *entry;
 318
 319         if (oldaddr==NULL || newaddr==NULL) return;
 320
 321         if (UNLIKELY(onm->nentries == onm->entriessize)) {
 322                 onm->entriessize *= 2;
 323                 onm->entries = MEM_reallocN(onm->entries, sizeof(*onm->entries) * onm->entriessize);
 324         }
 325
 326         entry = &onm->entries[onm->nentries++];
 327         entry->old = oldaddr;
 328         entry->newp = newaddr;
 329         entry->nr = nr;
 330 }
 331
 332 void blo_do_versions_oldnewmap_insert(OldNewMap *onm, const void *oldaddr, void *newaddr, int nr)
 333 {
 334         oldnewmap_insert(onm, oldaddr, newaddr, nr);
 335 }
 336
 337 /**
 338  * Do a full search (no state).
 339  *
 340  * \param lasthit: Use as a reference position to avoid a full search
 341  * from either end of the array, giving more efficient lookups.
 342  *
 343  * \note This would seem an ideal case for hash or btree lookups.
 344  * However the data is written in-order, using the \a lasthit will normally avoid calling this function.
 345  * Creating a btree/hash structure adds overhead for the common-case to optimize the corner-case
 346  * (since most entries will never be retrieved).
 347  * So just keep full lookups as a fall-back.
 348  */
 349 static int oldnewmap_lookup_entry_full(const OldNewMap *onm, const void *addr, int lasthit)
 350 {
 351         const int nentries = onm->nentries;
 352         const OldNew *entries = onm->entries;
 353         int i;
 354
 355         /* search relative to lasthit where possible */
 356         if (lasthit >= 0 && lasthit < nentries) {
 357
 358                 /* search forwards */
 359                 i = lasthit;
 360                 while (++i != nentries) {
 361                         if (entries[i].old == addr) {
 362                                 return i;
 363                         }
 364                 }
 365
 366                 /* search backwards */
 367                 i = lasthit + 1;
 368                 while (i--) {
 369                         if (entries[i].old == addr) {
 370                                 return i;
 371                         }
 372                 }
 373         }
 374         else {
 375                 /* search backwards (full) */
 376                 i = nentries;
 377                 while (i--) {
 378                         if (entries[i].old == addr) {
 379                                 return i;
 380                         }
 381                 }
 382         }
 383
 384         return -1;
 385 }
 386
 387 static void *oldnewmap_lookup_and_inc(OldNewMap *onm, const void *addr, bool increase_users)
 388 {
 389         int i;
 390
 391         if (addr == NULL) return NULL;
 392
 393         if (onm->lasthit < onm->nentries-1) {
 394                 OldNew *entry = &onm->entries[++onm->lasthit];
 395
 396                 if (entry->old == addr) {
 397                         if (increase_users)
 398                                 entry->nr++;
 399                         return entry->newp;
 400                 }
 401         }
 402
 403         i = oldnewmap_lookup_entry_full(onm, addr, onm->lasthit);
 404         if (i != -1) {
 405                 OldNew *entry = &onm->entries[i];
 406                 BLI_assert(entry->old == addr);
 407                 onm->lasthit = i;
 408                 if (increase_users)
 409                         entry->nr++;
 410                 return entry->newp;
 411         }
 412
 413         return NULL;
 414 }
 415
 416 /* for libdata, nr has ID code, no increment */
 417 static void *oldnewmap_liblookup(OldNewMap *onm, const void *addr, const void *lib)
 418 {
 419         if (addr == NULL) {
 420                 return NULL;
 421         }
 422
 423         /* lasthit works fine for non-libdata, linking there is done in same sequence as writing */
 424         if (onm->sorted) {
 425                 const OldNew entry_s = {.old = addr};
 426                 OldNew *entry = bsearch(&entry_s, onm->entries, onm->nentries, sizeof(OldNew), verg_oldnewmap);
 427                 if (entry) {
 428                         ID *id = entry->newp;
 429
 430                         if (id && (!lib || id->lib)) {
 431                                 return id;
 432                         }
 433                 }
 434         }
 435         else {
 436                 /* note, this can be a bottle neck when loading some files */
 437                 const int i = oldnewmap_lookup_entry_full(onm, addr, -1);
 438                 if (i != -1) {
 439                         OldNew *entry = &onm->entries[i];
 440                         ID *id = entry->newp;
 441                         BLI_assert(entry->old == addr);
 442                         if (id && (!lib || id->lib)) {
 443                                 return id;
 444                         }
 445                 }
 446         }
 447
 448         return NULL;
 449 }
 450
 451 static void oldnewmap_free_unused(OldNewMap *onm)
 452 {
 453         int i;
 454
 455         for (i = 0; i < onm->nentries; i++) {
 456                 OldNew *entry = &onm->entries[i];
 457                 if (entry->nr == 0) {
 458                         MEM_freeN(entry->newp);
 459                         entry->newp = NULL;
 460                 }
 461         }
 462 }
 463
 464 static void oldnewmap_clear(OldNewMap *onm)
 465 {
 466         onm->nentries = 0;
 467         onm->lasthit = 0;
 468 }
 469
 470 static void oldnewmap_free(OldNewMap *onm)
 471 {
 472         MEM_freeN(onm->entries);
 473         MEM_freeN(onm);
 474 }
 475
 476 /***/
 477
 478 static void read_libraries(FileData *basefd, ListBase *mainlist);
 479
 480 /* ************ help functions ***************** */
 481
 482 static void add_main_to_main(Main *mainvar, Main *from)
 483 {
 484         ListBase *lbarray[MAX_LIBARRAY], *fromarray[MAX_LIBARRAY];
 485         int a;
 486
 487         set_listbasepointers(mainvar, lbarray);
 488         a = set_listbasepointers(from, fromarray);
 489         while (a--) {
 490                 BLI_movelisttolist(lbarray[a], fromarray[a]);
 491         }
 492 }
 493
 494 void blo_join_main(ListBase *mainlist)
 495 {
 496         Main *tojoin, *mainl;
 497
 498         mainl = mainlist->first;
 499         while ((tojoin = mainl->next)) {
 500                 add_main_to_main(mainl, tojoin);
 501                 BLI_remlink(mainlist, tojoin);
 502                 BKE_main_free(tojoin);
 503         }
 504 }
 505
 506 static void split_libdata(ListBase *lb_src, Main **lib_main_array, const unsigned int lib_main_array_len)
 507 {
 508         for (ID *id = lb_src->first, *idnext; id; id = idnext) {
 509                 idnext = id->next;
 510
 511                 if (id->lib) {
 512                         if (((unsigned int)id->lib->temp_index < lib_main_array_len) &&
 513                             /* this check should never fail, just incase 'id->lib' is a dangling pointer. */
 514                             (lib_main_array[id->lib->temp_index]->curlib == id->lib))
 515                         {
 516                                 Main *mainvar = lib_main_array[id->lib->temp_index];
 517                                 ListBase *lb_dst = which_libbase(mainvar, GS(id->name));
 518                                 BLI_remlink(lb_src, id);
 519                                 BLI_addtail(lb_dst, id);
 520                         }
 521                         else {
 522                                 printf("%s: invalid library for '%s'\n", __func__, id->name);
 523                                 BLI_assert(0);
 524                         }
 525                 }
 526         }
 527 }
 528
 529 void blo_split_main(ListBase *mainlist, Main *main)
 530 {
 531         mainlist->first = mainlist->last = main;
 532         main->next = NULL;
 533
 534         if (BLI_listbase_is_empty(&main->library))
 535                 return;
 536
 537         /* (Library.temp_index -> Main), lookup table */
 538         const unsigned int lib_main_array_len = BLI_listbase_count(&main->library);
 539         Main             **lib_main_array     = MEM_malloc_arrayN(lib_main_array_len, sizeof(*lib_main_array), __func__);
 540
 541         int i = 0;
 542         for (Library *lib = main->library.first; lib; lib = lib->id.next, i++) {
 543                 Main *libmain = BKE_main_new();
 544                 libmain->curlib = lib;
 545                 libmain->versionfile = lib->versionfile;
 546                 libmain->subversionfile = lib->subversionfile;
 547                 BLI_addtail(mainlist, libmain);
 548                 lib->temp_index = i;
 549                 lib_main_array[i] = libmain;
 550         }
 551
 552         ListBase *lbarray[MAX_LIBARRAY];
 553         i = set_listbasepointers(main, lbarray);
 554         while (i--) {
 555                 split_libdata(lbarray[i], lib_main_array, lib_main_array_len);
 556         }
 557
 558         MEM_freeN(lib_main_array);
 559 }
 560
 561 static void read_file_version(FileData *fd, Main *main)
 562 {
 563         BHead *bhead;
 564
 565         for (bhead= blo_firstbhead(fd); bhead; bhead= blo_nextbhead(fd, bhead)) {
 566                 if (bhead->code == GLOB) {
 567                         FileGlobal *fg= read_struct(fd, bhead, "Global");
 568                         if (fg) {
 569                                 main->subversionfile= fg->subversion;
 570                                 main->minversionfile= fg->minversion;
 571                                 main->minsubversionfile= fg->minsubversion;
 572                                 MEM_freeN(fg);
 573                         }
 574                         else if (bhead->code == ENDB)
 575                                 break;
 576                 }
 577         }
 578         if (main->curlib) {
 579                 main->curlib->versionfile = main->versionfile;
 580                 main->curlib->subversionfile = main->subversionfile;
 581         }
 582 }
 583
 584 #ifdef USE_GHASH_BHEAD
 585 static void read_file_bhead_idname_map_create(FileData *fd)
 586 {
 587         BHead *bhead;
 588
 589         /* dummy values */
 590         bool is_link = false;
 591         int code_prev = ENDB;
 592         unsigned int reserve = 0;
 593
 594         for (bhead = blo_firstbhead(fd); bhead; bhead = blo_nextbhead(fd, bhead)) {
 595                 if (code_prev != bhead->code) {
 596                         code_prev = bhead->code;
 597                         is_link = BKE_idcode_is_valid(code_prev) ? BKE_idcode_is_linkable(code_prev) : false;
 598                 }
 599
 600                 if (is_link) {
 601                         reserve += 1;
 602                 }
 603         }
 604
 605         BLI_assert(fd->bhead_idname_hash == NULL);
 606
 607         fd->bhead_idname_hash = BLI_ghash_str_new_ex(__func__, reserve);
 608
 609         for (bhead = blo_firstbhead(fd); bhead; bhead = blo_nextbhead(fd, bhead)) {
 610                 if (code_prev != bhead->code) {
 611                         code_prev = bhead->code;
 612                         is_link = BKE_idcode_is_valid(code_prev) ? BKE_idcode_is_linkable(code_prev) : false;
 613                 }
 614
 615                 if (is_link) {
 616                         BLI_ghash_insert(fd->bhead_idname_hash, (void *)bhead_id_name(fd, bhead), bhead);
 617                 }
 618         }
 619 }
 620 #endif
 621
 622
 623 static Main *blo_find_main(FileData *fd, const char *filepath, const char *relabase)
 624 {
 625         ListBase *mainlist = fd->mainlist;
 626         Main *m;
 627         Library *lib;
 628         char name1[FILE_MAX];
 629
 630         BLI_strncpy(name1, filepath, sizeof(name1));
 631         BLI_cleanup_path(relabase, name1);
 632
 633 //      printf("blo_find_main: relabase  %s\n", relabase);
 634 //      printf("blo_find_main: original in  %s\n", filepath);
 635 //      printf("blo_find_main: converted to %s\n", name1);
 636
 637         for (m = mainlist->first; m; m = m->next) {
 638                 const char *libname = (m->curlib) ? m->curlib->filepath : m->name;
 639
 640                 if (BLI_path_cmp(name1, libname) == 0) {
 641                         if (G.debug & G_DEBUG) printf("blo_find_main: found library %s\n", libname);
 642                         return m;
 643                 }
 644         }
 645
 646         m = BKE_main_new();
 647         BLI_addtail(mainlist, m);
 648
 649         /* Add library datablock itself to 'main' Main, since libraries are **never** linked data.
 650          * Fixes bug where you could end with all ID_LI datablocks having the same name... */
 651         lib = BKE_libblock_alloc(mainlist->first, ID_LI, "Lib", 0);
 652         lib->id.us = ID_FAKE_USERS(lib);  /* Important, consistency with main ID reading code from read_libblock(). */
 653         BLI_strncpy(lib->name, filepath, sizeof(lib->name));
 654         BLI_strncpy(lib->filepath, name1, sizeof(lib->filepath));
 655
 656         m->curlib = lib;
 657
 658         read_file_version(fd, m);
 659
 660         if (G.debug & G_DEBUG) printf("blo_find_main: added new lib %s\n", filepath);
 661         return m;
 662 }
 663
 664
 665 /* ************ FILE PARSING ****************** */
 666
 667 static void switch_endian_bh4(BHead4 *bhead)
 668 {
 669         /* the ID_.. codes */
 670         if ((bhead->code & 0xFFFF)==0) bhead->code >>= 16;
 671
 672         if (bhead->code != ENDB) {
 673                 BLI_endian_switch_int32(&bhead->len);
 674                 BLI_endian_switch_int32(&bhead->SDNAnr);
 675                 BLI_endian_switch_int32(&bhead->nr);
 676         }
 677 }
 678
 679 static void switch_endian_bh8(BHead8 *bhead)
 680 {
 681         /* the ID_.. codes */
 682         if ((bhead->code & 0xFFFF)==0) bhead->code >>= 16;
 683
 684         if (bhead->code != ENDB) {
 685                 BLI_endian_switch_int32(&bhead->len);
 686                 BLI_endian_switch_int32(&bhead->SDNAnr);
 687                 BLI_endian_switch_int32(&bhead->nr);
 688         }
 689 }
 690
 691 static void bh4_from_bh8(BHead *bhead, BHead8 *bhead8, int do_endian_swap)
 692 {
 693         BHead4 *bhead4 = (BHead4 *) bhead;
 694         int64_t old;
 695
 696         bhead4->code = bhead8->code;
 697         bhead4->len = bhead8->len;
 698
 699         if (bhead4->code != ENDB) {
 700                 /* perform a endian swap on 64bit pointers, otherwise the pointer might map to zero
 701                  * 0x0000000000000000000012345678 would become 0x12345678000000000000000000000000
 702                  */
 703                 if (do_endian_swap) {
 704                         BLI_endian_switch_int64(&bhead8->old);
 705                 }
 706
 707                 /* this patch is to avoid a long long being read from not-eight aligned positions
 708                  * is necessary on any modern 64bit architecture) */
 709                 memcpy(&old, &bhead8->old, 8);
 710                 bhead4->old = (int) (old >> 3);
 711
 712                 bhead4->SDNAnr = bhead8->SDNAnr;
 713                 bhead4->nr = bhead8->nr;
 714         }
 715 }
 716
 717 static void bh8_from_bh4(BHead *bhead, BHead4 *bhead4)
 718 {
 719         BHead8 *bhead8 = (BHead8 *) bhead;
 720
 721         bhead8->code = bhead4->code;
 722         bhead8->len = bhead4->len;
 723
 724         if (bhead8->code != ENDB) {
 725                 bhead8->old = bhead4->old;
 726                 bhead8->SDNAnr = bhead4->SDNAnr;
 727                 bhead8->nr= bhead4->nr;
 728         }
 729 }
 730
 731 static BHeadN *get_bhead(FileData *fd)
 732 {
 733         BHeadN *new_bhead = NULL;
 734         int readsize;
 735
 736         if (fd) {
 737                 if (!fd->eof) {
 738                         /* initializing to zero isn't strictly needed but shuts valgrind up
 739                          * since uninitialized memory gets compared */
 740                         BHead8 bhead8 = {0};
 741                         BHead4 bhead4 = {0};
 742                         BHead  bhead = {0};
 743
 744                         /* First read the bhead structure.
 745                          * Depending on the platform the file was written on this can
 746                          * be a big or little endian BHead4 or BHead8 structure.
 747                          *
 748                          * As usual 'ENDB' (the last *partial* bhead of the file)
 749                          * needs some special handling. We don't want to EOF just yet.
 750                          */
 751                         if (fd->flags & FD_FLAGS_FILE_POINTSIZE_IS_4) {
 752                                 bhead4.code = DATA;
 753                                 readsize = fd->read(fd, &bhead4, sizeof(bhead4));
 754
 755                                 if (readsize == sizeof(bhead4) || bhead4.code == ENDB) {
 756                                         if (fd->flags & FD_FLAGS_SWITCH_ENDIAN) {
 757                                                 switch_endian_bh4(&bhead4);
 758                                         }
 759
 760                                         if (fd->flags & FD_FLAGS_POINTSIZE_DIFFERS) {
 761                                                 bh8_from_bh4(&bhead, &bhead4);
 762                                         }
 763                                         else {
 764                                                 memcpy(&bhead, &bhead4, sizeof(bhead));
 765                                         }
 766                                 }
 767                                 else {
 768                                         fd->eof = 1;
 769                                         bhead.len= 0;
 770                                 }
 771                         }
 772                         else {
 773                                 bhead8.code = DATA;
 774                                 readsize = fd->read(fd, &bhead8, sizeof(bhead8));
 775
 776                                 if (readsize == sizeof(bhead8) || bhead8.code == ENDB) {
 777                                         if (fd->flags & FD_FLAGS_SWITCH_ENDIAN) {
 778                                                 switch_endian_bh8(&bhead8);
 779                                         }
 780
 781                                         if (fd->flags & FD_FLAGS_POINTSIZE_DIFFERS) {
 782                                                 bh4_from_bh8(&bhead, &bhead8, (fd->flags & FD_FLAGS_SWITCH_ENDIAN));
 783                                         }
 784                                         else {
 785                                                 memcpy(&bhead, &bhead8, sizeof(bhead));
 786                                         }
 787                                 }
 788                                 else {
 789                                         fd->eof = 1;
 790                                         bhead.len= 0;
 791                                 }
 792                         }
 793
 794                         /* make sure people are not trying to pass bad blend files */
 795                         if (bhead.len < 0) fd->eof = 1;
 796
 797                         /* bhead now contains the (converted) bhead structure. Now read
 798                          * the associated data and put everything in a BHeadN (creative naming !)
 799                          */
 800                         if (!fd->eof) {
 801                                 new_bhead = MEM_mallocN(sizeof(BHeadN) + bhead.len, "new_bhead");
 802                                 if (new_bhead) {
 803                                         new_bhead->next = new_bhead->prev = NULL;
 804                                         new_bhead->bhead = bhead;
 805
 806                                         readsize = fd->read(fd, new_bhead + 1, bhead.len);
 807
 808                                         if (readsize != bhead.len) {
 809                                                 fd->eof = 1;
 810                                                 MEM_freeN(new_bhead);
 811                                                 new_bhead = NULL;
 812                                         }
 813                                 }
 814                                 else {
 815                                         fd->eof = 1;
 816                                 }
 817                         }
 818                 }
 819         }
 820
 821         /* We've read a new block. Now add it to the list
 822          * of blocks.
 823          */
 824         if (new_bhead) {
 825                 BLI_addtail(&fd->listbase, new_bhead);
 826         }
 827
 828         return(new_bhead);
 829 }
 830
 831 BHead *blo_firstbhead(FileData *fd)
 832 {
 833         BHeadN *new_bhead;
 834         BHead *bhead = NULL;
 835
 836         /* Rewind the file
 837          * Read in a new block if necessary
 838          */
 839         new_bhead = fd->listbase.first;
 840         if (new_bhead == NULL) {
 841                 new_bhead = get_bhead(fd);
 842         }
 843
 844         if (new_bhead) {
 845                 bhead = &new_bhead->bhead;
 846         }
 847
 848         return(bhead);
 849 }
 850
 851 BHead *blo_prevbhead(FileData *UNUSED(fd), BHead *thisblock)
 852 {
 853         BHeadN *bheadn = (BHeadN *)POINTER_OFFSET(thisblock, -offsetof(BHeadN, bhead));
 854         BHeadN *prev = bheadn->prev;
 855
 856         return (prev) ? &prev->bhead : NULL;
 857 }
 858
 859 BHead *blo_nextbhead(FileData *fd, BHead *thisblock)
 860 {
 861         BHeadN *new_bhead = NULL;
 862         BHead *bhead = NULL;
 863
 864         if (thisblock) {
 865                 /* bhead is actually a sub part of BHeadN
 866                  * We calculate the BHeadN pointer from the BHead pointer below */
 867                 new_bhead = (BHeadN *)POINTER_OFFSET(thisblock, -offsetof(BHeadN, bhead));
 868
 869                 /* get the next BHeadN. If it doesn't exist we read in the next one */
 870                 new_bhead = new_bhead->next;
 871                 if (new_bhead == NULL) {
 872                         new_bhead = get_bhead(fd);
 873                 }
 874         }
 875
 876         if (new_bhead) {
 877                 /* here we do the reverse:
 878                  * go from the BHeadN pointer to the BHead pointer */
 879                 bhead = &new_bhead->bhead;
 880         }
 881
 882         return(bhead);
 883 }
 884
 885 /* Warning! Caller's responsibility to ensure given bhead **is** and ID one! */
 886 const char *bhead_id_name(const FileData *fd, const BHead *bhead)
 887 {
 888         return (const char *)POINTER_OFFSET(bhead, sizeof(*bhead) + fd->id_name_offs);
 889 }
 890
 891 static void decode_blender_header(FileData *fd)
 892 {
 893         char header[SIZEOFBLENDERHEADER], num[4];
 894         int readsize;
 895
 896         /* read in the header data */
 897         readsize = fd->read(fd, header, sizeof(header));
 898
 899         if (readsize == sizeof(header) &&
 900             STREQLEN(header, "BLENDER", 7) &&
 901             ELEM(header[7], '_', '-') &&
 902             ELEM(header[8], 'v', 'V') &&
 903             (isdigit(header[9]) && isdigit(header[10]) && isdigit(header[11])))
 904         {
 905                 fd->flags |= FD_FLAGS_FILE_OK;
 906
 907                 /* what size are pointers in the file ? */
 908                 if (header[7] == '_') {
 909                         fd->flags |= FD_FLAGS_FILE_POINTSIZE_IS_4;
 910                         if (sizeof(void *) != 4) {
 911                                 fd->flags |= FD_FLAGS_POINTSIZE_DIFFERS;
 912                         }
 913                 }
 914                 else {
 915                         if (sizeof(void *) != 8) {
 916                                 fd->flags |= FD_FLAGS_POINTSIZE_DIFFERS;
 917                         }
 918                 }
 919
 920                 /* is the file saved in a different endian
 921                  * than we need ?
 922                  */
 923                 if (((header[8] == 'v') ? L_ENDIAN : B_ENDIAN) != ENDIAN_ORDER) {
 924                         fd->flags |= FD_FLAGS_SWITCH_ENDIAN;
 925                 }
 926
 927                 /* get the version number */
 928                 memcpy(num, header + 9, 3);
 929                 num[3] = 0;
 930                 fd->fileversion = atoi(num);
 931         }
 932 }
 933
 934 /**
 935  * \return Success if the file is read correctly, else set \a r_error_message.
 936  */
 937 static bool read_file_dna(FileData *fd, const char **r_error_message)
 938 {
 939         BHead *bhead;
 940
 941         for (bhead = blo_firstbhead(fd); bhead; bhead = blo_nextbhead(fd, bhead)) {
 942                 if (bhead->code == DNA1) {
 943                         const bool do_endian_swap = (fd->flags & FD_FLAGS_SWITCH_ENDIAN) != 0;
 944
 945                         fd->filesdna = DNA_sdna_from_data(&bhead[1], bhead->len, do_endian_swap, true, r_error_message);
 946                         if (fd->filesdna) {
 947                                 fd->compflags = DNA_struct_get_compareflags(fd->filesdna, fd->memsdna);
 948                                 /* used to retrieve ID names from (bhead+1) */
 949                                 fd->id_name_offs = DNA_elem_offset(fd->filesdna, "ID", "char", "name[]");
 950
 951                                 return true;
 952                         }
 953                         else {
 954                                 return false;
 955                         }
 956
 957                 }
 958                 else if (bhead->code == ENDB)
 959                         break;
 960         }
 961
 962         *r_error_message = "Missing DNA block";
 963         return false;
 964 }
 965
 966 static int *read_file_thumbnail(FileData *fd)
 967 {
 968         BHead *bhead;
 969         int *blend_thumb = NULL;
 970
 971         for (bhead = blo_firstbhead(fd); bhead; bhead = blo_nextbhead(fd, bhead)) {
 972                 if (bhead->code == TEST) {
 973                         const bool do_endian_swap = (fd->flags & FD_FLAGS_SWITCH_ENDIAN) != 0;
 974                         int *data = (int *)(bhead + 1);
 975
 976                         if (bhead->len < (2 * sizeof(int))) {
 977                                 break;
 978                         }
 979
 980                         if (do_endian_swap) {
 981                                 BLI_endian_switch_int32(&data[0]);
 982                                 BLI_endian_switch_int32(&data[1]);
 983                         }
 984
 985                         int width = data[0];
 986                         int height = data[1];
 987
 988                         if (!BLEN_THUMB_SAFE_MEMSIZE(width, height)) {
 989                                 break;
 990                         }
 991                         if (bhead->len < BLEN_THUMB_MEMSIZE_FILE(width, height)) {
 992                                 break;
 993                         }
 994
 995                         blend_thumb = data;
 996                         break;
 997                 }
 998                 else if (bhead->code != REND) {
 999                         /* Thumbnail is stored in TEST immediately after first REND... */
1000                         break;
1001                 }
1002         }
1003
1004         return blend_thumb;
1005 }
1006
1007 static int fd_read_from_file(FileData *filedata, void *buffer, unsigned int size)
1008 {
1009         int readsize = read(filedata->filedes, buffer, size);
1010
1011         if (readsize < 0) {
1012                 readsize = EOF;
1013         }
1014         else {
1015                 filedata->seek += readsize;
1016         }
1017
1018         return readsize;
1019 }
1020
1021 static int fd_read_gzip_from_file(FileData *filedata, void *buffer, unsigned int size)
1022 {
1023         int readsize = gzread(filedata->gzfiledes, buffer, size);
1024
1025         if (readsize < 0) {
1026                 readsize = EOF;
1027         }
1028         else {
1029                 filedata->seek += readsize;
1030         }
1031
1032         return (readsize);
1033 }
1034
1035 static int fd_read_from_memory(FileData *filedata, void *buffer, unsigned int size)
1036 {
1037         /* don't read more bytes then there are available in the buffer */
1038         int readsize = (int)MIN2(size, (unsigned int)(filedata->buffersize - filedata->seek));
1039
1040         memcpy(buffer, filedata->buffer + filedata->seek, readsize);
1041         filedata->seek += readsize;
1042
1043         return (readsize);
1044 }
1045
1046 static int fd_read_from_memfile(FileData *filedata, void *buffer, unsigned int size)
1047 {
1048         static unsigned int seek = (1<<30);     /* the current position */
1049         static unsigned int offset = 0;         /* size of previous chunks */
1050         static MemFileChunk *chunk = NULL;
1051         unsigned int chunkoffset, readsize, totread;
1052
1053         if (size == 0) return 0;
1054
1055         if (seek != (unsigned int)filedata->seek) {
1056                 chunk = filedata->memfile->chunks.first;
1057                 seek = 0;
1058
1059                 while (chunk) {
1060                         if (seek + chunk->size > (unsigned) filedata->seek) break;
1061                         seek += chunk->size;
1062                         chunk = chunk->next;
1063                 }
1064                 offset = seek;
1065                 seek = filedata->seek;
1066         }
1067
1068         if (chunk) {
1069                 totread = 0;
1070
1071                 do {
1072                         /* first check if it's on the end if current chunk */
1073                         if (seek-offset == chunk->size) {
1074                                 offset += chunk->size;
1075                                 chunk = chunk->next;
1076                         }
1077
1078                         /* debug, should never happen */
1079                         if (chunk == NULL) {
1080                                 printf("illegal read, chunk zero\n");
1081                                 return 0;
1082                         }
1083
1084                         chunkoffset = seek-offset;
1085                         readsize = size-totread;
1086
1087                         /* data can be spread over multiple chunks, so clamp size
1088                          * to within this chunk, and then it will read further in
1089                          * the next chunk */
1090                         if (chunkoffset+readsize > chunk->size)
1091                                 readsize= chunk->size-chunkoffset;
1092
1093                         memcpy(POINTER_OFFSET(buffer, totread), chunk->buf + chunkoffset, readsize);
1094                         totread += readsize;
1095                         filedata->seek += readsize;
1096                         seek += readsize;
1097                 } while (totread < size);
1098
1099                 return totread;
1100         }
1101
1102         return 0;
1103 }
1104
1105 static FileData *filedata_new(void)
1106 {
1107         FileData *fd = MEM_callocN(sizeof(FileData), "FileData");
1108
1109         fd->filedes = -1;
1110         fd->gzfiledes = NULL;
1111
1112         fd->memsdna = DNA_sdna_current_get();
1113
1114         fd->datamap = oldnewmap_new();
1115         fd->globmap = oldnewmap_new();
1116         fd->libmap = oldnewmap_new();
1117
1118         return fd;
1119 }
1120
1121 static FileData *blo_decode_and_check(FileData *fd, ReportList *reports)
1122 {
1123         decode_blender_header(fd);
1124
1125         if (fd->flags & FD_FLAGS_FILE_OK) {
1126                 const char *error_message = NULL;
1127                 if (read_file_dna(fd, &error_message) == false) {
1128                         BKE_reportf(reports, RPT_ERROR,
1129                                     "Failed to read blend file '%s': %s",
1130                                     fd->relabase, error_message);
1131                         blo_freefiledata(fd);
1132                         fd = NULL;
1133                 }
1134         }
1135         else {
1136                 BKE_reportf(reports, RPT_ERROR, "Failed to read blend file '%s', not a blend file", fd->relabase);
1137                 blo_freefiledata(fd);
1138                 fd = NULL;
1139         }
1140
1141         return fd;
1142 }
1143
1144 /* cannot be called with relative paths anymore! */
1145 /* on each new library added, it now checks for the current FileData and expands relativeness */
1146 FileData *blo_openblenderfile(const char *filepath, ReportList *reports)
1147 {
1148         gzFile gzfile;
1149         errno = 0;
1150         gzfile = BLI_gzopen(filepath, "rb");
1151
1152         if (gzfile == (gzFile)Z_NULL) {
1153                 BKE_reportf(reports, RPT_WARNING, "Unable to open '%s': %s",
1154                             filepath, errno ? strerror(errno) : TIP_("unknown error reading file"));
1155                 return NULL;
1156         }
1157         else {
1158                 FileData *fd = filedata_new();
1159                 fd->gzfiledes = gzfile;
1160                 fd->read = fd_read_gzip_from_file;
1161
1162                 /* needed for library_append and read_libraries */
1163                 BLI_strncpy(fd->relabase, filepath, sizeof(fd->relabase));
1164
1165                 return blo_decode_and_check(fd, reports);
1166         }
1167 }
1168
1169 /**
1170  * Same as blo_openblenderfile(), but does not reads DNA data, only header. Use it for light access
1171  * (e.g. thumbnail reading).
1172  */
1173 static FileData *blo_openblenderfile_minimal(const char *filepath)
1174 {
1175         gzFile gzfile;
1176         errno = 0;
1177         gzfile = BLI_gzopen(filepath, "rb");
1178
1179         if (gzfile != (gzFile)Z_NULL) {
1180                 FileData *fd = filedata_new();
1181                 fd->gzfiledes = gzfile;
1182                 fd->read = fd_read_gzip_from_file;
1183
1184                 decode_blender_header(fd);
1185
1186                 if (fd->flags & FD_FLAGS_FILE_OK) {
1187                         return fd;
1188                 }
1189
1190                 blo_freefiledata(fd);
1191         }
1192
1193         return NULL;
1194 }
1195
1196 static int fd_read_gzip_from_memory(FileData *filedata, void *buffer, unsigned int size)
1197 {
1198         int err;
1199
1200         filedata->strm.next_out = (Bytef *) buffer;
1201         filedata->strm.avail_out = size;
1202
1203         // Inflate another chunk.
1204         err = inflate (&filedata->strm, Z_SYNC_FLUSH);
1205
1206         if (err == Z_STREAM_END) {
1207                 return 0;
1208         }
1209         else if (err != Z_OK) {
1210                 printf("fd_read_gzip_from_memory: zlib error\n");
1211                 return 0;
1212         }
1213
1214         filedata->seek += size;
1215
1216         return (size);
1217 }
1218
1219 static int fd_read_gzip_from_memory_init(FileData *fd)
1220 {
1221
1222         fd->strm.next_in = (Bytef *) fd->buffer;
1223         fd->strm.avail_in = fd->buffersize;
1224         fd->strm.total_out = 0;
1225         fd->strm.zalloc = Z_NULL;
1226         fd->strm.zfree = Z_NULL;
1227
1228         if (inflateInit2(&fd->strm, (16+MAX_WBITS)) != Z_OK)
1229                 return 0;
1230
1231         fd->read = fd_read_gzip_from_memory;
1232
1233         return 1;
1234 }
1235
1236 FileData *blo_openblendermemory(const void *mem, int memsize, ReportList *reports)
1237 {
1238         if (!mem || memsize<SIZEOFBLENDERHEADER) {
1239                 BKE_report(reports, RPT_WARNING, (mem) ? TIP_("Unable to read"): TIP_("Unable to open"));
1240                 return NULL;
1241         }
1242         else {
1243                 FileData *fd = filedata_new();
1244                 const char *cp = mem;
1245
1246                 fd->buffer = mem;
1247                 fd->buffersize = memsize;
1248
1249                 /* test if gzip */
1250                 if (cp[0] == 0x1f && cp[1] == 0x8b) {
1251                         if (0 == fd_read_gzip_from_memory_init(fd)) {
1252                                 blo_freefiledata(fd);
1253                                 return NULL;
1254                         }
1255                 }
1256                 else
1257                         fd->read = fd_read_from_memory;
1258
1259                 fd->flags |= FD_FLAGS_NOT_MY_BUFFER;
1260
1261                 return blo_decode_and_check(fd, reports);
1262         }
1263 }
1264
1265 FileData *blo_openblendermemfile(MemFile *memfile, ReportList *reports)
1266 {
1267         if (!memfile) {
1268                 BKE_report(reports, RPT_WARNING, "Unable to open blend <memory>");
1269                 return NULL;
1270         }
1271         else {
1272                 FileData *fd = filedata_new();
1273                 fd->memfile = memfile;
1274
1275                 fd->read = fd_read_from_memfile;
1276                 fd->flags |= FD_FLAGS_NOT_MY_BUFFER;
1277
1278                 return blo_decode_and_check(fd, reports);
1279         }
1280 }
1281
1282
1283 void blo_freefiledata(FileData *fd)
1284 {
1285         if (fd) {
1286                 if (fd->filedes != -1) {
1287                         close(fd->filedes);
1288                 }
1289
1290                 if (fd->gzfiledes != NULL) {
1291                         gzclose(fd->gzfiledes);
1292                 }
1293
1294                 if (fd->strm.next_in) {
1295                         if (inflateEnd(&fd->strm) != Z_OK) {
1296                                 printf("close gzip stream error\n");
1297                         }
1298                 }
1299
1300                 if (fd->buffer && !(fd->flags & FD_FLAGS_NOT_MY_BUFFER)) {
1301                         MEM_freeN((void *)fd->buffer);
1302                         fd->buffer = NULL;
1303                 }
1304
1305                 // Free all BHeadN data blocks
1306                 BLI_freelistN(&fd->listbase);
1307
1308                 if (fd->filesdna)
1309                         DNA_sdna_free(fd->filesdna);
1310                 if (fd->compflags)
1311                         MEM_freeN((void *)fd->compflags);
1312
1313                 if (fd->datamap)
1314                         oldnewmap_free(fd->datamap);
1315                 if (fd->globmap)
1316                         oldnewmap_free(fd->globmap);
1317                 if (fd->imamap)
1318                         oldnewmap_free(fd->imamap);
1319                 if (fd->movieclipmap)
1320                         oldnewmap_free(fd->movieclipmap);
1321                 if (fd->soundmap)
1322                         oldnewmap_free(fd->soundmap);
1323                 if (fd->packedmap)
1324                         oldnewmap_free(fd->packedmap);
1325                 if (fd->libmap && !(fd->flags & FD_FLAGS_NOT_MY_LIBMAP))
1326                         oldnewmap_free(fd->libmap);
1327                 if (fd->bheadmap)
1328                         MEM_freeN(fd->bheadmap);
1329
1330 #ifdef USE_GHASH_BHEAD
1331                 if (fd->bhead_idname_hash) {
1332                         BLI_ghash_free(fd->bhead_idname_hash, NULL, NULL);
1333                 }
1334 #endif
1335
1336                 MEM_freeN(fd);
1337         }
1338 }
1339
1340 /* ************ DIV ****************** */
1341
1342 /**
1343  * Check whether given path ends with a blend file compatible extension (.blend, .ble or .blend.gz).
1344  *
1345  * \param str The path to check.
1346  * \return true is this path ends with a blender file extension.
1347  */
1348 bool BLO_has_bfile_extension(const char *str)
1349 {
1350         const char *ext_test[4] = {".blend", ".ble", ".blend.gz", NULL};
1351         return BLI_testextensie_array(str, ext_test);
1352 }
1353
1354 /**
1355  * Try to explode given path into its 'library components' (i.e. a .blend file, id type/group, and datablock itself).
1356  *
1357  * \param path the full path to explode.
1358  * \param r_dir the string that'll contain path up to blend file itself ('library' path).
1359  *              WARNING! Must be FILE_MAX_LIBEXTRA long (it also stores group and name strings)!
1360  * \param r_group the string that'll contain 'group' part of the path, if any. May be NULL.
1361  * \param r_name the string that'll contain data's name part of the path, if any. May be NULL.
1362  * \return true if path contains a blend file.
1363  */
1364 bool BLO_library_path_explode(const char *path, char *r_dir, char **r_group, char **r_name)
1365 {
1366         /* We might get some data names with slashes, so we have to go up in path until we find blend file itself,
1367          * then we now next path item is group, and everything else is data name. */
1368         char *slash = NULL, *prev_slash = NULL, c = '\0';
1369
1370         r_dir[0] = '\0';
1371         if (r_group) {
1372                 *r_group = NULL;
1373         }
1374         if (r_name) {
1375                 *r_name = NULL;
1376         }
1377
1378         /* if path leads to an existing directory, we can be sure we're not (in) a library */
1379         if (BLI_is_dir(path)) {
1380                 return false;
1381         }
1382
1383         strcpy(r_dir, path);
1384
1385         while ((slash = (char *)BLI_last_slash(r_dir))) {
1386                 char tc = *slash;
1387                 *slash = '\0';
1388                 if (BLO_has_bfile_extension(r_dir) && BLI_is_file(r_dir)) {
1389                         break;
1390                 }
1391
1392                 if (prev_slash) {
1393                         *prev_slash = c;
1394                 }
1395                 prev_slash = slash;
1396                 c = tc;
1397         }
1398
1399         if (!slash) {
1400                 return false;
1401         }
1402
1403         if (slash[1] != '\0') {
1404                 BLI_assert(strlen(slash + 1) < BLO_GROUP_MAX);
1405                 if (r_group) {
1406                         *r_group = slash + 1;
1407                 }
1408         }
1409
1410         if (prev_slash && (prev_slash[1] != '\0')) {
1411                 BLI_assert(strlen(prev_slash + 1) < MAX_ID_NAME - 2);
1412                 if (r_name) {
1413                         *r_name = prev_slash + 1;
1414                 }
1415         }
1416
1417         return true;
1418 }
1419
1420 /**
1421  * Does a very light reading of given .blend file to extract its stored thumbnail.
1422  *
1423  * \param filepath The path of the file to extract thumbnail from.
1424  * \return The raw thumbnail
1425  *         (MEM-allocated, as stored in file, use BKE_main_thumbnail_to_imbuf() to convert it to ImBuf image).
1426  */
1427 BlendThumbnail *BLO_thumbnail_from_file(const char *filepath)
1428 {
1429         FileData *fd;
1430         BlendThumbnail *data = NULL;
1431         int *fd_data;
1432
1433         fd = blo_openblenderfile_minimal(filepath);
1434         fd_data = fd ? read_file_thumbnail(fd) : NULL;
1435
1436         if (fd_data) {
1437                 int width = fd_data[0];
1438                 int height = fd_data[1];
1439
1440                 /* Protect against buffer overflow vulnerability. */
1441                 if (BLEN_THUMB_SAFE_MEMSIZE(width, height)) {
1442                         const size_t sz = BLEN_THUMB_MEMSIZE(width, height);
1443                         data = MEM_mallocN(sz, __func__);
1444
1445                         if (data) {
1446                                 BLI_assert((sz - sizeof(*data)) == (BLEN_THUMB_MEMSIZE_FILE(width, height) - (sizeof(*fd_data) * 2)));
1447                                 data->width = width;
1448                                 data->height = height;
1449                                 memcpy(data->rect, &fd_data[2], sz - sizeof(*data));
1450                         }
1451                 }
1452         }
1453
1454         blo_freefiledata(fd);
1455
1456         return data;
1457 }
1458
1459 /* ************** OLD POINTERS ******************* */
1460
1461 static void *newdataadr(FileData *fd, const void *adr)          /* only direct databocks */
1462 {
1463         return oldnewmap_lookup_and_inc(fd->datamap, adr, true);
1464 }
1465
1466 /* This is a special version of newdataadr() which allows us to keep lasthit of
1467  * map unchanged. In certain cases this makes file loading time significantly
1468  * faster.
1469  *
1470  * Use this function in cases like restoring pointer from one list element to
1471  * another list element, but keep lasthit value so we can continue restoring
1472  * pointers efficiently.
1473  *
1474  * Example of this could be found in direct_link_fcurves() which restores the
1475  * fcurve group pointer and keeps lasthit optimal for linking all further
1476  * fcurves.
1477  */
1478 static void *newdataadr_ex(FileData *fd, const void *adr, bool increase_lasthit)                /* only direct databocks */
1479 {
1480         if (increase_lasthit) {
1481                 return newdataadr(fd, adr);
1482         }
1483         else {
1484                 int lasthit = fd->datamap->lasthit;
1485                 void *newadr = newdataadr(fd, adr);
1486                 fd->datamap->lasthit = lasthit;
1487                 return newadr;
1488         }
1489 }
1490
1491 static void *newdataadr_no_us(FileData *fd, const void *adr)            /* only direct databocks */
1492 {
1493         return oldnewmap_lookup_and_inc(fd->datamap, adr, false);
1494 }
1495
1496 static void *newglobadr(FileData *fd, const void *adr)      /* direct datablocks with global linking */
1497 {
1498         return oldnewmap_lookup_and_inc(fd->globmap, adr, true);
1499 }
1500
1501 static void *newimaadr(FileData *fd, const void *adr)               /* used to restore image data after undo */
1502 {
1503         if (fd->imamap && adr)
1504                 return oldnewmap_lookup_and_inc(fd->imamap, adr, true);
1505         return NULL;
1506 }
1507
1508 static void *newmclipadr(FileData *fd, const void *adr)      /* used to restore movie clip data after undo */
1509 {
1510         if (fd->movieclipmap && adr)
1511                 return oldnewmap_lookup_and_inc(fd->movieclipmap, adr, true);
1512         return NULL;
1513 }
1514
1515 static void *newsoundadr(FileData *fd, const void *adr)      /* used to restore sound data after undo */
1516 {
1517         if (fd->soundmap && adr)
1518                 return oldnewmap_lookup_and_inc(fd->soundmap, adr, true);
1519         return NULL;
1520 }
1521
1522 static void *newpackedadr(FileData *fd, const void *adr)      /* used to restore packed data after undo */
1523 {
1524         if (fd->packedmap && adr)
1525                 return oldnewmap_lookup_and_inc(fd->packedmap, adr, true);
1526
1527         return oldnewmap_lookup_and_inc(fd->datamap, adr, true);
1528 }
1529
1530
1531 static void *newlibadr(FileData *fd, const void *lib, const void *adr)          /* only lib data */
1532 {
1533         return oldnewmap_liblookup(fd->libmap, adr, lib);
1534 }
1535
1536 void *blo_do_versions_newlibadr(FileData *fd, const void *lib, const void *adr)         /* only lib data */
1537 {
1538         return newlibadr(fd, lib, adr);
1539 }
1540
1541 static void *newlibadr_us(FileData *fd, const void *lib, const void *adr)       /* increases user number */
1542 {
1543         ID *id = newlibadr(fd, lib, adr);
1544
1545         id_us_plus_no_lib(id);
1546
1547         return id;
1548 }
1549
1550 void *blo_do_versions_newlibadr_us(FileData *fd, const void *lib, const void *adr)      /* increases user number */
1551 {
1552         return newlibadr_us(fd, lib, adr);
1553 }
1554
1555 static void *newlibadr_real_us(FileData *fd, const void *lib, const void *adr)  /* ensures real user */
1556 {
1557         ID *id = newlibadr(fd, lib, adr);
1558
1559         id_us_ensure_real(id);
1560
1561         return id;
1562 }
1563
1564 static void change_idid_adr_fd(FileData *fd, const void *old, void *new)
1565 {
1566         int i;
1567
1568         /* use a binary search if we have a sorted libmap, for now it's not needed. */
1569         BLI_assert(fd->libmap->sorted == false);
1570
1571         for (i = 0; i < fd->libmap->nentries; i++) {
1572                 OldNew *entry = &fd->libmap->entries[i];
1573
1574                 if (old==entry->newp && entry->nr==ID_ID) {
1575                         entry->newp = new;
1576                         if (new) entry->nr = GS( ((ID *)new)->name );
1577                 }
1578         }
1579 }
1580
1581 static void change_idid_adr(ListBase *mainlist, FileData *basefd, void *old, void *new)
1582 {
1583         Main *mainptr;
1584
1585         for (mainptr = mainlist->first; mainptr; mainptr = mainptr->next) {
1586                 FileData *fd;
1587
1588                 if (mainptr->curlib)
1589                         fd = mainptr->curlib->filedata;
1590                 else
1591                         fd = basefd;
1592
1593                 if (fd) {
1594                         change_idid_adr_fd(fd, old, new);
1595                 }
1596         }
1597 }
1598
1599 /* lib linked proxy objects point to our local data, we need
1600  * to clear that pointer before reading the undo memfile since
1601  * the object might be removed, it is set again in reading
1602  * if the local object still exists */
1603 void blo_clear_proxy_pointers_from_lib(Main *oldmain)
1604 {
1605         Object *ob = oldmain->object.first;
1606
1607         for (; ob; ob= ob->id.next) {
1608                 if (ob->id.lib)
1609                         ob->proxy_from = NULL;
1610         }
1611 }
1612
1613 void blo_make_image_pointer_map(FileData *fd, Main *oldmain)
1614 {
1615         Image *ima = oldmain->image.first;
1616         Scene *sce = oldmain->scene.first;
1617         int a;
1618
1619         fd->imamap = oldnewmap_new();
1620
1621         for (; ima; ima = ima->id.next) {
1622                 if (ima->cache)
1623                         oldnewmap_insert(fd->imamap, ima->cache, ima->cache, 0);
1624                 for (a = 0; a < TEXTARGET_COUNT; a++)
1625                         if (ima->gputexture[a])
1626                                 oldnewmap_insert(fd->imamap, ima->gputexture[a], ima->gputexture[a], 0);
1627                 if (ima->rr)
1628                         oldnewmap_insert(fd->imamap, ima->rr, ima->rr, 0);
1629                 for (a=0; a < IMA_MAX_RENDER_SLOT; a++)
1630                         if (ima->renders[a])
1631                                 oldnewmap_insert(fd->imamap, ima->renders[a], ima->renders[a], 0);
1632         }
1633         for (; sce; sce = sce->id.next) {
1634                 if (sce->nodetree && sce->nodetree->previews) {
1635                         bNodeInstanceHashIterator iter;
1636                         NODE_INSTANCE_HASH_ITER(iter, sce->nodetree->previews) {
1637                                 bNodePreview *preview = BKE_node_instance_hash_iterator_get_value(&iter);
1638                                 oldnewmap_insert(fd->imamap, preview, preview, 0);
1639                         }
1640                 }
1641         }
1642 }
1643
1644 /* set old main image ibufs to zero if it has been restored */
1645 /* this works because freeing old main only happens after this call */
1646 void blo_end_image_pointer_map(FileData *fd, Main *oldmain)
1647 {
1648         OldNew *entry = fd->imamap->entries;
1649         Image *ima = oldmain->image.first;
1650         Scene *sce = oldmain->scene.first;
1651         int i;
1652
1653         /* used entries were restored, so we put them to zero */
1654         for (i = 0; i < fd->imamap->nentries; i++, entry++) {
1655                 if (entry->nr > 0)
1656                         entry->newp = NULL;
1657         }
1658
1659         for (; ima; ima = ima->id.next) {
1660                 ima->cache = newimaadr(fd, ima->cache);
1661                 if (ima->cache == NULL) {
1662                         ima->tpageflag &= ~IMA_GLBIND_IS_DATA;
1663                         for (i = 0; i < TEXTARGET_COUNT; i++) {
1664                                 ima->bindcode[i] = 0;
1665                                 ima->gputexture[i] = NULL;
1666                         }
1667                         ima->rr = NULL;
1668                 }
1669                 for (i = 0; i < IMA_MAX_RENDER_SLOT; i++)
1670                         ima->renders[i] = newimaadr(fd, ima->renders[i]);
1671
1672                 for (i = 0; i < TEXTARGET_COUNT; i++)
1673                         ima->gputexture[i] = newimaadr(fd, ima->gputexture[i]);
1674                 ima->rr = newimaadr(fd, ima->rr);
1675         }
1676         for (; sce; sce = sce->id.next) {
1677                 if (sce->nodetree && sce->nodetree->previews) {
1678                         bNodeInstanceHash *new_previews = BKE_node_instance_hash_new("node previews");
1679                         bNodeInstanceHashIterator iter;
1680
1681                         /* reconstruct the preview hash, only using remaining pointers */
1682                         NODE_INSTANCE_HASH_ITER(iter, sce->nodetree->previews) {
1683                                 bNodePreview *preview = BKE_node_instance_hash_iterator_get_value(&iter);
1684                                 if (preview) {
1685                                         bNodePreview *new_preview = newimaadr(fd, preview);
1686                                         if (new_preview) {
1687                                                 bNodeInstanceKey key = BKE_node_instance_hash_iterator_get_key(&iter);
1688                                                 BKE_node_instance_hash_insert(new_previews, key, new_preview);
1689                                         }
1690                                 }
1691                         }
1692                         BKE_node_instance_hash_free(sce->nodetree->previews, NULL);
1693                         sce->nodetree->previews = new_previews;
1694                 }
1695         }
1696 }
1697
1698 void blo_make_movieclip_pointer_map(FileData *fd, Main *oldmain)
1699 {
1700         MovieClip *clip = oldmain->movieclip.first;
1701         Scene *sce = oldmain->scene.first;
1702
1703         fd->movieclipmap = oldnewmap_new();
1704
1705         for (; clip; clip = clip->id.next) {
1706                 if (clip->cache)
1707                         oldnewmap_insert(fd->movieclipmap, clip->cache, clip->cache, 0);
1708
1709                 if (clip->tracking.camera.intrinsics)
1710                         oldnewmap_insert(fd->movieclipmap, clip->tracking.camera.intrinsics, clip->tracking.camera.intrinsics, 0);
1711         }
1712
1713         for (; sce; sce = sce->id.next) {
1714                 if (sce->nodetree) {
1715                         bNode *node;
1716                         for (node = sce->nodetree->nodes.first; node; node = node->next)
1717                                 if (node->type == CMP_NODE_MOVIEDISTORTION)
1718                                         oldnewmap_insert(fd->movieclipmap, node->storage, node->storage, 0);
1719                 }
1720         }
1721 }
1722
1723 /* set old main movie clips caches to zero if it has been restored */
1724 /* this works because freeing old main only happens after this call */
1725 void blo_end_movieclip_pointer_map(FileData *fd, Main *oldmain)
1726 {
1727         OldNew *entry = fd->movieclipmap->entries;
1728         MovieClip *clip = oldmain->movieclip.first;
1729         Scene *sce = oldmain->scene.first;
1730         int i;
1731
1732         /* used entries were restored, so we put them to zero */
1733         for (i=0; i < fd->movieclipmap->nentries; i++, entry++) {
1734                 if (entry->nr > 0)
1735                         entry->newp = NULL;
1736         }
1737
1738         for (; clip; clip = clip->id.next) {
1739                 clip->cache = newmclipadr(fd, clip->cache);
1740                 clip->tracking.camera.intrinsics = newmclipadr(fd, clip->tracking.camera.intrinsics);
1741         }
1742
1743         for (; sce; sce = sce->id.next) {
1744                 if (sce->nodetree) {
1745                         bNode *node;
1746                         for (node = sce->nodetree->nodes.first; node; node = node->next)
1747                                 if (node->type == CMP_NODE_MOVIEDISTORTION)
1748                                         node->storage = newmclipadr(fd, node->storage);
1749                 }
1750         }
1751 }
1752
1753 void blo_make_sound_pointer_map(FileData *fd, Main *oldmain)
1754 {
1755         bSound *sound = oldmain->sound.first;
1756
1757         fd->soundmap = oldnewmap_new();
1758
1759         for (; sound; sound = sound->id.next) {
1760                 if (sound->waveform)
1761                         oldnewmap_insert(fd->soundmap, sound->waveform, sound->waveform, 0);
1762         }
1763 }
1764
1765 /* set old main sound caches to zero if it has been restored */
1766 /* this works because freeing old main only happens after this call */
1767 void blo_end_sound_pointer_map(FileData *fd, Main *oldmain)
1768 {
1769         OldNew *entry = fd->soundmap->entries;
1770         bSound *sound = oldmain->sound.first;
1771         int i;
1772
1773         /* used entries were restored, so we put them to zero */
1774         for (i = 0; i < fd->soundmap->nentries; i++, entry++) {
1775                 if (entry->nr > 0)
1776                         entry->newp = NULL;
1777         }
1778
1779         for (; sound; sound = sound->id.next) {
1780                 sound->waveform = newsoundadr(fd, sound->waveform);
1781         }
1782 }
1783
1784 /* XXX disabled this feature - packed files also belong in temp saves and quit.blend, to make restore work */
1785
1786 static void insert_packedmap(FileData *fd, PackedFile *pf)
1787 {
1788         oldnewmap_insert(fd->packedmap, pf, pf, 0);
1789         oldnewmap_insert(fd->packedmap, pf->data, pf->data, 0);
1790 }
1791
1792 void blo_make_packed_pointer_map(FileData *fd, Main *oldmain)
1793 {
1794         Image *ima;
1795         VFont *vfont;
1796         bSound *sound;
1797         Library *lib;
1798
1799         fd->packedmap = oldnewmap_new();
1800
1801         for (ima = oldmain->image.first; ima; ima = ima->id.next) {
1802                 ImagePackedFile *imapf;
1803
1804                 if (ima->packedfile)
1805                         insert_packedmap(fd, ima->packedfile);
1806
1807                 for (imapf = ima->packedfiles.first; imapf; imapf = imapf->next)
1808                         if (imapf->packedfile)
1809                                 insert_packedmap(fd, imapf->packedfile);
1810         }
1811
1812         for (vfont = oldmain->vfont.first; vfont; vfont = vfont->id.next)
1813                 if (vfont->packedfile)
1814                         insert_packedmap(fd, vfont->packedfile);
1815
1816         for (sound = oldmain->sound.first; sound; sound = sound->id.next)
1817                 if (sound->packedfile)
1818                         insert_packedmap(fd, sound->packedfile);
1819
1820         for (lib = oldmain->library.first; lib; lib = lib->id.next)
1821                 if (lib->packedfile)
1822                         insert_packedmap(fd, lib->packedfile);
1823
1824 }
1825
1826 /* set old main packed data to zero if it has been restored */
1827 /* this works because freeing old main only happens after this call */
1828 void blo_end_packed_pointer_map(FileData *fd, Main *oldmain)
1829 {
1830         Image *ima;
1831         VFont *vfont;
1832         bSound *sound;
1833         Library *lib;
1834         OldNew *entry = fd->packedmap->entries;
1835         int i;
1836
1837         /* used entries were restored, so we put them to zero */
1838         for (i=0; i < fd->packedmap->nentries; i++, entry++) {
1839                 if (entry->nr > 0)
1840                         entry->newp = NULL;
1841         }
1842
1843         for (ima = oldmain->image.first; ima; ima = ima->id.next) {
1844                 ImagePackedFile *imapf;
1845
1846                 ima->packedfile = newpackedadr(fd, ima->packedfile);
1847
1848                 for (imapf = ima->packedfiles.first; imapf; imapf = imapf->next)
1849                         imapf->packedfile = newpackedadr(fd, imapf->packedfile);
1850         }
1851
1852         for (vfont = oldmain->vfont.first; vfont; vfont = vfont->id.next)
1853                 vfont->packedfile = newpackedadr(fd, vfont->packedfile);
1854
1855         for (sound = oldmain->sound.first; sound; sound = sound->id.next)
1856                 sound->packedfile = newpackedadr(fd, sound->packedfile);
1857
1858         for (lib = oldmain->library.first; lib; lib = lib->id.next)
1859                 lib->packedfile = newpackedadr(fd, lib->packedfile);
1860 }
1861
1862
1863 /* undo file support: add all library pointers in lookup */
1864 void blo_add_library_pointer_map(ListBase *old_mainlist, FileData *fd)
1865 {
1866         Main *ptr = old_mainlist->first;
1867         ListBase *lbarray[MAX_LIBARRAY];
1868
1869         for (ptr = ptr->next; ptr; ptr = ptr->next) {
1870                 int i = set_listbasepointers(ptr, lbarray);
1871                 while (i--) {
1872                         ID *id;
1873                         for (id = lbarray[i]->first; id; id = id->next)
1874                                 oldnewmap_insert(fd->libmap, id, id, GS(id->name));
1875                 }
1876         }
1877
1878         fd->old_mainlist = old_mainlist;
1879 }
1880
1881
1882 /* ********** END OLD POINTERS ****************** */
1883 /* ********** READ FILE ****************** */
1884
1885 static void switch_endian_structs(const struct SDNA *filesdna, BHead *bhead)
1886 {
1887         int blocksize, nblocks;
1888         char *data;
1889
1890         data = (char *)(bhead+1);
1891         blocksize = filesdna->typelens[ filesdna->structs[bhead->SDNAnr][0] ];
1892
1893         nblocks = bhead->nr;
1894         while (nblocks--) {
1895                 DNA_struct_switch_endian(filesdna, bhead->SDNAnr, data);
1896
1897                 data += blocksize;
1898         }
1899 }
1900
1901 static void *read_struct(FileData *fd, BHead *bh, const char *blockname)
1902 {
1903         void *temp = NULL;
1904
1905         if (bh->len) {
1906                 /* switch is based on file dna */
1907                 if (bh->SDNAnr && (fd->flags & FD_FLAGS_SWITCH_ENDIAN))
1908                         switch_endian_structs(fd->filesdna, bh);
1909
1910                 if (fd->compflags[bh->SDNAnr] != SDNA_CMP_REMOVED) {
1911                         if (fd->compflags[bh->SDNAnr] == SDNA_CMP_NOT_EQUAL) {
1912                                 temp = DNA_struct_reconstruct(fd->memsdna, fd->filesdna, fd->compflags, bh->SDNAnr, bh->nr, (bh+1));
1913                         }
1914                         else {
1915                                 /* SDNA_CMP_EQUAL */
1916                                 temp = MEM_mallocN(bh->len, blockname);
1917                                 memcpy(temp, (bh+1), bh->len);
1918                         }
1919                 }
1920         }
1921
1922         return temp;
1923 }
1924
1925 typedef void (*link_list_cb)(FileData *fd, void *data);
1926
1927 static void link_list_ex(FileData *fd, ListBase *lb, link_list_cb callback)             /* only direct data */
1928 {
1929         Link *ln, *prev;
1930
1931         if (BLI_listbase_is_empty(lb)) return;
1932
1933         lb->first = newdataadr(fd, lb->first);
1934         if (callback != NULL) {
1935                 callback(fd, lb->first);
1936         }
1937         ln = lb->first;
1938         prev = NULL;
1939         while (ln) {
1940                 ln->next = newdataadr(fd, ln->next);
1941                 if (ln->next != NULL && callback != NULL) {
1942                         callback(fd, ln->next);
1943                 }
1944                 ln->prev = prev;
1945                 prev = ln;
1946                 ln = ln->next;
1947         }
1948         lb->last = prev;
1949 }
1950
1951 static void link_list(FileData *fd, ListBase *lb)               /* only direct data */
1952 {
1953         link_list_ex(fd, lb, NULL);
1954 }
1955
1956 static void link_glob_list(FileData *fd, ListBase *lb)          /* for glob data */
1957 {
1958         Link *ln, *prev;
1959         void *poin;
1960
1961         if (BLI_listbase_is_empty(lb)) return;
1962         poin = newdataadr(fd, lb->first);
1963         if (lb->first) {
1964                 oldnewmap_insert(fd->globmap, lb->first, poin, 0);
1965         }
1966         lb->first = poin;
1967
1968         ln = lb->first;
1969         prev = NULL;
1970         while (ln) {
1971                 poin = newdataadr(fd, ln->next);
1972                 if (ln->next) {
1973                         oldnewmap_insert(fd->globmap, ln->next, poin, 0);
1974                 }
1975                 ln->next = poin;
1976                 ln->prev = prev;
1977                 prev = ln;
1978                 ln = ln->next;
1979         }
1980         lb->last = prev;
1981 }
1982
1983 static void test_pointer_array(FileData *fd, void **mat)
1984 {
1985         int64_t *lpoin, *lmat;
1986         int *ipoin, *imat;
1987         size_t len;
1988
1989                 /* manually convert the pointer array in
1990                  * the old dna format to a pointer array in
1991                  * the new dna format.
1992                  */
1993         if (*mat) {
1994                 len = MEM_allocN_len(*mat)/fd->filesdna->pointerlen;
1995
1996                 if (fd->filesdna->pointerlen==8 && fd->memsdna->pointerlen==4) {
1997                         ipoin=imat= MEM_malloc_arrayN(len, 4, "newmatar");
1998                         lpoin= *mat;
1999
2000                         while (len-- > 0) {
2001                                 if ((fd->flags & FD_FLAGS_SWITCH_ENDIAN))
2002                                         BLI_endian_switch_int64(lpoin);
2003                                 *ipoin = (int)((*lpoin) >> 3);
2004                                 ipoin++;
2005                                 lpoin++;
2006                         }
2007                         MEM_freeN(*mat);
2008                         *mat = imat;
2009                 }
2010
2011                 if (fd->filesdna->pointerlen==4 && fd->memsdna->pointerlen==8) {
2012                         lpoin = lmat = MEM_malloc_arrayN(len, 8, "newmatar");
2013                         ipoin = *mat;
2014
2015                         while (len-- > 0) {
2016                                 *lpoin = *ipoin;
2017                                 ipoin++;
2018                                 lpoin++;
2019                         }
2020                         MEM_freeN(*mat);
2021                         *mat= lmat;
2022                 }
2023         }
2024 }
2025
2026 /* ************ READ ID Properties *************** */
2027
2028 static void IDP_DirectLinkProperty(IDProperty *prop, int switch_endian, FileData *fd);
2029 static void IDP_LibLinkProperty(IDProperty *prop, FileData *fd);
2030
2031 static void IDP_DirectLinkIDPArray(IDProperty *prop, int switch_endian, FileData *fd)
2032 {
2033         IDProperty *array;
2034         int i;
2035
2036         /* since we didn't save the extra buffer, set totallen to len */
2037         prop->totallen = prop->len;
2038         prop->data.pointer = newdataadr(fd, prop->data.pointer);
2039
2040         array = (IDProperty *)prop->data.pointer;
2041
2042         /* note!, idp-arrays didn't exist in 2.4x, so the pointer will be cleared
2043          * theres not really anything we can do to correct this, at least don't crash */
2044         if (array == NULL) {
2045                 prop->len = 0;
2046                 prop->totallen = 0;
2047         }
2048
2049
2050         for (i = 0; i < prop->len; i++)
2051                 IDP_DirectLinkProperty(&array[i], switch_endian, fd);
2052 }
2053
2054 static void IDP_DirectLinkArray(IDProperty *prop, int switch_endian, FileData *fd)
2055 {
2056         IDProperty **array;
2057         int i;
2058
2059         /* since we didn't save the extra buffer, set totallen to len */
2060         prop->totallen = prop->len;
2061         prop->data.pointer = newdataadr(fd, prop->data.pointer);
2062
2063         if (prop->subtype == IDP_GROUP) {
2064                 test_pointer_array(fd, prop->data.pointer);
2065                 array = prop->data.pointer;
2066
2067                 for (i = 0; i < prop->len; i++)
2068                         IDP_DirectLinkProperty(array[i], switch_endian, fd);
2069         }
2070         else if (prop->subtype == IDP_DOUBLE) {
2071                 if (switch_endian) {
2072                         BLI_endian_switch_double_array(prop->data.pointer, prop->len);
2073                 }
2074         }
2075         else {
2076                 if (switch_endian) {
2077                         /* also used for floats */
2078                         BLI_endian_switch_int32_array(prop->data.pointer, prop->len);
2079                 }
2080         }
2081 }
2082
2083 static void IDP_DirectLinkString(IDProperty *prop, FileData *fd)
2084 {
2085         /*since we didn't save the extra string buffer, set totallen to len.*/
2086         prop->totallen = prop->len;
2087         prop->data.pointer = newdataadr(fd, prop->data.pointer);
2088 }
2089
2090 static void IDP_DirectLinkGroup(IDProperty *prop, int switch_endian, FileData *fd)
2091 {
2092         ListBase *lb = &prop->data.group;
2093         IDProperty *loop;
2094
2095         link_list(fd, lb);
2096
2097         /*Link child id properties now*/
2098         for (loop=prop->data.group.first; loop; loop=loop->next) {
2099                 IDP_DirectLinkProperty(loop, switch_endian, fd);
2100         }
2101 }
2102
2103 static void IDP_DirectLinkProperty(IDProperty *prop, int switch_endian, FileData *fd)
2104 {
2105         switch (prop->type) {
2106                 case IDP_GROUP:
2107                         IDP_DirectLinkGroup(prop, switch_endian, fd);
2108                         break;
2109                 case IDP_STRING:
2110                         IDP_DirectLinkString(prop, fd);
2111                         break;
2112                 case IDP_ARRAY:
2113                         IDP_DirectLinkArray(prop, switch_endian, fd);
2114                         break;
2115                 case IDP_IDPARRAY:
2116                         IDP_DirectLinkIDPArray(prop, switch_endian, fd);
2117                         break;
2118                 case IDP_DOUBLE:
2119                         /* erg, stupid doubles.  since I'm storing them
2120                          * in the same field as int val; val2 in the
2121                          * IDPropertyData struct, they have to deal with
2122                          * endianness specifically
2123                          *
2124                          * in theory, val and val2 would've already been swapped
2125                          * if switch_endian is true, so we have to first unswap
2126                          * them then reswap them as a single 64-bit entity.
2127                          */
2128
2129                         if (switch_endian) {
2130                                 BLI_endian_switch_int32(&prop->data.val);
2131                                 BLI_endian_switch_int32(&prop->data.val2);
2132                                 BLI_endian_switch_int64((int64_t *)&prop->data.val);
2133                         }
2134                         break;
2135                 case IDP_INT:
2136                 case IDP_FLOAT:
2137                 case IDP_ID:
2138                         break;  /* Nothing special to do here. */
2139                 default:
2140                         /* Unknown IDP type, nuke it (we cannot handle unknown types everywhere in code,
2141                          * IDP are way too polymorphic to do it safely. */
2142                         printf("%s: found unknown IDProperty type %d, reset to Integer one !\n", __func__, prop->type);
2143                         /* Note: we do not attempt to free unknown prop, we have no way to know how to do that! */
2144                         prop->type = IDP_INT;
2145                         prop->subtype = 0;
2146                         IDP_Int(prop) = 0;
2147         }
2148 }
2149
2150 #define IDP_DirectLinkGroup_OrFree(prop, switch_endian, fd) \
2151        _IDP_DirectLinkGroup_OrFree(prop, switch_endian, fd, __func__)
2152
2153 static void _IDP_DirectLinkGroup_OrFree(IDProperty **prop, int switch_endian, FileData *fd,
2154                                         const char *caller_func_id)
2155 {
2156         if (*prop) {
2157                 if ((*prop)->type == IDP_GROUP) {
2158                         IDP_DirectLinkGroup(*prop, switch_endian, fd);
2159                 }
2160                 else {
2161                         /* corrupt file! */
2162                         printf("%s: found non group data, freeing type %d!\n",
2163                                caller_func_id, (*prop)->type);
2164                         /* don't risk id, data's likely corrupt. */
2165                         // IDP_FreeProperty(*prop);
2166                         *prop = NULL;
2167                 }
2168         }
2169 }
2170
2171 static void IDP_LibLinkProperty(IDProperty *prop, FileData *fd)
2172 {
2173         if (!prop)
2174                 return;
2175
2176         switch (prop->type) {
2177                 case IDP_ID: /* PointerProperty */
2178                 {
2179                         void *newaddr = newlibadr_us(fd, NULL, IDP_Id(prop));
2180                         if (IDP_Id(prop) && !newaddr && G.debug) {
2181                                 printf("Error while loading \"%s\". Data not found in file!\n", prop->name);
2182                         }
2183                         prop->data.pointer = newaddr;
2184                         break;
2185                 }
2186                 case IDP_IDPARRAY: /* CollectionProperty */
2187                 {
2188                         IDProperty *idp_array = IDP_IDPArray(prop);
2189                         for (int i = 0; i < prop->len; i++) {
2190                                 IDP_LibLinkProperty(&(idp_array[i]), fd);
2191                         }
2192                         break;
2193                 }
2194                 case IDP_GROUP: /* PointerProperty */
2195                 {
2196                         for (IDProperty *loop = prop->data.group.first; loop; loop = loop->next) {
2197                                 IDP_LibLinkProperty(loop, fd);
2198                         }
2199                         break;
2200                 }
2201                 default:
2202                         break;  /* Nothing to do for other IDProps. */
2203         }
2204 }
2205
2206 /* ************ READ IMAGE PREVIEW *************** */
2207
2208 static PreviewImage *direct_link_preview_image(FileData *fd, PreviewImage *old_prv)
2209 {
2210         PreviewImage *prv = newdataadr(fd, old_prv);
2211
2212         if (prv) {
2213                 int i;
2214                 for (i = 0; i < NUM_ICON_SIZES; ++i) {
2215                         if (prv->rect[i]) {
2216                                 prv->rect[i] = newdataadr(fd, prv->rect[i]);
2217                         }
2218                         prv->gputexture[i] = NULL;
2219                 }
2220                 prv->icon_id = 0;
2221                 prv->tag = 0;
2222         }
2223
2224         return prv;
2225 }
2226
2227 /* ************ READ ID *************** */
2228
2229 static void direct_link_id(FileData *fd, ID *id)
2230 {
2231         /*link direct data of ID properties*/
2232         if (id->properties) {
2233                 id->properties = newdataadr(fd, id->properties);
2234                 /* this case means the data was written incorrectly, it should not happen */
2235                 IDP_DirectLinkGroup_OrFree(&id->properties, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2236         }
2237         id->py_instance = NULL;
2238 }
2239
2240 /* ************ READ CurveMapping *************** */
2241
2242 /* cuma itself has been read! */
2243 static void direct_link_curvemapping(FileData *fd, CurveMapping *cumap)
2244 {
2245         int a;
2246
2247         /* flag seems to be able to hang? Maybe old files... not bad to clear anyway */
2248         cumap->flag &= ~CUMA_PREMULLED;
2249
2250         for (a = 0; a < CM_TOT; a++) {
2251                 cumap->cm[a].curve = newdataadr(fd, cumap->cm[a].curve);
2252                 cumap->cm[a].table = NULL;
2253                 cumap->cm[a].premultable = NULL;
2254         }
2255 }
2256
2257 /* ************ READ Brush *************** */
2258 /* library brush linking after fileread */
2259 static void lib_link_brush(FileData *fd, Main *main)
2260 {
2261         /* only link ID pointers */
2262         for (Brush *brush = main->brush.first; brush; brush = brush->id.next) {
2263                 if (brush->id.tag & LIB_TAG_NEED_LINK) {
2264                         IDP_LibLinkProperty(brush->id.properties, fd);
2265
2266                         /* brush->(mask_)mtex.obj is ignored on purpose? */
2267                         brush->mtex.tex = newlibadr_us(fd, brush->id.lib, brush->mtex.tex);
2268                         brush->mask_mtex.tex = newlibadr_us(fd, brush->id.lib, brush->mask_mtex.tex);
2269                         brush->clone.image = newlibadr(fd, brush->id.lib, brush->clone.image);
2270                         brush->toggle_brush = newlibadr(fd, brush->id.lib, brush->toggle_brush);
2271                         brush->paint_curve = newlibadr_us(fd, brush->id.lib, brush->paint_curve);
2272
2273                         brush->id.tag &= ~LIB_TAG_NEED_LINK;
2274                 }
2275         }
2276 }
2277
2278 static void direct_link_brush(FileData *fd, Brush *brush)
2279 {
2280         /* brush itself has been read */
2281
2282         /* fallof curve */
2283         brush->curve = newdataadr(fd, brush->curve);
2284         brush->gradient = newdataadr(fd, brush->gradient);
2285
2286         if (brush->curve)
2287                 direct_link_curvemapping(fd, brush->curve);
2288         else
2289                 BKE_brush_curve_preset(brush, CURVE_PRESET_SHARP);
2290
2291         brush->preview = NULL;
2292         brush->icon_imbuf = NULL;
2293 }
2294
2295 /* ************ READ Palette *************** */
2296 static void lib_link_palette(FileData *fd, Main *main)
2297 {
2298         /* only link ID pointers */
2299         for (Palette *palette = main->palettes.first; palette; palette = palette->id.next) {
2300                 if (palette->id.tag & LIB_TAG_NEED_LINK) {
2301                         IDP_LibLinkProperty(palette->id.properties, fd);
2302
2303                         palette->id.tag &= ~LIB_TAG_NEED_LINK;
2304                 }
2305         }
2306 }
2307
2308 static void direct_link_palette(FileData *fd, Palette *palette)
2309 {
2310         /* palette itself has been read */
2311         link_list(fd, &palette->colors);
2312 }
2313
2314 static void lib_link_paint_curve(FileData *fd, Main *main)
2315 {
2316         /* only link ID pointers */
2317         for (PaintCurve *pc = main->paintcurves.first; pc; pc = pc->id.next) {
2318                 if (pc->id.tag & LIB_TAG_NEED_LINK) {
2319                         IDP_LibLinkProperty(pc->id.properties, fd);
2320
2321                         pc->id.tag &= ~LIB_TAG_NEED_LINK;
2322                 }
2323         }
2324 }
2325
2326 static void direct_link_paint_curve(FileData *fd, PaintCurve *pc)
2327 {
2328         pc->points = newdataadr(fd, pc->points);
2329 }
2330
2331 /* ************ READ PACKEDFILE *************** */
2332
2333 static PackedFile *direct_link_packedfile(FileData *fd, PackedFile *oldpf)
2334 {
2335         PackedFile *pf = newpackedadr(fd, oldpf);
2336
2337         if (pf) {
2338                 pf->data = newpackedadr(fd, pf->data);
2339         }
2340
2341         return pf;
2342 }
2343
2344 /* ************ READ ANIMATION STUFF ***************** */
2345
2346 /* Legacy Data Support (for Version Patching) ----------------------------- */
2347
2348 // XXX deprecated - old animation system
2349 static void lib_link_ipo(FileData *fd, Main *main)
2350 {
2351         Ipo *ipo;
2352
2353         for (ipo = main->ipo.first; ipo; ipo = ipo->id.next) {
2354                 if (ipo->id.tag & LIB_TAG_NEED_LINK) {
2355                         IpoCurve *icu;
2356                         for (icu = ipo->curve.first; icu; icu = icu->next) {
2357                                 if (icu->driver)
2358                                         icu->driver->ob = newlibadr(fd, ipo->id.lib, icu->driver->ob);
2359                         }
2360                         ipo->id.tag &= ~LIB_TAG_NEED_LINK;
2361                 }
2362         }
2363 }
2364
2365 // XXX deprecated - old animation system
2366 static void direct_link_ipo(FileData *fd, Ipo *ipo)
2367 {
2368         IpoCurve *icu;
2369
2370         link_list(fd, &(ipo->curve));
2371
2372         for (icu = ipo->curve.first; icu; icu = icu->next) {
2373                 icu->bezt = newdataadr(fd, icu->bezt);
2374                 icu->bp = newdataadr(fd, icu->bp);
2375                 icu->driver = newdataadr(fd, icu->driver);
2376         }
2377 }
2378
2379 // XXX deprecated - old animation system
2380 static void lib_link_nlastrips(FileData *fd, ID *id, ListBase *striplist)
2381 {
2382         bActionStrip *strip;
2383         bActionModifier *amod;
2384
2385         for (strip=striplist->first; strip; strip=strip->next) {
2386                 strip->object = newlibadr(fd, id->lib, strip->object);
2387                 strip->act = newlibadr_us(fd, id->lib, strip->act);
2388                 strip->ipo = newlibadr(fd, id->lib, strip->ipo);
2389                 for (amod = strip->modifiers.first; amod; amod = amod->next)
2390                         amod->ob = newlibadr(fd, id->lib, amod->ob);
2391         }
2392 }
2393
2394 // XXX deprecated - old animation system
2395 static void direct_link_nlastrips(FileData *fd, ListBase *strips)
2396 {
2397         bActionStrip *strip;
2398
2399         link_list(fd, strips);
2400
2401         for (strip = strips->first; strip; strip = strip->next)
2402                 link_list(fd, &strip->modifiers);
2403 }
2404
2405 // XXX deprecated - old animation system
2406 static void lib_link_constraint_channels(FileData *fd, ID *id, ListBase *chanbase)
2407 {
2408         bConstraintChannel *chan;
2409
2410         for (chan=chanbase->first; chan; chan=chan->next) {
2411                 chan->ipo = newlibadr_us(fd, id->lib, chan->ipo);
2412         }
2413 }
2414
2415 /* Data Linking ----------------------------- */
2416
2417 static void lib_link_fmodifiers(FileData *fd, ID *id, ListBase *list)
2418 {
2419         FModifier *fcm;
2420
2421         for (fcm = list->first; fcm; fcm = fcm->next) {
2422                 /* data for specific modifiers */
2423                 switch (fcm->type) {
2424                         case FMODIFIER_TYPE_PYTHON:
2425                         {
2426                                 FMod_Python *data = (FMod_Python *)fcm->data;
2427                                 data->script = newlibadr(fd, id->lib, data->script);
2428
2429                                 break;
2430                         }
2431                 }
2432         }
2433 }
2434
2435 static void lib_link_fcurves(FileData *fd, ID *id, ListBase *list)
2436 {
2437         FCurve *fcu;
2438
2439         if (list == NULL)
2440                 return;
2441
2442         /* relink ID-block references... */
2443         for (fcu = list->first; fcu; fcu = fcu->next) {
2444                 /* driver data */
2445                 if (fcu->driver) {
2446                         ChannelDriver *driver = fcu->driver;
2447                         DriverVar *dvar;
2448
2449                         for (dvar= driver->variables.first; dvar; dvar= dvar->next) {
2450                                 DRIVER_TARGETS_LOOPER(dvar)
2451                                 {
2452                                         /* only relink if still used */
2453                                         if (tarIndex < dvar->num_targets)
2454                                                 dtar->id = newlibadr(fd, id->lib, dtar->id);
2455                                         else
2456                                                 dtar->id = NULL;
2457                                 }
2458                                 DRIVER_TARGETS_LOOPER_END
2459                         }
2460                 }
2461
2462                 /* modifiers */
2463                 lib_link_fmodifiers(fd, id, &fcu->modifiers);
2464         }
2465 }
2466
2467
2468 /* NOTE: this assumes that link_list has already been called on the list */
2469 static void direct_link_fmodifiers(FileData *fd, ListBase *list, FCurve *curve)
2470 {
2471         FModifier *fcm;
2472
2473         for (fcm = list->first; fcm; fcm = fcm->next) {
2474                 /* relink general data */
2475                 fcm->data  = newdataadr(fd, fcm->data);
2476                 fcm->curve = curve;
2477
2478                 /* do relinking of data for specific types */
2479                 switch (fcm->type) {
2480                         case FMODIFIER_TYPE_GENERATOR:
2481                         {
2482                                 FMod_Generator *data = (FMod_Generator *)fcm->data;
2483
2484                                 data->coefficients = newdataadr(fd, data->coefficients);
2485
2486                                 if (fd->flags & FD_FLAGS_SWITCH_ENDIAN) {
2487                                         BLI_endian_switch_float_array(data->coefficients, data->arraysize);
2488                                 }
2489
2490                                 break;
2491                         }
2492                         case FMODIFIER_TYPE_ENVELOPE:
2493                         {
2494                                 FMod_Envelope *data=  (FMod_Envelope *)fcm->data;
2495
2496                                 data->data= newdataadr(fd, data->data);
2497
2498                                 break;
2499                         }
2500                         case FMODIFIER_TYPE_PYTHON:
2501                         {
2502                                 FMod_Python *data = (FMod_Python *)fcm->data;
2503
2504                                 data->prop = newdataadr(fd, data->prop);
2505                                 IDP_DirectLinkGroup_OrFree(&data->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2506
2507                                 break;
2508                         }
2509                 }
2510         }
2511 }
2512
2513 /* NOTE: this assumes that link_list has already been called on the list */
2514 static void direct_link_fcurves(FileData *fd, ListBase *list)
2515 {
2516         FCurve *fcu;
2517
2518         /* link F-Curve data to F-Curve again (non ID-libs) */
2519         for (fcu = list->first; fcu; fcu = fcu->next) {
2520                 /* curve data */
2521                 fcu->bezt = newdataadr(fd, fcu->bezt);
2522                 fcu->fpt = newdataadr(fd, fcu->fpt);
2523
2524                 /* rna path */
2525                 fcu->rna_path = newdataadr(fd, fcu->rna_path);
2526
2527                 /* group */
2528                 fcu->grp = newdataadr_ex(fd, fcu->grp, false);
2529
2530                 /* clear disabled flag - allows disabled drivers to be tried again ([#32155]),
2531                  * but also means that another method for "reviving disabled F-Curves" exists
2532                  */
2533                 fcu->flag &= ~FCURVE_DISABLED;
2534
2535                 /* driver */
2536                 fcu->driver= newdataadr(fd, fcu->driver);
2537                 if (fcu->driver) {
2538                         ChannelDriver *driver= fcu->driver;
2539                         DriverVar *dvar;
2540
2541                         /* compiled expression data will need to be regenerated (old pointer may still be set here) */
2542                         driver->expr_comp = NULL;
2543
2544                         /* give the driver a fresh chance - the operating environment may be different now
2545                          * (addons, etc. may be different) so the driver namespace may be sane now [#32155]
2546                          */
2547                         driver->flag &= ~DRIVER_FLAG_INVALID;
2548
2549                         /* relink variables, targets and their paths */
2550                         link_list(fd, &driver->variables);
2551                         for (dvar= driver->variables.first; dvar; dvar= dvar->next) {
2552                                 DRIVER_TARGETS_LOOPER(dvar)
2553                                 {
2554                                         /* only relink the targets being used */
2555                                         if (tarIndex < dvar->num_targets)
2556                                                 dtar->rna_path = newdataadr(fd, dtar->rna_path);
2557                                         else
2558                                                 dtar->rna_path = NULL;
2559                                 }
2560                                 DRIVER_TARGETS_LOOPER_END
2561                         }
2562                 }
2563
2564                 /* modifiers */
2565                 link_list(fd, &fcu->modifiers);
2566                 direct_link_fmodifiers(fd, &fcu->modifiers, fcu);
2567         }
2568 }
2569
2570
2571 static void lib_link_action(FileData *fd, Main *main)
2572 {
2573         for (bAction *act = main->action.first; act; act = act->id.next) {
2574                 if (act->id.tag & LIB_TAG_NEED_LINK) {
2575                         IDP_LibLinkProperty(act->id.properties, fd);
2576
2577 // XXX deprecated - old animation system <<<
2578                         for (bActionChannel *chan = act->chanbase.first; chan; chan = chan->next) {
2579                                 chan->ipo = newlibadr_us(fd, act->id.lib, chan->ipo);
2580                                 lib_link_constraint_channels(fd, &act->id, &chan->constraintChannels);
2581                         }
2582 // >>> XXX deprecated - old animation system
2583
2584                         lib_link_fcurves(fd, &act->id, &act->curves);
2585
2586                         for (TimeMarker *marker = act->markers.first; marker; marker = marker->next) {
2587                                 if (marker->camera) {
2588                                         marker->camera = newlibadr(fd, act->id.lib, marker->camera);
2589                                 }
2590                         }
2591
2592                         act->id.tag &= ~LIB_TAG_NEED_LINK;
2593                 }
2594         }
2595 }
2596
2597 static void direct_link_action(FileData *fd, bAction *act)
2598 {
2599         bActionChannel *achan; // XXX deprecated - old animation system
2600         bActionGroup *agrp;
2601
2602         link_list(fd, &act->curves);
2603         link_list(fd, &act->chanbase); // XXX deprecated - old animation system
2604         link_list(fd, &act->groups);
2605         link_list(fd, &act->markers);
2606
2607 // XXX deprecated - old animation system <<<
2608         for (achan = act->chanbase.first; achan; achan=achan->next) {
2609                 achan->grp = newdataadr(fd, achan->grp);
2610
2611                 link_list(fd, &achan->constraintChannels);
2612         }
2613 // >>> XXX deprecated - old animation system
2614
2615         direct_link_fcurves(fd, &act->curves);
2616
2617         for (agrp = act->groups.first; agrp; agrp= agrp->next) {
2618                 agrp->channels.first= newdataadr(fd, agrp->channels.first);
2619                 agrp->channels.last= newdataadr(fd, agrp->channels.last);
2620         }
2621 }
2622
2623 static void lib_link_nladata_strips(FileData *fd, ID *id, ListBase *list)
2624 {
2625         NlaStrip *strip;
2626
2627         for (strip = list->first; strip; strip = strip->next) {
2628                 /* check strip's children */
2629                 lib_link_nladata_strips(fd, id, &strip->strips);
2630
2631                 /* check strip's F-Curves */
2632                 lib_link_fcurves(fd, id, &strip->fcurves);
2633
2634                 /* reassign the counted-reference to action */
2635                 strip->act = newlibadr_us(fd, id->lib, strip->act);
2636
2637                 /* fix action id-root (i.e. if it comes from a pre 2.57 .blend file) */
2638                 if ((strip->act) && (strip->act->idroot == 0))
2639                         strip->act->idroot = GS(id->name);
2640         }
2641 }
2642
2643 static void lib_link_nladata(FileData *fd, ID *id, ListBase *list)
2644 {
2645         NlaTrack *nlt;
2646
2647         /* we only care about the NLA strips inside the tracks */
2648         for (nlt = list->first; nlt; nlt = nlt->next) {
2649                 lib_link_nladata_strips(fd, id, &nlt->strips);
2650         }
2651 }
2652
2653 /* This handles Animato NLA-Strips linking
2654  * NOTE: this assumes that link_list has already been called on the list
2655  */
2656 static void direct_link_nladata_strips(FileData *fd, ListBase *list)
2657 {
2658         NlaStrip *strip;
2659
2660         for (strip = list->first; strip; strip = strip->next) {
2661                 /* strip's child strips */
2662                 link_list(fd, &strip->strips);
2663                 direct_link_nladata_strips(fd, &strip->strips);
2664
2665                 /* strip's F-Curves */
2666                 link_list(fd, &strip->fcurves);
2667                 direct_link_fcurves(fd, &strip->fcurves);
2668
2669                 /* strip's F-Modifiers */
2670                 link_list(fd, &strip->modifiers);
2671                 direct_link_fmodifiers(fd, &strip->modifiers, NULL);
2672         }
2673 }
2674
2675 /* NOTE: this assumes that link_list has already been called on the list */
2676 static void direct_link_nladata(FileData *fd, ListBase *list)
2677 {
2678         NlaTrack *nlt;
2679
2680         for (nlt = list->first; nlt; nlt = nlt->next) {
2681                 /* relink list of strips */
2682                 link_list(fd, &nlt->strips);
2683
2684                 /* relink strip data */
2685                 direct_link_nladata_strips(fd, &nlt->strips);
2686         }
2687 }
2688
2689 /* ------- */
2690
2691 static void lib_link_keyingsets(FileData *fd, ID *id, ListBase *list)
2692 {
2693         KeyingSet *ks;
2694         KS_Path *ksp;
2695
2696         /* here, we're only interested in the ID pointer stored in some of the paths */
2697         for (ks = list->first; ks; ks = ks->next) {
2698                 for (ksp = ks->paths.first; ksp; ksp = ksp->next) {
2699                         ksp->id= newlibadr(fd, id->lib, ksp->id);
2700                 }
2701         }
2702 }
2703
2704 /* NOTE: this assumes that link_list has already been called on the list */
2705 static void direct_link_keyingsets(FileData *fd, ListBase *list)
2706 {
2707         KeyingSet *ks;
2708         KS_Path *ksp;
2709
2710         /* link KeyingSet data to KeyingSet again (non ID-libs) */
2711         for (ks = list->first; ks; ks = ks->next) {
2712                 /* paths */
2713                 link_list(fd, &ks->paths);
2714
2715                 for (ksp = ks->paths.first; ksp; ksp = ksp->next) {
2716                         /* rna path */
2717                         ksp->rna_path= newdataadr(fd, ksp->rna_path);
2718                 }
2719         }
2720 }
2721
2722 /* ------- */
2723
2724 static void lib_link_animdata(FileData *fd, ID *id, AnimData *adt)
2725 {
2726         if (adt == NULL)
2727                 return;
2728
2729         /* link action data */
2730         adt->action= newlibadr_us(fd, id->lib, adt->action);
2731         adt->tmpact= newlibadr_us(fd, id->lib, adt->tmpact);
2732
2733         /* fix action id-roots (i.e. if they come from a pre 2.57 .blend file) */
2734         if ((adt->action) && (adt->action->idroot == 0))
2735                 adt->action->idroot = GS(id->name);
2736         if ((adt->tmpact) && (adt->tmpact->idroot == 0))
2737                 adt->tmpact->idroot = GS(id->name);
2738
2739         /* link drivers */
2740         lib_link_fcurves(fd, id, &adt->drivers);
2741
2742         /* overrides don't have lib-link for now, so no need to do anything */
2743
2744         /* link NLA-data */
2745         lib_link_nladata(fd, id, &adt->nla_tracks);
2746 }
2747
2748 static void direct_link_animdata(FileData *fd, AnimData *adt)
2749 {
2750         /* NOTE: must have called newdataadr already before doing this... */
2751         if (adt == NULL)
2752                 return;
2753
2754         /* link drivers */
2755         link_list(fd, &adt->drivers);
2756         direct_link_fcurves(fd, &adt->drivers);
2757
2758         /* link overrides */
2759         // TODO...
2760
2761         /* link NLA-data */
2762         link_list(fd, &adt->nla_tracks);
2763         direct_link_nladata(fd, &adt->nla_tracks);
2764
2765         /* relink active track/strip - even though strictly speaking this should only be used
2766          * if we're in 'tweaking mode', we need to be able to have this loaded back for
2767          * undo, but also since users may not exit tweakmode before saving (#24535)
2768          */
2769         // TODO: it's not really nice that anyone should be able to save the file in this
2770         //              state, but it's going to be too hard to enforce this single case...
2771         adt->act_track = newdataadr(fd, adt->act_track);
2772         adt->actstrip = newdataadr(fd, adt->actstrip);
2773 }
2774
2775 /* ************ READ CACHEFILES *************** */
2776
2777 static void lib_link_cachefiles(FileData *fd, Main *bmain)
2778 {
2779         /* only link ID pointers */
2780         for (CacheFile *cache_file = bmain->cachefiles.first; cache_file; cache_file = cache_file->id.next) {
2781                 if (cache_file->id.tag & LIB_TAG_NEED_LINK) {
2782                         IDP_LibLinkProperty(cache_file->id.properties, fd);
2783                         lib_link_animdata(fd, &cache_file->id, cache_file->adt);
2784
2785                         cache_file->id.tag &= ~LIB_TAG_NEED_LINK;
2786                 }
2787         }
2788 }
2789
2790 static void direct_link_cachefile(FileData *fd, CacheFile *cache_file)
2791 {
2792         BLI_listbase_clear(&cache_file->object_paths);
2793         cache_file->handle = NULL;
2794         cache_file->handle_mutex = NULL;
2795
2796         /* relink animdata */
2797         cache_file->adt = newdataadr(fd, cache_file->adt);
2798         direct_link_animdata(fd, cache_file->adt);
2799 }
2800
2801 /* ************ READ MOTION PATHS *************** */
2802
2803 /* direct data for cache */
2804 static void direct_link_motionpath(FileData *fd, bMotionPath *mpath)
2805 {
2806         /* sanity check */
2807         if (mpath == NULL)
2808                 return;
2809
2810         /* relink points cache */
2811         mpath->points = newdataadr(fd, mpath->points);
2812 }
2813
2814 /* ************ READ NODE TREE *************** */
2815
2816 /* Single node tree (also used for material/scene trees), ntree is not NULL */
2817 static void lib_link_ntree(FileData *fd, ID *id, bNodeTree *ntree)
2818 {
2819         bNode *node;
2820         bNodeSocket *sock;
2821
2822         IDP_LibLinkProperty(ntree->id.properties, fd);
2823         lib_link_animdata(fd, &ntree->id, ntree->adt);
2824
2825         ntree->gpd = newlibadr_us(fd, id->lib, ntree->gpd);
2826
2827         for (node = ntree->nodes.first; node; node = node->next) {
2828                 /* Link ID Properties -- and copy this comment EXACTLY for easy finding
2829                  * of library blocks that implement this.*/
2830                 IDP_LibLinkProperty(node->prop, fd);
2831
2832                 node->id = newlibadr_us(fd, id->lib, node->id);
2833
2834                 for (sock = node->inputs.first; sock; sock = sock->next) {
2835                         IDP_LibLinkProperty(sock->prop, fd);
2836                 }
2837                 for (sock = node->outputs.first; sock; sock = sock->next) {
2838                         IDP_LibLinkProperty(sock->prop, fd);
2839                 }
2840         }
2841
2842         for (sock = ntree->inputs.first; sock; sock = sock->next) {
2843                 IDP_LibLinkProperty(sock->prop, fd);
2844         }
2845         for (sock = ntree->outputs.first; sock; sock = sock->next) {
2846                 IDP_LibLinkProperty(sock->prop, fd);
2847         }
2848 }
2849
2850 /* library ntree linking after fileread */
2851 static void lib_link_nodetree(FileData *fd, Main *main)
2852 {
2853         /* only link ID pointers */
2854         for (bNodeTree *ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
2855                 if (ntree->id.tag & LIB_TAG_NEED_LINK) {
2856                         lib_link_ntree(fd, &ntree->id, ntree);
2857
2858                         ntree->id.tag &= ~LIB_TAG_NEED_LINK;
2859                 }
2860         }
2861 }
2862
2863 /* updates group node socket identifier so that
2864  * external links to/from the group node are preserved.
2865  */
2866 static void lib_node_do_versions_group_indices(bNode *gnode)
2867 {
2868         bNodeTree *ngroup = (bNodeTree*)gnode->id;
2869         bNodeSocket *sock;
2870         bNodeLink *link;
2871
2872         for (sock=gnode->outputs.first; sock; sock = sock->next) {
2873                 int old_index = sock->to_index;
2874
2875                 for (link = ngroup->links.first; link; link = link->next) {
2876                         if (link->tonode == NULL && link->fromsock->own_index == old_index) {
2877                                 strcpy(sock->identifier, link->fromsock->identifier);
2878                                 /* deprecated */
2879                                 sock->own_index = link->fromsock->own_index;
2880                                 sock->to_index = 0;
2881                                 sock->groupsock = NULL;
2882                         }
2883                 }
2884         }
2885         for (sock=gnode->inputs.first; sock; sock = sock->next) {
2886                 int old_index = sock->to_index;
2887
2888                 for (link = ngroup->links.first; link; link = link->next) {
2889                         if (link->fromnode == NULL && link->tosock->own_index == old_index) {
2890                                 strcpy(sock->identifier, link->tosock->identifier);
2891                                 /* deprecated */
2892                                 sock->own_index = link->tosock->own_index;
2893                                 sock->to_index = 0;
2894                                 sock->groupsock = NULL;
2895                         }
2896                 }
2897         }
2898 }
2899
2900 /* verify types for nodes and groups, all data has to be read */
2901 /* open = 0: appending/linking, open = 1: open new file (need to clean out dynamic
2902  * typedefs */
2903 static void lib_verify_nodetree(Main *main, int UNUSED(open))
2904 {
2905         /* this crashes blender on undo/redo */
2906 #if 0
2907                 if (open == 1) {
2908                         reinit_nodesystem();
2909                 }
2910 #endif
2911
2912         /* set node->typeinfo pointers */
2913         FOREACH_NODETREE(main, ntree, id) {
2914                 ntreeSetTypes(NULL, ntree);
2915         } FOREACH_NODETREE_END
2916
2917         /* verify static socket templates */
2918         FOREACH_NODETREE(main, ntree, id) {
2919                 bNode *node;
2920                 for (node=ntree->nodes.first; node; node=node->next)
2921                         node_verify_socket_templates(ntree, node);
2922         } FOREACH_NODETREE_END
2923
2924         {
2925                 bool has_old_groups = false;
2926                 /* XXX this should actually be part of do_versions, but since we need
2927                  * finished library linking, it is not possible there. Instead in do_versions
2928                  * we have set the NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2 flag, so at this point we can do the
2929                  * actual group node updates.
2930                  */
2931                 for (bNodeTree *ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
2932                         if (ntree->flag & NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2) {
2933                                 has_old_groups = 1;
2934                         }
2935                 }
2936
2937                 if (has_old_groups) {
2938                         FOREACH_NODETREE(main, ntree, id) {
2939                                 /* updates external links for all group nodes in a tree */
2940                                 bNode *node;
2941                                 for (node = ntree->nodes.first; node; node = node->next) {
2942                                         if (node->type == NODE_GROUP) {
2943                                                 bNodeTree *ngroup = (bNodeTree*)node->id;
2944                                                 if (ngroup && (ngroup->flag & NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2))
2945                                                         lib_node_do_versions_group_indices(node);
2946                                         }
2947                                 }
2948                         } FOREACH_NODETREE_END
2949                 }
2950
2951                 for (bNodeTree *ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
2952                         ntree->flag &= ~NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2;
2953                 }
2954         }
2955
2956         {
2957                 /* Convert the previously used ntree->inputs/ntree->outputs lists to interface nodes.
2958                  * Pre 2.56.2 node trees automatically have all unlinked sockets exposed already
2959                  * (see NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2).
2960                  *
2961                  * XXX this should actually be part of do_versions,
2962                  * but needs valid typeinfo pointers to create interface nodes.
2963                  *
2964                  * Note: theoretically only needed in node groups (main->nodetree),
2965                  * but due to a temporary bug such links could have been added in all trees,
2966                  * so have to clean up all of them ...
2967                  */
2968
2969                 FOREACH_NODETREE(main, ntree, id) {
2970                         if (ntree->flag & NTREE_DO_VERSIONS_CUSTOMNODES_GROUP) {
2971                                 bNode *input_node = NULL, *output_node = NULL;
2972                                 int num_inputs = 0, num_outputs = 0;
2973                                 bNodeLink *link, *next_link;
2974                                 /* Only create new interface nodes for actual older files.
2975                                  * New file versions already have input/output nodes with duplicate links,
2976                                  * in that case just remove the invalid links.
2977                                  */
2978                                 const bool create_io_nodes = (ntree->flag & NTREE_DO_VERSIONS_CUSTOMNODES_GROUP_CREATE_INTERFACE) != 0;
2979
2980                                 float input_locx = 1000000.0f, input_locy = 0.0f;
2981                                 float output_locx = -1000000.0f, output_locy = 0.0f;
2982                                 /* rough guess, not nice but we don't have access to UI constants here ... */
2983                                 static const float offsetx = 42 + 3*20 + 20;
2984                                 /*static const float offsety = 0.0f;*/
2985
2986                                 if (create_io_nodes) {
2987                                         if (ntree->inputs.first)
2988                                                 input_node = nodeAddStaticNode(NULL, ntree, NODE_GROUP_INPUT);
2989
2990                                         if (ntree->outputs.first)
2991                                                 output_node = nodeAddStaticNode(NULL, ntree, NODE_GROUP_OUTPUT);
2992                                 }
2993
2994                                 /* Redirect links from/to the node tree interface to input/output node.
2995                                  * If the fromnode/tonode pointers are NULL, this means a link from/to
2996                                  * the ntree interface sockets, which need to be redirected to new interface nodes.
2997                                  */
2998                                 for (link = ntree->links.first; link; link = next_link) {
2999                                         bool free_link = false;
3000                                         next_link = link->next;
3001
3002                                         if (link->fromnode == NULL) {
3003                                                 if (input_node) {
3004                                                         link->fromnode = input_node;
3005                                                         link->fromsock = node_group_input_find_socket(input_node, link->fromsock->identifier);
3006                                                         ++num_inputs;
3007
3008                                                         if (link->tonode) {
3009                                                                 if (input_locx > link->tonode->locx - offsetx)
3010                                                                         input_locx = link->tonode->locx - offsetx;
3011                                                                 input_locy += link->tonode->locy;
3012                                                         }
3013                                                 }
3014                                                 else {
3015                                                         free_link = true;
3016                                                 }
3017                                         }
3018
3019                                         if (link->tonode == NULL) {
3020                                                 if (output_node) {
3021                                                         link->tonode = output_node;
3022                                                         link->tosock = node_group_output_find_socket(output_node, link->tosock->identifier);
3023                                                         ++num_outputs;
3024
3025                                                         if (link->fromnode) {
3026                                                                 if (output_locx < link->fromnode->locx + offsetx)
3027                                                                         output_locx = link->fromnode->locx + offsetx;
3028                                                                 output_locy += link->fromnode->locy;
3029                                                         }
3030                                                 }
3031                                                 else {
3032                                                         free_link = true;
3033                                                 }
3034                                         }
3035
3036                                         if (free_link)
3037                                                 nodeRemLink(ntree, link);
3038                                 }
3039
3040                                 if (num_inputs > 0) {
3041                                         input_locy /= num_inputs;
3042                                         input_node->locx = input_locx;
3043                                         input_node->locy = input_locy;
3044                                 }
3045                                 if (num_outputs > 0) {
3046                                         output_locy /= num_outputs;
3047                                         output_node->locx = output_locx;
3048                                         output_node->locy = output_locy;
3049                                 }
3050
3051                                 /* clear do_versions flags */
3052                                 ntree->flag &= ~(NTREE_DO_VERSIONS_CUSTOMNODES_GROUP | NTREE_DO_VERSIONS_CUSTOMNODES_GROUP_CREATE_INTERFACE);
3053                         }
3054                 }
3055                 FOREACH_NODETREE_END
3056         }
3057
3058         /* verify all group user nodes */
3059         for (bNodeTree *ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
3060                 ntreeVerifyNodes(main, &ntree->id);
3061         }
3062
3063         /* make update calls where necessary */
3064         {
3065                 FOREACH_NODETREE(main, ntree, id) {
3066                         /* make an update call for the tree */
3067                         ntreeUpdateTree(main, ntree);
3068                 } FOREACH_NODETREE_END
3069         }
3070 }
3071
3072 static void direct_link_node_socket(FileData *fd, bNodeSocket *sock)
3073 {
3074         sock->prop = newdataadr(fd, sock->prop);
3075         IDP_DirectLinkGroup_OrFree(&sock->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
3076
3077         sock->link = newdataadr(fd, sock->link);
3078         sock->typeinfo = NULL;
3079         sock->storage = newdataadr(fd, sock->storage);
3080         sock->default_value = newdataadr(fd, sock->default_value);
3081         sock->cache = NULL;
3082 }
3083
3084 /* ntree itself has been read! */
3085 static void direct_link_nodetree(FileData *fd, bNodeTree *ntree)
3086 {
3087         /* note: writing and reading goes in sync, for speed */
3088         bNode *node;
3089         bNodeSocket *sock;
3090         bNodeLink *link;
3091
3092         ntree->init = 0;                /* to set callbacks and force setting types */
3093         ntree->is_updating = false;
3094         ntree->typeinfo= NULL;
3095         ntree->interface_type = NULL;
3096
3097         ntree->progress = NULL;
3098         ntree->execdata = NULL;
3099         ntree->duplilock = NULL;
3100
3101         ntree->adt = newdataadr(fd, ntree->adt);
3102         direct_link_animdata(fd, ntree->adt);
3103
3104         ntree->id.recalc &= ~ID_RECALC_ALL;
3105
3106         link_list(fd, &ntree->nodes);
3107         for (node = ntree->nodes.first; node; node = node->next) {
3108                 node->typeinfo = NULL;
3109
3110                 link_list(fd, &node->inputs);
3111                 link_list(fd, &node->outputs);
3112
3113                 node->prop = newdataadr(fd, node->prop);
3114                 IDP_DirectLinkGroup_OrFree(&node->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
3115
3116                 link_list(fd, &node->internal_links);
3117                 for (link = node->internal_links.first; link; link = link->next) {
3118                         link->fromnode = newdataadr(fd, link->fromnode);
3119                         link->fromsock = newdataadr(fd, link->fromsock);
3120                         link->tonode = newdataadr(fd, link->tonode);
3121                         link->tosock = newdataadr(fd, link->tosock);
3122                 }
3123
3124                 if (node->type == CMP_NODE_MOVIEDISTORTION) {
3125                         node->storage = newmclipadr(fd, node->storage);
3126                 }
3127                 else {
3128                         node->storage = newdataadr(fd, node->storage);
3129                 }
3130
3131                 if (node->storage) {
3132                         /* could be handlerized at some point */
3133                         if (ntree->type==NTREE_SHADER) {
3134                                 if (node->type==SH_NODE_CURVE_VEC || node->type==SH_NODE_CURVE_RGB) {
3135                                         direct_link_curvemapping(fd, node->storage);
3136                                 }
3137                                 else if (node->type==SH_NODE_SCRIPT) {
3138                                         NodeShaderScript *nss = (NodeShaderScript *) node->storage;
3139                                         nss->bytecode = newdataadr(fd, nss->bytecode);
3140                                 }
3141                                 else if (node->type==SH_NODE_TEX_POINTDENSITY) {
3142                                         NodeShaderTexPointDensity *npd = (NodeShaderTexPointDensity *) node->storage;
3143                                         memset(&npd->pd, 0, sizeof(npd->pd));
3144                                 }
3145                         }
3146                         else if (ntree->type==NTREE_COMPOSIT) {
3147                                 if (ELEM(node->type, CMP_NODE_TIME, CMP_NODE_CURVE_VEC, CMP_NODE_CURVE_RGB, CMP_NODE_HUECORRECT))
3148                                         direct_link_curvemapping(fd, node->storage);
3149                                 else if (ELEM(node->type, CMP_NODE_IMAGE, CMP_NODE_R_LAYERS, CMP_NODE_VIEWER, CMP_NODE_SPLITVIEWER))
3150                                         ((ImageUser *)node->storage)->ok = 1;
3151                         }
3152                         else if ( ntree->type==NTREE_TEXTURE) {
3153                                 if (node->type==TEX_NODE_CURVE_RGB || node->type==TEX_NODE_CURVE_TIME)
3154                                         direct_link_curvemapping(fd, node->storage);
3155                                 else if (node->type==TEX_NODE_IMAGE)
3156                                         ((ImageUser *)node->storage)->ok = 1;
3157                         }
3158                 }
3159         }
3160         link_list(fd, &ntree->links);
3161
3162         /* and we connect the rest */
3163         for (node = ntree->nodes.first; node; node = node->next) {
3164                 node->parent = newdataadr(fd, node->parent);
3165                 node->lasty = 0;
3166
3167                 for (sock = node->inputs.first; sock; sock = sock->next)
3168                         direct_link_node_socket(fd, sock);
3169                 for (sock = node->outputs.first; sock; sock = sock->next)
3170                         direct_link_node_socket(fd, sock);
3171         }
3172
3173         /* interface socket lists */
3174         link_list(fd, &ntree->inputs);
3175         link_list(fd, &ntree->outputs);
3176         for (sock = ntree->inputs.first; sock; sock = sock->next)
3177                 direct_link_node_socket(fd, sock);
3178         for (sock = ntree->outputs.first; sock; sock = sock->next)
3179                 direct_link_node_socket(fd, sock);
3180
3181         for (link = ntree->links.first; link; link= link->next) {
3182                 link->fromnode = newdataadr(fd, link->fromnode);
3183                 link->tonode = newdataadr(fd, link->tonode);
3184                 link->fromsock = newdataadr(fd, link->fromsock);
3185                 link->tosock = newdataadr(fd, link->tosock);
3186         }
3187
3188 #if 0
3189         if (ntree->previews) {
3190                 bNodeInstanceHash *new_previews = BKE_node_instance_hash_new("node previews");
3191                 bNodeInstanceHashIterator iter;
3192
3193                 NODE_INSTANCE_HASH_ITER(iter, ntree->previews) {
3194                         bNodePreview *preview = BKE_node_instance_hash_iterator_get_value(&iter);
3195                         if (preview) {
3196                                 bNodePreview *new_preview = newimaadr(fd, preview);
3197                                 if (new_preview) {
3198                                         bNodeInstanceKey key = BKE_node_instance_hash_iterator_get_key(&iter);
3199                                         BKE_node_instance_hash_insert(new_previews, key, new_preview);
3200                                 }
3201                         }
3202                 }
3203                 BKE_node_instance_hash_free(ntree->previews, NULL);
3204                 ntree->previews = new_previews;
3205         }
3206 #else
3207         /* XXX TODO */
3208         ntree->previews = NULL;
3209 #endif
3210
3211         /* type verification is in lib-link */
3212 }
3213
3214 /* ************ READ ARMATURE ***************** */
3215
3216 /* temp struct used to transport needed info to lib_link_constraint_cb() */
3217 typedef struct tConstraintLinkData {
3218         FileData *fd;
3219         ID *id;
3220 } tConstraintLinkData;
3221 /* callback function used to relink constraint ID-links */
3222 static void lib_link_constraint_cb(bConstraint *UNUSED(con), ID **idpoin, bool is_reference, void *userdata)
3223 {
3224         tConstraintLinkData *cld= (tConstraintLinkData *)userdata;
3225
3226         /* for reference types, we need to increment the usercounts on load... */
3227         if (is_reference) {
3228                 /* reference type - with usercount */
3229                 *idpoin = newlibadr_us(cld->fd, cld->id->lib, *idpoin);
3230         }
3231         else {
3232                 /* target type - no usercount needed */
3233                 *idpoin = newlibadr(cld->fd, cld->id->lib, *idpoin);
3234         }
3235 }
3236
3237 static void lib_link_constraints(FileData *fd, ID *id, ListBase *conlist)
3238 {
3239         tConstraintLinkData cld;
3240         bConstraint *con;
3241
3242         /* legacy fixes */
3243         for (con = conlist->first; con; con=con->next) {
3244                 /* patch for error introduced by changing constraints (dunno how) */
3245                 /* if con->data type changes, dna cannot resolve the pointer! (ton) */
3246                 if (con->data == NULL) {
3247                         con->type = CONSTRAINT_TYPE_NULL;
3248                 }
3249                 /* own ipo, all constraints have it */
3250                 con->ipo = newlibadr_us(fd, id->lib, con->ipo); // XXX deprecated - old animation system
3251         }
3252
3253         /* relink all ID-blocks used by the constraints */
3254         cld.fd = fd;
3255         cld.id = id;
3256
3257         BKE_constraints_id_loop(conlist, lib_link_constraint_cb, &cld);
3258 }
3259
3260 static void direct_link_constraints(FileData *fd, ListBase *lb)
3261 {
3262         bConstraint *con;
3263
3264         link_list(fd, lb);
3265         for (con=lb->first; con; con=con->next) {
3266                 con->data = newdataadr(fd, con->data);
3267
3268                 switch (con->type) {
3269                         case CONSTRAINT_TYPE_PYTHON:
3270                         {
3271                                 bPythonConstraint *data= con->data;
3272
3273                                 link_list(fd, &data->targets);
3274
3275                                 data->prop = newdataadr(fd, data->prop);
3276                                 IDP_DirectLinkGroup_OrFree(&data->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
3277                                 break;
3278                         }
3279                         case CONSTRAINT_TYPE_SPLINEIK:
3280                         {
3281                                 bSplineIKConstraint *data= con->data;
3282
3283                                 data->points= newdataadr(fd, data->points);
3284                                 break;
3285                         }
3286                         case CONSTRAINT_TYPE_KINEMATIC:
3287                         {
3288                                 bKinematicConstraint *data = con->data;
3289
3290                                 con->lin_error = 0.f;
3291                                 con->rot_error = 0.f;
3292
3293                                 /* version patch for runtime flag, was not cleared in some case */
3294                                 data->flag &= ~CONSTRAINT_IK_AUTO;
3295                                 break;
3296                         }
3297                         case CONSTRAINT_TYPE_CHILDOF:
3298                         {
3299                                 /* XXX version patch, in older code this flag wasn't always set, and is inherent to type */
3300                                 if (con->ownspace == CONSTRAINT_SPACE_POSE)
3301                                         con->flag |= CONSTRAINT_SPACEONCE;
3302                                 break;
3303                         }
3304                         case CONSTRAINT_TYPE_TRANSFORM_CACHE:
3305                         {
3306                                 bTransformCacheConstraint *data = con->data;
3307                                 data->reader = NULL;
3308                         }
3309                 }
3310         }
3311 }
3312
3313 static void lib_link_pose(FileData *fd, Main *bmain, Object *ob, bPose *pose)
3314 {
3315         bArmature *arm = ob->data;
3316
3317         if (!pose || !arm)
3318                 return;
3319
3320         /* always rebuild to match proxy or lib changes, but on Undo */
3321         bool rebuild = false;
3322
3323         if (fd->memfile == NULL) {
3324                 if (ob->proxy || (ob->id.lib==NULL && arm->id.lib)) {
3325                         rebuild = true;
3326                 }
3327         }
3328
3329         /* avoid string */
3330         GHash *bone_hash = BKE_armature_bone_from_name_map(arm);
3331
3332         if (ob->proxy) {
3333                 /* sync proxy layer */
3334                 if (pose->proxy_layer)
3335                         arm->layer = pose->proxy_layer;
3336
3337                 /* sync proxy active bone */
3338                 if (pose->proxy_act_bone[0]) {
3339                         Bone *bone = BLI_ghash_lookup(bone_hash, pose->proxy_act_bone);
3340                         if (bone) {
3341                                 arm->act_bone = bone;
3342                         }
3343                 }
3344         }
3345
3346         for (bPoseChannel *pchan = pose->chanbase.first; pchan; pchan = pchan->next) {
3347                 lib_link_constraints(fd, (ID *)ob, &pchan->constraints);
3348
3349                 pchan->bone = BLI_ghash_lookup(bone_hash, pchan->name);
3350
3351                 IDP_LibLinkProperty(pchan->prop, fd);
3352
3353                 pchan->custom = newlibadr_us(fd, arm->id.lib, pchan->custom);
3354                 if (UNLIKELY(pchan->bone == NULL)) {
3355                         rebuild = true;
3356                 }
3357                 else if ((ob->id.lib == NULL) && arm->id.lib) {
3358                         /* local pose selection copied to armature, bit hackish */
3359                         pchan->bone->flag &= ~BONE_SELECTED;
3360                         pchan->bone->flag |= pchan->selectflag;
3361                 }
3362         }
3363
3364         BLI_ghash_free(bone_hash, NULL, NULL);
3365
3366
3367         if (rebuild) {
3368                 DAG_id_tag_update_ex(bmain, &ob->id, OB_RECALC_OB | OB_RECALC_DATA | OB_RECALC_TIME);
3369                 BKE_pose_tag_recalc(bmain, pose);
3370         }
3371 }
3372
3373 static void lib_link_bones(FileData *fd, Bone *bone)
3374 {
3375         IDP_LibLinkProperty(bone->prop, fd);
3376
3377         for (Bone *curbone = bone->childbase.first; curbone; curbone = curbone->next) {
3378                 lib_link_bones(fd, curbone);
3379         }
3380 }
3381
3382 static void lib_link_armature(FileData *fd, Main *main)
3383 {
3384         for (bArmature *arm = main->armature.first; arm; arm = arm->id.next) {
3385                 if (arm->id.tag & LIB_TAG_NEED_LINK) {
3386                         IDP_LibLinkProperty(arm->id.properties, fd);
3387                         lib_link_animdata(fd, &arm->id, arm->adt);
3388
3389                         for (Bone *curbone = arm->bonebase.first; curbone; curbone = curbone->next) {
3390                                 lib_link_bones(fd, curbone);
3391                         }
3392
3393                         arm->id.tag &= ~LIB_TAG_NEED_LINK;
3394                 }
3395         }
3396 }
3397
3398 static void direct_link_bones(FileData *fd, Bone *bone)
3399 {
3400         Bone *child;
3401
3402         bone->parent = newdataadr(fd, bone->parent);
3403         bone->prop = newdataadr(fd, bone->prop);
3404         IDP_DirectLinkGroup_OrFree(&bone->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
3405
3406         bone->flag &= ~BONE_DRAW_ACTIVE;
3407
3408         link_list(fd, &bone->childbase);
3409
3410         for (child=bone->childbase.first; child; child=child->next)
3411                 direct_link_bones(fd, child);
3412 }
3413
3414 static void direct_link_armature(FileData *fd, bArmature *arm)
3415 {
3416         Bone *bone;
3417
3418         link_list(fd, &arm->bonebase);
3419         arm->edbo = NULL;
3420         arm->sketch = NULL;
3421
3422         arm->adt = newdataadr(fd, arm->adt);
3423         direct_link_animdata(fd, arm->adt);
3424
3425         for (bone = arm->bonebase.first; bone; bone = bone->next) {
3426                 direct_link_bones(fd, bone);
3427         }
3428
3429         arm->act_bone = newdataadr(fd, arm->act_bone);
3430         arm->act_edbone = NULL;
3431 }
3432
3433 /* ************ READ CAMERA ***************** */
3434
3435 static void lib_link_camera(FileData *fd, Main *main)
3436 {
3437         for (Camera *ca = main->camera.first; ca; ca = ca->id.next) {
3438                 if (ca->id.tag & LIB_TAG_NEED_LINK) {
3439                         IDP_LibLinkProperty(ca->id.properties, fd);
3440                         lib_link_animdata(fd, &ca->id, ca->adt);
3441
3442                         ca->ipo = newlibadr_us(fd, ca->id.lib, ca->ipo); // XXX deprecated - old animation system
3443
3444                         ca->dof_ob = newlibadr(fd, ca->id.lib, ca->dof_ob);
3445
3446                         ca->id.tag &= ~LIB_TAG_NEED_LINK;
3447                 }
3448         }
3449 }
3450
3451 static void direct_link_camera(FileData *fd, Camera *ca)
3452 {
3453         ca->adt = newdataadr(fd, ca->adt);
3454         direct_link_animdata(fd, ca->adt);
3455 }
3456
3457
3458 /* ************ READ LAMP ***************** */
3459
3460 static void lib_link_lamp(FileData *fd, Main *main)
3461 {
3462         for (Lamp *la = main->lamp.first; la; la = la->id.next) {
3463                 if (la->id.tag & LIB_TAG_NEED_LINK) {
3464                         IDP_LibLinkProperty(la->id.properties, fd);
3465                         lib_link_animdata(fd, &la->id, la->adt);
3466
3467                         for (int a = 0; a < MAX_MTEX; a++) {
3468                                 MTex *mtex = la->mtex[a];
3469                                 if (mtex) {
3470                                         mtex->tex = newlibadr_us(fd, la->id.lib, mtex->tex);
3471                                         mtex->object = newlibadr(fd, la->id.lib, mtex->object);
3472                                 }
3473   &n