1 files changed, 31 insertions, 31 deletions

diff --git a/source/blender/nodes/intern/node_exec.c b/source/blender/nodes/intern/node_exec.c
index 5b97685fc54..3708a7663ed 100644
--- a/source/blender/nodes/intern/node_exec.c
+++ b/source/blender/nodes/intern/node_exec.c
@@ -61,14 +61,14 @@ bNodeStack *node_get_socket_stack(bNodeStack *stack, bNodeSocket *sock)
 void node_get_stack(bNode *node, bNodeStack *stack, bNodeStack **in, bNodeStack **out)
 {
 	bNodeSocket *sock;
-	
+
 	/* build pointer stack */
 	if (in) {
 		for (sock = node->inputs.first; sock; sock = sock->next) {
 			*(in++) = node_get_socket_stack(stack, sock);
 		}
 	}
-	
+
 	if (out) {
 		for (sock = node->outputs.first; sock; sock = sock->next) {
 			*(out++) = node_get_socket_stack(stack, sock);
@@ -127,13 +127,13 @@ static struct bNodeStack *setup_stack(bNodeStack *stack, bNodeTree *ntree, bNode
 	bNodeStack *ns = node_get_socket_stack(stack, sock);
 	if (!ns)
 		return NULL;
-	
+
 	/* don't mess with remote socket stacks, these are initialized by other nodes! */
 	if (sock->link)
 		return ns;
-	
+
 	ns->sockettype = sock->type;
-	
+
 	switch (sock->type) {
 		case SOCK_FLOAT:
 			ns->vec[0] = node_socket_get_float(ntree, node, sock);
@@ -145,7 +145,7 @@ static struct bNodeStack *setup_stack(bNodeStack *stack, bNodeTree *ntree, bNode
 			node_socket_get_color(ntree, node, sock, ns->vec);
 			break;
 	}
-	
+
 	return ns;
 }
 
@@ -161,29 +161,29 @@ bNodeTreeExec *ntree_exec_begin(bNodeExecContext *context, bNodeTree *ntree, bNo
 	bNode **nodelist;
 	int totnodes, n;
 	/* XXX texnodes have threading issues with muting, have to disable it there ... */
-	
+
 	/* ensure all sock->link pointers and node levels are correct */
 	ntreeUpdateTree(G.main, ntree);
-	
+
 	/* get a dependency-sorted list of nodes */
 	ntreeGetDependencyList(ntree, &nodelist, &totnodes);
-	
+
 	/* XXX could let callbacks do this for specialized data */
 	exec = MEM_callocN(sizeof(bNodeTreeExec), "node tree execution data");
 	/* backpointer to node tree */
 	exec->nodetree = ntree;
-	
+
 	/* set stack indices */
 	index = 0;
 	for (n = 0; n < totnodes; ++n) {
 		node = nodelist[n];
-		
+
 		node->stack_index = index;
-		
+
 		/* init node socket stack indexes */
 		for (sock = node->inputs.first; sock; sock = sock->next)
 			node_init_input_index(sock, &index);
-		
+
 		if (node->flag & NODE_MUTED || node->type == NODE_REROUTE) {
 			for (sock = node->outputs.first; sock; sock = sock->next)
 				node_init_output_index(sock, &index, &node->internal_links);
@@ -193,48 +193,48 @@ bNodeTreeExec *ntree_exec_begin(bNodeExecContext *context, bNodeTree *ntree, bNo
 				node_init_output_index(sock, &index, NULL);
 		}
 	}
-	
+
 	/* allocated exec data pointers for nodes */
 	exec->totnodes = totnodes;
 	exec->nodeexec = MEM_callocN(exec->totnodes * sizeof(bNodeExec), "node execution data");
 	/* allocate data pointer for node stack */
 	exec->stacksize = index;
 	exec->stack = MEM_callocN(exec->stacksize * sizeof(bNodeStack), "bNodeStack");
-	
+
 	/* all non-const results are considered inputs */
 	for (n = 0; n < exec->stacksize; ++n)
 		exec->stack[n].hasinput = 1;
-	
+
 	/* prepare all nodes for execution */
 	for (n = 0, nodeexec = exec->nodeexec; n < totnodes; ++n, ++nodeexec) {
 		node = nodeexec->node = nodelist[n];
 		nodeexec->freeexecfunc = node->typeinfo->freeexecfunc;
-		
+
 		/* tag inputs */
 		for (sock = node->inputs.first; sock; sock = sock->next) {
 			/* disable the node if an input link is invalid */
 			if (sock->link && !(sock->link->flag & NODE_LINK_VALID))
 				node->need_exec = 0;
-			
+
 			ns = setup_stack(exec->stack, ntree, node, sock);
 			if (ns)
 				ns->hasoutput = 1;
 		}
-		
+
 		/* tag all outputs */
 		for (sock = node->outputs.first; sock; sock = sock->next) {
 			/* ns = */ setup_stack(exec->stack, ntree, node, sock);
 		}
-		
+
 		nodekey = BKE_node_instance_key(parent_key, ntree, node);
 		nodeexec->data.preview = context->previews ? BKE_node_instance_hash_lookup(context->previews, nodekey) : NULL;
 		if (node->typeinfo->initexecfunc)
 			nodeexec->data.data = node->typeinfo->initexecfunc(context, node, nodekey);
 	}
-	
+
 	if (nodelist)
 		MEM_freeN(nodelist);
-	
+
 	return exec;
 }
 
@@ -242,18 +242,18 @@ void ntree_exec_end(bNodeTreeExec *exec)
 {
 	bNodeExec *nodeexec;
 	int n;
-	
+
 	if (exec->stack)
 		MEM_freeN(exec->stack);
-	
+
 	for (n = 0, nodeexec = exec->nodeexec; n < exec->totnodes; ++n, ++nodeexec) {
 		if (nodeexec->freeexecfunc)
 			nodeexec->freeexecfunc(nodeexec->data.data);
 	}
-	
+
 	if (exec->nodeexec)
 		MEM_freeN(exec->nodeexec);
-	
+
 	MEM_freeN(exec);
 }
 
@@ -263,14 +263,14 @@ bNodeThreadStack *ntreeGetThreadStack(bNodeTreeExec *exec, int thread)
 {
 	ListBase *lb = &exec->threadstack[thread];
 	bNodeThreadStack *nts;
-	
+
 	for (nts = lb->first; nts; nts = nts->next) {
 		if (!nts->used) {
 			nts->used = true;
 			break;
 		}
 	}
-	
+
 	if (!nts) {
 		nts = MEM_callocN(sizeof(bNodeThreadStack), "bNodeThreadStack");
 		nts->stack = MEM_dupallocN(exec->stack);
@@ -293,9 +293,9 @@ bool ntreeExecThreadNodes(bNodeTreeExec *exec, bNodeThreadStack *nts, void *call
 	bNodeExec *nodeexec;
 	bNode *node;
 	int n;
-	
+
 	/* nodes are presorted, so exec is in order of list */
-	
+
 	for (n = 0, nodeexec = exec->nodeexec; n < exec->totnodes; ++n, ++nodeexec) {
 		node = nodeexec->node;
 		if (node->need_exec) {
@@ -308,7 +308,7 @@ bool ntreeExecThreadNodes(bNodeTreeExec *exec, bNodeThreadStack *nts, void *call
 				node->typeinfo->execfunc(callerdata, thread, node, &nodeexec->data, nsin, nsout);
 		}
 	}
-	
+
 	/* signal to that all went OK, for render */
 	return true;
 }