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