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