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