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