Merge branch 'master' into soc-2013-depsgraph_mt
[blender.git] / source / blender / blenloader / intern / readfile.c
1 /*
2  * ***** BEGIN GPL LICENSE BLOCK *****
3  *
4  * This program is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU General Public License
6  * as published by the Free Software Foundation; either version 2
7  * of the License, or (at your option) any later version.
8  *
9  * This program is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
12  * GNU General Public License for more details.
13  *
14  * You should have received a copy of the GNU General Public License
15  * along with this program; if not, write to the Free Software Foundation,
16  * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17  *
18  * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
19  * All rights reserved.
20  *
21  *
22  * Contributor(s): Blender Foundation
23  *
24  * ***** END GPL LICENSE BLOCK *****
25  *
26  */
27
28 /** \file blender/blenloader/intern/readfile.c
29  *  \ingroup blenloader
30  */
31
32
33 #include "zlib.h"
34
35 #include <limits.h>
36 #include <stdio.h> // for printf fopen fwrite fclose sprintf FILE
37 #include <stdlib.h> // for getenv atoi
38 #include <stddef.h> // for offsetof
39 #include <fcntl.h> // for open
40 #include <string.h> // for strrchr strncmp strstr
41 #include <math.h> // for fabs
42 #include <stdarg.h> /* for va_start/end */
43 #include <time.h> /* for gmtime */
44
45 #include "BLI_utildefines.h"
46 #ifndef WIN32
47 #  include <unistd.h> // for read close
48 #else
49 #  include <io.h> // for open close read
50 #  include "winsock2.h"
51 #  include "BLI_winstuff.h"
52 #endif
53
54 /* allow readfile to use deprecated functionality */
55 #define DNA_DEPRECATED_ALLOW
56
57 #include "DNA_anim_types.h"
58 #include "DNA_armature_types.h"
59 #include "DNA_actuator_types.h"
60 #include "DNA_brush_types.h"
61 #include "DNA_camera_types.h"
62 #include "DNA_cloth_types.h"
63 #include "DNA_controller_types.h"
64 #include "DNA_constraint_types.h"
65 #include "DNA_dynamicpaint_types.h"
66 #include "DNA_effect_types.h"
67 #include "DNA_fileglobal_types.h"
68 #include "DNA_genfile.h"
69 #include "DNA_group_types.h"
70 #include "DNA_gpencil_types.h"
71 #include "DNA_ipo_types.h"
72 #include "DNA_key_types.h"
73 #include "DNA_lattice_types.h"
74 #include "DNA_lamp_types.h"
75 #include "DNA_linestyle_types.h"
76 #include "DNA_meta_types.h"
77 #include "DNA_material_types.h"
78 #include "DNA_mesh_types.h"
79 #include "DNA_meshdata_types.h"
80 #include "DNA_nla_types.h"
81 #include "DNA_node_types.h"
82 #include "DNA_object_fluidsim.h" // NT
83 #include "DNA_object_types.h"
84 #include "DNA_packedFile_types.h"
85 #include "DNA_particle_types.h"
86 #include "DNA_property_types.h"
87 #include "DNA_rigidbody_types.h"
88 #include "DNA_text_types.h"
89 #include "DNA_view3d_types.h"
90 #include "DNA_screen_types.h"
91 #include "DNA_sensor_types.h"
92 #include "DNA_sdna_types.h"
93 #include "DNA_scene_types.h"
94 #include "DNA_sequence_types.h"
95 #include "DNA_smoke_types.h"
96 #include "DNA_speaker_types.h"
97 #include "DNA_sound_types.h"
98 #include "DNA_space_types.h"
99 #include "DNA_vfont_types.h"
100 #include "DNA_world_types.h"
101 #include "DNA_movieclip_types.h"
102 #include "DNA_mask_types.h"
103
104 #include "MEM_guardedalloc.h"
105
106 #include "BLI_utildefines.h"
107 #include "BLI_endian_switch.h"
108 #include "BLI_blenlib.h"
109 #include "BLI_math.h"
110 #include "BLI_edgehash.h"
111 #include "BLI_threads.h"
112 #include "BLI_mempool.h"
113
114 #include "BLF_translation.h"
115
116 #include "BKE_anim.h"
117 #include "BKE_action.h"
118 #include "BKE_armature.h"
119 #include "BKE_brush.h"
120 #include "BKE_colortools.h"
121 #include "BKE_constraint.h"
122 #include "BKE_context.h"
123 #include "BKE_curve.h"
124 #include "BKE_deform.h"
125 #include "BKE_depsgraph.h"
126 #include "BKE_effect.h"
127 #include "BKE_fcurve.h"
128 #include "BKE_global.h" // for G
129 #include "BKE_group.h"
130 #include "BKE_image.h"
131 #include "BKE_lattice.h"
132 #include "BKE_library.h" // for which_libbase
133 #include "BKE_idcode.h"
134 #include "BKE_idprop.h"
135 #include "BKE_material.h"
136 #include "BKE_main.h" // for Main
137 #include "BKE_mesh.h" // for ME_ defines (patching)
138 #include "BKE_modifier.h"
139 #include "BKE_multires.h"
140 #include "BKE_node.h" // for tree type defines
141 #include "BKE_ocean.h"
142 #include "BKE_object.h"
143 #include "BKE_paint.h"
144 #include "BKE_particle.h"
145 #include "BKE_pointcache.h"
146 #include "BKE_property.h" // for BKE_bproperty_object_get
147 #include "BKE_report.h"
148 #include "BKE_sca.h" // for init_actuator
149 #include "BKE_scene.h"
150 #include "BKE_screen.h"
151 #include "BKE_sequencer.h"
152 #include "BKE_text.h" // for txt_extended_ascii_as_utf8
153 #include "BKE_texture.h"
154 #include "BKE_tracking.h"
155 #include "BKE_treehash.h"
156 #include "BKE_sound.h"
157 #include "BKE_writeffmpeg.h"
158
159 #include "IMB_imbuf.h"  // for proxy / timecode versioning stuff
160
161 #include "NOD_common.h"
162 #include "NOD_socket.h"
163 #include "NOD_composite.h"
164 #include "NOD_shader.h"
165 #include "NOD_texture.h"
166
167 #include "BLO_readfile.h"
168 #include "BLO_undofile.h"
169 #include "BLO_blend_defs.h"
170
171 #include "RE_engine.h"
172
173 #include "readfile.h"
174
175 #include "PIL_time.h"
176
177 #include <errno.h>
178
179 /*
180  * Remark: still a weak point is the newaddress() function, that doesnt solve reading from
181  * multiple files at the same time
182  *
183  * (added remark: oh, i thought that was solved? will look at that... (ton)
184  *
185  * READ
186  * - Existing Library (Main) push or free
187  * - allocate new Main
188  * - load file
189  * - read SDNA
190  * - for each LibBlock
191  *     - read LibBlock
192  *     - if a Library
193  *         - make a new Main
194  *         - attach ID's to it
195  *     - else
196  *         - read associated 'direct data'
197  *         - link direct data (internal and to LibBlock)
198  * - read FileGlobal
199  * - read USER data, only when indicated (file is ~/X.XX/startup.blend)
200  * - free file
201  * - per Library (per Main)
202  *     - read file
203  *     - read SDNA
204  *     - find LibBlocks and attach IDs to Main
205  *         - if external LibBlock
206  *             - search all Main's
207  *                 - or it's already read,
208  *                 - or not read yet
209  *                 - or make new Main
210  *     - per LibBlock
211  *         - read recursive
212  *         - read associated direct data
213  *         - link direct data (internal and to LibBlock)
214  *     - free file
215  * - per Library with unread LibBlocks
216  *     - read file
217  *     - read SDNA
218  *     - per LibBlock
219  *                - read recursive
220  *                - read associated direct data
221  *                - link direct data (internal and to LibBlock)
222  *         - free file
223  * - join all Mains
224  * - link all LibBlocks and indirect pointers to libblocks
225  * - initialize FileGlobal and copy pointers to Global
226  */
227
228 /***/
229
230 typedef struct OldNew {
231         void *old, *newp;
232         int nr;
233 } OldNew;
234
235 typedef struct OldNewMap {
236         OldNew *entries;
237         int nentries, entriessize;
238         int sorted;
239         int lasthit;
240 } OldNewMap;
241
242
243 /* local prototypes */
244 static void *read_struct(FileData *fd, BHead *bh, const char *blockname);
245 static void direct_link_modifiers(FileData *fd, ListBase *lb);
246 static void convert_tface_mt(FileData *fd, Main *main);
247
248 /* this function ensures that reports are printed,
249  * in the case of libraray linking errors this is important!
250  *
251  * bit kludge but better then doubling up on prints,
252  * we could alternatively have a versions of a report function which forces printing - campbell
253  */
254
255 void blo_reportf_wrap(ReportList *reports, ReportType type, const char *format, ...)
256 {
257         char fixed_buf[1024]; /* should be long enough */
258         
259         va_list args;
260         
261         va_start(args, format);
262         vsnprintf(fixed_buf, sizeof(fixed_buf), format, args);
263         va_end(args);
264         
265         fixed_buf[sizeof(fixed_buf) - 1] = '\0';
266         
267         BKE_report(reports, type, fixed_buf);
268         
269         if (G.background == 0) {
270                 printf("%s\n", fixed_buf);
271         }
272 }
273
274 static OldNewMap *oldnewmap_new(void) 
275 {
276         OldNewMap *onm= MEM_callocN(sizeof(*onm), "OldNewMap");
277         
278         onm->entriessize = 1024;
279         onm->entries = MEM_mallocN(sizeof(*onm->entries)*onm->entriessize, "OldNewMap.entries");
280         
281         return onm;
282 }
283
284 static int verg_oldnewmap(const void *v1, const void *v2)
285 {
286         const struct OldNew *x1=v1, *x2=v2;
287         
288         if (x1->old > x2->old) return 1;
289         else if (x1->old < x2->old) return -1;
290         return 0;
291 }
292
293
294 static void oldnewmap_sort(FileData *fd) 
295 {
296         qsort(fd->libmap->entries, fd->libmap->nentries, sizeof(OldNew), verg_oldnewmap);
297         fd->libmap->sorted = 1;
298 }
299
300 /* nr is zero for data, and ID code for libdata */
301 static void oldnewmap_insert(OldNewMap *onm, void *oldaddr, void *newaddr, int nr) 
302 {
303         OldNew *entry;
304         
305         if (oldaddr==NULL || newaddr==NULL) return;
306         
307         if (onm->nentries == onm->entriessize) {
308                 int osize = onm->entriessize;
309                 OldNew *oentries = onm->entries;
310                 
311                 onm->entriessize *= 2;
312                 onm->entries = MEM_mallocN(sizeof(*onm->entries)*onm->entriessize, "OldNewMap.entries");
313                 
314                 memcpy(onm->entries, oentries, sizeof(*oentries)*osize);
315                 MEM_freeN(oentries);
316         }
317
318         entry = &onm->entries[onm->nentries++];
319         entry->old = oldaddr;
320         entry->newp = newaddr;
321         entry->nr = nr;
322 }
323
324 void blo_do_versions_oldnewmap_insert(OldNewMap *onm, void *oldaddr, void *newaddr, int nr)
325 {
326         oldnewmap_insert(onm, oldaddr, newaddr, nr);
327 }
328
329 static void *oldnewmap_lookup_and_inc(OldNewMap *onm, void *addr, bool increase_users) 
330 {
331         int i;
332         
333         if (addr == NULL) return NULL;
334         
335         if (onm->lasthit < onm->nentries-1) {
336                 OldNew *entry = &onm->entries[++onm->lasthit];
337                 
338                 if (entry->old == addr) {
339                         if (increase_users)
340                                 entry->nr++;
341                         return entry->newp;
342                 }
343         }
344         
345         for (i = 0; i < onm->nentries; i++) {
346                 OldNew *entry = &onm->entries[i];
347                 
348                 if (entry->old == addr) {
349                         onm->lasthit = i;
350                         
351                         if (increase_users)
352                                 entry->nr++;
353                         return entry->newp;
354                 }
355         }
356         
357         return NULL;
358 }
359
360 /* for libdata, nr has ID code, no increment */
361 static void *oldnewmap_liblookup(OldNewMap *onm, void *addr, void *lib)
362 {
363         if (addr == NULL) {
364                 return NULL;
365         }
366
367         /* lasthit works fine for non-libdata, linking there is done in same sequence as writing */
368         if (onm->sorted) {
369                 OldNew entry_s, *entry;
370
371                 entry_s.old = addr;
372
373                 entry = bsearch(&entry_s, onm->entries, onm->nentries, sizeof(OldNew), verg_oldnewmap);
374                 if (entry) {
375                         ID *id = entry->newp;
376
377                         if (id && (!lib || id->lib)) {
378                                 return id;
379                         }
380                 }
381         }
382         else {
383                 /* note, this can be a bottle neck when loading some files */
384                 unsigned int nentries = (unsigned int)onm->nentries;
385                 unsigned int i;
386                 OldNew *entry;
387
388                 for (i = 0, entry = onm->entries; i < nentries; i++, entry++) {
389                         if (entry->old == addr) {
390                                 ID *id = entry->newp;
391                                 if (id && (!lib || id->lib)) {
392                                         return id;
393                                 }
394                         }
395                 }
396         }
397
398         return NULL;
399 }
400
401 static void oldnewmap_free_unused(OldNewMap *onm) 
402 {
403         int i;
404
405         for (i = 0; i < onm->nentries; i++) {
406                 OldNew *entry = &onm->entries[i];
407                 if (entry->nr == 0) {
408                         MEM_freeN(entry->newp);
409                         entry->newp = NULL;
410                 }
411         }
412 }
413
414 static void oldnewmap_clear(OldNewMap *onm) 
415 {
416         onm->nentries = 0;
417         onm->lasthit = 0;
418 }
419
420 static void oldnewmap_free(OldNewMap *onm) 
421 {
422         MEM_freeN(onm->entries);
423         MEM_freeN(onm);
424 }
425
426 /***/
427
428 static void read_libraries(FileData *basefd, ListBase *mainlist);
429
430 /* ************ help functions ***************** */
431
432 static void add_main_to_main(Main *mainvar, Main *from)
433 {
434         ListBase *lbarray[MAX_LIBARRAY], *fromarray[MAX_LIBARRAY];
435         int a;
436         
437         set_listbasepointers(mainvar, lbarray);
438         a = set_listbasepointers(from, fromarray);
439         while (a--) {
440                 BLI_movelisttolist(lbarray[a], fromarray[a]);
441         }
442 }
443
444 void blo_join_main(ListBase *mainlist)
445 {
446         Main *tojoin, *mainl;
447         
448         mainl = mainlist->first;
449         while ((tojoin = mainl->next)) {
450                 add_main_to_main(mainl, tojoin);
451                 BLI_remlink(mainlist, tojoin);
452                 MEM_freeN(tojoin);
453         }
454 }
455
456 static void split_libdata(ListBase *lb, Main *first)
457 {
458         ListBase *lbn;
459         ID *id, *idnext;
460         Main *mainvar;
461         
462         id = lb->first;
463         while (id) {
464                 idnext = id->next;
465                 if (id->lib) {
466                         mainvar = first;
467                         while (mainvar) {
468                                 if (mainvar->curlib == id->lib) {
469                                         lbn= which_libbase(mainvar, GS(id->name));
470                                         BLI_remlink(lb, id);
471                                         BLI_addtail(lbn, id);
472                                         break;
473                                 }
474                                 mainvar = mainvar->next;
475                         }
476                         if (mainvar == NULL) printf("error split_libdata\n");
477                 }
478                 id = idnext;
479         }
480 }
481
482 void blo_split_main(ListBase *mainlist, Main *main)
483 {
484         ListBase *lbarray[MAX_LIBARRAY];
485         Library *lib;
486         int i;
487         
488         mainlist->first = mainlist->last = main;
489         main->next = NULL;
490         
491         if (main->library.first == NULL)
492                 return;
493         
494         for (lib = main->library.first; lib; lib = lib->id.next) {
495                 Main *libmain = BKE_main_new();
496                 libmain->curlib = lib;
497                 BLI_addtail(mainlist, libmain);
498         }
499         
500         i = set_listbasepointers(main, lbarray);
501         while (i--)
502                 split_libdata(lbarray[i], main->next);
503 }
504
505 static void read_file_version(FileData *fd, Main *main)
506 {
507         BHead *bhead;
508         
509         for (bhead= blo_firstbhead(fd); bhead; bhead= blo_nextbhead(fd, bhead)) {
510                 if (bhead->code == GLOB) {
511                         FileGlobal *fg= read_struct(fd, bhead, "Global");
512                         if (fg) {
513                                 main->subversionfile= fg->subversion;
514                                 main->minversionfile= fg->minversion;
515                                 main->minsubversionfile= fg->minsubversion;
516                                 MEM_freeN(fg);
517                         }
518                         else if (bhead->code == ENDB)
519                                 break;
520                 }
521         }
522 }
523
524
525 static Main *blo_find_main(FileData *fd, const char *filepath, const char *relabase)
526 {
527         ListBase *mainlist = fd->mainlist;
528         Main *m;
529         Library *lib;
530         char name1[FILE_MAX];
531         
532         BLI_strncpy(name1, filepath, sizeof(name1));
533         BLI_cleanup_path(relabase, name1);
534         
535 //      printf("blo_find_main: relabase  %s\n", relabase);
536 //      printf("blo_find_main: original in  %s\n", filepath);
537 //      printf("blo_find_main: converted to %s\n", name1);
538         
539         for (m = mainlist->first; m; m = m->next) {
540                 char *libname = (m->curlib) ? m->curlib->filepath : m->name;
541                 
542                 if (BLI_path_cmp(name1, libname) == 0) {
543                         if (G.debug & G_DEBUG) printf("blo_find_main: found library %s\n", libname);
544                         return m;
545                 }
546         }
547         
548         m = BKE_main_new();
549         BLI_addtail(mainlist, m);
550         
551         lib = BKE_libblock_alloc(&m->library, ID_LI, "lib");
552         BLI_strncpy(lib->name, filepath, sizeof(lib->name));
553         BLI_strncpy(lib->filepath, name1, sizeof(lib->filepath));
554         
555         m->curlib = lib;
556         
557         read_file_version(fd, m);
558         
559         if (G.debug & G_DEBUG) printf("blo_find_main: added new lib %s\n", filepath);
560         return m;
561 }
562
563
564 /* ************ FILE PARSING ****************** */
565
566 static void switch_endian_bh4(BHead4 *bhead)
567 {
568         /* the ID_.. codes */
569         if ((bhead->code & 0xFFFF)==0) bhead->code >>= 16;
570         
571         if (bhead->code != ENDB) {
572                 BLI_endian_switch_int32(&bhead->len);
573                 BLI_endian_switch_int32(&bhead->SDNAnr);
574                 BLI_endian_switch_int32(&bhead->nr);
575         }
576 }
577
578 static void switch_endian_bh8(BHead8 *bhead)
579 {
580         /* the ID_.. codes */
581         if ((bhead->code & 0xFFFF)==0) bhead->code >>= 16;
582         
583         if (bhead->code != ENDB) {
584                 BLI_endian_switch_int32(&bhead->len);
585                 BLI_endian_switch_int32(&bhead->SDNAnr);
586                 BLI_endian_switch_int32(&bhead->nr);
587         }
588 }
589
590 static void bh4_from_bh8(BHead *bhead, BHead8 *bhead8, int do_endian_swap)
591 {
592         BHead4 *bhead4 = (BHead4 *) bhead;
593         int64_t old;
594
595         bhead4->code = bhead8->code;
596         bhead4->len = bhead8->len;
597
598         if (bhead4->code != ENDB) {
599                 /* perform a endian swap on 64bit pointers, otherwise the pointer might map to zero
600                  * 0x0000000000000000000012345678 would become 0x12345678000000000000000000000000
601                  */
602                 if (do_endian_swap) {
603                         BLI_endian_switch_int64(&bhead8->old);
604                 }
605                 
606                 /* this patch is to avoid a long long being read from not-eight aligned positions
607                  * is necessary on any modern 64bit architecture) */
608                 memcpy(&old, &bhead8->old, 8);
609                 bhead4->old = (int) (old >> 3);
610                 
611                 bhead4->SDNAnr = bhead8->SDNAnr;
612                 bhead4->nr = bhead8->nr;
613         }
614 }
615
616 static void bh8_from_bh4(BHead *bhead, BHead4 *bhead4)
617 {
618         BHead8 *bhead8 = (BHead8 *) bhead;
619         
620         bhead8->code = bhead4->code;
621         bhead8->len = bhead4->len;
622         
623         if (bhead8->code != ENDB) {
624                 bhead8->old = bhead4->old;
625                 bhead8->SDNAnr = bhead4->SDNAnr;
626                 bhead8->nr= bhead4->nr;
627         }
628 }
629
630 static BHeadN *get_bhead(FileData *fd)
631 {
632         BHeadN *new_bhead = NULL;
633         int readsize;
634         
635         if (fd) {
636                 if (!fd->eof) {
637                         /* initializing to zero isn't strictly needed but shuts valgrind up
638                          * since uninitialized memory gets compared */
639                         BHead8 bhead8 = {0};
640                         BHead4 bhead4 = {0};
641                         BHead  bhead = {0};
642                         
643                         /* First read the bhead structure.
644                          * Depending on the platform the file was written on this can
645                          * be a big or little endian BHead4 or BHead8 structure.
646                          *
647                          * As usual 'ENDB' (the last *partial* bhead of the file)
648                          * needs some special handling. We don't want to EOF just yet.
649                          */
650                         if (fd->flags & FD_FLAGS_FILE_POINTSIZE_IS_4) {
651                                 bhead4.code = DATA;
652                                 readsize = fd->read(fd, &bhead4, sizeof(bhead4));
653                                 
654                                 if (readsize == sizeof(bhead4) || bhead4.code == ENDB) {
655                                         if (fd->flags & FD_FLAGS_SWITCH_ENDIAN) {
656                                                 switch_endian_bh4(&bhead4);
657                                         }
658                                         
659                                         if (fd->flags & FD_FLAGS_POINTSIZE_DIFFERS) {
660                                                 bh8_from_bh4(&bhead, &bhead4);
661                                         }
662                                         else {
663                                                 memcpy(&bhead, &bhead4, sizeof(bhead));
664                                         }
665                                 }
666                                 else {
667                                         fd->eof = 1;
668                                         bhead.len= 0;
669                                 }
670                         }
671                         else {
672                                 bhead8.code = DATA;
673                                 readsize = fd->read(fd, &bhead8, sizeof(bhead8));
674                                 
675                                 if (readsize == sizeof(bhead8) || bhead8.code == ENDB) {
676                                         if (fd->flags & FD_FLAGS_SWITCH_ENDIAN) {
677                                                 switch_endian_bh8(&bhead8);
678                                         }
679                                         
680                                         if (fd->flags & FD_FLAGS_POINTSIZE_DIFFERS) {
681                                                 bh4_from_bh8(&bhead, &bhead8, (fd->flags & FD_FLAGS_SWITCH_ENDIAN));
682                                         }
683                                         else {
684                                                 memcpy(&bhead, &bhead8, sizeof(bhead));
685                                         }
686                                 }
687                                 else {
688                                         fd->eof = 1;
689                                         bhead.len= 0;
690                                 }
691                         }
692                         
693                         /* make sure people are not trying to pass bad blend files */
694                         if (bhead.len < 0) fd->eof = 1;
695                         
696                         /* bhead now contains the (converted) bhead structure. Now read
697                          * the associated data and put everything in a BHeadN (creative naming !)
698                          */
699                         if (!fd->eof) {
700                                 new_bhead = MEM_mallocN(sizeof(BHeadN) + bhead.len, "new_bhead");
701                                 if (new_bhead) {
702                                         new_bhead->next = new_bhead->prev = NULL;
703                                         new_bhead->bhead = bhead;
704                                         
705                                         readsize = fd->read(fd, new_bhead + 1, bhead.len);
706                                         
707                                         if (readsize != bhead.len) {
708                                                 fd->eof = 1;
709                                                 MEM_freeN(new_bhead);
710                                                 new_bhead = NULL;
711                                         }
712                                 }
713                                 else {
714                                         fd->eof = 1;
715                                 }
716                         }
717                 }
718         }
719
720         /* We've read a new block. Now add it to the list
721          * of blocks.
722          */
723         if (new_bhead) {
724                 BLI_addtail(&fd->listbase, new_bhead);
725         }
726         
727         return(new_bhead);
728 }
729
730 BHead *blo_firstbhead(FileData *fd)
731 {
732         BHeadN *new_bhead;
733         BHead *bhead = NULL;
734         
735         /* Rewind the file
736          * Read in a new block if necessary
737          */
738         new_bhead = fd->listbase.first;
739         if (new_bhead == NULL) {
740                 new_bhead = get_bhead(fd);
741         }
742         
743         if (new_bhead) {
744                 bhead = &new_bhead->bhead;
745         }
746         
747         return(bhead);
748 }
749
750 BHead *blo_prevbhead(FileData *UNUSED(fd), BHead *thisblock)
751 {
752         BHeadN *bheadn = (BHeadN *) (((char *) thisblock) - offsetof(BHeadN, bhead));
753         BHeadN *prev = bheadn->prev;
754         
755         return (prev) ? &prev->bhead : NULL;
756 }
757
758 BHead *blo_nextbhead(FileData *fd, BHead *thisblock)
759 {
760         BHeadN *new_bhead = NULL;
761         BHead *bhead = NULL;
762         
763         if (thisblock) {
764                 /* bhead is actually a sub part of BHeadN
765                  * We calculate the BHeadN pointer from the BHead pointer below */
766                 new_bhead = (BHeadN *) (((char *) thisblock) - offsetof(BHeadN, bhead));
767                 
768                 /* get the next BHeadN. If it doesn't exist we read in the next one */
769                 new_bhead = new_bhead->next;
770                 if (new_bhead == NULL) {
771                         new_bhead = get_bhead(fd);
772                 }
773         }
774         
775         if (new_bhead) {
776                 /* here we do the reverse:
777                  * go from the BHeadN pointer to the BHead pointer */
778                 bhead = &new_bhead->bhead;
779         }
780         
781         return(bhead);
782 }
783
784 static void decode_blender_header(FileData *fd)
785 {
786         char header[SIZEOFBLENDERHEADER], num[4];
787         int readsize;
788         
789         /* read in the header data */
790         readsize = fd->read(fd, header, sizeof(header));
791         
792         if (readsize == sizeof(header)) {
793                 if (strncmp(header, "BLENDER", 7) == 0) {
794                         int remove_this_endian_test = 1;
795                         
796                         fd->flags |= FD_FLAGS_FILE_OK;
797                         
798                         /* what size are pointers in the file ? */
799                         if (header[7]=='_') {
800                                 fd->flags |= FD_FLAGS_FILE_POINTSIZE_IS_4;
801                                 if (sizeof(void *) != 4) {
802                                         fd->flags |= FD_FLAGS_POINTSIZE_DIFFERS;
803                                 }
804                         }
805                         else {
806                                 if (sizeof(void *) != 8) {
807                                         fd->flags |= FD_FLAGS_POINTSIZE_DIFFERS;
808                                 }
809                         }
810                         
811                         /* is the file saved in a different endian
812                          * than we need ?
813                          */
814                         if (((((char *)&remove_this_endian_test)[0] == 1) ? L_ENDIAN : B_ENDIAN) != ((header[8] == 'v') ? L_ENDIAN : B_ENDIAN)) {
815                                 fd->flags |= FD_FLAGS_SWITCH_ENDIAN;
816                         }
817                         
818                         /* get the version number */
819                         memcpy(num, header + 9, 3);
820                         num[3] = 0;
821                         fd->fileversion = atoi(num);
822                 }
823         }
824 }
825
826 static int read_file_dna(FileData *fd)
827 {
828         BHead *bhead;
829         
830         for (bhead = blo_firstbhead(fd); bhead; bhead = blo_nextbhead(fd, bhead)) {
831                 if (bhead->code == DNA1) {
832                         const bool do_endian_swap = (fd->flags & FD_FLAGS_SWITCH_ENDIAN) != 0;
833                         
834                         fd->filesdna = DNA_sdna_from_data(&bhead[1], bhead->len, do_endian_swap);
835                         if (fd->filesdna) {
836                                 fd->compflags = DNA_struct_get_compareflags(fd->filesdna, fd->memsdna);
837                                 /* used to retrieve ID names from (bhead+1) */
838                                 fd->id_name_offs = DNA_elem_offset(fd->filesdna, "ID", "char", "name[]");
839                         }
840                         
841                         return 1;
842                 }
843                 else if (bhead->code == ENDB)
844                         break;
845         }
846         
847         return 0;
848 }
849
850 static int fd_read_from_file(FileData *filedata, void *buffer, unsigned int size)
851 {
852         int readsize = read(filedata->filedes, buffer, size);
853         
854         if (readsize < 0) {
855                 readsize = EOF;
856         }
857         else {
858                 filedata->seek += readsize;
859         }
860         
861         return readsize;
862 }
863
864 static int fd_read_gzip_from_file(FileData *filedata, void *buffer, unsigned int size)
865 {
866         int readsize = gzread(filedata->gzfiledes, buffer, size);
867         
868         if (readsize < 0) {
869                 readsize = EOF;
870         }
871         else {
872                 filedata->seek += readsize;
873         }
874         
875         return (readsize);
876 }
877
878 static int fd_read_from_memory(FileData *filedata, void *buffer, unsigned int size)
879 {
880         /* don't read more bytes then there are available in the buffer */
881         int readsize = (int)MIN2(size, (unsigned int)(filedata->buffersize - filedata->seek));
882         
883         memcpy(buffer, filedata->buffer + filedata->seek, readsize);
884         filedata->seek += readsize;
885         
886         return (readsize);
887 }
888
889 static int fd_read_from_memfile(FileData *filedata, void *buffer, unsigned int size)
890 {
891         static unsigned int seek = (1<<30);     /* the current position */
892         static unsigned int offset = 0;         /* size of previous chunks */
893         static MemFileChunk *chunk = NULL;
894         unsigned int chunkoffset, readsize, totread;
895         
896         if (size == 0) return 0;
897         
898         if (seek != (unsigned int)filedata->seek) {
899                 chunk = filedata->memfile->chunks.first;
900                 seek = 0;
901                 
902                 while (chunk) {
903                         if (seek + chunk->size > (unsigned) filedata->seek) break;
904                         seek += chunk->size;
905                         chunk = chunk->next;
906                 }
907                 offset = seek;
908                 seek = filedata->seek;
909         }
910         
911         if (chunk) {
912                 totread = 0;
913                 
914                 do {
915                         /* first check if it's on the end if current chunk */
916                         if (seek-offset == chunk->size) {
917                                 offset += chunk->size;
918                                 chunk = chunk->next;
919                         }
920                         
921                         /* debug, should never happen */
922                         if (chunk == NULL) {
923                                 printf("illegal read, chunk zero\n");
924                                 return 0;
925                         }
926                         
927                         chunkoffset = seek-offset;
928                         readsize = size-totread;
929                         
930                         /* data can be spread over multiple chunks, so clamp size
931                          * to within this chunk, and then it will read further in
932                          * the next chunk */
933                         if (chunkoffset+readsize > chunk->size)
934                                 readsize= chunk->size-chunkoffset;
935                         
936                         memcpy((char *)buffer + totread, chunk->buf + chunkoffset, readsize);
937                         totread += readsize;
938                         filedata->seek += readsize;
939                         seek += readsize;
940                 } while (totread < size);
941                 
942                 return totread;
943         }
944         
945         return 0;
946 }
947
948 static FileData *filedata_new(void)
949 {
950         FileData *fd = MEM_callocN(sizeof(FileData), "FileData");
951         
952         fd->filedes = -1;
953         fd->gzfiledes = NULL;
954         
955         /* XXX, this doesn't need to be done all the time,
956          * but it keeps us re-entrant,  remove once we have
957          * a lib that provides a nice lock. - zr
958          */
959         fd->memsdna = DNA_sdna_from_data(DNAstr, DNAlen, false);
960         
961         fd->datamap = oldnewmap_new();
962         fd->globmap = oldnewmap_new();
963         fd->libmap = oldnewmap_new();
964         
965         return fd;
966 }
967
968 static FileData *blo_decode_and_check(FileData *fd, ReportList *reports)
969 {
970         decode_blender_header(fd);
971         
972         if (fd->flags & FD_FLAGS_FILE_OK) {
973                 if (!read_file_dna(fd)) {
974                         BKE_reportf(reports, RPT_ERROR, "Failed to read blend file '%s', incomplete", fd->relabase);
975                         blo_freefiledata(fd);
976                         fd = NULL;
977                 }
978         }
979         else {
980                 BKE_reportf(reports, RPT_ERROR, "Failed to read blend file '%s', not a blend file", fd->relabase);
981                 blo_freefiledata(fd);
982                 fd = NULL;
983         }
984         
985         return fd;
986 }
987
988 /* cannot be called with relative paths anymore! */
989 /* on each new library added, it now checks for the current FileData and expands relativeness */
990 FileData *blo_openblenderfile(const char *filepath, ReportList *reports)
991 {
992         gzFile gzfile;
993         errno = 0;
994         gzfile = BLI_gzopen(filepath, "rb");
995         
996         if (gzfile == (gzFile)Z_NULL) {
997                 BKE_reportf(reports, RPT_WARNING, "Unable to open '%s': %s",
998                             filepath, errno ? strerror(errno) : TIP_("unknown error reading file"));
999                 return NULL;
1000         }
1001         else {
1002                 FileData *fd = filedata_new();
1003                 fd->gzfiledes = gzfile;
1004                 fd->read = fd_read_gzip_from_file;
1005                 
1006                 /* needed for library_append and read_libraries */
1007                 BLI_strncpy(fd->relabase, filepath, sizeof(fd->relabase));
1008                 
1009                 return blo_decode_and_check(fd, reports);
1010         }
1011 }
1012
1013 static int fd_read_gzip_from_memory(FileData *filedata, void *buffer, unsigned int size)
1014 {
1015         int err;
1016
1017         filedata->strm.next_out = (Bytef *) buffer;
1018         filedata->strm.avail_out = size;
1019
1020         // Inflate another chunk.
1021         err = inflate (&filedata->strm, Z_SYNC_FLUSH);
1022
1023         if (err == Z_STREAM_END) {
1024                 return 0;
1025         }
1026         else if (err != Z_OK) {
1027                 printf("fd_read_gzip_from_memory: zlib error\n");
1028                 return 0;
1029         }
1030
1031         filedata->seek += size;
1032
1033         return (size);
1034 }
1035
1036 static int fd_read_gzip_from_memory_init(FileData *fd)
1037 {
1038
1039         fd->strm.next_in = (Bytef *) fd->buffer;
1040         fd->strm.avail_in = fd->buffersize;
1041         fd->strm.total_out = 0;
1042         fd->strm.zalloc = Z_NULL;
1043         fd->strm.zfree = Z_NULL;
1044         
1045         if (inflateInit2(&fd->strm, (16+MAX_WBITS)) != Z_OK)
1046                 return 0;
1047
1048         fd->read = fd_read_gzip_from_memory;
1049         
1050         return 1;
1051 }
1052
1053 FileData *blo_openblendermemory(const void *mem, int memsize, ReportList *reports)
1054 {
1055         if (!mem || memsize<SIZEOFBLENDERHEADER) {
1056                 BKE_report(reports, RPT_WARNING, (mem) ? TIP_("Unable to read"): TIP_("Unable to open"));
1057                 return NULL;
1058         }
1059         else {
1060                 FileData *fd = filedata_new();
1061                 const char *cp = mem;
1062                 
1063                 fd->buffer = mem;
1064                 fd->buffersize = memsize;
1065                 
1066                 /* test if gzip */
1067                 if (cp[0] == 0x1f && cp[1] == 0x8b) {
1068                         if (0 == fd_read_gzip_from_memory_init(fd)) {
1069                                 blo_freefiledata(fd);
1070                                 return NULL;
1071                         }
1072                 }
1073                 else
1074                         fd->read = fd_read_from_memory;
1075                         
1076                 fd->flags |= FD_FLAGS_NOT_MY_BUFFER;
1077
1078                 return blo_decode_and_check(fd, reports);
1079         }
1080 }
1081
1082 FileData *blo_openblendermemfile(MemFile *memfile, ReportList *reports)
1083 {
1084         if (!memfile) {
1085                 BKE_report(reports, RPT_WARNING, "Unable to open blend <memory>");
1086                 return NULL;
1087         }
1088         else {
1089                 FileData *fd = filedata_new();
1090                 fd->memfile = memfile;
1091                 
1092                 fd->read = fd_read_from_memfile;
1093                 fd->flags |= FD_FLAGS_NOT_MY_BUFFER;
1094                 
1095                 return blo_decode_and_check(fd, reports);
1096         }
1097 }
1098
1099
1100 void blo_freefiledata(FileData *fd)
1101 {
1102         if (fd) {
1103                 if (fd->filedes != -1) {
1104                         close(fd->filedes);
1105                 }
1106                 
1107                 if (fd->gzfiledes != NULL) {
1108                         gzclose(fd->gzfiledes);
1109                 }
1110                 
1111                 if (fd->strm.next_in) {
1112                         if (inflateEnd (&fd->strm) != Z_OK) {
1113                                 printf("close gzip stream error\n");
1114                         }
1115                 }
1116                 
1117                 if (fd->buffer && !(fd->flags & FD_FLAGS_NOT_MY_BUFFER)) {
1118                         MEM_freeN((void *)fd->buffer);
1119                         fd->buffer = NULL;
1120                 }
1121                 
1122                 // Free all BHeadN data blocks
1123                 BLI_freelistN(&fd->listbase);
1124                 
1125                 if (fd->memsdna)
1126                         DNA_sdna_free(fd->memsdna);
1127                 if (fd->filesdna)
1128                         DNA_sdna_free(fd->filesdna);
1129                 if (fd->compflags)
1130                         MEM_freeN(fd->compflags);
1131                 
1132                 if (fd->datamap)
1133                         oldnewmap_free(fd->datamap);
1134                 if (fd->globmap)
1135                         oldnewmap_free(fd->globmap);
1136                 if (fd->imamap)
1137                         oldnewmap_free(fd->imamap);
1138                 if (fd->movieclipmap)
1139                         oldnewmap_free(fd->movieclipmap);
1140                 if (fd->packedmap)
1141                         oldnewmap_free(fd->packedmap);
1142                 if (fd->libmap && !(fd->flags & FD_FLAGS_NOT_MY_LIBMAP))
1143                         oldnewmap_free(fd->libmap);
1144                 if (fd->bheadmap)
1145                         MEM_freeN(fd->bheadmap);
1146                 
1147                 MEM_freeN(fd);
1148         }
1149 }
1150
1151 /* ************ DIV ****************** */
1152
1153 int BLO_has_bfile_extension(const char *str)
1154 {
1155         return (BLI_testextensie(str, ".ble") || 
1156                 BLI_testextensie(str, ".blend") || 
1157                 BLI_testextensie(str, ".blend.gz"));
1158 }
1159
1160 int BLO_is_a_library(const char *path, char *dir, char *group)
1161 {
1162         /* return ok when a blenderfile, in dir is the filename,
1163          * in group the type of libdata
1164          */
1165         int len;
1166         char *fd;
1167         
1168         strcpy(dir, path);
1169         len = strlen(dir);
1170         if (len < 7) return 0;
1171         if ((dir[len - 1] != '/') && (dir[len - 1] != '\\')) return 0;
1172         
1173         group[0] = '\0';
1174         dir[len - 1] = '\0';
1175
1176         /* Find the last slash */
1177         fd = (char *)BLI_last_slash(dir);
1178
1179         if (fd == NULL) return 0;
1180         *fd = 0;
1181         if (BLO_has_bfile_extension(fd+1)) {
1182                 /* the last part of the dir is a .blend file, no group follows */
1183                 *fd = '/'; /* put back the removed slash separating the dir and the .blend file name */
1184         }
1185         else {
1186                 const char * const gp = fd + 1; // in case we have a .blend file, gp points to the group
1187                 
1188                 /* Find the last slash */
1189                 fd = (char *)BLI_last_slash(dir);
1190                 if (!fd || !BLO_has_bfile_extension(fd+1)) return 0;
1191                 
1192                 /* now we know that we are in a blend file and it is safe to 
1193                  * assume that gp actually points to a group */
1194                 if (strcmp("Screen", gp) != 0)
1195                         BLI_strncpy(group, gp, GROUP_MAX);
1196         }
1197         return 1;
1198 }
1199
1200 /* ************** OLD POINTERS ******************* */
1201
1202 static void *newdataadr(FileData *fd, void *adr)                /* only direct databocks */
1203 {
1204         return oldnewmap_lookup_and_inc(fd->datamap, adr, true);
1205 }
1206
1207 static void *newdataadr_no_us(FileData *fd, void *adr)          /* only direct databocks */
1208 {
1209         return oldnewmap_lookup_and_inc(fd->datamap, adr, false);
1210 }
1211
1212 static void *newglobadr(FileData *fd, void *adr)            /* direct datablocks with global linking */
1213 {
1214         return oldnewmap_lookup_and_inc(fd->globmap, adr, true);
1215 }
1216
1217 static void *newimaadr(FileData *fd, void *adr)             /* used to restore image data after undo */
1218 {
1219         if (fd->imamap && adr)
1220                 return oldnewmap_lookup_and_inc(fd->imamap, adr, true);
1221         return NULL;
1222 }
1223
1224 static void *newmclipadr(FileData *fd, void *adr)      /* used to restore movie clip data after undo */
1225 {
1226         if (fd->movieclipmap && adr)
1227                 return oldnewmap_lookup_and_inc(fd->movieclipmap, adr, true);
1228         return NULL;
1229 }
1230
1231 static void *newpackedadr(FileData *fd, void *adr)      /* used to restore packed data after undo */
1232 {
1233         if (fd->packedmap && adr)
1234                 return oldnewmap_lookup_and_inc(fd->packedmap, adr, true);
1235         
1236         return oldnewmap_lookup_and_inc(fd->datamap, adr, true);
1237 }
1238
1239
1240 static void *newlibadr(FileData *fd, void *lib, void *adr)              /* only lib data */
1241 {
1242         return oldnewmap_liblookup(fd->libmap, adr, lib);
1243 }
1244
1245 void *blo_do_versions_newlibadr(FileData *fd, void *lib, void *adr)             /* only lib data */
1246 {
1247         return newlibadr(fd, lib, adr);
1248 }
1249
1250 static void *newlibadr_us(FileData *fd, void *lib, void *adr)   /* increases user number */
1251 {
1252         ID *id = newlibadr(fd, lib, adr);
1253         
1254         if (id)
1255                 id->us++;
1256         
1257         return id;
1258 }
1259
1260 void *blo_do_versions_newlibadr_us(FileData *fd, void *lib, void *adr)  /* increases user number */
1261 {
1262         return newlibadr_us(fd, lib, adr);
1263 }
1264
1265 static void change_idid_adr_fd(FileData *fd, void *old, void *new)
1266 {
1267         int i;
1268         
1269         for (i = 0; i < fd->libmap->nentries; i++) {
1270                 OldNew *entry = &fd->libmap->entries[i];
1271                 
1272                 if (old==entry->newp && entry->nr==ID_ID) {
1273                         entry->newp = new;
1274                         if (new) entry->nr = GS( ((ID *)new)->name );
1275                 }
1276         }
1277 }
1278
1279 static void change_idid_adr(ListBase *mainlist, FileData *basefd, void *old, void *new)
1280 {
1281         Main *mainptr;
1282         
1283         for (mainptr = mainlist->first; mainptr; mainptr = mainptr->next) {
1284                 FileData *fd;
1285                 
1286                 if (mainptr->curlib)
1287                         fd = mainptr->curlib->filedata;
1288                 else
1289                         fd = basefd;
1290                 
1291                 if (fd) {
1292                         change_idid_adr_fd(fd, old, new);
1293                 }
1294         }
1295 }
1296
1297 /* lib linked proxy objects point to our local data, we need
1298  * to clear that pointer before reading the undo memfile since
1299  * the object might be removed, it is set again in reading
1300  * if the local object still exists */
1301 void blo_clear_proxy_pointers_from_lib(Main *oldmain)
1302 {
1303         Object *ob = oldmain->object.first;
1304         
1305         for (; ob; ob= ob->id.next) {
1306                 if (ob->id.lib)
1307                         ob->proxy_from = NULL;
1308         }
1309 }
1310
1311 void blo_make_image_pointer_map(FileData *fd, Main *oldmain)
1312 {
1313         Image *ima = oldmain->image.first;
1314         Scene *sce = oldmain->scene.first;
1315         int a;
1316         
1317         fd->imamap = oldnewmap_new();
1318         
1319         for (; ima; ima = ima->id.next) {
1320                 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                 fcm->edata = NULL;
2032                 
2033                 /* do relinking of data for specific types */
2034                 switch (fcm->type) {
2035                         case FMODIFIER_TYPE_GENERATOR:
2036                         {
2037                                 FMod_Generator *data = (FMod_Generator *)fcm->data;
2038                                 
2039                                 data->coefficients = newdataadr(fd, data->coefficients);
2040                                 
2041                                 if (fd->flags & FD_FLAGS_SWITCH_ENDIAN) {
2042                                         BLI_endian_switch_float_array(data->coefficients, data->arraysize);
2043                                 }
2044                         }
2045                                 break;
2046                         case FMODIFIER_TYPE_ENVELOPE:
2047                         {
2048                                 FMod_Envelope *data=  (FMod_Envelope *)fcm->data;
2049                                 
2050                                 data->data= newdataadr(fd, data->data);
2051                         }
2052                                 break;
2053                         case FMODIFIER_TYPE_PYTHON:
2054                         {
2055                                 FMod_Python *data = (FMod_Python *)fcm->data;
2056                                 
2057                                 data->prop = newdataadr(fd, data->prop);
2058                                 IDP_DirectLinkGroup_OrFree(&data->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2059                         }
2060                                 break;
2061                 }
2062         }
2063 }
2064
2065 /* NOTE: this assumes that link_list has already been called on the list */
2066 static void direct_link_fcurves(FileData *fd, ListBase *list)
2067 {
2068         FCurve *fcu;
2069         
2070         /* link F-Curve data to F-Curve again (non ID-libs) */
2071         for (fcu = list->first; fcu; fcu = fcu->next) {
2072                 /* curve data */
2073                 fcu->bezt = newdataadr(fd, fcu->bezt);
2074                 fcu->fpt = newdataadr(fd, fcu->fpt);
2075                 
2076                 /* rna path */
2077                 fcu->rna_path = newdataadr(fd, fcu->rna_path);
2078                 
2079                 /* group */
2080                 fcu->grp = newdataadr(fd, fcu->grp);
2081                 
2082                 /* clear disabled flag - allows disabled drivers to be tried again ([#32155]),
2083                  * but also means that another method for "reviving disabled F-Curves" exists
2084                  */
2085                 fcu->flag &= ~FCURVE_DISABLED;
2086                 
2087                 /* driver */
2088                 fcu->driver= newdataadr(fd, fcu->driver);
2089                 if (fcu->driver) {
2090                         ChannelDriver *driver= fcu->driver;
2091                         DriverVar *dvar;
2092                         
2093                         /* compiled expression data will need to be regenerated (old pointer may still be set here) */
2094                         driver->expr_comp = NULL;
2095                         
2096                         /* give the driver a fresh chance - the operating environment may be different now 
2097                          * (addons, etc. may be different) so the driver namespace may be sane now [#32155]
2098                          */
2099                         driver->flag &= ~DRIVER_FLAG_INVALID;
2100                         
2101                         /* relink variables, targets and their paths */
2102                         link_list(fd, &driver->variables);
2103                         for (dvar= driver->variables.first; dvar; dvar= dvar->next) {
2104                                 DRIVER_TARGETS_LOOPER(dvar)
2105                                 {
2106                                         /* only relink the targets being used */
2107                                         if (tarIndex < dvar->num_targets)
2108                                                 dtar->rna_path = newdataadr(fd, dtar->rna_path);
2109                                         else
2110                                                 dtar->rna_path = NULL;
2111                                 }
2112                                 DRIVER_TARGETS_LOOPER_END
2113                         }
2114                 }
2115                 
2116                 /* modifiers */
2117                 link_list(fd, &fcu->modifiers);
2118                 direct_link_fmodifiers(fd, &fcu->modifiers);
2119         }
2120 }
2121
2122
2123 static void lib_link_action(FileData *fd, Main *main)
2124 {
2125         bAction *act;
2126         bActionChannel *chan;
2127
2128         for (act = main->action.first; act; act = act->id.next) {
2129                 if (act->id.flag & LIB_NEED_LINK) {
2130                         act->id.flag -= LIB_NEED_LINK;
2131                         
2132 // XXX deprecated - old animation system <<<
2133                         for (chan=act->chanbase.first; chan; chan=chan->next) {
2134                                 chan->ipo = newlibadr_us(fd, act->id.lib, chan->ipo);
2135                                 lib_link_constraint_channels(fd, &act->id, &chan->constraintChannels);
2136                         }
2137 // >>> XXX deprecated - old animation system
2138                         
2139                         lib_link_fcurves(fd, &act->id, &act->curves);
2140                 }
2141         }
2142 }
2143
2144 static void direct_link_action(FileData *fd, bAction *act)
2145 {
2146         bActionChannel *achan; // XXX deprecated - old animation system
2147         bActionGroup *agrp;
2148
2149         link_list(fd, &act->curves);
2150         link_list(fd, &act->chanbase); // XXX deprecated - old animation system
2151         link_list(fd, &act->groups);
2152         link_list(fd, &act->markers);
2153
2154 // XXX deprecated - old animation system <<<
2155         for (achan = act->chanbase.first; achan; achan=achan->next) {
2156                 achan->grp = newdataadr(fd, achan->grp);
2157                 
2158                 link_list(fd, &achan->constraintChannels);
2159         }
2160 // >>> XXX deprecated - old animation system
2161
2162         direct_link_fcurves(fd, &act->curves);
2163         
2164         for (agrp = act->groups.first; agrp; agrp= agrp->next) {
2165                 agrp->channels.first= newdataadr(fd, agrp->channels.first);
2166                 agrp->channels.last= newdataadr(fd, agrp->channels.last);
2167         }
2168 }
2169
2170 static void lib_link_nladata_strips(FileData *fd, ID *id, ListBase *list)
2171 {
2172         NlaStrip *strip;
2173         
2174         for (strip = list->first; strip; strip = strip->next) {
2175                 /* check strip's children */
2176                 lib_link_nladata_strips(fd, id, &strip->strips);
2177                 
2178                 /* check strip's F-Curves */
2179                 lib_link_fcurves(fd, id, &strip->fcurves);
2180                 
2181                 /* reassign the counted-reference to action */
2182                 strip->act = newlibadr_us(fd, id->lib, strip->act);
2183                 
2184                 /* fix action id-root (i.e. if it comes from a pre 2.57 .blend file) */
2185                 if ((strip->act) && (strip->act->idroot == 0))
2186                         strip->act->idroot = GS(id->name);
2187         }
2188 }
2189
2190 static void lib_link_nladata(FileData *fd, ID *id, ListBase *list)
2191 {
2192         NlaTrack *nlt;
2193         
2194         /* we only care about the NLA strips inside the tracks */
2195         for (nlt = list->first; nlt; nlt = nlt->next) {
2196                 lib_link_nladata_strips(fd, id, &nlt->strips);
2197         }
2198 }
2199
2200 /* This handles Animato NLA-Strips linking 
2201  * NOTE: this assumes that link_list has already been called on the list 
2202  */
2203 static void direct_link_nladata_strips(FileData *fd, ListBase *list)
2204 {
2205         NlaStrip *strip;
2206         
2207         for (strip = list->first; strip; strip = strip->next) {
2208                 /* strip's child strips */
2209                 link_list(fd, &strip->strips);
2210                 direct_link_nladata_strips(fd, &strip->strips);
2211                 
2212                 /* strip's F-Curves */
2213                 link_list(fd, &strip->fcurves);
2214                 direct_link_fcurves(fd, &strip->fcurves);
2215                 
2216                 /* strip's F-Modifiers */
2217                 link_list(fd, &strip->modifiers);
2218                 direct_link_fmodifiers(fd, &strip->modifiers);
2219         }
2220 }
2221
2222 /* NOTE: this assumes that link_list has already been called on the list */
2223 static void direct_link_nladata(FileData *fd, ListBase *list)
2224 {
2225         NlaTrack *nlt;
2226         
2227         for (nlt = list->first; nlt; nlt = nlt->next) {
2228                 /* relink list of strips */
2229                 link_list(fd, &nlt->strips);
2230                 
2231                 /* relink strip data */
2232                 direct_link_nladata_strips(fd, &nlt->strips);
2233         }
2234 }
2235
2236 /* ------- */
2237
2238 static void lib_link_keyingsets(FileData *fd, ID *id, ListBase *list)
2239 {
2240         KeyingSet *ks;
2241         KS_Path *ksp;
2242         
2243         /* here, we're only interested in the ID pointer stored in some of the paths */
2244         for (ks = list->first; ks; ks = ks->next) {
2245                 for (ksp = ks->paths.first; ksp; ksp = ksp->next) {
2246                         ksp->id= newlibadr(fd, id->lib, ksp->id); 
2247                 }
2248         }
2249 }
2250
2251 /* NOTE: this assumes that link_list has already been called on the list */
2252 static void direct_link_keyingsets(FileData *fd, ListBase *list)
2253 {
2254         KeyingSet *ks;
2255         KS_Path *ksp;
2256         
2257         /* link KeyingSet data to KeyingSet again (non ID-libs) */
2258         for (ks = list->first; ks; ks = ks->next) {
2259                 /* paths */
2260                 link_list(fd, &ks->paths);
2261                 
2262                 for (ksp = ks->paths.first; ksp; ksp = ksp->next) {
2263                         /* rna path */
2264                         ksp->rna_path= newdataadr(fd, ksp->rna_path);
2265                 }
2266         }
2267 }
2268
2269 /* ------- */
2270
2271 static void lib_link_animdata(FileData *fd, ID *id, AnimData *adt)
2272 {
2273         if (adt == NULL)
2274                 return;
2275         
2276         /* link action data */
2277         adt->action= newlibadr_us(fd, id->lib, adt->action);
2278         adt->tmpact= newlibadr_us(fd, id->lib, adt->tmpact);
2279         
2280         /* fix action id-roots (i.e. if they come from a pre 2.57 .blend file) */
2281         if ((adt->action) && (adt->action->idroot == 0))
2282                 adt->action->idroot = GS(id->name);
2283         if ((adt->tmpact) && (adt->tmpact->idroot == 0))
2284                 adt->tmpact->idroot = GS(id->name);
2285         
2286         /* link drivers */
2287         lib_link_fcurves(fd, id, &adt->drivers);
2288         
2289         /* overrides don't have lib-link for now, so no need to do anything */
2290         
2291         /* link NLA-data */
2292         lib_link_nladata(fd, id, &adt->nla_tracks);
2293 }
2294
2295 static void direct_link_animdata(FileData *fd, AnimData *adt)
2296 {
2297         /* NOTE: must have called newdataadr already before doing this... */
2298         if (adt == NULL)
2299                 return;
2300         
2301         /* link drivers */
2302         link_list(fd, &adt->drivers);
2303         direct_link_fcurves(fd, &adt->drivers);
2304         
2305         /* link overrides */
2306         // TODO...
2307         
2308         /* link NLA-data */
2309         link_list(fd, &adt->nla_tracks);
2310         direct_link_nladata(fd, &adt->nla_tracks);
2311         
2312         /* relink active strip - even though strictly speaking this should only be used
2313          * if we're in 'tweaking mode', we need to be able to have this loaded back for
2314          * undo, but also since users may not exit tweakmode before saving (#24535)
2315          */
2316         // TODO: it's not really nice that anyone should be able to save the file in this
2317         //              state, but it's going to be too hard to enforce this single case...
2318         adt->actstrip = newdataadr(fd, adt->actstrip);
2319 }       
2320
2321 /* ************ READ MOTION PATHS *************** */
2322
2323 /* direct data for cache */
2324 static void direct_link_motionpath(FileData *fd, bMotionPath *mpath)
2325 {
2326         /* sanity check */
2327         if (mpath == NULL)
2328                 return;
2329         
2330         /* relink points cache */
2331         mpath->points = newdataadr(fd, mpath->points);
2332 }
2333
2334 /* ************ READ NODE TREE *************** */
2335
2336 static void lib_link_node_socket(FileData *fd, ID *UNUSED(id), bNodeSocket *sock)
2337 {
2338         /* Link ID Properties -- and copy this comment EXACTLY for easy finding
2339          * of library blocks that implement this.*/
2340         if (sock->prop)
2341                 IDP_LibLinkProperty(sock->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2342 }
2343
2344 /* singe node tree (also used for material/scene trees), ntree is not NULL */
2345 static void lib_link_ntree(FileData *fd, ID *id, bNodeTree *ntree)
2346 {
2347         bNode *node;
2348         bNodeSocket *sock;
2349         
2350         if (ntree->adt) lib_link_animdata(fd, &ntree->id, ntree->adt);
2351         
2352         ntree->gpd = newlibadr_us(fd, id->lib, ntree->gpd);
2353         
2354         for (node = ntree->nodes.first; node; node = node->next) {
2355                 /* Link ID Properties -- and copy this comment EXACTLY for easy finding
2356                  * of library blocks that implement this.*/
2357                 if (node->prop)
2358                         IDP_LibLinkProperty(node->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2359                 
2360                 node->id= newlibadr_us(fd, id->lib, node->id);
2361
2362                 for (sock = node->inputs.first; sock; sock = sock->next)
2363                         lib_link_node_socket(fd, id, sock);
2364                 for (sock = node->outputs.first; sock; sock = sock->next)
2365                         lib_link_node_socket(fd, id, sock);
2366         }
2367         
2368         for (sock = ntree->inputs.first; sock; sock = sock->next)
2369                 lib_link_node_socket(fd, id, sock);
2370         for (sock = ntree->outputs.first; sock; sock = sock->next)
2371                 lib_link_node_socket(fd, id, sock);
2372 }
2373
2374 /* library ntree linking after fileread */
2375 static void lib_link_nodetree(FileData *fd, Main *main)
2376 {
2377         bNodeTree *ntree;
2378         
2379         /* only link ID pointers */
2380         for (ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
2381                 if (ntree->id.flag & LIB_NEED_LINK) {
2382                         ntree->id.flag -= LIB_NEED_LINK;
2383                         lib_link_ntree(fd, &ntree->id, ntree);
2384                 }
2385         }
2386 }
2387
2388 /* get node tree stored locally in other IDs */
2389 static bNodeTree *nodetree_from_id(ID *id)
2390 {
2391         if (!id)
2392                 return NULL;
2393         switch (GS(id->name)) {
2394                 case ID_SCE: return ((Scene *)id)->nodetree;
2395                 case ID_MA: return ((Material *)id)->nodetree;
2396                 case ID_WO: return ((World *)id)->nodetree;
2397                 case ID_LA: return ((Lamp *)id)->nodetree;
2398                 case ID_TE: return ((Tex *)id)->nodetree;
2399         }
2400         return NULL;
2401 }
2402
2403 /* updates group node socket identifier so that
2404  * external links to/from the group node are preserved.
2405  */
2406 static void lib_node_do_versions_group_indices(bNode *gnode)
2407 {
2408         bNodeTree *ngroup = (bNodeTree*)gnode->id;
2409         bNodeSocket *sock;
2410         bNodeLink *link;
2411         
2412         for (sock=gnode->outputs.first; sock; sock = sock->next) {
2413                 int old_index = sock->to_index;
2414                 
2415                 for (link = ngroup->links.first; link; link = link->next) {
2416                         if (link->tonode == NULL && link->fromsock->own_index == old_index) {
2417                                 strcpy(sock->identifier, link->fromsock->identifier);
2418                                 /* deprecated */
2419                                 sock->own_index = link->fromsock->own_index;
2420                                 sock->to_index = 0;
2421                                 sock->groupsock = NULL;
2422                         }
2423                 }
2424         }
2425         for (sock=gnode->inputs.first; sock; sock = sock->next) {
2426                 int old_index = sock->to_index;
2427                 
2428                 for (link = ngroup->links.first; link; link = link->next) {
2429                         if (link->fromnode == NULL && link->tosock->own_index == old_index) {
2430                                 strcpy(sock->identifier, link->tosock->identifier);
2431                                 /* deprecated */
2432                                 sock->own_index = link->tosock->own_index;
2433                                 sock->to_index = 0;
2434                                 sock->groupsock = NULL;
2435                         }
2436                 }
2437         }
2438 }
2439
2440 /* verify types for nodes and groups, all data has to be read */
2441 /* open = 0: appending/linking, open = 1: open new file (need to clean out dynamic
2442  * typedefs */
2443 static void lib_verify_nodetree(Main *main, int UNUSED(open))
2444 {
2445         bNodeTree *ntree;
2446         
2447         /* this crashes blender on undo/redo */
2448 #if 0
2449                 if (open == 1) {
2450                         reinit_nodesystem();
2451                 }
2452 #endif
2453         
2454         /* set node->typeinfo pointers */
2455         FOREACH_NODETREE(main, ntree, id) {
2456                 ntreeSetTypes(NULL, ntree);
2457         } FOREACH_NODETREE_END
2458         
2459         /* verify static socket templates */
2460         FOREACH_NODETREE(main, ntree, id) {
2461                 bNode *node;
2462                 for (node=ntree->nodes.first; node; node=node->next)
2463                         node_verify_socket_templates(ntree, node);
2464         } FOREACH_NODETREE_END
2465         
2466         {
2467                 int has_old_groups = 0;
2468                 /* XXX this should actually be part of do_versions, but since we need
2469                  * finished library linking, it is not possible there. Instead in do_versions
2470                  * we have set the NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2 flag, so at this point we can do the
2471                  * actual group node updates.
2472                  */
2473                 for (ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
2474                         if (ntree->flag & NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2)
2475                                 has_old_groups = 1;
2476                 }
2477                 
2478                 if (has_old_groups) {
2479                         FOREACH_NODETREE(main, ntree, id) {
2480                                 /* updates external links for all group nodes in a tree */
2481                                 bNode *node;
2482                                 for (node = ntree->nodes.first; node; node = node->next) {
2483                                         if (node->type == NODE_GROUP) {
2484                                                 bNodeTree *ngroup = (bNodeTree*)node->id;
2485                                                 if (ngroup && (ngroup->flag & NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2))
2486                                                         lib_node_do_versions_group_indices(node);
2487                                         }
2488                                 }
2489                         } FOREACH_NODETREE_END
2490                 }
2491                 
2492                 for (ntree = main->nodetree.first; ntree; ntree = ntree->id.next)
2493                         ntree->flag &= ~NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2;
2494         }
2495         
2496         {
2497                 /* Convert the previously used ntree->inputs/ntree->outputs lists to interface nodes.
2498                  * Pre 2.56.2 node trees automatically have all unlinked sockets exposed already
2499                  * (see NTREE_DO_VERSIONS_GROUP_EXPOSE_2_56_2).
2500                  *
2501                  * XXX this should actually be part of do_versions,
2502                  * but needs valid typeinfo pointers to create interface nodes.
2503                  *
2504                  * Note: theoretically only needed in node groups (main->nodetree),
2505                  * but due to a temporary bug such links could have been added in all trees,
2506                  * so have to clean up all of them ...
2507                  */
2508                 
2509                 FOREACH_NODETREE(main, ntree, id) {
2510                         if (ntree->flag & NTREE_DO_VERSIONS_CUSTOMNODES_GROUP) {
2511                                 bNode *input_node = NULL, *output_node = NULL;
2512                                 int num_inputs = 0, num_outputs = 0;
2513                                 bNodeLink *link, *next_link;
2514                                 /* Only create new interface nodes for actual older files.
2515                                  * New file versions already have input/output nodes with duplicate links,
2516                                  * in that case just remove the invalid links.
2517                                  */
2518                                 int create_io_nodes = (ntree->flag & NTREE_DO_VERSIONS_CUSTOMNODES_GROUP_CREATE_INTERFACE);
2519                                 
2520                                 float input_locx = 1000000.0f, input_locy = 0.0f;
2521                                 float output_locx = -1000000.0f, output_locy = 0.0f;
2522                                 /* rough guess, not nice but we don't have access to UI constants here ... */
2523                                 static const float offsetx = 42 + 3*20 + 20;
2524                                 /*static const float offsety = 0.0f;*/
2525                                 
2526                                 if (create_io_nodes) {
2527                                         if (ntree->inputs.first)
2528                                                 input_node = nodeAddStaticNode(NULL, ntree, NODE_GROUP_INPUT);
2529                                         
2530                                         if (ntree->outputs.first)
2531                                                 output_node = nodeAddStaticNode(NULL, ntree, NODE_GROUP_OUTPUT);
2532                                 }
2533                                 
2534                                 /* Redirect links from/to the node tree interface to input/output node.
2535                                  * If the fromnode/tonode pointers are NULL, this means a link from/to
2536                                  * the ntree interface sockets, which need to be redirected to new interface nodes.
2537                                  */
2538                                 for (link = ntree->links.first; link; link = next_link) {
2539                                         int free_link = FALSE;
2540                                         next_link = link->next;
2541                                         
2542                                         if (link->fromnode == NULL) {
2543                                                 if (input_node) {
2544                                                         link->fromnode = input_node;
2545                                                         link->fromsock = node_group_input_find_socket(input_node, link->fromsock->identifier);
2546                                                         ++num_inputs;
2547                                                         
2548                                                         if (link->tonode) {
2549                                                                 if (input_locx > link->tonode->locx - offsetx)
2550                                                                         input_locx = link->tonode->locx - offsetx;
2551                                                                 input_locy += link->tonode->locy;
2552                                                         }
2553                                                 }
2554                                                 else
2555                                                         free_link = TRUE;
2556                                         }
2557                                         
2558                                         if (link->tonode == NULL) {
2559                                                 if (output_node) {
2560                                                         link->tonode = output_node;
2561                                                         link->tosock = node_group_output_find_socket(output_node, link->tosock->identifier);
2562                                                         ++num_outputs;
2563                                                         
2564                                                         if (link->fromnode) {
2565                                                                 if (output_locx < link->fromnode->locx + offsetx)
2566                                                                         output_locx = link->fromnode->locx + offsetx;
2567                                                                 output_locy += link->fromnode->locy;
2568                                                         }
2569                                                 }
2570                                                 else
2571                                                         free_link = TRUE;
2572                                         }
2573                                         
2574                                         if (free_link)
2575                                                 nodeRemLink(ntree, link);
2576                                 }
2577                                 
2578                                 if (num_inputs > 0) {
2579                                         input_locy /= num_inputs;
2580                                         input_node->locx = input_locx;
2581                                         input_node->locy = input_locy;
2582                                 }
2583                                 if (num_outputs > 0) {
2584                                         output_locy /= num_outputs;
2585                                         output_node->locx = output_locx;
2586                                         output_node->locy = output_locy;
2587                                 }
2588                                 
2589                                 /* clear do_versions flags */
2590                                 ntree->flag &= ~(NTREE_DO_VERSIONS_CUSTOMNODES_GROUP | NTREE_DO_VERSIONS_CUSTOMNODES_GROUP_CREATE_INTERFACE);
2591                         }
2592                 }
2593                 FOREACH_NODETREE_END
2594         }
2595         
2596         /* verify all group user nodes */
2597         for (ntree = main->nodetree.first; ntree; ntree = ntree->id.next) {
2598                 ntreeVerifyNodes(main, &ntree->id);
2599         }
2600         
2601         /* make update calls where necessary */
2602         {
2603                 FOREACH_NODETREE(main, ntree, id) {
2604                         /* make an update call for the tree */
2605                         ntreeUpdateTree(main, ntree);
2606                 } FOREACH_NODETREE_END
2607         }
2608 }
2609
2610 static void direct_link_node_socket(FileData *fd, bNodeSocket *sock)
2611 {
2612         sock->prop = newdataadr(fd, sock->prop);
2613         IDP_DirectLinkGroup_OrFree(&sock->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2614         
2615         sock->link = newdataadr(fd, sock->link);
2616         sock->typeinfo = NULL;
2617         sock->storage = newdataadr(fd, sock->storage);
2618         sock->default_value = newdataadr(fd, sock->default_value);
2619         sock->cache = NULL;
2620 }
2621
2622 /* ntree itself has been read! */
2623 static void direct_link_nodetree(FileData *fd, bNodeTree *ntree)
2624 {
2625         /* note: writing and reading goes in sync, for speed */
2626         bNode *node;
2627         bNodeSocket *sock;
2628         bNodeLink *link;
2629         
2630         ntree->init = 0;                /* to set callbacks and force setting types */
2631         ntree->is_updating = FALSE;
2632         ntree->typeinfo= NULL;
2633         ntree->interface_type = NULL;
2634         
2635         ntree->progress = NULL;
2636         ntree->execdata = NULL;
2637         
2638         ntree->adt = newdataadr(fd, ntree->adt);
2639         direct_link_animdata(fd, ntree->adt);
2640         
2641         ntree->id.flag &= ~(LIB_ID_RECALC|LIB_ID_RECALC_DATA);
2642
2643         link_list(fd, &ntree->nodes);
2644         for (node = ntree->nodes.first; node; node = node->next) {
2645                 node->typeinfo = NULL;
2646                 
2647                 link_list(fd, &node->inputs);
2648                 link_list(fd, &node->outputs);
2649                 
2650                 node->prop = newdataadr(fd, node->prop);
2651                 IDP_DirectLinkGroup_OrFree(&node->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2652                 
2653                 link_list(fd, &node->internal_links);
2654                 for (link = node->internal_links.first; link; link = link->next) {
2655                         link->fromnode = newdataadr(fd, link->fromnode);
2656                         link->fromsock = newdataadr(fd, link->fromsock);
2657                         link->tonode = newdataadr(fd, link->tonode);
2658                         link->tosock = newdataadr(fd, link->tosock);
2659                 }
2660                 
2661                 if (node->type == CMP_NODE_MOVIEDISTORTION) {
2662                         node->storage = newmclipadr(fd, node->storage);
2663                 }
2664                 else {
2665                         node->storage = newdataadr(fd, node->storage);
2666                 }
2667                 
2668                 if (node->storage) {
2669                         /* could be handlerized at some point */
2670                         if (ntree->type==NTREE_SHADER) {
2671                                 if (node->type==SH_NODE_CURVE_VEC || node->type==SH_NODE_CURVE_RGB) {
2672                                         direct_link_curvemapping(fd, node->storage);
2673                                 }
2674                                 else if (node->type==SH_NODE_SCRIPT) {
2675                                         NodeShaderScript *nss = (NodeShaderScript *) node->storage;
2676                                         nss->bytecode = newdataadr(fd, nss->bytecode);
2677                                 }
2678                         }
2679                         else if (ntree->type==NTREE_COMPOSIT) {
2680                                 if (ELEM4(node->type, CMP_NODE_TIME, CMP_NODE_CURVE_VEC, CMP_NODE_CURVE_RGB, CMP_NODE_HUECORRECT))
2681                                         direct_link_curvemapping(fd, node->storage);
2682                                 else if (ELEM3(node->type, CMP_NODE_IMAGE, CMP_NODE_VIEWER, CMP_NODE_SPLITVIEWER))
2683                                         ((ImageUser *)node->storage)->ok = 1;
2684                         }
2685                         else if ( ntree->type==NTREE_TEXTURE) {
2686                                 if (node->type==TEX_NODE_CURVE_RGB || node->type==TEX_NODE_CURVE_TIME)
2687                                         direct_link_curvemapping(fd, node->storage);
2688                                 else if (node->type==TEX_NODE_IMAGE)
2689                                         ((ImageUser *)node->storage)->ok = 1;
2690                         }
2691                 }
2692         }
2693         link_list(fd, &ntree->links);
2694         
2695         /* and we connect the rest */
2696         for (node = ntree->nodes.first; node; node = node->next) {
2697                 node->parent = newdataadr(fd, node->parent);
2698                 node->lasty = 0;
2699                 
2700                 for (sock = node->inputs.first; sock; sock = sock->next)
2701                         direct_link_node_socket(fd, sock);
2702                 for (sock = node->outputs.first; sock; sock = sock->next)
2703                         direct_link_node_socket(fd, sock);
2704         }
2705         
2706         /* interface socket lists */
2707         link_list(fd, &ntree->inputs);
2708         link_list(fd, &ntree->outputs);
2709         for (sock = ntree->inputs.first; sock; sock = sock->next)
2710                 direct_link_node_socket(fd, sock);
2711         for (sock = ntree->outputs.first; sock; sock = sock->next)
2712                 direct_link_node_socket(fd, sock);
2713         
2714         for (link = ntree->links.first; link; link= link->next) {
2715                 link->fromnode = newdataadr(fd, link->fromnode);
2716                 link->tonode = newdataadr(fd, link->tonode);
2717                 link->fromsock = newdataadr(fd, link->fromsock);
2718                 link->tosock = newdataadr(fd, link->tosock);
2719         }
2720         
2721 #if 0
2722         if (ntree->previews) {
2723                 bNodeInstanceHash *new_previews = BKE_node_instance_hash_new("node previews");
2724                 bNodeInstanceHashIterator iter;
2725                 
2726                 NODE_INSTANCE_HASH_ITER(iter, ntree->previews) {
2727                         bNodePreview *preview = BKE_node_instance_hash_iterator_get_value(&iter);
2728                         if (preview) {
2729                                 bNodePreview *new_preview = newimaadr(fd, preview);
2730                                 if (new_preview) {
2731                                         bNodeInstanceKey key = BKE_node_instance_hash_iterator_get_key(&iter);
2732                                         BKE_node_instance_hash_insert(new_previews, key, new_preview);
2733                                 }
2734                         }
2735                 }
2736                 BKE_node_instance_hash_free(ntree->previews, NULL);
2737                 ntree->previews = new_previews;
2738         }
2739 #else
2740         /* XXX TODO */
2741         ntree->previews = NULL;
2742 #endif
2743         
2744         /* type verification is in lib-link */
2745 }
2746
2747 /* ************ READ ARMATURE ***************** */
2748
2749 /* temp struct used to transport needed info to lib_link_constraint_cb() */
2750 typedef struct tConstraintLinkData {
2751         FileData *fd;
2752         ID *id;
2753 } tConstraintLinkData;
2754 /* callback function used to relink constraint ID-links */
2755 static void lib_link_constraint_cb(bConstraint *UNUSED(con), ID **idpoin, short isReference, void *userdata)
2756 {
2757         tConstraintLinkData *cld= (tConstraintLinkData *)userdata;
2758         
2759         /* for reference types, we need to increment the usercounts on load... */
2760         if (isReference) {
2761                 /* reference type - with usercount */
2762                 *idpoin = newlibadr_us(cld->fd, cld->id->lib, *idpoin);
2763         }
2764         else {
2765                 /* target type - no usercount needed */
2766                 *idpoin = newlibadr(cld->fd, cld->id->lib, *idpoin);
2767         }
2768 }
2769
2770 static void lib_link_constraints(FileData *fd, ID *id, ListBase *conlist)
2771 {
2772         tConstraintLinkData cld;
2773         bConstraint *con;
2774         
2775         /* legacy fixes */
2776         for (con = conlist->first; con; con=con->next) {
2777                 /* patch for error introduced by changing constraints (dunno how) */
2778                 /* if con->data type changes, dna cannot resolve the pointer! (ton) */
2779                 if (con->data == NULL) {
2780                         con->type = CONSTRAINT_TYPE_NULL;
2781                 }
2782                 /* own ipo, all constraints have it */
2783                 con->ipo = newlibadr_us(fd, id->lib, con->ipo); // XXX deprecated - old animation system
2784         }
2785         
2786         /* relink all ID-blocks used by the constraints */
2787         cld.fd = fd;
2788         cld.id = id;
2789         
2790         BKE_id_loop_constraints(conlist, lib_link_constraint_cb, &cld);
2791 }
2792
2793 static void direct_link_constraints(FileData *fd, ListBase *lb)
2794 {
2795         bConstraint *con;
2796         
2797         link_list(fd, lb);
2798         for (con=lb->first; con; con=con->next) {
2799                 con->data = newdataadr(fd, con->data);
2800                 
2801                 switch (con->type) {
2802                         case CONSTRAINT_TYPE_PYTHON:
2803                         {
2804                                 bPythonConstraint *data= con->data;
2805                                 
2806                                 link_list(fd, &data->targets);
2807                                 
2808                                 data->prop = newdataadr(fd, data->prop);
2809                                 IDP_DirectLinkGroup_OrFree(&data->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2810                                 break;
2811                         }
2812                         case CONSTRAINT_TYPE_SPLINEIK:
2813                         {
2814                                 bSplineIKConstraint *data= con->data;
2815
2816                                 data->points= newdataadr(fd, data->points);
2817                                 break;
2818                         }
2819                         case CONSTRAINT_TYPE_KINEMATIC:
2820                         {
2821                                 bKinematicConstraint *data = con->data;
2822
2823                                 con->lin_error = 0.f;
2824                                 con->rot_error = 0.f;
2825
2826                                 /* version patch for runtime flag, was not cleared in some case */
2827                                 data->flag &= ~CONSTRAINT_IK_AUTO;
2828                                 break;
2829                         }
2830                         case CONSTRAINT_TYPE_CHILDOF:
2831                         {
2832                                 /* XXX version patch, in older code this flag wasn't always set, and is inherent to type */
2833                                 if (con->ownspace == CONSTRAINT_SPACE_POSE)
2834                                         con->flag |= CONSTRAINT_SPACEONCE;
2835                                 break;
2836                         }
2837                 }
2838         }
2839 }
2840
2841 static void lib_link_pose(FileData *fd, Main *bmain, Object *ob, bPose *pose)
2842 {
2843         bPoseChannel *pchan;
2844         bArmature *arm = ob->data;
2845         int rebuild = 0;
2846         
2847         if (!pose || !arm)
2848                 return;
2849         
2850         /* always rebuild to match proxy or lib changes, but on Undo */
2851         if (fd->memfile == NULL)
2852                 if (ob->proxy || (ob->id.lib==NULL && arm->id.lib))
2853                         rebuild = 1;
2854         
2855         if (ob->proxy) {
2856                 /* sync proxy layer */
2857                 if (pose->proxy_layer)
2858                         arm->layer = pose->proxy_layer;
2859                 
2860                 /* sync proxy active bone */
2861                 if (pose->proxy_act_bone[0]) {
2862                         Bone *bone = BKE_armature_find_bone_name(arm, pose->proxy_act_bone);
2863                         if (bone)
2864                                 arm->act_bone = bone;
2865                 }
2866         }
2867         
2868         for (pchan = pose->chanbase.first; pchan; pchan=pchan->next) {
2869                 lib_link_constraints(fd, (ID *)ob, &pchan->constraints);
2870                 
2871                 /* hurms... loop in a loop, but yah... later... (ton) */
2872                 pchan->bone = BKE_armature_find_bone_name(arm, pchan->name);
2873                 
2874                 pchan->custom = newlibadr_us(fd, arm->id.lib, pchan->custom);
2875                 if (pchan->bone == NULL)
2876                         rebuild= 1;
2877                 else if (ob->id.lib==NULL && arm->id.lib) {
2878                         /* local pose selection copied to armature, bit hackish */
2879                         pchan->bone->flag &= ~BONE_SELECTED;
2880                         pchan->bone->flag |= pchan->selectflag;
2881                 }
2882         }
2883         
2884         if (rebuild) {
2885                 DAG_id_tag_update_ex(bmain, &ob->id, OB_RECALC_OB | OB_RECALC_DATA | OB_RECALC_TIME);
2886                 pose->flag |= POSE_RECALC;
2887         }
2888 }
2889
2890 static void lib_link_armature(FileData *fd, Main *main)
2891 {
2892         bArmature *arm;
2893         
2894         for (arm = main->armature.first; arm; arm = arm->id.next) {
2895                 if (arm->id.flag & LIB_NEED_LINK) {
2896                         if (arm->adt) lib_link_animdata(fd, &arm->id, arm->adt);
2897                         arm->id.flag -= LIB_NEED_LINK;
2898                 }
2899         }
2900 }
2901
2902 static void direct_link_bones(FileData *fd, Bone *bone)
2903 {
2904         Bone *child;
2905         
2906         bone->parent = newdataadr(fd, bone->parent);
2907         bone->prop = newdataadr(fd, bone->prop);
2908         IDP_DirectLinkGroup_OrFree(&bone->prop, (fd->flags & FD_FLAGS_SWITCH_ENDIAN), fd);
2909                 
2910         bone->flag &= ~BONE_DRAW_ACTIVE;
2911         
2912         link_list(fd, &bone->childbase);
2913         
2914         for (child=bone->childbase.first; child; child=child->next)
2915                 direct_link_bones(fd, child);
2916 }
2917
2918 static void direct_link_armature(FileData *fd, bArmature *arm)
2919 {
2920         Bone *bone;
2921         
2922         link_list(fd, &arm->bonebase);
2923         arm->edbo = NULL;
2924         arm->sketch = NULL;
2925         
2926         arm->adt = newdataadr(fd, arm->adt);
2927         direct_link_animdata(fd, arm->adt);
2928         
2929         for (bone = arm->bonebase.first; bone; bone = bone->next) {
2930                 direct_link_bones(fd, bone);
2931         }
2932         
2933         arm->act_bone = newdataadr(fd, arm->act_bone);
2934         arm->act_edbone = NULL;
2935 }
2936
2937 /* ************ READ CAMERA ***************** */
2938
2939 static void lib_link_camera(FileData *fd, Main *main)
2940 {
2941         Camera *ca;
2942         
2943         for (ca = main->camera.first; ca; ca = ca->id.next) {
2944                 if (ca->id.flag & LIB_NEED_LINK) {
2945                         if (ca->adt) lib_link_animdata(fd, &ca->id, ca->adt);
2946                         
2947                         ca->ipo = newlibadr_us(fd, ca->id.lib, ca->ipo); // XXX deprecated - old animation system
2948                         
2949                         ca->dof_ob = newlibadr_us(fd, ca->id.lib, ca->dof_ob);
2950                         
2951                         ca->id.flag -= LIB_NEED_LINK;
2952                 }
2953         }
2954 }
2955
2956 static void direct_link_camera(FileData *fd, Camera *ca)
2957 {
2958         ca->adt = newdataadr(fd, ca->adt);
2959         direct_link_animdata(fd, ca->adt);
2960 }
2961
2962
2963 /* ************ READ LAMP ***************** */
2964
2965 static void lib_link_lamp(FileData *fd, Main *main)
2966 {
2967         Lamp *la;
2968         MTex *mtex;
2969         int a;
2970         
2971         for (la = main->lamp.first; la; la = la->id.next) {
2972                 if (la->id.flag & LIB_NEED_LINK) {
2973                         if (la->adt) lib_link_animdata(fd, &la->id, la->adt);
2974                         
2975                         for (a = 0; a < MAX_MTEX; a++) {
2976                                 mtex = la->mtex[a];
2977                                 if (mtex) {
2978                                         mtex->tex = newlibadr_us(fd, la->id.lib, mtex->tex);
2979                                         mtex->object = newlibadr(fd, la->id.lib, mtex->object);
2980                                 }
2981                         }
2982                         
2983                         la->ipo = newlibadr_us(fd, la->id.lib, la->ipo); // XXX deprecated - old animation system
2984                         
2985                         if (la->nodetree) {
2986                                 lib_link_ntree(fd, &la->id, la->nodetree);
2987                                 la->nodetree->id.lib = la->id.lib;
2988                         }
2989                         
2990                         la->id.flag -= LIB_NEED_LINK;
2991                 }
2992         }
2993 }
2994
2995 static void direct_link_lamp(FileData *fd, Lamp *la)
2996 {
2997         int a;
2998         
2999         la->adt = newdataadr(fd, la->adt);
3000         direct_link_animdata(fd, la->adt);
3001         
3002         for (a=0; a<MAX_MTEX; a++) {
3003                 la->mtex[a] = newdataadr(fd, la->mtex[a]);
3004         }
3005         
3006         la->curfalloff = newdataadr(fd, la->curfalloff);
3007         if (la->curfalloff)
3008                 direct_link_curvemapping(fd, la->curfalloff);
3009
3010         la->nodetree= newdataadr(fd, la->nodetree);
3011         if (la->nodetree) {
3012                 direct_link_id(fd, &la->nodetree->id);
3013                 direct_link_nodetree(fd, la->nodetree);
3014         }
3015         
3016         la->preview = direct_link_preview_image(fd, la->preview);
3017 }
3018
3019 /* ************ READ keys ***************** */
3020
3021 void blo_do_versions_key_uidgen(Key *key)
3022 {
3023         KeyBlock *block;
3024
3025         key->uidgen = 1;
3026         for (block = key->block.first; block; block = block->next) {
3027                 block->uid = key->uidgen++;
3028         }
3029 }
3030
3031 static void lib_link_key(FileData *fd, Main *main)
3032 {
3033         Key *key;
3034         
3035         for (key = main->key.first; key; key = key->id.next) {
3036                 /*check if we need to generate unique ids for the shapekeys*/
3037                 if (!key->uidgen) {
3038                         blo_do_versions_key_uidgen(key);
3039                 }
3040                 
3041                 if (key->id.flag & LIB_NEED_LINK) {
3042                         if (key->adt) lib_link_animdata(fd, &key->id, key->adt);
3043                         
3044                         key->ipo = newlibadr_us(fd, key->id.lib, key->ipo); // XXX deprecated - old animation system
3045                         key->from = newlibadr(fd, key->id.lib, key->from);
3046                         
3047                         key->id.flag -= LIB_NEED_LINK;
3048                 }
3049         }
3050 }
3051
3052 static void switch_endian_keyblock(Key *key, KeyBlock *kb)
3053 {
3054         int elemsize, a, b;
3055         char *data, *poin, *cp;
3056         
3057         elemsize = key->elemsize;
3058         data = kb->data;
3059         
3060         for (a = 0; a < kb->totelem; a++) {
3061                 cp = key->elemstr;
3062                 poin = data;
3063                 
3064                 while (cp[0]) {  /* cp[0] == amount */
3065                         switch (cp[1]) {  /* cp[1] = type */
3066                                 case IPO_FLOAT:
3067                                 case IPO_BPOINT:
3068                                 case IPO_BEZTRIPLE:
3069                                         b = cp[0];
3070                                         BLI_endian_switch_float_array((float *)poin, b);
3071                                         poin += sizeof(float) * b;
3072                                         break;
3073                         }
3074                         
3075                         cp += 2;
3076                 }
3077                 data += elemsize;
3078         }
3079 }
3080
3081 static void direct_link_key(FileData *fd, Key *key)
3082 {
3083         KeyBlock *kb;
3084         
3085         link_list(fd, &(key->block));
3086         
3087         key->adt = newdataadr(fd, key->adt);
3088         direct_link_animdata(fd, key->adt);
3089                 
3090         key->refkey= newdataadr(fd, key->refkey);
3091         
3092         for (kb = key->block.first; kb; kb = kb->next) {
3093                 kb->data = newdataadr(fd, kb->data);
3094                 
3095                 if (fd->flags & FD_FLAGS_SWITCH_ENDIAN)
3096                         switch_endian_keyblock(key, kb);
3097         }
3098 }
3099
3100 /* ************ READ mball ***************** */
3101
3102 static void lib_link_mball(FileData *fd, Main *main)
3103 {
3104         MetaBall *mb;
3105         int a;
3106         
3107         for (mb = main->mball.first; mb; mb = mb->id.next) {
3108                 if (mb->id.flag & LIB_NEED_LINK) {
3109                         if (mb->adt) lib_link_animdata(fd, &mb->id, mb->adt);
3110                         
3111                         for (a = 0; a < mb->totcol; a++) 
3112                                 mb->mat[a] = newlibadr_us(fd, mb->id.lib, mb->mat[a]);
3113                         
3114                         mb->ipo = newlibadr_us(fd, mb->id.lib, mb->ipo); // XXX deprecated - old animation system
3115                         
3116                         mb->id.flag -= LIB_NEED_LINK;
3117                 }
3118         }
3119 }
3120
3121 static void direct_link_mball(FileData *fd, MetaBall *mb)
3122 {
3123         mb->adt = newdataadr(fd, mb->adt);
3124         direct_link_animdata(fd, mb->adt);
3125         
3126         mb->mat = newdataadr(fd, mb->mat);
3127         test_pointer_array(fd, (void **)&mb->mat);
3128         
3129         link_list(fd, &(mb->elems));
3130         
3131         mb->disp.first = mb->disp.last = NULL;
3132         mb->editelems = NULL;
3133 /*      mb->edit_elems.first= mb->edit_elems.last= NULL;*/
3134         mb->lastelem = NULL;
3135 }
3136
3137 /* ************ READ WORLD ***************** */
3138
3139 static void lib_link_world(FileData *fd, Main *main)
3140 {
3141         World *wrld;
3142         MTex *mtex;
3143         int a;
3144         
3145         for (wrld = main->world.first; wrld; wrld = wrld->id.next) {
3146                 if (wrld->id.flag & LIB_NEED_LINK) {
3147                         if (wrld->adt) lib_link_animdata(fd, &wrld->id, wrld->adt);
3148                         
3149                         wrld->ipo = newlibadr_us(fd, wrld->id.lib, wrld->ipo); // XXX deprecated - old animation system
3150                         
3151                         for (a=0; a < MAX_MTEX; a++) {
3152                                 mtex = wrld->mtex[a];
3153                                 if (mtex) {
3154                                         mtex->tex = newlibadr_us(fd, wrld->id.lib, mtex->tex);
3155                                         mtex->object = newlibadr(fd, wrld->id.lib, mtex->object);
3156                                 }
3157                         }
3158                         
3159                         if (wrld->nodetree) {
3160                                 lib_link_ntree(fd, &wrld->id, wrld->nodetree);
3161                                 wrld->nodetree->id.lib = wrld->id.lib;
3162                         }
3163                         
3164                         wrld->id.flag -= LIB_NEED_LINK;
3165                 }
3166         }
3167 }
3168
3169 static void direct_link_world(FileData *fd, World *wrld)
3170 {
3171         int a;
3172         
3173         wrld->adt = newdataadr(fd, wrld->adt);
3174         direct_link_animdata(fd, wrld->adt);
3175         
3176         for (a = 0; a < MAX_MTEX; a++) {
3177                 wrld->mtex[a] = newdataadr(fd, wrld->mtex[a]);
3178         }
3179         
3180         wrld->nodetree = newdataadr(fd, wrld->nodetree);
3181         if (wrld->nodetree) {
3182                 direct_link_id(fd, &wrld->nodetree->id);
3183                 direct_link_nodetree(fd, wrld->nodetree);
3184         }
3185         
3186         wrld->preview = direct_link_preview_image(fd, wrld->preview);
3187 }
3188
3189
3190 /* ************ READ VFONT ***************** */
3191
3192 static void lib_link_vfont(FileData *UNUSED(fd), Main *main)
3193 {
3194         VFont *vf;
3195         
3196         for (vf = main->vfont.first; vf; vf = vf->id.next) {
3197                 if (vf->id.flag & LIB_NEED_LINK) {
3198                         vf->id.flag -= LIB_NEED_LINK;
3199                 }
3200         }
3201 }
3202
3203 static void direct_link_vfont(FileData *fd, VFont *vf)
3204 {
3205         vf->data = NULL;
3206         vf->temp_pf = NULL;
3207         vf->packedfile = direct_link_packedfile(fd, vf->packedfile);
3208 }
3209
3210 /* ************ READ TEXT ****************** */
3211
3212 static void lib_link_text(FileData *UNUSED(fd), Main *main)
3213 {
3214         Text *text;
3215         
3216         for (text = main->text.first; text; text = text->id.next) {
3217                 if (text->id.flag & LIB_NEED_LINK) {
3218                         text->id.flag -= LIB_NEED_LINK;
3219                 }
3220         }
3221 }
3222
3223 static void direct_link_text(FileData *fd, Text *text)
3224 {
3225         TextLine *ln;
3226         
3227         text->name = newdataadr(fd, text->name);
3228         
3229         text->undo_pos = -1;
3230         text->undo_len = TXT_INIT_UNDO;
3231         text->undo_buf = MEM_mallocN(text->undo_len, "undo buf");
3232         
3233         text->compiled = NULL;
3234         
3235 #if 0
3236         if (text->flags & TXT_ISEXT) {
3237                 BKE_text_reload(text);
3238                 }
3239                 /* else { */
3240 #endif
3241         
3242         link_list(fd, &text->lines);
3243         
3244         text->curl = newdataadr(fd, text->curl);
3245         text->sell = newdataadr(fd, text->sell);
3246         
3247         for (ln = text->lines.first; ln; ln = ln->next) {
3248                 ln->line = newdataadr(fd, ln->line);
3249         &