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