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