merging trunk 17520:19093
[blender.git] / source / blender / blenkernel / intern / node.c
1 /**
2  * $Id$
3  *
4  * ***** BEGIN GPL LICENSE BLOCK *****
5  *
6  * This program is free software; you can redistribute it and/or
7  * modify it under the terms of the GNU General Public License
8  * as published by the Free Software Foundation; either version 2
9  * of the License, or (at your option) any later version. 
10  *
11  * This program is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14  * GNU General Public License for more details.
15  *
16  * You should have received a copy of the GNU General Public License
17  * along with this program; if not, write to the Free Software Foundation,
18  * Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
19  *
20  * The Original Code is Copyright (C) 2005 Blender Foundation.
21  * All rights reserved.
22  *
23  * The Original Code is: all of this file.
24  *
25  * Contributor(s): none yet.
26  *
27  * ***** END GPL LICENSE BLOCK *****
28  */
29
30 #ifndef DISABLE_PYTHON
31 #include <Python.h>
32 #endif
33
34 #include <stdlib.h>
35 #include <string.h>
36
37 #include "DNA_ID.h"
38 #include "DNA_image_types.h"
39 #include "DNA_node_types.h"
40 #include "DNA_material_types.h"
41 #include "DNA_texture_types.h"
42 #include "DNA_text_types.h"
43 #include "DNA_scene_types.h"
44
45 #include "BKE_blender.h"
46 #include "BKE_colortools.h"
47 #include "BKE_global.h"
48 #include "BKE_image.h"
49 #include "BKE_library.h"
50 #include "BKE_main.h"
51 #include "BKE_node.h"
52 #include "BKE_texture.h"
53 #include "BKE_text.h"
54 #include "BKE_utildefines.h"
55
56 #include "BLI_arithb.h"
57 #include "BLI_blenlib.h"
58 #include "BLI_rand.h"
59 #include "BLI_threads.h"
60
61 #include "PIL_time.h"
62
63 #include "MEM_guardedalloc.h"
64 #include "IMB_imbuf.h"
65
66 #include "RE_pipeline.h"
67 #include "RE_shader_ext.h"              /* <- TexResult */
68 #include "RE_render_ext.h"              /* <- ibuf_sample() */
69
70 #include "CMP_node.h"
71 #include "intern/CMP_util.h"    /* stupid include path... */
72
73 #include "SHD_node.h"
74 #include "TEX_node.h"
75 #include "intern/TEX_util.h"
76
77 #include "GPU_extensions.h"
78 #include "GPU_material.h"
79
80 static ListBase empty_list = {NULL, NULL};
81 ListBase node_all_composit = {NULL, NULL};
82 ListBase node_all_shaders = {NULL, NULL};
83 ListBase node_all_textures = {NULL, NULL};
84
85 /* ************** Type stuff **********  */
86
87 static bNodeType *node_get_type(bNodeTree *ntree, int type, bNodeTree *ngroup, ID *id)
88 {
89         if(type==NODE_GROUP) {
90                 if(ngroup && GS(ngroup->id.name)==ID_NT) {
91                         return ngroup->owntype;
92                 }
93                 return NULL;
94         }
95         else {
96                 bNodeType *ntype = ntree->alltypes.first;
97                 for(; ntype; ntype= ntype->next)
98                         if(ntype->type==type && id==ntype->id )
99                                 return ntype;
100                 
101                 return NULL;
102         }
103 }
104
105 void ntreeInitTypes(bNodeTree *ntree)
106 {
107         bNode *node, *next;
108         
109         if(ntree->type==NTREE_SHADER)
110                 ntree->alltypes= node_all_shaders;
111         else if(ntree->type==NTREE_COMPOSIT)
112                 ntree->alltypes= node_all_composit;
113         else if(ntree->type==NTREE_TEXTURE)
114                 ntree->alltypes= node_all_textures;
115         else {
116                 ntree->alltypes= empty_list;
117                 printf("Error: no type definitions for nodes\n");
118         }
119         
120         for(node= ntree->nodes.first; node; node= next) {
121                 next= node->next;
122                 if(node->type==NODE_DYNAMIC) {
123                         bNodeType *stype= NULL;
124                         if(node->id==NULL) { /* empty script node */
125                                 stype= node_get_type(ntree, node->type, NULL, NULL);
126                         } else { /* not an empty script node */
127                                 stype= node_get_type(ntree, node->type, NULL, node->id);
128                                 if(!stype) {
129                                         stype= node_get_type(ntree, node->type, NULL, NULL);
130                                         /* needed info if the pynode script fails now: */
131                                         if (node->id) node->storage= ntree;
132                                 } else {
133                                         node->custom1= 0;
134                                         node->custom1= BSET(node->custom1,NODE_DYNAMIC_ADDEXIST);
135                                 }
136                         }
137                         node->typeinfo= stype;
138                         node->typeinfo->initfunc(node);
139                 } else {
140                         node->typeinfo= node_get_type(ntree, node->type, (bNodeTree *)node->id, NULL);
141                 }
142
143                 if(node->typeinfo==NULL) {
144                         printf("Error: Node type %s doesn't exist anymore, removed\n", node->name);
145                         nodeFreeNode(ntree, node);
146                 }
147         }
148                         
149         ntree->init |= NTREE_TYPE_INIT;
150 }
151
152 /* updates node with (modified) bNodeType.. this should be done for all trees */
153 void ntreeUpdateType(bNodeTree *ntree, bNodeType *ntype)
154 {
155         bNode *node;
156
157         for(node= ntree->nodes.first; node; node= node->next) {
158                 if(node->typeinfo== ntype) {
159                         nodeUpdateType(ntree, node, ntype);
160                 }
161         }
162 }
163
164 /* only used internal... we depend on type definitions! */
165 static bNodeSocket *node_add_socket_type(ListBase *lb, bNodeSocketType *stype)
166 {
167         bNodeSocket *sock= MEM_callocN(sizeof(bNodeSocket), "sock");
168         
169         BLI_strncpy(sock->name, stype->name, NODE_MAXSTR);
170         if(stype->limit==0) sock->limit= 0xFFF;
171         else sock->limit= stype->limit;
172         sock->type= stype->type;
173         
174         sock->to_index= stype->own_index;
175         sock->tosock= stype->internsock;
176         
177         sock->ns.vec[0]= stype->val1;
178         sock->ns.vec[1]= stype->val2;
179         sock->ns.vec[2]= stype->val3;
180         sock->ns.vec[3]= stype->val4;
181         sock->ns.min= stype->min;
182         sock->ns.max= stype->max;
183         
184         if(lb)
185                 BLI_addtail(lb, sock);
186
187         return sock;
188 }
189
190 static void node_rem_socket(bNodeTree *ntree, ListBase *lb, bNodeSocket *sock)
191 {
192         bNodeLink *link, *next;
193         
194         for(link= ntree->links.first; link; link= next) {
195                 next= link->next;
196                 if(link->fromsock==sock || link->tosock==sock) {
197                         nodeRemLink(ntree, link);
198                 }
199         }
200         
201         BLI_remlink(lb, sock);
202         MEM_freeN(sock);
203 }
204
205 static bNodeSocket *verify_socket(ListBase *lb, bNodeSocketType *stype)
206 {
207         bNodeSocket *sock;
208         
209         for(sock= lb->first; sock; sock= sock->next) {
210                 /* both indices are zero for non-groups, otherwise it's a unique index */
211                 if(sock->to_index==stype->own_index)
212                         if(strncmp(sock->name, stype->name, NODE_MAXSTR)==0)
213                                 break;
214         }
215         if(sock) {
216                 sock->type= stype->type;                /* in future, read this from tydefs! */
217                 if(stype->limit==0) sock->limit= 0xFFF;
218                 else sock->limit= stype->limit;
219                 sock->ns.min= stype->min;
220                 sock->ns.max= stype->max;
221                 sock->tosock= stype->internsock;
222                 
223                 BLI_remlink(lb, sock);
224                 
225                 return sock;
226         }
227         else {
228                 return node_add_socket_type(NULL, stype);
229         }
230 }
231
232 static void verify_socket_list(bNodeTree *ntree, ListBase *lb, bNodeSocketType *stype_first)
233 {
234         bNodeSocketType *stype;
235         
236         /* no inputs anymore? */
237         if(stype_first==NULL) {
238                 while(lb->first)
239                         node_rem_socket(ntree, lb, lb->first);
240         }
241         else {
242                 /* step by step compare */
243                 stype= stype_first;
244                 while(stype->type != -1) {
245                         stype->sock= verify_socket(lb, stype);
246                         stype++;
247                 }
248                 /* leftovers are removed */
249                 while(lb->first)
250                         node_rem_socket(ntree, lb, lb->first);
251                 /* and we put back the verified sockets */
252                 stype= stype_first;
253                 while(stype->type != -1) {
254                         BLI_addtail(lb, stype->sock);
255                         stype++;
256                 }
257         }
258 }
259
260 void nodeVerifyType(bNodeTree *ntree, bNode *node)
261 {
262         bNodeType *ntype= node->typeinfo;
263         
264         if(ntype) {
265                 /* might add some other verify stuff here */
266                 
267                 verify_socket_list(ntree, &node->inputs, ntype->inputs);
268                 verify_socket_list(ntree, &node->outputs, ntype->outputs);
269         }
270 }
271
272 void ntreeVerifyTypes(bNodeTree *ntree)
273 {
274         bNode *node;
275         
276         /* if((ntree->init & NTREE_TYPE_INIT)==0) */
277         ntreeInitTypes(ntree);
278
279         /* check inputs and outputs, and remove or insert them */
280         for(node= ntree->nodes.first; node; node= node->next)
281                 nodeVerifyType(ntree, node);
282         
283 }
284
285 /* ************** Group stuff ********** */
286
287 bNodeType node_group_typeinfo= {
288         /* next,prev   */       NULL, NULL,
289         /* type code   */       NODE_GROUP,
290         /* name        */       "Group",
291         /* width+range */       120, 60, 200,
292         /* class+opts  */       NODE_CLASS_GROUP, NODE_OPTIONS,
293         /* input sock  */       NULL,
294         /* output sock */       NULL,
295         /* storage     */       "",
296         /* execfunc    */       NULL,
297         /* butfunc     */       NULL,
298         /* initfunc    */       NULL,
299         /* freestoragefunc    */        NULL,
300         /* copystoragefunc    */        NULL,
301         /* id          */       NULL
302 };
303
304 /* tag internal sockets */
305 static void group_tag_internal_sockets(bNodeTree *ngroup)
306 {
307         bNode *node;
308         bNodeSocket *sock;
309         bNodeLink *link;
310         
311         /* clear intern tag, but check already for hidden sockets */
312         for(node= ngroup->nodes.first; node; node= node->next) {
313                 for(sock= node->inputs.first; sock; sock= sock->next)
314                         sock->intern= sock->flag & SOCK_HIDDEN;
315                 for(sock= node->outputs.first; sock; sock= sock->next)
316                         sock->intern= sock->flag & (SOCK_HIDDEN|SOCK_UNAVAIL);
317         }
318         /* set tag */
319         for(link= ngroup->links.first; link; link= link->next) {
320                 link->fromsock->intern= 1;
321                 link->tosock->intern= 1;
322         }
323         
324         /* remove link pointer to external links (only happens on create group) */
325         for(node= ngroup->nodes.first; node; node= node->next) {
326                 for(sock= node->inputs.first; sock; sock= sock->next)
327                         if(sock->intern==0)
328                                 sock->link= NULL;
329         }
330
331         /* set all intern sockets to own_index zero, makes sure that later use won't mixup */
332         for(node= ngroup->nodes.first; node; node= node->next) {
333                 for(sock= node->inputs.first; sock; sock= sock->next)
334                         if(sock->intern)
335                                 sock->own_index= 0;
336                 for(sock= node->outputs.first; sock; sock= sock->next)
337                         if(sock->intern)
338                                 sock->own_index= 0;
339         }
340 }
341
342 /* after editing group, new sockets are zero */
343 /* this routine ensures unique identifiers for zero sockets that are exposed */
344 static void group_verify_own_indices(bNodeTree *ngroup)
345 {
346         bNode *node;
347         bNodeSocket *sock;
348         
349         for(node= ngroup->nodes.first; node; node= node->next) {
350                 for(sock= node->inputs.first; sock; sock= sock->next)
351                         if(sock->own_index==0 && sock->intern==0)
352                                 sock->own_index= ++(ngroup->cur_index);
353                 for(sock= node->outputs.first; sock; sock= sock->next)
354                         if(sock->own_index==0 && sock->intern==0)
355                                 sock->own_index= ++(ngroup->cur_index);
356         }
357         //printf("internal index %d\n", ngroup->cur_index);
358 }
359
360
361 /* nodetrees can be used as groups, so we need typeinfo structs generated */
362 void ntreeMakeOwnType(bNodeTree *ngroup)
363 {
364         bNode *node;
365         bNodeSocket *sock;
366         int totin= 0, totout=0, a;
367
368         /* tags socket when internal linked */
369         group_tag_internal_sockets(ngroup);
370         
371         /* ensure all sockets have own unique id */
372         group_verify_own_indices(ngroup);
373         
374         /* counting stats */
375         for(node= ngroup->nodes.first; node; node= node->next) {
376                 if(node->type==NODE_GROUP)
377                         break;
378                 for(sock= node->inputs.first; sock; sock= sock->next)
379                         if(sock->intern==0) 
380                                 totin++;
381                 for(sock= node->outputs.first; sock; sock= sock->next)
382                         if(sock->intern==0) 
383                                 totout++;
384         }
385         /* debug: nodetrees in nodetrees not handled yet */
386         if(node) {
387                 printf("group in group, not supported yet\n");
388                 return;
389         }
390         
391         /* free own type struct */
392         if(ngroup->owntype) {
393                 if(ngroup->owntype->inputs)
394                         MEM_freeN(ngroup->owntype->inputs);
395                 if(ngroup->owntype->outputs)
396                         MEM_freeN(ngroup->owntype->outputs);
397                 MEM_freeN(ngroup->owntype);
398         }
399         
400         /* make own type struct */
401         ngroup->owntype= MEM_callocN(sizeof(bNodeType), "group type");
402         *ngroup->owntype= node_group_typeinfo; /* copy data, for init */
403         
404         /* input type arrays */
405         if(totin) {
406                 bNodeSocketType *stype;
407                 bNodeSocketType *inputs= MEM_callocN(sizeof(bNodeSocketType)*(totin+1), "bNodeSocketType");
408                 a= 0;
409                 
410                 for(node= ngroup->nodes.first; node; node= node->next) {
411                         /* nodes are presumed fully verified, stype and socket list are in sync */
412                         stype= node->typeinfo->inputs;
413                         for(sock= node->inputs.first; sock; sock= sock->next, stype++) {
414                                 if(sock->intern==0) {
415                                         /* debug only print */
416                                         if(stype==NULL || stype->type==-1) printf("group verification error %s\n", ngroup->id.name);
417                                         
418                                         inputs[a]= *stype;
419                                         inputs[a].own_index= sock->own_index;
420                                         inputs[a].internsock= sock;     
421                                         a++;
422                                 }
423                         }
424                 }
425                 inputs[a].type= -1;     /* terminator code */
426                 ngroup->owntype->inputs= inputs;
427         }       
428         
429         /* output type arrays */
430         if(totout) {
431                 bNodeSocketType *stype;
432                 bNodeSocketType *outputs= MEM_callocN(sizeof(bNodeSocketType)*(totout+1), "bNodeSocketType");
433                 a= 0;
434                 
435                 for(node= ngroup->nodes.first; node; node= node->next) {
436                         /* nodes are presumed fully verified, stype and socket list are in sync */
437                         stype= node->typeinfo->outputs;
438                         for(sock= node->outputs.first; sock; sock= sock->next, stype++) {
439                                 if(sock->intern==0) {
440                                         /* debug only print */
441                                         if(stype==NULL || stype->type==-1) printf("group verification error %s\n", ngroup->id.name);
442                                         
443                                         outputs[a]= *stype;
444                                         outputs[a].own_index= sock->own_index;
445                                         outputs[a].internsock= sock;    
446                                         a++;
447                                 }
448                         }
449                 }
450                 outputs[a].type= -1;    /* terminator code */
451                 ngroup->owntype->outputs= outputs;
452         }
453         
454         /* voila, the nodetree has the full definition for generating group-node instances! */
455 }
456
457
458 static bNodeSocket *groupnode_find_tosock(bNode *gnode, int index)
459 {
460         bNodeSocket *sock;
461         
462         for(sock= gnode->inputs.first; sock; sock= sock->next)
463                 if(sock->to_index==index)
464                         return sock;
465         return NULL;
466 }
467
468 static bNodeSocket *groupnode_find_fromsock(bNode *gnode, int index)
469 {
470         bNodeSocket *sock;
471         
472         for(sock= gnode->outputs.first; sock; sock= sock->next)
473                 if(sock->to_index==index)
474                         return sock;
475         return NULL;
476 }
477
478 bNode *nodeMakeGroupFromSelected(bNodeTree *ntree)
479 {
480         bNodeLink *link, *linkn;
481         bNode *node, *gnode, *nextn;
482         bNodeSocket *sock;
483         bNodeTree *ngroup;
484         float min[2], max[2];
485         int totnode=0;
486         
487         INIT_MINMAX2(min, max);
488         
489         /* is there something to group? also do some clearing */
490         for(node= ntree->nodes.first; node; node= node->next) {
491                 if(node->flag & NODE_SELECT) {
492                         /* no groups in groups */
493                         if(node->type==NODE_GROUP)
494                                 return NULL;
495                         DO_MINMAX2( (&node->locx), min, max);
496                         totnode++;
497                 }
498                 node->done= 0;
499         }
500         if(totnode==0) return NULL;
501         
502         /* check if all connections are OK, no unselected node has both
503                 inputs and outputs to a selection */
504         for(link= ntree->links.first; link; link= link->next) {
505                 if(link->fromnode->flag & NODE_SELECT)
506                         link->tonode->done |= 1;
507                 if(link->tonode->flag & NODE_SELECT)
508                         link->fromnode->done |= 2;
509         }       
510         
511         for(node= ntree->nodes.first; node; node= node->next) {
512                 if((node->flag & NODE_SELECT)==0)
513                         if(node->done==3)
514                                 break;
515         }
516         if(node) 
517                 return NULL;
518         
519         /* OK! new nodetree */
520         ngroup= alloc_libblock(&G.main->nodetree, ID_NT, "NodeGroup");
521         ngroup->type= ntree->type;
522         ngroup->alltypes= ntree->alltypes;
523         
524         /* move nodes over */
525         for(node= ntree->nodes.first; node; node= nextn) {
526                 nextn= node->next;
527                 if(node->flag & NODE_SELECT) {
528                         BLI_remlink(&ntree->nodes, node);
529                         BLI_addtail(&ngroup->nodes, node);
530                         node->locx-= 0.5f*(min[0]+max[0]);
531                         node->locy-= 0.5f*(min[1]+max[1]);
532
533                         /* set selin and selout of the nodetree */
534                         for(sock= node->inputs.first; sock; sock= sock->next) {
535                                 if(sock->flag & SOCK_SEL) {
536                                         ngroup->selin= sock;
537                                         break;
538                                 }
539                         }
540                         for(sock= node->outputs.first; sock; sock= sock->next) {
541                                 if(sock->flag & SOCK_SEL) {
542                                         ngroup->selout= sock;
543                                         break;
544                                 }
545                         }
546
547                         /* set socket own_index to zero since it can still have a value
548                          * from being in a group before, otherwise it doesn't get a unique
549                          * index in group_verify_own_indices */
550                         for(sock= node->inputs.first; sock; sock= sock->next)
551                                 sock->own_index= 0;
552                         for(sock= node->outputs.first; sock; sock= sock->next)
553                                 sock->own_index= 0;
554                 }
555         }
556
557         /* move links over */
558         for(link= ntree->links.first; link; link= linkn) {
559                 linkn= link->next;
560                 if(link->fromnode->flag & link->tonode->flag & NODE_SELECT) {
561                         BLI_remlink(&ntree->links, link);
562                         BLI_addtail(&ngroup->links, link);
563                 }
564         }
565         
566         /* now we can make own group typeinfo */
567         ntreeMakeOwnType(ngroup);
568         
569         /* make group node */
570         gnode= nodeAddNodeType(ntree, NODE_GROUP, ngroup, NULL);
571         gnode->locx= 0.5f*(min[0]+max[0]);
572         gnode->locy= 0.5f*(min[1]+max[1]);
573         
574         /* relink external sockets */
575         for(link= ntree->links.first; link; link= linkn) {
576                 linkn= link->next;
577                 
578                 if(link->tonode->flag & NODE_SELECT) {
579                         link->tonode= gnode;
580                         sock= groupnode_find_tosock(gnode, link->tosock->own_index);
581                         if(sock==NULL) {
582                                 nodeRemLink(ntree, link);       
583                                 printf("Removed link, cannot mix internal and external sockets in group\n");
584                         }
585                         else link->tosock= sock;
586                 }
587                 else if(link->fromnode->flag & NODE_SELECT) {
588                         link->fromnode= gnode;
589                         sock= groupnode_find_fromsock(gnode, link->fromsock->own_index);
590                         if(sock==NULL) {
591                                 nodeRemLink(ntree, link);       
592                                 printf("Removed link, cannot mix internal and external sockets in group\n");
593                         }
594                         else link->fromsock= sock;
595                 }
596         }
597         
598         /* initialize variables of unused input sockets */
599         for(node= ngroup->nodes.first; node; node= node->next) {
600                 for(sock= node->inputs.first; sock; sock= sock->next) {
601                         if(sock->intern==0) {
602                                 bNodeSocket *nsock= groupnode_find_tosock(gnode, sock->own_index);
603                                 if(nsock) {
604                                         QUATCOPY(nsock->ns.vec, sock->ns.vec);
605                                 }
606                         }
607                 }
608         }
609
610         /* update node levels */
611         ntreeSolveOrder(ntree);
612
613         return gnode;
614 }
615
616 /* note: ungroup: group_indices zero! */
617
618 /* here's a nasty little one, need to check users... */
619 /* should become callbackable... */
620 void nodeVerifyGroup(bNodeTree *ngroup)
621 {
622         
623         /* group changed, so we rebuild the type definition */
624         ntreeMakeOwnType(ngroup);
625         
626         if(ngroup->type==NTREE_SHADER) {
627                 Material *ma;
628                 for(ma= G.main->mat.first; ma; ma= ma->id.next) {
629                         if(ma->nodetree) {
630                                 bNode *node;
631                                 
632                                 /* find if group is in tree */
633                                 for(node= ma->nodetree->nodes.first; node; node= node->next)
634                                         if(node->id == (ID *)ngroup)
635                                                 break;
636                                 
637                                 if(node) {
638                                         /* set all type pointers OK */
639                                         ntreeInitTypes(ma->nodetree);
640                                         
641                                         for(node= ma->nodetree->nodes.first; node; node= node->next)
642                                                 if(node->id == (ID *)ngroup)
643                                                         nodeVerifyType(ma->nodetree, node);
644                                 }
645                         }
646                 }
647         }
648         else if(ngroup->type==NTREE_COMPOSIT) {
649                 Scene *sce;
650                 for(sce= G.main->scene.first; sce; sce= sce->id.next) {
651                         if(sce->nodetree) {
652                                 bNode *node;
653                                 
654                                 /* find if group is in tree */
655                                 for(node= sce->nodetree->nodes.first; node; node= node->next)
656                                         if(node->id == (ID *)ngroup)
657                                                 break;
658                                 
659                                 if(node) {
660                                         /* set all type pointers OK */
661                                         ntreeInitTypes(sce->nodetree);
662                                         
663                                         for(node= sce->nodetree->nodes.first; node; node= node->next)
664                                                 if(node->id == (ID *)ngroup)
665                                                         nodeVerifyType(sce->nodetree, node);
666                                 }
667                         }
668                 }
669         }
670         else if(ngroup->type==NTREE_TEXTURE) {
671                 Tex *tx;
672                 for(tx= G.main->tex.first; tx; tx= tx->id.next) {
673                         if(tx->nodetree) {
674                                 bNode *node;
675                                 
676                                 /* find if group is in tree */
677                                 for(node= tx->nodetree->nodes.first; node; node= node->next)
678                                         if(node->id == (ID *)ngroup)
679                                                 break;
680                                 
681                                 if(node) {
682                                         /* set all type pointers OK */
683                                         ntreeInitTypes(tx->nodetree);
684                                         
685                                         for(node= tx->nodetree->nodes.first; node; node= node->next)
686                                                 if(node->id == (ID *)ngroup)
687                                                         nodeVerifyType(tx->nodetree, node);
688                                 }
689                         }
690                 }
691         }
692 }
693
694 /* also to check all users of groups. Now only used in editor for hide/unhide */
695 /* should become callbackable? */
696 void nodeGroupSocketUseFlags(bNodeTree *ngroup)
697 {
698         bNode *node;
699         bNodeSocket *sock;
700
701         /* clear flags */
702         for(node= ngroup->nodes.first; node; node= node->next) {
703                 for(sock= node->inputs.first; sock; sock= sock->next)
704                         sock->flag &= ~SOCK_IN_USE;
705                 for(sock= node->outputs.first; sock; sock= sock->next)
706                         sock->flag &= ~SOCK_IN_USE;
707         }
708         
709         /* tag all thats in use */
710         if(ngroup->type==NTREE_SHADER) {
711                 Material *ma;
712                 for(ma= G.main->mat.first; ma; ma= ma->id.next) {
713                         if(ma->nodetree) {
714                                 for(node= ma->nodetree->nodes.first; node; node= node->next) {
715                                         if(node->id==(ID *)ngroup) {
716                                                 for(sock= node->inputs.first; sock; sock= sock->next)
717                                                         if(sock->link)
718                                                                 if(sock->tosock) 
719                                                                         sock->tosock->flag |= SOCK_IN_USE;
720                                                 for(sock= node->outputs.first; sock; sock= sock->next)
721                                                         if(nodeCountSocketLinks(ma->nodetree, sock))
722                                                                 if(sock->tosock) 
723                                                                         sock->tosock->flag |= SOCK_IN_USE;
724                                         }
725                                 }
726                         }
727                 }
728         }
729         else if(ngroup->type==NTREE_COMPOSIT) {
730                 Scene *sce;
731                 for(sce= G.main->scene.first; sce; sce= sce->id.next) {
732                         if(sce->nodetree) {
733                                 for(node= sce->nodetree->nodes.first; node; node= node->next) {
734                                         if(node->id==(ID *)ngroup) {
735                                                 for(sock= node->inputs.first; sock; sock= sock->next)
736                                                         if(sock->link)
737                                                                 if(sock->tosock) 
738                                                                         sock->tosock->flag |= SOCK_IN_USE;
739                                                 for(sock= node->outputs.first; sock; sock= sock->next)
740                                                         if(nodeCountSocketLinks(sce->nodetree, sock))
741                                                                 if(sock->tosock) 
742                                                                         sock->tosock->flag |= SOCK_IN_USE;
743                                         }
744                                 }
745                         }
746                 }
747         }
748         else if(ngroup->type==NTREE_TEXTURE) {
749                 Tex *tx;
750                 for(tx= G.main->tex.first; tx; tx= tx->id.next) {
751                         if(tx->nodetree) {
752                                 for(node= tx->nodetree->nodes.first; node; node= node->next) {
753                                         if(node->id==(ID *)ngroup) {
754                                                 for(sock= node->inputs.first; sock; sock= sock->next)
755                                                         if(sock->link)
756                                                                 if(sock->tosock) 
757                                                                         sock->tosock->flag |= SOCK_IN_USE;
758                                                 for(sock= node->outputs.first; sock; sock= sock->next)
759                                                         if(nodeCountSocketLinks(tx->nodetree, sock))
760                                                                 if(sock->tosock) 
761                                                                         sock->tosock->flag |= SOCK_IN_USE;
762                                         }
763                                 }
764                         }
765                 }
766         }
767         
768 }
769
770 /* finds a node based on given socket */
771 int nodeFindNode(bNodeTree *ntree, bNodeSocket *sock, bNode **nodep, int *sockindex)
772 {
773         bNode *node;
774         bNodeSocket *tsock;
775         int index= 0;
776         
777         for(node= ntree->nodes.first; node; node= node->next) {
778                 for(index=0, tsock= node->inputs.first; tsock; tsock= tsock->next, index++)
779                         if(tsock==sock)
780                                 break;
781                 if(tsock)
782                         break;
783                 for(index=0, tsock= node->outputs.first; tsock; tsock= tsock->next, index++)
784                         if(tsock==sock)
785                                 break;
786                 if(tsock)
787                         break;
788         }
789
790         if(node) {
791                 *nodep= node;
792                 if(sockindex) *sockindex= index;
793                 return 1;
794         }
795         
796         *nodep= NULL;
797         return 0;
798 }
799
800 /* returns 1 if its OK */
801 int nodeGroupUnGroup(bNodeTree *ntree, bNode *gnode)
802 {
803         bNodeLink *link, *linkn;
804         bNode *node, *nextn;
805         bNodeTree *ngroup, *wgroup;
806         int index;
807         
808         ngroup= (bNodeTree *)gnode->id;
809         if(ngroup==NULL) return 0;
810         
811         /* clear new pointers, set in copytree */
812         for(node= ntree->nodes.first; node; node= node->next)
813                 node->new_node= NULL;
814
815         wgroup= ntreeCopyTree(ngroup, 0);
816         
817         /* add the nodes into the ntree */
818         for(node= wgroup->nodes.first; node; node= nextn) {
819                 nextn= node->next;
820                 BLI_remlink(&wgroup->nodes, node);
821                 BLI_addtail(&ntree->nodes, node);
822                 node->locx+= gnode->locx;
823                 node->locy+= gnode->locy;
824                 node->flag |= NODE_SELECT;
825         }
826         /* and the internal links */
827         for(link= wgroup->links.first; link; link= linkn) {
828                 linkn= link->next;
829                 BLI_remlink(&wgroup->links, link);
830                 BLI_addtail(&ntree->links, link);
831         }
832
833         /* restore links to and from the gnode */
834         for(link= ntree->links.first; link; link= link->next) {
835                 if(link->tonode==gnode) {
836                         /* link->tosock->tosock is on the node we look for */
837                         nodeFindNode(ngroup, link->tosock->tosock, &nextn, &index);
838                         if(nextn==NULL) printf("wrong stuff!\n");
839                         else if(nextn->new_node==NULL) printf("wrong stuff too!\n");
840                         else {
841                                 link->tonode= nextn->new_node;
842                                 link->tosock= BLI_findlink(&link->tonode->inputs, index);
843                         }
844                 }
845                 else if(link->fromnode==gnode) {
846                         /* link->fromsock->tosock is on the node we look for */
847                         nodeFindNode(ngroup, link->fromsock->tosock, &nextn, &index);
848                         if(nextn==NULL) printf("1 wrong stuff!\n");
849                         else if(nextn->new_node==NULL) printf("1 wrong stuff too!\n");
850                         else {
851                                 link->fromnode= nextn->new_node;
852                                 link->fromsock= BLI_findlink(&link->fromnode->outputs, index);
853                         }
854                 }
855         }
856         
857         /* remove the gnode & work tree */
858         free_libblock(&G.main->nodetree, wgroup);
859         
860         nodeFreeNode(ntree, gnode);
861         
862         /* solve order goes fine, but the level tags not... doing it twice works for now. solve this once */
863         ntreeSolveOrder(ntree);
864         ntreeSolveOrder(ntree);
865
866         return 1;
867 }
868
869 void nodeCopyGroup(bNode *gnode)
870 {
871         bNodeSocket *sock;
872
873         gnode->id->us--;
874         gnode->id= (ID *)ntreeCopyTree((bNodeTree *)gnode->id, 0);
875
876         /* new_sock was set in nodeCopyNode */
877         for(sock=gnode->inputs.first; sock; sock=sock->next)
878                 if(sock->tosock)
879                         sock->tosock= sock->tosock->new_sock;
880
881         for(sock=gnode->outputs.first; sock; sock=sock->next)
882                 if(sock->tosock)
883                         sock->tosock= sock->tosock->new_sock;
884 }
885
886 /* ************** Add stuff ********** */
887 void nodeAddSockets(bNode *node, bNodeType *ntype)
888 {
889         bNodeSocketType *stype;
890
891         if(ntype->inputs) {
892                 stype= ntype->inputs;
893                 while(stype->type != -1) {
894                         node_add_socket_type(&node->inputs, stype);
895                         stype++;
896                 }
897         }
898         if(ntype->outputs) {
899                 stype= ntype->outputs;
900                 while(stype->type != -1) {
901                         node_add_socket_type(&node->outputs, stype);
902                         stype++;
903                 }
904         }
905 }
906
907
908 bNode *nodeAddNodeType(bNodeTree *ntree, int type, bNodeTree *ngroup, ID *id)
909 {
910         bNode *node= NULL;
911         bNodeType *ntype= NULL;
912
913         if(type>=NODE_DYNAMIC_MENU) {
914                 int a=0, idx= type-NODE_DYNAMIC_MENU;
915                 ntype= ntree->alltypes.first;
916                 while(ntype) {
917                         if(ntype->type==NODE_DYNAMIC) {
918                                 if(a==idx)
919                                         break;
920                                 a++;
921                         }
922                         ntype= ntype->next;
923                 }
924         } else
925                 ntype= node_get_type(ntree, type, ngroup, id);
926
927         node= MEM_callocN(sizeof(bNode), "new node");
928         BLI_addtail(&ntree->nodes, node);
929         node->typeinfo= ntype;
930         if(type>=NODE_DYNAMIC_MENU)
931                 node->custom2= type; /* for node_dynamic_init */
932
933         if(ngroup)
934                 BLI_strncpy(node->name, ngroup->id.name+2, NODE_MAXSTR);
935         else if(type>NODE_DYNAMIC_MENU) {
936                 BLI_strncpy(node->name, ntype->id->name+2, NODE_MAXSTR);
937         }
938         else
939                 BLI_strncpy(node->name, ntype->name, NODE_MAXSTR);
940         node->type= ntype->type;
941         node->flag= NODE_SELECT|ntype->flag;
942         node->width= ntype->width;
943         node->miniwidth= 42.0f;         /* small value only, allows print of first chars */
944
945         if(type==NODE_GROUP)
946                 node->id= (ID *)ngroup;
947
948         /* need init handler later? */
949         /* got it-bob*/
950         if(ntype->initfunc!=NULL)
951                 ntype->initfunc(node);
952         
953         if(type==TEX_NODE_OUTPUT)
954                 ntreeTexAssignIndex(ntree, node);
955
956         nodeAddSockets(node, ntype);
957         
958         return node;
959 }
960
961 void nodeMakeDynamicType(bNode *node)
962 {
963         /* find SH_DYNAMIC_NODE ntype */
964         bNodeType *ntype= node_all_shaders.first;
965         while(ntype) {
966                 if(ntype->type==NODE_DYNAMIC && ntype->id==NULL)
967                         break;
968                 ntype= ntype->next;
969         }
970
971         /* make own type struct to fill */
972         if(ntype) {
973                 /*node->typeinfo= MEM_dupallocN(ntype);*/
974                 bNodeType *newtype= MEM_callocN(sizeof(bNodeType), "dynamic bNodeType");
975                 *newtype= *ntype;
976                 newtype->name= BLI_strdup(ntype->name);
977                 node->typeinfo= newtype;
978         }
979 }
980
981 void nodeUpdateType(bNodeTree *ntree, bNode* node, bNodeType *ntype)
982 {
983         verify_socket_list(ntree, &node->inputs, ntype->inputs);
984         verify_socket_list(ntree, &node->outputs, ntype->outputs);
985 }
986
987 /* keep socket listorder identical, for copying links */
988 /* ntree is the target tree */
989 bNode *nodeCopyNode(struct bNodeTree *ntree, struct bNode *node, int internal)
990 {
991         bNode *nnode= MEM_callocN(sizeof(bNode), "dupli node");
992         bNodeSocket *sock, *oldsock;
993
994         *nnode= *node;
995         BLI_addtail(&ntree->nodes, nnode);
996         
997         duplicatelist(&nnode->inputs, &node->inputs);
998         oldsock= node->inputs.first;
999         for(sock= nnode->inputs.first; sock; sock= sock->next, oldsock= oldsock->next) {
1000                 oldsock->new_sock= sock;
1001                 if(internal)
1002                         sock->own_index= 0;
1003         }
1004         
1005         duplicatelist(&nnode->outputs, &node->outputs);
1006         oldsock= node->outputs.first;
1007         for(sock= nnode->outputs.first; sock; sock= sock->next, oldsock= oldsock->next) {
1008                 if(internal)
1009                         sock->own_index= 0;
1010                 sock->stack_index= 0;
1011                 sock->ns.data= NULL;
1012                 oldsock->new_sock= sock;
1013         }
1014         
1015         if(nnode->id)
1016                 nnode->id->us++;
1017         
1018         if(node->typeinfo->copystoragefunc)
1019                 node->typeinfo->copystoragefunc(node, nnode);
1020         
1021         node->new_node= nnode;
1022         nnode->new_node= NULL;
1023         nnode->preview= NULL;
1024         
1025         if(node->type==TEX_NODE_OUTPUT)
1026                 ntreeTexAssignIndex(ntree, node);
1027
1028         return nnode;
1029 }
1030
1031 bNodeLink *nodeAddLink(bNodeTree *ntree, bNode *fromnode, bNodeSocket *fromsock, bNode *tonode, bNodeSocket *tosock)
1032 {
1033         bNodeLink *link= MEM_callocN(sizeof(bNodeLink), "link");
1034         
1035         BLI_addtail(&ntree->links, link);
1036         link->fromnode= fromnode;
1037         link->fromsock= fromsock;
1038         link->tonode= tonode;
1039         link->tosock= tosock;
1040         
1041         return link;
1042 }
1043
1044 void nodeRemLink(bNodeTree *ntree, bNodeLink *link)
1045 {
1046         BLI_remlink(&ntree->links, link);
1047         if(link->tosock)
1048                 link->tosock->link= NULL;
1049         MEM_freeN(link);
1050 }
1051
1052
1053 bNodeTree *ntreeAddTree(int type)
1054 {
1055         bNodeTree *ntree= MEM_callocN(sizeof(bNodeTree), "new node tree");
1056         ntree->type= type;
1057         ntree->alltypes.first = NULL;
1058         ntree->alltypes.last = NULL;
1059         
1060         ntreeInitTypes(ntree);
1061         return ntree;
1062 }
1063
1064 bNodeTree *ntreeCopyTree(bNodeTree *ntree, int internal_select)
1065 {
1066         bNodeTree *newtree;
1067         bNode *node, *nnode, *last;
1068         bNodeLink *link, *nlink;
1069         bNodeSocket *sock;
1070         int a;
1071         
1072         if(ntree==NULL) return NULL;
1073         
1074         if(internal_select==0) {
1075                 /* is ntree part of library? */
1076                 for(newtree=G.main->nodetree.first; newtree; newtree= newtree->id.next)
1077                         if(newtree==ntree) break;
1078                 if(newtree)
1079                         newtree= copy_libblock(ntree);
1080                 else
1081                         newtree= MEM_dupallocN(ntree);
1082                 newtree->nodes.first= newtree->nodes.last= NULL;
1083                 newtree->links.first= newtree->links.last= NULL;
1084         }
1085         else
1086                 newtree= ntree;
1087         
1088         last= ntree->nodes.last;
1089         for(node= ntree->nodes.first; node; node= node->next) {
1090                 
1091                 node->new_node= NULL;
1092                 if(internal_select==0 || (node->flag & NODE_SELECT)) {
1093                         nnode= nodeCopyNode(newtree, node, internal_select);    /* sets node->new */
1094                         if(internal_select) {
1095                                 node->flag &= ~NODE_SELECT;
1096                                 nnode->flag |= NODE_SELECT;
1097                         }
1098                         node->flag &= ~NODE_ACTIVE;
1099
1100                         /* deselect original sockets */
1101                         for(sock= node->inputs.first; sock; sock= sock->next) {
1102                                 if(sock->flag & SOCK_SEL) sock->flag&= ~SOCK_SEL;
1103                         }
1104                         for(sock= node->outputs.first; sock; sock= sock->next) {
1105                                 if(sock->flag & SOCK_SEL) sock->flag&= ~SOCK_SEL;
1106                         }
1107                         
1108                         /* set tree selin and selout to new sockets */
1109                         for(sock= nnode->inputs.first; sock; sock= sock->next) {
1110                                 if(sock->flag & SOCK_SEL) {
1111                                         ntree->selin= sock;
1112                                         break;
1113                                 }
1114                         }
1115                         for(sock= nnode->outputs.first; sock; sock= sock->next) {
1116                                 if(sock->flag & SOCK_SEL) {
1117                                         ntree->selout= sock;
1118                                         break;
1119                                 }
1120                         }
1121                 }
1122                 if(node==last) break;
1123         }
1124         
1125         /* check for copying links */
1126         for(link= ntree->links.first; link; link= link->next) {
1127                 if(link->fromnode->new_node && link->tonode->new_node) {
1128                         nlink= nodeAddLink(newtree, link->fromnode->new_node, NULL, link->tonode->new_node, NULL);
1129                         /* sockets were copied in order */
1130                         for(a=0, sock= link->fromnode->outputs.first; sock; sock= sock->next, a++) {
1131                                 if(sock==link->fromsock)
1132                                         break;
1133                         }
1134                         nlink->fromsock= BLI_findlink(&link->fromnode->new_node->outputs, a);
1135                         
1136                         for(a=0, sock= link->tonode->inputs.first; sock; sock= sock->next, a++) {
1137                                 if(sock==link->tosock)
1138                                         break;
1139                         }
1140                         nlink->tosock= BLI_findlink(&link->tonode->new_node->inputs, a);
1141                 }
1142         }
1143         
1144         /* own type definition for group usage */
1145         if(internal_select==0) {
1146                 if(ntree->owntype) {
1147                         newtree->owntype= MEM_dupallocN(ntree->owntype);
1148                         if(ntree->owntype->inputs)
1149                                 newtree->owntype->inputs= MEM_dupallocN(ntree->owntype->inputs);
1150                         if(ntree->owntype->outputs)
1151                                 newtree->owntype->outputs= MEM_dupallocN(ntree->owntype->outputs);
1152                 }
1153         }
1154         /* weird this is required... there seem to be link pointers wrong still? */
1155         /* anyhoo, doing this solves crashes on copying entire tree (copy scene) and delete nodes */
1156         ntreeSolveOrder(newtree);
1157
1158         return newtree;
1159 }
1160
1161 /* ************** Free stuff ********** */
1162
1163 /* goes over entire tree */
1164 void nodeUnlinkNode(bNodeTree *ntree, bNode *node)
1165 {
1166         bNodeLink *link, *next;
1167         bNodeSocket *sock;
1168         ListBase *lb;
1169         
1170         for(link= ntree->links.first; link; link= next) {
1171                 next= link->next;
1172                 
1173                 if(link->fromnode==node) {
1174                         lb= &node->outputs;
1175                         NodeTagChanged(ntree, link->tonode);
1176                 }
1177                 else if(link->tonode==node)
1178                         lb= &node->inputs;
1179                 else
1180                         lb= NULL;
1181
1182                 if(lb) {
1183                         for(sock= lb->first; sock; sock= sock->next) {
1184                                 if(link->fromsock==sock || link->tosock==sock)
1185                                         break;
1186                         }
1187                         if(sock) {
1188                                 nodeRemLink(ntree, link);
1189                         }
1190                 }
1191         }
1192 }
1193
1194 static void composit_free_node_cache(bNode *node)
1195 {
1196         bNodeSocket *sock;
1197         
1198         for(sock= node->outputs.first; sock; sock= sock->next) {
1199                 if(sock->ns.data) {
1200                         free_compbuf(sock->ns.data);
1201                         sock->ns.data= NULL;
1202                 }
1203         }
1204 }
1205
1206 void nodeFreeNode(bNodeTree *ntree, bNode *node)
1207 {
1208         nodeUnlinkNode(ntree, node);
1209         BLI_remlink(&ntree->nodes, node);
1210
1211         /* since it is called while free database, node->id is undefined */
1212         
1213         if(ntree->type==NTREE_COMPOSIT)
1214                 composit_free_node_cache(node);
1215         BLI_freelistN(&node->inputs);
1216         BLI_freelistN(&node->outputs);
1217         
1218         if(node->preview) {
1219                 if(node->preview->rect)
1220                         MEM_freeN(node->preview->rect);
1221                 MEM_freeN(node->preview);
1222         }
1223         if(node->typeinfo && node->typeinfo->freestoragefunc) {
1224                 node->typeinfo->freestoragefunc(node);
1225         }
1226
1227         MEM_freeN(node);
1228 }
1229
1230 /* do not free ntree itself here, free_libblock calls this function too */
1231 void ntreeFreeTree(bNodeTree *ntree)
1232 {
1233         bNode *node, *next;
1234         
1235         if(ntree==NULL) return;
1236         
1237         ntreeEndExecTree(ntree);        /* checks for if it is still initialized */
1238         
1239         BLI_freelistN(&ntree->links);   /* do first, then unlink_node goes fast */
1240         
1241         for(node= ntree->nodes.first; node; node= next) {
1242                 next= node->next;
1243                 nodeFreeNode(ntree, node);
1244         }
1245         
1246         if(ntree->owntype) {
1247                 if(ntree->owntype->inputs)
1248                         MEM_freeN(ntree->owntype->inputs);
1249                 if(ntree->owntype->outputs)
1250                         MEM_freeN(ntree->owntype->outputs);
1251                 MEM_freeN(ntree->owntype);
1252         }
1253 }
1254
1255 void ntreeFreeCache(bNodeTree *ntree)
1256 {
1257         bNode *node;
1258         
1259         if(ntree==NULL) return;
1260
1261         if(ntree->type==NTREE_COMPOSIT)
1262                 for(node= ntree->nodes.first; node; node= node->next)
1263                         composit_free_node_cache(node);
1264
1265 }
1266
1267 void ntreeMakeLocal(bNodeTree *ntree)
1268 {
1269         int local=0, lib=0;
1270         
1271         /* - only lib users: do nothing
1272             * - only local users: set flag
1273             * - mixed: make copy
1274             */
1275         
1276         if(ntree->id.lib==NULL) return;
1277         if(ntree->id.us==1) {
1278                 ntree->id.lib= 0;
1279                 ntree->id.flag= LIB_LOCAL;
1280                 new_id(0, (ID *)ntree, 0);
1281                 return;
1282         }
1283         
1284         /* now check users of groups... again typedepending, callback... */
1285         if(ntree->type==NTREE_SHADER) {
1286                 Material *ma;
1287                 for(ma= G.main->mat.first; ma; ma= ma->id.next) {
1288                         if(ma->nodetree) {
1289                                 bNode *node;
1290                                 
1291                                 /* find if group is in tree */
1292                                 for(node= ma->nodetree->nodes.first; node; node= node->next) {
1293                                         if(node->id == (ID *)ntree) {
1294                                                 if(ma->id.lib) lib= 1;
1295                                                 else local= 1;
1296                                         }
1297                                 }
1298                         }
1299                 }
1300         }
1301         else if(ntree->type==NTREE_COMPOSIT) {
1302                 Scene *sce;
1303                 for(sce= G.main->scene.first; sce; sce= sce->id.next) {
1304                         if(sce->nodetree) {
1305                                 bNode *node;
1306                                 
1307                                 /* find if group is in tree */
1308                                 for(node= sce->nodetree->nodes.first; node; node= node->next) {
1309                                         if(node->id == (ID *)ntree) {
1310                                                 if(sce->id.lib) lib= 1;
1311                                                 else local= 1;
1312                                         }
1313                                 }
1314                         }
1315                 }
1316         }
1317         else if(ntree->type==NTREE_TEXTURE) {
1318                 Tex *tx;
1319                 for(tx= G.main->tex.first; tx; tx= tx->id.next) {
1320                         if(tx->nodetree) {
1321                                 bNode *node;
1322                                 
1323                                 /* find if group is in tree */
1324                                 for(node= tx->nodetree->nodes.first; node; node= node->next) {
1325                                         if(node->id == (ID *)ntree) {
1326                                                 if(tx->id.lib) lib= 1;
1327                                                 else local= 1;
1328                                         }
1329                                 }
1330                         }
1331                 }
1332         }
1333         
1334         /* if all users are local, we simply make tree local */
1335         if(local && lib==0) {
1336                 ntree->id.lib= NULL;
1337                 ntree->id.flag= LIB_LOCAL;
1338                 new_id(0, (ID *)ntree, 0);
1339         }
1340         else if(local && lib) {
1341                 /* this is the mixed case, we copy the tree and assign it to local users */
1342                 bNodeTree *newtree= ntreeCopyTree(ntree, 0);
1343                 
1344                 newtree->id.us= 0;
1345                 
1346                 if(ntree->type==NTREE_SHADER) {
1347                         Material *ma;
1348                         for(ma= G.main->mat.first; ma; ma= ma->id.next) {
1349                                 if(ma->nodetree) {
1350                                         bNode *node;
1351                                         
1352                                         /* find if group is in tree */
1353                                         for(node= ma->nodetree->nodes.first; node; node= node->next) {
1354                                                 if(node->id == (ID *)ntree) {
1355                                                         if(ma->id.lib==NULL) {
1356                                                                 node->id= &newtree->id;
1357                                                                 newtree->id.us++;
1358                                                                 ntree->id.us--;
1359                                                         }
1360                                                 }
1361                                         }
1362                                 }
1363                         }
1364                 }
1365                 else if(ntree->type==NTREE_COMPOSIT) {
1366                         Scene *sce;
1367                         for(sce= G.main->scene.first; sce; sce= sce->id.next) {
1368                                 if(sce->nodetree) {
1369                                         bNode *node;
1370                                         
1371                                         /* find if group is in tree */
1372                                         for(node= sce->nodetree->nodes.first; node; node= node->next) {
1373                                                 if(node->id == (ID *)ntree) {
1374                                                         if(sce->id.lib==NULL) {
1375                                                                 node->id= &newtree->id;
1376                                                                 newtree->id.us++;
1377                                                                 ntree->id.us--;
1378                                                         }
1379                                                 }
1380                                         }
1381                                 }
1382                         }
1383                 }
1384                 else if(ntree->type==NTREE_TEXTURE) {
1385                         Tex *tx;
1386                         for(tx= G.main->tex.first; tx; tx= tx->id.next) {
1387                                 if(tx->nodetree) {
1388                                         bNode *node;
1389                                         
1390                                         /* find if group is in tree */
1391                                         for(node= tx->nodetree->nodes.first; node; node= node->next) {
1392                                                 if(node->id == (ID *)ntree) {
1393                                                         if(tx->id.lib==NULL) {
1394                                                                 node->id= &newtree->id;
1395                                                                 newtree->id.us++;
1396                                                                 ntree->id.us--;
1397                                                         }
1398                                                 }
1399                                         }
1400                                 }
1401                         }
1402                 }
1403         }
1404 }
1405
1406
1407 /* ************ find stuff *************** */
1408
1409 static int ntreeHasType(bNodeTree *ntree, int type)
1410 {
1411         bNode *node;
1412         
1413         if(ntree)
1414                 for(node= ntree->nodes.first; node; node= node->next)
1415                         if(node->type == type)
1416                                 return 1;
1417         return 0;
1418 }
1419
1420 bNodeLink *nodeFindLink(bNodeTree *ntree, bNodeSocket *from, bNodeSocket *to)
1421 {
1422         bNodeLink *link;
1423         
1424         for(link= ntree->links.first; link; link= link->next) {
1425                 if(link->fromsock==from && link->tosock==to)
1426                         return link;
1427                 if(link->fromsock==to && link->tosock==from)    /* hrms? */
1428                         return link;
1429         }
1430         return NULL;
1431 }
1432
1433 int nodeCountSocketLinks(bNodeTree *ntree, bNodeSocket *sock)
1434 {
1435         bNodeLink *link;
1436         int tot= 0;
1437         
1438         for(link= ntree->links.first; link; link= link->next) {
1439                 if(link->fromsock==sock || link->tosock==sock)
1440                         tot++;
1441         }
1442         return tot;
1443 }
1444
1445 bNode *nodeGetActive(bNodeTree *ntree)
1446 {
1447         bNode *node;
1448         
1449         if(ntree==NULL) return NULL;
1450         
1451         for(node= ntree->nodes.first; node; node= node->next)
1452                 if(node->flag & NODE_ACTIVE)
1453                         break;
1454         return node;
1455 }
1456
1457 /* two active flags, ID nodes have special flag for buttons display */
1458 bNode *nodeGetActiveID(bNodeTree *ntree, short idtype)
1459 {
1460         bNode *node;
1461         
1462         if(ntree==NULL) return NULL;
1463
1464         /* check for group edit */
1465     for(node= ntree->nodes.first; node; node= node->next)
1466                 if(node->flag & NODE_GROUP_EDIT)
1467                         break;
1468
1469         if(node)
1470                 ntree= (bNodeTree*)node->id;
1471         
1472         /* now find active node with this id */
1473         for(node= ntree->nodes.first; node; node= node->next)
1474                 if(node->id && GS(node->id->name)==idtype)
1475                         if(node->flag & NODE_ACTIVE_ID)
1476                                 break;
1477
1478         return node;
1479 }
1480
1481 /* two active flags, ID nodes have special flag for buttons display */
1482 void nodeClearActiveID(bNodeTree *ntree, short idtype)
1483 {
1484         bNode *node;
1485         
1486         if(ntree==NULL) return;
1487         
1488         for(node= ntree->nodes.first; node; node= node->next)
1489                 if(node->id && GS(node->id->name)==idtype)
1490                         node->flag &= ~NODE_ACTIVE_ID;
1491 }
1492
1493 /* two active flags, ID nodes have special flag for buttons display */
1494 void nodeSetActive(bNodeTree *ntree, bNode *node)
1495 {
1496         bNode *tnode;
1497         
1498         /* make sure only one node is active, and only one per ID type */
1499         for(tnode= ntree->nodes.first; tnode; tnode= tnode->next) {
1500                 tnode->flag &= ~NODE_ACTIVE;
1501                 
1502                 if(node->id && tnode->id) {
1503                         if(GS(node->id->name) == GS(tnode->id->name))
1504                                 tnode->flag &= ~NODE_ACTIVE_ID;
1505                 }
1506         }
1507         
1508         node->flag |= NODE_ACTIVE;
1509         if(node->id)
1510                 node->flag |= NODE_ACTIVE_ID;
1511 }
1512
1513 /* use flags are not persistant yet, groups might need different tagging, so we do it each time
1514    when we need to get this info */
1515 void ntreeSocketUseFlags(bNodeTree *ntree)
1516 {
1517         bNode *node;
1518         bNodeSocket *sock;
1519         bNodeLink *link;
1520         
1521         /* clear flags */
1522         for(node= ntree->nodes.first; node; node= node->next) {
1523                 for(sock= node->inputs.first; sock; sock= sock->next)
1524                         sock->flag &= ~SOCK_IN_USE;
1525                 for(sock= node->outputs.first; sock; sock= sock->next)
1526                         sock->flag &= ~SOCK_IN_USE;
1527         }
1528         
1529         /* tag all thats in use */
1530         for(link= ntree->links.first; link; link= link->next) {
1531                 link->fromsock->flag |= SOCK_IN_USE;
1532                 link->tosock->flag |= SOCK_IN_USE;
1533         }
1534 }
1535
1536 /* ************** dependency stuff *********** */
1537
1538 /* node is guaranteed to be not checked before */
1539 static int node_recurs_check(bNode *node, bNode ***nsort, int level)
1540 {
1541         bNode *fromnode;
1542         bNodeSocket *sock;
1543         int has_inputlinks= 0;
1544         
1545         node->done= 1;
1546         level++;
1547         
1548         for(sock= node->inputs.first; sock; sock= sock->next) {
1549                 if(sock->link) {
1550                         has_inputlinks= 1;
1551                         fromnode= sock->link->fromnode;
1552                         if(fromnode->done==0) {
1553                                 fromnode->level= node_recurs_check(fromnode, nsort, level);
1554                         }
1555                 }
1556         }
1557 //      printf("node sort %s level %d\n", node->name, level);
1558         **nsort= node;
1559         (*nsort)++;
1560         
1561         if(has_inputlinks)
1562                 return level;
1563         else 
1564                 return 0xFFF;
1565 }
1566
1567 void ntreeSolveOrder(bNodeTree *ntree)
1568 {
1569         bNode *node, **nodesort, **nsort;
1570         bNodeSocket *sock;
1571         bNodeLink *link;
1572         int a, totnode=0;
1573         
1574         /* the solve-order is called on each tree change, so we should be sure no exec can be running */
1575         ntreeEndExecTree(ntree);
1576
1577         /* set links pointers the input sockets, to find dependencies */
1578         /* first clear data */
1579         for(node= ntree->nodes.first; node; node= node->next) {
1580                 node->done= 0;
1581                 totnode++;
1582                 for(sock= node->inputs.first; sock; sock= sock->next)
1583                         sock->link= NULL;
1584         }
1585         if(totnode==0)
1586                 return;
1587         
1588         for(link= ntree->links.first; link; link= link->next) {
1589                 link->tosock->link= link;
1590         }
1591         
1592         nsort= nodesort= MEM_callocN(totnode*sizeof(void *), "sorted node array");
1593         
1594         /* recursive check */
1595         for(node= ntree->nodes.first; node; node= node->next) {
1596                 if(node->done==0) {
1597                         node->level= node_recurs_check(node, &nsort, 0);
1598                 }
1599         }
1600         
1601         /* re-insert nodes in order, first a paranoia check */
1602         for(a=0; a<totnode; a++) {
1603                 if(nodesort[a]==NULL)
1604                         break;
1605         }
1606         if(a<totnode)
1607                 printf("sort error in node tree");
1608         else {
1609                 ntree->nodes.first= ntree->nodes.last= NULL;
1610                 for(a=0; a<totnode; a++)
1611                         BLI_addtail(&ntree->nodes, nodesort[a]);
1612         }
1613         
1614         MEM_freeN(nodesort);
1615         
1616         /* find the active outputs, might become tree type dependant handler */
1617         for(node= ntree->nodes.first; node; node= node->next) {
1618                 if(node->typeinfo->nclass==NODE_CLASS_OUTPUT) {
1619                         bNode *tnode;
1620                         int output= 0;
1621                         
1622                         /* we need a check for which output node should be tagged like this, below an exception */
1623                         if(node->type==CMP_NODE_OUTPUT_FILE)
1624                            continue;
1625                            
1626                         /* there is more types having output class, each one is checked */
1627                         for(tnode= ntree->nodes.first; tnode; tnode= tnode->next) {
1628                                 if(tnode->typeinfo->nclass==NODE_CLASS_OUTPUT) {
1629                                         if(tnode->type==node->type) {
1630                                                 if(tnode->flag & NODE_DO_OUTPUT) {
1631                                                         output++;
1632                                                         if(output>1)
1633                                                                 tnode->flag &= ~NODE_DO_OUTPUT;
1634                                                 }
1635                                         }
1636                                 }
1637                         }
1638                         if(output==0)
1639                                 node->flag |= NODE_DO_OUTPUT;
1640                 }
1641         }
1642         
1643         /* here we could recursively set which nodes have to be done,
1644                 might be different for editor or for "real" use... */
1645 }
1646
1647 /* should be callback! */
1648 void NodeTagChanged(bNodeTree *ntree, bNode *node)
1649 {
1650         if(ntree->type==NTREE_COMPOSIT) {
1651                 bNodeSocket *sock;
1652
1653                 for(sock= node->outputs.first; sock; sock= sock->next) {
1654                         if(sock->ns.data) {
1655                                 free_compbuf(sock->ns.data);
1656                                 sock->ns.data= NULL;
1657                                 
1658                                 //if(node->preview && node->preview->rect) {
1659                                 //      MEM_freeN(node->preview->rect);
1660                                 //      node->preview->rect= NULL;
1661                                 //}
1662                                         
1663                         }
1664                 }
1665                 node->need_exec= 1;
1666         }
1667         else if(ntree->type == NTREE_TEXTURE)
1668                 ntreeTexUpdatePreviews(ntree);
1669 }
1670
1671 void NodeTagIDChanged(bNodeTree *ntree, ID *id)
1672 {
1673         if(id==NULL)
1674                 return;
1675         
1676         if(ntree->type==NTREE_COMPOSIT) {
1677                 bNode *node;
1678                 
1679                 for(node= ntree->nodes.first; node; node= node->next)
1680                         if(node->id==id)
1681                                 NodeTagChanged(ntree, node);
1682         }
1683 }
1684
1685
1686 /* *************** preview *********** */
1687
1688 /* if node->preview, then we assume the rect to exist */
1689
1690 static void nodeInitPreview(bNode *node, int xsize, int ysize)
1691 {
1692         
1693         if(node->preview==NULL) {
1694                 node->preview= MEM_callocN(sizeof(bNodePreview), "node preview");
1695 //              printf("added preview %s\n", node->name);
1696         }
1697         
1698         /* node previews can get added with variable size this way */
1699         if(xsize==0 || ysize==0)
1700                 return;
1701         
1702         /* sanity checks & initialize */
1703         if(node->preview->rect) {
1704                 if(node->preview->xsize!=xsize && node->preview->ysize!=ysize) {
1705                         MEM_freeN(node->preview->rect);
1706                         node->preview->rect= NULL;
1707                 }
1708         }
1709         
1710         if(node->preview->rect==NULL) {
1711                 node->preview->rect= MEM_callocN(4*xsize + xsize*ysize*sizeof(float)*4, "node preview rect");
1712                 node->preview->xsize= xsize;
1713                 node->preview->ysize= ysize;
1714         }
1715 }
1716
1717 void ntreeInitPreview(bNodeTree *ntree, int xsize, int ysize)
1718 {
1719         bNode *node;
1720         
1721         if(ntree==NULL)
1722                 return;
1723         
1724         for(node= ntree->nodes.first; node; node= node->next) {
1725                 if(node->typeinfo->flag & NODE_PREVIEW) /* hrms, check for closed nodes? */
1726                         nodeInitPreview(node, xsize, ysize);
1727                 if(node->type==NODE_GROUP && (node->flag & NODE_GROUP_EDIT))
1728                         ntreeInitPreview((bNodeTree *)node->id, xsize, ysize);
1729         }               
1730 }
1731
1732 static void nodeClearPreview(bNode *node)
1733 {
1734         if(node->preview && node->preview->rect)
1735                 memset(node->preview->rect, 0, MEM_allocN_len(node->preview->rect));
1736 }
1737
1738 /* use it to enforce clear */
1739 void ntreeClearPreview(bNodeTree *ntree)
1740 {
1741         bNode *node;
1742         
1743         if(ntree==NULL)
1744                 return;
1745         
1746         for(node= ntree->nodes.first; node; node= node->next) {
1747                 if(node->typeinfo->flag & NODE_PREVIEW)
1748                         nodeClearPreview(node);
1749                 if(node->type==NODE_GROUP && (node->flag & NODE_GROUP_EDIT))
1750                         ntreeClearPreview((bNodeTree *)node->id);
1751         }               
1752 }
1753
1754 /* hack warning! this function is only used for shader previews, and 
1755    since it gets called multiple times per pixel for Ztransp we only
1756    add the color once. Preview gets cleared before it starts render though */
1757 void nodeAddToPreview(bNode *node, float *col, int x, int y)
1758 {
1759         bNodePreview *preview= node->preview;
1760         if(preview) {
1761                 if(x>=0 && y>=0) {
1762                         if(x<preview->xsize && y<preview->ysize) {
1763                                 float *tar= preview->rect+ 4*((preview->xsize*y) + x);
1764                                 if(tar[0]==0.0f) {
1765                                         QUATCOPY(tar, col);
1766                                 }
1767                         }
1768                         //else printf("prv out bound x y %d %d\n", x, y);
1769                 }
1770                 //else printf("prv out bound x y %d %d\n", x, y);
1771         }
1772 }
1773
1774
1775
1776 /* ******************* executing ************* */
1777
1778 /* see notes at ntreeBeginExecTree */
1779 static void group_node_get_stack(bNode *node, bNodeStack *stack, bNodeStack **in, bNodeStack **out, bNodeStack **gin, bNodeStack **gout)
1780 {
1781         bNodeSocket *sock;
1782         
1783         /* build pointer stack */
1784         for(sock= node->inputs.first; sock; sock= sock->next) {
1785                 if(sock->intern) {
1786                         /* yep, intern can have link or is hidden socket */
1787                         if(sock->link)
1788                                 *(in++)= stack + sock->link->fromsock->stack_index;
1789                         else
1790                                 *(in++)= &sock->ns;
1791                 }
1792                 else
1793                         *(in++)= gin[sock->stack_index_ext];
1794         }
1795         
1796         for(sock= node->outputs.first; sock; sock= sock->next) {
1797                 if(sock->intern)
1798                         *(out++)= stack + sock->stack_index;
1799                 else
1800                         *(out++)= gout[sock->stack_index_ext];
1801         }
1802 }
1803
1804 static void node_group_execute(bNodeStack *stack, void *data, bNode *gnode, bNodeStack **in, bNodeStack **out)
1805 {
1806         bNode *node;
1807         bNodeTree *ntree= (bNodeTree *)gnode->id;
1808         bNodeStack *nsin[MAX_SOCKET];   /* arbitrary... watch this */
1809         bNodeStack *nsout[MAX_SOCKET];  /* arbitrary... watch this */
1810         
1811         if(ntree==NULL) return;
1812         
1813         stack+= gnode->stack_index;
1814                 
1815         for(node= ntree->nodes.first; node; node= node->next) {
1816                 if(node->typeinfo->execfunc) {
1817                         group_node_get_stack(node, stack, nsin, nsout, in, out);
1818                         
1819                         /* for groups, only execute outputs for edited group */
1820                         if(node->typeinfo->nclass==NODE_CLASS_OUTPUT) {
1821                                 if(gnode->flag & NODE_GROUP_EDIT)
1822                                         if(node->flag & NODE_DO_OUTPUT)
1823                                                 node->typeinfo->execfunc(data, node, nsin, nsout);
1824                         }
1825                         else
1826                                 node->typeinfo->execfunc(data, node, nsin, nsout);
1827                 }
1828         }
1829         
1830         /* free internal group output nodes */
1831         if(ntree->type==NTREE_COMPOSIT) {
1832                 for(node= ntree->nodes.first; node; node= node->next) {
1833                         if(node->typeinfo->execfunc) {
1834                                 bNodeSocket *sock;
1835                                 
1836                                 for(sock= node->outputs.first; sock; sock= sock->next) {
1837                                         if(sock->intern) {
1838                                                 bNodeStack *ns= stack + sock->stack_index;
1839                                                 if(ns->data) {
1840                                                         free_compbuf(ns->data);
1841                                                         ns->data= NULL;
1842                                                 }
1843                                         }
1844                                 }
1845                         }
1846                 }
1847         }
1848 }
1849
1850 /* recursively called for groups */
1851 /* we set all trees on own local indices, but put a total counter
1852    in the groups, so each instance of a group has own stack */
1853 static int ntree_begin_exec_tree(bNodeTree *ntree)
1854 {
1855         bNode *node;
1856         bNodeSocket *sock;
1857         int index= 0, index_in= 0, index_out= 0;
1858         
1859         if((ntree->init & NTREE_TYPE_INIT)==0)
1860                 ntreeInitTypes(ntree);
1861         
1862         /* create indices for stack, check preview */
1863         for(node= ntree->nodes.first; node; node= node->next) {
1864                 
1865                 for(sock= node->inputs.first; sock; sock= sock->next) {
1866                         if(sock->intern==0)
1867                                 sock->stack_index_ext= index_in++;
1868                 }
1869                 
1870                 for(sock= node->outputs.first; sock; sock= sock->next) {
1871                         sock->stack_index= index++;
1872                         if(sock->intern==0)
1873                                 sock->stack_index_ext= index_out++;
1874                 }
1875                 
1876                 if(node->type==NODE_GROUP) {
1877                         if(node->id) {
1878                                 node->stack_index= index;
1879                                 index+= ntree_begin_exec_tree((bNodeTree *)node->id);
1880                         }
1881                 }
1882         }
1883         
1884         return index;
1885 }
1886
1887 /* copy socket compbufs to stack, initialize usage of curve nodes */
1888 static void composit_begin_exec(bNodeTree *ntree, int is_group)
1889 {
1890         bNode *node;
1891         bNodeSocket *sock;
1892         
1893         for(node= ntree->nodes.first; node; node= node->next) {
1894                 
1895                 /* initialize needed for groups */
1896                 node->exec= 0;  
1897                 
1898                 if(is_group==0) {
1899                         for(sock= node->outputs.first; sock; sock= sock->next) {
1900                                 bNodeStack *ns= ntree->stack + sock->stack_index;
1901                                 
1902                                 if(sock->ns.data) {
1903                                         ns->data= sock->ns.data;
1904                                         sock->ns.data= NULL;
1905                                 }
1906                         }
1907                 }
1908                 /* cannot initialize them while using in threads */
1909                 if(ELEM3(node->type, CMP_NODE_TIME, CMP_NODE_CURVE_VEC, CMP_NODE_CURVE_RGB)) {
1910                         curvemapping_initialize(node->storage);
1911                         if(node->type==CMP_NODE_CURVE_RGB)
1912                                 curvemapping_premultiply(node->storage, 0);
1913                 }
1914                 if(node->type==NODE_GROUP)
1915                         composit_begin_exec((bNodeTree *)node->id, 1);
1916
1917         }
1918 }
1919
1920 /* copy stack compbufs to sockets */
1921 static void composit_end_exec(bNodeTree *ntree, int is_group)
1922 {
1923         extern void print_compbuf(char *str, struct CompBuf *cbuf);
1924         bNode *node;
1925         bNodeStack *ns;
1926         int a;
1927
1928         for(node= ntree->nodes.first; node; node= node->next) {
1929                 if(is_group==0) {
1930                         bNodeSocket *sock;
1931                 
1932                         for(sock= node->outputs.first; sock; sock= sock->next) {
1933                                 ns= ntree->stack + sock->stack_index;
1934                                 if(ns->data) {
1935                                         sock->ns.data= ns->data;
1936                                         ns->data= NULL;
1937                                 }
1938                         }
1939                 }
1940                 if(node->type==CMP_NODE_CURVE_RGB)
1941                         curvemapping_premultiply(node->storage, 1);
1942                 
1943                 if(node->type==NODE_GROUP)
1944                         composit_end_exec((bNodeTree *)node->id, 1);
1945
1946                 node->need_exec= 0;
1947         }
1948         
1949         if(is_group==0) {
1950                 /* internally, group buffers are not stored */
1951                 for(ns= ntree->stack, a=0; a<ntree->stacksize; a++, ns++) {
1952                         if(ns->data) {
1953                                 printf("freed leftover buffer from stack\n");
1954                                 free_compbuf(ns->data);
1955                         }
1956                 }
1957         }
1958 }
1959
1960 static void group_tag_used_outputs(bNode *gnode, bNodeStack *stack)
1961 {
1962         bNodeTree *ntree= (bNodeTree *)gnode->id;
1963         bNode *node;
1964         
1965         stack+= gnode->stack_index;
1966         
1967         for(node= ntree->nodes.first; node; node= node->next) {
1968                 if(node->typeinfo->execfunc) {
1969                         bNodeSocket *sock;
1970                         
1971                         for(sock= node->inputs.first; sock; sock= sock->next) {
1972                                 if(sock->intern) {
1973                                         if(sock->link) {
1974                                                 bNodeStack *ns= stack + sock->link->fromsock->stack_index;
1975                                                 ns->hasoutput= 1;
1976                                                 ns->sockettype= sock->link->fromsock->type;
1977                                         }
1978                                         else
1979                                                 sock->ns.sockettype= sock->type;
1980                                 }
1981                         }
1982                 }
1983         }
1984 }
1985
1986 /* stack indices make sure all nodes only write in allocated data, for making it thread safe */
1987 /* only root tree gets the stack, to enable instances to have own stack entries */
1988 /* only two threads now! */
1989 /* per tree (and per group) unique indices are created */
1990 /* the index_ext we need to be able to map from groups to the group-node own stack */
1991
1992 typedef struct bNodeThreadStack {
1993         struct bNodeThreadStack *next, *prev;
1994         bNodeStack *stack;
1995         int used;
1996 } bNodeThreadStack;
1997
1998 static bNodeThreadStack *ntreeGetThreadStack(bNodeTree *ntree, int thread)
1999 {
2000         ListBase *lb= &ntree->threadstack[thread];
2001         bNodeThreadStack *nts;
2002         
2003         /* for material shading this is called quite a lot (perhaps too much locking unlocking)
2004          * however without locking we get bug #18058 - Campbell */
2005         BLI_lock_thread(LOCK_CUSTOM1); 
2006         
2007         for(nts=lb->first; nts; nts=nts->next) {
2008                 if(!nts->used) {
2009                         nts->used= 1;
2010                         BLI_unlock_thread(LOCK_CUSTOM1);
2011                         return nts;
2012                 }
2013         }
2014         nts= MEM_callocN(sizeof(bNodeThreadStack), "bNodeThreadStack");
2015         nts->stack= MEM_dupallocN(ntree->stack);
2016         nts->used= 1;
2017         BLI_addtail(lb, nts);
2018         BLI_unlock_thread(LOCK_CUSTOM1);
2019         return nts;
2020 }
2021
2022 static void ntreeReleaseThreadStack(bNodeThreadStack *nts)
2023 {
2024         nts->used= 0;
2025 }
2026
2027 /* free texture delegates */
2028 static void tex_end_exec(bNodeTree *ntree)
2029 {
2030         bNodeThreadStack *nts;
2031         bNodeStack *ns;
2032         int th, a;
2033         
2034         if(ntree->threadstack)
2035                 for(th=0; th<BLENDER_MAX_THREADS; th++)
2036                         for(nts=ntree->threadstack[th].first; nts; nts=nts->next)
2037                                 for(ns= nts->stack, a=0; a<ntree->stacksize; a++, ns++)
2038                                         if(ns->data)
2039                                                 MEM_freeN(ns->data);
2040                                                 
2041 }
2042
2043 void ntreeBeginExecTree(bNodeTree *ntree)
2044 {
2045         /* let's make it sure */
2046         if(ntree->init & NTREE_EXEC_INIT)
2047                 return;
2048         
2049         /* allocate the thread stack listbase array */
2050         if(ntree->type!=NTREE_COMPOSIT)
2051                 ntree->threadstack= MEM_callocN(BLENDER_MAX_THREADS*sizeof(ListBase), "thread stack array");
2052
2053         /* goes recursive over all groups */
2054         ntree->stacksize= ntree_begin_exec_tree(ntree);
2055
2056         if(ntree->stacksize) {
2057                 bNode *node;
2058                 bNodeStack *ns;
2059                 int a;
2060                 
2061                 /* allocate the base stack */
2062                 ns=ntree->stack= MEM_callocN(ntree->stacksize*sizeof(bNodeStack), "node stack");
2063                 
2064                 /* tag inputs, the get_stack() gives own socket stackdata if not in use */
2065                 for(a=0; a<ntree->stacksize; a++, ns++) ns->hasinput= 1;
2066                 
2067                 /* tag used outputs, so we know when we can skip operations */
2068                 for(node= ntree->nodes.first; node; node= node->next) {
2069                         bNodeSocket *sock;
2070                         for(sock= node->inputs.first; sock; sock= sock->next) {
2071                                 if(sock->link) {
2072                                         ns= ntree->stack + sock->link->fromsock->stack_index;
2073                                         ns->hasoutput= 1;
2074                                         ns->sockettype= sock->link->fromsock->type;
2075                                 }
2076                                 else
2077                                         sock->ns.sockettype= sock->type;
2078                         }
2079                         if(node->type==NODE_GROUP && node->id)
2080                                 group_tag_used_outputs(node, ntree->stack);
2081                 }
2082                 
2083                 if(ntree->type==NTREE_COMPOSIT)
2084                         composit_begin_exec(ntree, 0);
2085         }
2086         
2087         ntree->init |= NTREE_EXEC_INIT;
2088 }
2089
2090 void ntreeEndExecTree(bNodeTree *ntree)
2091 {
2092         
2093         if(ntree->init & NTREE_EXEC_INIT) {
2094                 bNodeThreadStack *nts;
2095                 int a;
2096                 
2097                 /* another callback candidate! */
2098                 if(ntree->type==NTREE_COMPOSIT)
2099                         composit_end_exec(ntree, 0);
2100                 else if(ntree->type==NTREE_TEXTURE)
2101                         tex_end_exec(ntree);
2102                 
2103                 if(ntree->stack) {
2104                         MEM_freeN(ntree->stack);
2105                         ntree->stack= NULL;
2106                 }
2107
2108                 if(ntree->threadstack) {
2109                         for(a=0; a<BLENDER_MAX_THREADS; a++) {
2110                                 for(nts=ntree->threadstack[a].first; nts; nts=nts->next)
2111                                         if (nts->stack) MEM_freeN(nts->stack);
2112                                 BLI_freelistN(&ntree->threadstack[a]);
2113                         }
2114
2115                         MEM_freeN(ntree->threadstack);
2116                         ntree->threadstack= NULL;
2117                 }
2118
2119                 ntree->init &= ~NTREE_EXEC_INIT;
2120         }
2121 }
2122
2123 static void node_get_stack(bNode *node, bNodeStack *stack, bNodeStack **in, bNodeStack **out)
2124 {
2125         bNodeSocket *sock;
2126         
2127         /* build pointer stack */
2128         for(sock= node->inputs.first; sock; sock= sock->next) {
2129                 if(sock->link)
2130                         *(in++)= stack + sock->link->fromsock->stack_index;
2131                 else
2132                         *(in++)= &sock->ns;
2133         }
2134         
2135         for(sock= node->outputs.first; sock; sock= sock->next) {
2136                 *(out++)= stack + sock->stack_index;
2137         }
2138 }
2139
2140 /* nodes are presorted, so exec is in order of list */
2141 void ntreeExecTree(bNodeTree *ntree, void *callerdata, int thread)
2142 {
2143         bNode *node;
2144         bNodeStack *nsin[MAX_SOCKET];   /* arbitrary... watch this */
2145         bNodeStack *nsout[MAX_SOCKET];  /* arbitrary... watch this */
2146         bNodeStack *stack;
2147         bNodeThreadStack *nts = NULL;
2148         
2149         /* only when initialized */
2150         if((ntree->init & NTREE_EXEC_INIT)==0)
2151                 ntreeBeginExecTree(ntree);
2152                 
2153         /* composite does 1 node per thread, so no multiple stacks needed */
2154         if(ntree->type==NTREE_COMPOSIT) {
2155                 stack= ntree->stack;
2156         }
2157         else {
2158                 nts= ntreeGetThreadStack(ntree, thread);
2159                 stack= nts->stack;
2160         }
2161         
2162         for(node= ntree->nodes.first; node; node= node->next) {
2163                 if(node->typeinfo->execfunc) {
2164                         node_get_stack(node, stack, nsin, nsout);
2165                         node->typeinfo->execfunc(callerdata, node, nsin, nsout);
2166                 }
2167                 else if(node->type==NODE_GROUP && node->id) {
2168                         node_get_stack(node, stack, nsin, nsout);
2169                         node_group_execute(stack, callerdata, node, nsin, nsout); 
2170                 }
2171         }
2172
2173         if(nts)
2174                 ntreeReleaseThreadStack(nts);
2175 }
2176
2177
2178 /* ***************************** threaded version for execute composite nodes ************* */
2179 /* these are nodes without input, only giving values */
2180 /* or nodes with only value inputs */
2181 static int node_only_value(bNode *node)
2182 {
2183         bNodeSocket *sock;
2184         
2185         if(ELEM3(node->type, CMP_NODE_TIME, CMP_NODE_VALUE, CMP_NODE_RGB))
2186                 return 1;
2187         
2188         /* doing this for all node types goes wrong. memory free errors */
2189         if(node->inputs.first && node->type==CMP_NODE_MAP_VALUE) {
2190                 int retval= 1;
2191                 for(sock= node->inputs.first; sock; sock= sock->next) {
2192                         if(sock->link)
2193                                 retval &= node_only_value(sock->link->fromnode);
2194                 }
2195                 return retval;
2196         }
2197         return 0;
2198 }
2199
2200
2201 /* not changing info, for thread callback */
2202 typedef struct ThreadData {
2203         bNodeStack *stack;
2204         RenderData *rd;
2205 } ThreadData;
2206
2207 static void *exec_composite_node(void *node_v)
2208 {
2209         bNodeStack *nsin[MAX_SOCKET];   /* arbitrary... watch this */
2210         bNodeStack *nsout[MAX_SOCKET];  /* arbitrary... watch this */
2211         bNode *node= node_v;
2212         ThreadData *thd= (ThreadData *)node->new_node; /* abuse */
2213         
2214         node_get_stack(node, thd->stack, nsin, nsout);
2215         
2216         if((node->flag & NODE_MUTED) && (!node_only_value(node))) {
2217                 /* viewers we execute, for feedback to user */
2218                 if(ELEM(node->type, CMP_NODE_VIEWER, CMP_NODE_SPLITVIEWER)) 
2219                         node->typeinfo->execfunc(thd->rd, node, nsin, nsout);
2220                 else
2221                         node_compo_pass_on(node, nsin, nsout);
2222         }
2223         else if(node->typeinfo->execfunc) {
2224                 node->typeinfo->execfunc(thd->rd, node, nsin, nsout);
2225         }
2226         else if(node->type==NODE_GROUP && node->id) {
2227                 node_group_execute(thd->stack, thd->rd, node, nsin, nsout); 
2228         }
2229         
2230         node->exec |= NODE_READY;
2231         return 0;
2232 }
2233
2234 /* return total of executable nodes, for timecursor */
2235 /* only compositor uses it */
2236 static int setExecutableNodes(bNodeTree *ntree, ThreadData *thd)
2237 {
2238         bNodeStack *nsin[MAX_SOCKET];   /* arbitrary... watch this */
2239         bNodeStack *nsout[MAX_SOCKET];  /* arbitrary... watch this */
2240         bNode *node;
2241         bNodeSocket *sock;
2242         int totnode= 0, group_edit= 0;
2243         
2244         /* note; do not add a dependency sort here, the stack was created already */
2245         
2246         /* if we are in group edit, viewer nodes get skipped when group has viewer */
2247         for(node= ntree->nodes.first; node; node= node->next)
2248                 if(node->type==NODE_GROUP && (node->flag & NODE_GROUP_EDIT))
2249                         if(ntreeHasType((bNodeTree *)node->id, CMP_NODE_VIEWER))
2250                                 group_edit= 1;
2251         
2252         for(node= ntree->nodes.first; node; node= node->next) {
2253                 int a;
2254                 
2255                 node_get_stack(node, thd->stack, nsin, nsout);
2256                 
2257                 /* test the outputs */
2258                 /* skip value-only nodes (should be in type!) */
2259                 if(!node_only_value(node)) {
2260                         for(a=0, sock= node->outputs.first; sock; sock= sock->next, a++) {
2261                                 if(nsout[a]->data==NULL && nsout[a]->hasoutput) {
2262                                         node->need_exec= 1;
2263                                         break;
2264                                 }
2265                         }
2266                 }
2267                 
2268                 /* test the inputs */
2269                 for(a=0, sock= node->inputs.first; sock; sock= sock->next, a++) {
2270                         /* skip viewer nodes in bg render or group edit */
2271                         if( ELEM(node->type, CMP_NODE_VIEWER, CMP_NODE_SPLITVIEWER) && (G.background || group_edit))
2272                                 node->need_exec= 0;
2273                         /* is sock in use? */
2274                         else if(sock->link) {
2275                                 bNodeLink *link= sock->link;
2276                                 /* this is the test for a cyclic case */
2277                                 if(link->fromnode->level >= link->tonode->level && link->tonode->level!=0xFFF) {
2278                                         if(link->fromnode->need_exec) {
2279                                                 node->need_exec= 1;
2280                                                 break;
2281                                         }
2282                                 }
2283                                 else {
2284                                         node->need_exec= 0;
2285                                         printf("Node %s skipped, cyclic dependency\n", node->name);
2286                                 }
2287                         }
2288                 }
2289                 
2290                 if(node->need_exec) {
2291                         
2292                         /* free output buffers */
2293                         for(a=0, sock= node->outputs.first; sock; sock= sock->next, a++) {
2294                                 if(nsout[a]->data) {
2295                                         free_compbuf(nsout[a]->data);
2296                                         nsout[a]->data= NULL;
2297                                 }
2298                         }
2299                         totnode++;
2300                         /* printf("node needs exec %s\n", node->name); */
2301                         
2302                         /* tag for getExecutableNode() */
2303                         node->exec= 0;
2304                 }
2305                 else {
2306                         /* tag for getExecutableNode() */
2307                         node->exec= NODE_READY|NODE_FINISHED;
2308                         
2309                 }
2310         }
2311         
2312         /* last step: set the stack values for only-value nodes */
2313         /* just does all now, compared to a full buffer exec this is nothing */
2314         if(totnode) {
2315                 for(node= ntree->nodes.first; node; node= node->next) {
2316                         if(node->need_exec==0 && node_only_value(node)) {
2317                                 if(node->typeinfo->execfunc) {
2318                                         node_get_stack(node, thd->stack, nsin, nsout);
2319                                         node->typeinfo->execfunc(thd->rd, node, nsin, nsout);
2320                                 }
2321                         }
2322                 }
2323         }
2324         
2325         return totnode;
2326 }
2327
2328 /* while executing tree, free buffers from nodes that are not needed anymore */
2329 static void freeExecutableNode(bNodeTree *ntree)
2330 {
2331         /* node outputs can be freed when:
2332         - not a render result or image node
2333         - when node outputs go to nodes all being set NODE_FINISHED
2334         */
2335         bNode *node;
2336         bNodeSocket *sock;
2337         
2338         /* set exec flag for finished nodes that might need freed */
2339         for(node= ntree->nodes.first; node; node= node->next) {
2340                 if(node->type!=CMP_NODE_R_LAYERS)
2341                         if(node->exec & NODE_FINISHED)
2342                                 node->exec |= NODE_FREEBUFS;
2343         }
2344         /* clear this flag for input links that are not done yet */
2345         for(node= ntree->nodes.first; node; node= node->next) {
2346                 if((node->exec & NODE_FINISHED)==0) {
2347                         for(sock= node->inputs.first; sock; sock= sock->next)
2348                                 if(sock->link)
2349                                         sock->link->fromnode->exec &= ~NODE_FREEBUFS;
2350                 }
2351         }
2352         /* now we can free buffers */
2353         for(node= ntree->nodes.first; node; node= node->next) {
2354                 if(node->exec & NODE_FREEBUFS) {
2355                         for(sock= node->outputs.first; sock; sock= sock->next) {
2356                                 bNodeStack *ns= ntree->stack + sock->stack_index;
2357                                 if(ns->data) {
2358                                         free_compbuf(ns->data);
2359                                         ns->data= NULL;
2360                                         // printf("freed buf node %s \n", node->name);
2361                                 }
2362                         }
2363                 }
2364         }
2365 }
2366
2367 static bNode *getExecutableNode(bNodeTree *ntree)
2368 {
2369         bNode *node;
2370         bNodeSocket *sock;
2371         
2372         for(node= ntree->nodes.first; node; node= node->next) {
2373                 if(node->exec==0) {
2374                         
2375                         /* input sockets should be ready */
2376                         for(sock= node->inputs.first; sock; sock= sock->next) {
2377                                 if(sock->link)
2378                                         if((sock->link->fromnode->exec & NODE_READY)==0)
2379                                                 break;
2380                         }
2381                         if(sock==NULL)
2382                                 return node;
2383                 }
2384         }
2385         return NULL;
2386 }
2387
2388
2389 /* optimized tree execute test for compositing */
2390 void ntreeCompositExecTree(bNodeTree *ntree, RenderData *rd, int do_preview)
2391 {
2392         bNode *node;
2393         ListBase threads;
2394         ThreadData thdata;
2395         int totnode, rendering= 1;
2396         
2397         if(ntree==NULL) return;
2398         
2399         if(do_preview)
2400                 ntreeInitPreview(ntree, 0, 0);
2401         
2402         ntreeBeginExecTree(ntree);
2403         
2404         /* prevent unlucky accidents */
2405         if(G.background)
2406                 rd->scemode &= ~R_COMP_CROP;
2407         
2408         /* setup callerdata for thread callback */
2409         thdata.rd= rd;
2410         thdata.stack= ntree->stack;
2411         
2412         /* fixed seed, for example noise texture */
2413         BLI_srandom(rd->cfra);
2414
2415         /* sets need_exec tags in nodes */
2416         totnode= setExecutableNodes(ntree, &thdata);
2417         
2418         BLI_init_threads(&threads, exec_composite_node, rd->threads);
2419         
2420         while(rendering) {
2421                 
2422                 if(BLI_available_threads(&threads)) {
2423                         node= getExecutableNode(ntree);
2424                         if(node) {
2425
2426                                 if(ntree->timecursor)
2427                                         ntree->timecursor(totnode);
2428                                 if(ntree->stats_draw) {
2429                                         char str[64];
2430                                         sprintf(str, "Compositing %d %s", totnode, node->name);
2431                                         ntree->stats_draw(str);
2432                                 }
2433                                 totnode--;
2434                                 
2435                                 node->new_node = (bNode *)&thdata;
2436                                 node->exec= NODE_PROCESSING;
2437                                 BLI_insert_thread(&threads, node);
2438                         }
2439                         else
2440                                 PIL_sleep_ms(50);
2441                 }
2442                 else
2443                         PIL_sleep_ms(50);
2444                 
2445                 rendering= 0;
2446                 /* test for ESC */
2447                 if(ntree->test_break && ntree->test_break()) {
2448                         for(node= ntree->nodes.first; node; node= node->next)
2449                                 node->exec |= NODE_READY;
2450                 }
2451                 
2452                 /* check for ready ones, and if we need to continue */
2453                 for(node= ntree->nodes.first; node; node= node->next) {
2454                         if(node->exec & NODE_READY) {
2455                                 if((node->exec & NODE_FINISHED)==0) {
2456                                         BLI_remove_thread(&threads, node); /* this waits for running thread to finish btw */
2457                                         node->exec |= NODE_FINISHED;
2458                                         
2459                                         /* freeing unused buffers */
2460                                         if(rd->scemode & R_COMP_FREE)
2461                                                 freeExecutableNode(ntree);
2462                                 }
2463                         }
2464                         else rendering= 1;
2465                 }
2466         }
2467         
2468         
2469         BLI_end_threads(&threads);
2470         
2471         ntreeEndExecTree(ntree);
2472 }
2473
2474 /* GPU material from shader nodes */
2475
2476 static void gpu_from_node_stack(ListBase *sockets, bNodeStack **ns, GPUNodeStack *gs)
2477 {
2478         bNodeSocket *sock;
2479         int i;
2480
2481         for (sock=sockets->first, i=0; sock; sock=sock->next, i++) {
2482                 memset(&gs[i], 0, sizeof(gs[i]));
2483
2484         QUATCOPY(gs[i].vec, ns[i]->vec);
2485                 gs[i].link= ns[i]->data;
2486
2487                 if (sock->type == SOCK_VALUE)
2488                         gs[i].type= GPU_FLOAT;
2489                 else if (sock->type == SOCK_VECTOR)
2490                         gs[i].type= GPU_VEC3;
2491                 else if (sock->type == SOCK_RGBA)
2492                         gs[i].type= GPU_VEC4;
2493                 else
2494                         gs[i].type= GPU_NONE;
2495
2496                 gs[i].name = "";
2497                 gs[i].hasinput= ns[i]->hasinput && ns[i]->data;
2498                 gs[i].hasoutput= ns[i]->hasinput && ns[i]->data;
2499                 gs[i].sockettype= ns[i]->sockettype;
2500         }
2501
2502         gs[i].type= GPU_NONE;
2503 }
2504
2505 static void data_from_gpu_stack(ListBase *sockets, bNodeStack **ns, GPUNodeStack *gs)
2506 {
2507         bNodeSocket *sock;
2508         int i;
2509
2510         for (sock=sockets->first, i=0; sock; sock=sock->next, i++) {
2511                 ns[i]->data= gs[i].link;
2512                 ns[i]->hasinput= gs[i].hasinput && gs[i].link;
2513                 ns[i]->hasoutput= gs[i].hasoutput;
2514                 ns[i]->sockettype= gs[i].sockettype;
2515         }
2516 }
2517
2518 static void gpu_node_group_execute(bNodeStack *stack, GPUMaterial *mat, bNode *gnode, bNodeStack **in, bNodeStack **out)
2519 {
2520         bNode *node;
2521         bNodeTree *ntree= (bNodeTree *)gnode->id;
2522         bNodeStack *nsin[MAX_SOCKET];   /* arbitrary... watch this */
2523         bNodeStack *nsout[MAX_SOCKET];  /* arbitrary... watch this */
2524         GPUNodeStack gpuin[MAX_SOCKET+1], gpuout[MAX_SOCKET+1];
2525         int doit = 0;
2526         
2527         if(ntree==NULL) return;
2528         
2529         stack+= gnode->stack_index;
2530                 
2531         for(node= ntree->nodes.first; node; node= node->next) {
2532                 if(node->typeinfo->gpufunc) {
2533                         group_node_get_stack(node, stack, nsin, nsout, in, out);
2534
2535                         doit = 0;
2536                         
2537                         /* for groups, only execute outputs for edited group */
2538                         if(node->typeinfo->nclass==NODE_CLASS_OUTPUT) {
2539                                 if(gnode->flag & NODE_GROUP_EDIT)
2540                                         if(node->flag & NODE_DO_OUTPUT)
2541                                                 doit = 1;
2542                         }
2543                         else
2544                                 doit = 1;
2545
2546                         if(doit)  {
2547                                 gpu_from_node_stack(&node->inputs, nsin, gpuin);
2548                                 gpu_from_node_stack(&node->outputs, nsout, gpuout);
2549                                 if(node->typeinfo->gpufunc(mat, node, gpuin, gpuout))
2550                                         data_from_gpu_stack(&node->outputs, nsout, gpuout);
2551                         }
2552                 }
2553         }
2554 }
2555
2556 void ntreeGPUMaterialNodes(bNodeTree *ntree, GPUMaterial *mat)
2557 {
2558         bNode *node;
2559         bNodeStack *stack;
2560         bNodeStack *nsin[MAX_SOCKET];   /* arbitrary... watch this */
2561         bNodeStack *nsout[MAX_SOCKET];  /* arbitrary... watch this */
2562         GPUNodeStack gpuin[MAX_SOCKET+1], gpuout[MAX_SOCKET+1];
2563
2564         if((ntree->init & NTREE_EXEC_INIT)==0)
2565                 ntreeBeginExecTree(ntree);
2566
2567         stack= ntree->stack;
2568
2569         for(node= ntree->nodes.first; node; node= node->next) {
2570                 if(node->typeinfo->gpufunc) {
2571                         node_get_stack(node, stack, nsin, nsout);
2572                         gpu_from_node_stack(&node->inputs, nsin, gpuin);
2573                         gpu_from_node_stack(&node->outputs, nsout, gpuout);
2574                         if(node->typeinfo->gpufunc(mat, node, gpuin, gpuout))
2575                                 data_from_gpu_stack(&node->outputs, nsout, gpuout);
2576                 }
2577         else if(node->type==NODE_GROUP && node->id) {
2578                         node_get_stack(node, stack, nsin, nsout);
2579                         gpu_node_group_execute(stack, mat, node, nsin, nsout);
2580                 }
2581         }
2582
2583         ntreeEndExecTree(ntree);
2584 }
2585
2586 /* **************** call to switch lamploop for material node ************ */
2587
2588 void (*node_shader_lamp_loop)(struct ShadeInput *, struct ShadeResult *);
2589
2590 void set_node_shader_lamp_loop(void (*lamp_loop_func)(ShadeInput *, ShadeResult *))
2591 {
2592         node_shader_lamp_loop= lamp_loop_func;
2593 }
2594
2595 /* clumsy checking... should do dynamic outputs once */
2596 static void force_hidden_passes(bNode *node, int passflag)
2597 {
2598         bNodeSocket *sock;
2599         
2600         for(sock= node->outputs.first; sock; sock= sock->next)
2601                 sock->flag &= ~SOCK_UNAVAIL;
2602         
2603         sock= BLI_findlink(&node->outputs, RRES_OUT_Z);
2604         if(!(passflag & SCE_PASS_Z)) sock->flag |= SOCK_UNAVAIL;
2605         sock= BLI_findlink(&node->outputs, RRES_OUT_NORMAL);
2606         if(!(passflag & SCE_PASS_NORMAL)) sock->flag |= SOCK_UNAVAIL;
2607         sock= BLI_findlink(&node->outputs, RRES_OUT_VEC);
2608         if(!(passflag & SCE_PASS_VECTOR)) sock->flag |= SOCK_UNAVAIL;
2609         sock= BLI_findlink(&node->outputs, RRES_OUT_UV);
2610         if(!(passflag & SCE_PASS_UV)) sock->flag |= SOCK_UNAVAIL;
2611         sock= BLI_findlink(&node->outputs, RRES_OUT_RGBA);
2612         if(!(passflag & SCE_PASS_RGBA)) sock->flag |= SOCK_UNAVAIL;
2613         sock= BLI_findlink(&node->outputs, RRES_OUT_DIFF);
2614         if(!(passflag & SCE_PASS_DIFFUSE)) sock->flag |= SOCK_UNAVAIL;
2615         sock= BLI_findlink(&node->outputs, RRES_OUT_SPEC);
2616         if(!(passflag & SCE_PASS_SPEC)) sock->flag |= SOCK_UNAVAIL;
2617         sock= BLI_findlink(&node->outputs, RRES_OUT_SHADOW);
2618         if(!(passflag & SCE_PASS_SHADOW)) sock->flag |= SOCK_UNAVAIL;
2619         sock= BLI_findlink(&node->outputs, RRES_OUT_AO);
2620         if(!(passflag & SCE_PASS_AO)) sock->flag |= SOCK_UNAVAIL;
2621         sock= BLI_findlink(&node->outputs, RRES_OUT_REFLECT);
2622         if(!(passflag & SCE_PASS_REFLECT)) sock->flag |= SOCK_UNAVAIL;
2623         sock= BLI_findlink(&node->outputs, RRES_OUT_REFRACT);
2624         if(!(passflag & SCE_PASS_REFRACT)) sock->flag |= SOCK_UNAVAIL;
2625         sock= BLI_findlink(&node->outputs, RRES_OUT_RADIO);
2626         if(!(passflag & SCE_PASS_RADIO)) sock->flag |= SOCK_UNAVAIL;
2627         sock= BLI_findlink(&node->outputs, RRES_OUT_INDEXOB);
2628         if(!(passflag & SCE_PASS_INDEXOB)) sock->flag |= SOCK_UNAVAIL;
2629         sock= BLI_findlink(&node->outputs, RRES_OUT_MIST);
2630         if(!(passflag & SCE_PASS_MIST)) sock->flag |= SOCK_UNAVAIL;
2631         
2632 }
2633
2634 /* based on rules, force sockets hidden always */
2635 void ntreeCompositForceHidden(bNodeTree *ntree)
2636 {
2637         bNode *node;
2638         
2639         if(ntree==NULL) return;
2640         
2641         for(node= ntree->nodes.first; node; node= node->next) {
2642                 if( node->type==CMP_NODE_R_LAYERS) {
2643                         Scene *sce= node->id?(Scene *)node->id:G.scene; /* G.scene is WEAK! */
2644                         SceneRenderLayer *srl= BLI_findlink(&sce->r.layers, node->custom1);
2645                         if(srl)
2646                                 force_hidden_passes(node, srl->passflag);
2647                 }
2648                 else if( node->type==CMP_NODE_IMAGE) {
2649                         Image *ima= (Image *)node->id;
2650                         if(ima) {
2651                                 if(ima->rr) {
2652                                         ImageUser *iuser= node->storage;
2653                                         RenderLayer *rl= BLI_findlink(&ima->rr->layers, iuser->layer);
2654                                         if(rl)
2655                                                 force_hidden_passes(node, rl->passflag);
2656                                         else
2657                                                 force_hidden_passes(node, 0);
2658                                 }
2659                                 else if(ima->type!=IMA_TYPE_MULTILAYER) {       /* if ->rr not yet read we keep inputs */
2660                                         force_hidden_passes(node, RRES_OUT_Z);
2661                                 }
2662                                 else
2663                                         force_hidden_passes(node, 0);
2664                         }
2665                         else
2666                                 force_hidden_passes(node, 0);
2667                 }
2668         }
2669
2670 }
2671
2672 /* called from render pipeline, to tag render input and output */
2673 /* need to do all scenes, to prevent errors when you re-render 1 scene */
2674 void ntreeCompositTagRender(Scene *curscene)
2675 {
2676         Scene *sce;
2677         
2678         for(sce= G.main->scene.first; sce; sce= sce->id.next) {
2679                 if(sce->nodetree) {
2680                         bNode *node;
2681                         
2682                         for(node= sce->nodetree->nodes.first; node; node= node->next) {
2683                                 if(node->id==(ID *)curscene || node->type==CMP_NODE_COMPOSITE)
2684                                         NodeTagChanged(sce->nodetree, node);
2685                         }
2686                 }
2687         }
2688 }
2689
2690 /* tags nodes that have animation capabilities */
2691 int ntreeCompositTagAnimated(bNodeTree *ntree)
2692 {
2693         bNode *node;
2694         int tagged= 0;
2695         
2696         if(ntree==NULL) return 0;
2697         
2698         for(node= ntree->nodes.first; node; node= node->next) {
2699                 if(node->type==CMP_NODE_IMAGE) {
2700                         Image *ima= (Image *)node->id;
2701                         if(ima && ELEM(ima->source, IMA_SRC_MOVIE, IMA_SRC_SEQUENCE)) {
2702                                 NodeTagChanged(ntree, node);
2703                                 tagged= 1;
2704                         }
2705                 }
2706                 else if(node->type==CMP_NODE_TIME) {
2707                         NodeTagChanged(ntree, node);
2708                         tagged= 1;
2709                 }
2710                 else if(node->type==CMP_NODE_R_LAYERS) {
2711                         NodeTagChanged(ntree, node);
2712                         tagged= 1;
2713                 }
2714                 else if(node->type==NODE_GROUP) {
2715                         if( ntreeCompositTagAnimated((bNodeTree *)node->id) ) {
2716                                 NodeTagChanged(ntree, node);
2717                         }
2718                 }
2719         }
2720         
2721         return tagged;
2722 }
2723
2724
2725 /* called from image window preview */
2726 void ntreeCompositTagGenerators(bNodeTree *ntree)
2727 {
2728         bNode *node;
2729         
2730         if(ntree==NULL) return;
2731         
2732         for(node= ntree->nodes.first; node; node= node->next) {
2733                 if( ELEM(node->type, CMP_NODE_R_LAYERS, CMP_NODE_IMAGE))
2734                         NodeTagChanged(ntree, node);
2735         }
2736 }
2737
2738 int ntreeTexTagAnimated(bNodeTree *ntree)
2739 {
2740         bNode *node;
2741         
2742         if(ntree==NULL) return 0;
2743         
2744         for(node= ntree->nodes.first; node; node= node->next) {
2745                 if(node->type==TEX_NODE_CURVE_TIME) {
2746                         NodeTagChanged(ntree, node);
2747                         return 1;
2748                 }
2749                 else if(node->type==NODE_GROUP) {
2750                         if( ntreeTexTagAnimated((bNodeTree *)node->id) ) {
2751                                 return 1;
2752                         }
2753                 }
2754         }
2755         
2756         return 0;
2757 }
2758
2759 /* ************* node definition init ********** */
2760
2761 static bNodeType *is_nodetype_registered(ListBase *typelist, int type, ID *id) 
2762 {
2763         bNodeType *ntype= typelist->first;
2764         
2765         for(;ntype; ntype= ntype->next )
2766                 if(ntype->type==type && ntype->id==id)
2767                         return ntype;
2768         
2769         return NULL;
2770 }
2771
2772 /* type can be from a static array, we make copy for duplicate types (like group) */
2773 void nodeRegisterType(ListBase *typelist, const bNodeType *ntype) 
2774 {
2775         bNodeType *found= is_nodetype_registered(typelist, ntype->type, ntype->id);
2776         
2777         if(found==NULL) {
2778                 bNodeType *ntypen= MEM_callocN(sizeof(bNodeType), "node type");
2779                 *ntypen= *ntype;
2780                 BLI_addtail(typelist, ntypen);
2781         }
2782 }
2783
2784 static void registerCompositNodes(ListBase *ntypelist)
2785 {
2786         nodeRegisterType(ntypelist, &node_group_typeinfo);
2787         nodeRegisterType(ntypelist, &cmp_node_rlayers);
2788         nodeRegisterType(ntypelist, &cmp_node_image);
2789         nodeRegisterType(ntypelist, &cmp_node_texture);
2790         nodeRegisterType(ntypelist, &cmp_node_value);
2791         nodeRegisterType(ntypelist, &cmp_node_rgb);
2792         nodeRegisterType(ntypelist, &cmp_node_curve_time);
2793         
2794         nodeRegisterType(ntypelist, &cmp_node_composite);
2795         nodeRegisterType(ntypelist, &cmp_node_viewer);
2796         nodeRegisterType(ntypelist, &cmp_node_splitviewer);
2797         nodeRegisterType(ntypelist, &cmp_node_output_file);
2798         
2799         nodeRegisterType(ntypelist, &cmp_node_curve_rgb);
2800         nodeRegisterType(ntypelist, &cmp_node_mix_rgb);
2801         nodeRegisterType(ntypelist, &cmp_node_hue_sat);
2802         nodeRegisterType(ntypelist, &cmp_node_brightcontrast);
2803         nodeRegisterType(ntypelist, &cmp_node_gamma);
2804         nodeRegisterType(ntypelist, &cmp_node_invert);
2805         nodeRegisterType(ntypelist, &cmp_node_alphaover);
2806         nodeRegisterType(ntypelist, &cmp_node_zcombine);
2807         
2808         nodeRegisterType(ntypelist, &cmp_node_normal);
2809         nodeRegisterType(ntypelist, &cmp_node_curve_vec);
2810         nodeRegisterType(ntypelist, &cmp_node_map_value);
2811         nodeRegisterType(ntypelist, &cmp_node_normalize);
2812         
2813         nodeRegisterType(ntypelist, &cmp_node_filter);
2814         nodeRegisterType(ntypelist, &cmp_node_blur);
2815         nodeRegisterType(ntypelist, &cmp_node_dblur);
2816         nodeRegisterType(ntypelist, &cmp_node_bilateralblur);
2817         nodeRegisterType(ntypelist, &cmp_node_vecblur);
2818         nodeRegisterType(ntypelist, &cmp_node_dilateerode);
2819         nodeRegisterType(ntypelist, &cmp_node_defocus);
2820         
2821         nodeRegisterType(ntypelist, &cmp_node_valtorgb);
2822         nodeRegisterType(ntypelist, &cmp_node_rgbtobw);
2823         nodeRegisterType(ntypelist, &cmp_node_setalpha);
2824         nodeRegisterType(ntypelist, &cmp_node_idmask);
2825         nodeRegisterType(ntypelist, &cmp_node_math);
2826         nodeRegisterType(ntypelist, &cmp_node_seprgba);
2827         nodeRegisterType(ntypelist, &cmp_node_combrgba);
2828         nodeRegisterType(ntypelist, &cmp_node_sephsva);
2829         nodeRegisterType(ntypelist, &cmp_node_combhsva);
2830         nodeRegisterType(ntypelist, &cmp_node_sepyuva);
2831         nodeRegisterType(ntypelist, &cmp_node_combyuva);
2832         nodeRegisterType(ntypelist, &cmp_node_sepycca);
2833         nodeRegisterType(ntypelist, &cmp_node_combycca);
2834         nodeRegisterType(ntypelist, &cmp_node_premulkey);
2835         
2836         nodeRegisterType(ntypelist, &cmp_node_diff_matte);
2837         nodeRegisterType(ntypelist, &cmp_node_chroma);
2838         nodeRegisterType(ntypelist, &cmp_node_channel_matte);
2839         nodeRegisterType(ntypelist, &cmp_node_color_spill);
2840         nodeRegisterType(ntypelist, &cmp_node_luma_matte);
2841         
2842         nodeRegisterType(ntypelist, &cmp_node_translate);
2843         nodeRegisterType(ntypelist, &cmp_node_rotate);
2844         nodeRegisterType(ntypelist, &cmp_node_scale);
2845         nodeRegisterType(ntypelist, &cmp_node_flip);
2846         nodeRegisterType(ntypelist, &cmp_node_crop);
2847         nodeRegisterType(ntypelist, &cmp_node_displace);
2848         nodeRegisterType(ntypelist, &cmp_node_mapuv);
2849         nodeRegisterType(ntypelist, &cmp_node_glare);
2850         nodeRegisterType(ntypelist, &cmp_node_tonemap);
2851         nodeRegisterType(ntypelist, &cmp_node_lensdist);
2852 }
2853
2854 static void registerShaderNodes(ListBase *ntypelist) 
2855 {
2856         nodeRegisterType(ntypelist, &node_group_typeinfo);
2857         nodeRegisterType(ntypelist, &sh_node_output);
2858         nodeRegisterType(ntypelist, &sh_node_mix_rgb);
2859         nodeRegisterType(ntypelist, &sh_node_valtorgb);
2860         nodeRegisterType(ntypelist, &sh_node_rgbtobw);
2861         nodeRegisterType(ntypelist, &sh_node_normal);
2862         nodeRegisterType(ntypelist, &sh_node_geom);
2863         nodeRegisterType(ntypelist, &sh_node_mapping);
2864         nodeRegisterType(ntypelist, &sh_node_curve_vec);
2865         nodeRegisterType(ntypelist, &sh_node_curve_rgb);
2866         nodeRegisterType(ntypelist, &sh_node_math);
2867         nodeRegisterType(ntypelist, &sh_node_vect_math);
2868         nodeRegisterType(ntypelist, &sh_node_squeeze);
2869         nodeRegisterType(ntypelist, &sh_node_camera);
2870         nodeRegisterType(ntypelist, &sh_node_material);
2871         nodeRegisterType(ntypelist, &sh_node_material_ext);
2872         nodeRegisterType(ntypelist, &sh_node_value);
2873         nodeRegisterType(ntypelist, &sh_node_rgb);
2874         nodeRegisterType(ntypelist, &sh_node_texture);
2875         nodeRegisterType(ntypelist, &node_dynamic_typeinfo);
2876         nodeRegisterType(ntypelist, &sh_node_invert);
2877         nodeRegisterType(ntypelist, &sh_node_seprgb);
2878         nodeRegisterType(ntypelist, &sh_node_combrgb);
2879         nodeRegisterType(ntypelist, &sh_node_hue_sat);
2880 }
2881
2882 static void registerTextureNodes(ListBase *ntypelist)
2883 {
2884         nodeRegisterType(ntypelist, &node_group_typeinfo);
2885         nodeRegisterType(ntypelist, &tex_node_math);
2886         nodeRegisterType(ntypelist, &tex_node_mix_rgb);
2887         nodeRegisterType(ntypelist, &tex_node_valtorgb);
2888         nodeRegisterType(ntypelist, &tex_node_rgbtobw);
2889         nodeRegisterType(ntypelist, &tex_node_valtonor);
2890         nodeRegisterType(ntypelist, &tex_node_curve_rgb);
2891         nodeRegisterType(ntypelist, &tex_node_curve_time);
2892         nodeRegisterType(ntypelist, &tex_node_invert);
2893         nodeRegisterType(ntypelist, &tex_node_hue_sat);
2894         nodeRegisterType(ntypelist, &tex_node_coord);
2895         nodeRegisterType(ntypelist, &tex_node_distance);
2896         nodeRegisterType(ntypelist, &tex_node_compose);
2897         nodeRegisterType(ntypelist, &tex_node_decompose);
2898         
2899         nodeRegisterType(ntypelist, &tex_node_output);
2900         nodeRegisterType(ntypelist, &tex_node_viewer);
2901         
2902         nodeRegisterType(ntypelist, &tex_node_checker);
2903         nodeRegisterType(ntypelist, &tex_node_texture);
2904         nodeRegisterType(ntypelist, &tex_node_bricks);
2905         nodeRegisterType(ntypelist, &tex_node_image);
2906         
2907         nodeRegisterType(ntypelist, &tex_node_rotate);
2908         nodeRegisterType(ntypelist, &tex_node_translate);
2909         nodeRegisterType(ntypelist, &tex_node_scale);
2910         
2911         nodeRegisterType(ntypelist, &tex_node_proc_voronoi);
2912         nodeRegisterType(ntypelist, &tex_node_proc_blend);
2913         nodeRegisterType(ntypelist, &tex_node_proc_magic);
2914         nodeRegisterType(ntypelist, &tex_node_proc_marble);
2915         nodeRegisterType(ntypelist, &tex_node_proc_clouds);
2916         nodeRegisterType(ntypelist, &tex_node_proc_wood);
2917         nodeRegisterType(ntypelist, &tex_node_proc_musgrave);
2918         nodeRegisterType(ntypelist, &tex_node_proc_noise);
2919         nodeRegisterType(ntypelist, &tex_node_proc_stucci);
2920         nodeRegisterType(ntypelist, &tex_node_proc_distnoise);
2921 }
2922
2923 static void remove_dynamic_typeinfos(ListBase *list)
2924 {
2925         bNodeType *ntype= list->first;
2926         bNodeType *next= NULL;
2927         while(ntype) {
2928                 next= ntype->next;
2929                 if(ntype->type==NODE_DYNAMIC && ntype->id!=NULL) {
2930                         BLI_remlink(list, ntype);
2931                         if(ntype->inputs) {
2932                                 bNodeSocketType *sock= ntype->inputs;
2933                                 while(sock->type!=-1) {
2934                                         MEM_freeN(sock->name);
2935                                         sock++;
2936                                 }
2937                                 MEM_freeN(ntype->inputs);
2938                         }
2939                         if(ntype->outputs) {
2940                                 bNodeSocketType *sock= ntype->outputs;
2941                                 while(sock->type!=-1) {
2942                                         MEM_freeN(sock->name);
2943                                         sock++;
2944                                 }
2945                                 MEM_freeN(ntype->outputs);
2946                         }
2947                         if(ntype->name) {
2948                                 MEM_freeN(ntype->name);
2949                         }
2950                         MEM_freeN(ntype);
2951                 }
2952                 ntype= next;
2953         }
2954 }
2955
2956 void init_nodesystem(void) 
2957 {
2958         registerCompositNodes(&node_all_composit);
2959         registerShaderNodes(&node_all_shaders);
2960         registerTextureNodes(&node_all_textures);
2961 }
2962
2963 void free_nodesystem(void) 
2964 {
2965         /*remove_dynamic_typeinfos(&node_all_composit);*/ /* unused for now */
2966         BLI_freelistN(&node_all_composit);
2967         remove_dynamic_typeinfos(&node_all_shaders);
2968         BLI_freelistN(&node_all_shaders);
2969         BLI_freelistN(&node_all_textures);
2970 }