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