ClangFormat: apply to source, most of intern

Apply clang format as proposed in T53211.

For details on usage and instructions for migrating branches
without conflicts, see:

https://wiki.blender.org/wiki/Tools/ClangFormat

1 files changed, 141 insertions, 145 deletions

diff --git a/source/blender/depsgraph/intern/depsgraph_query_foreach.cc b/source/blender/depsgraph/intern/depsgraph_query_foreach.cc
index a2ca4be5e33..717793d60f1 100644
--- a/source/blender/depsgraph/intern/depsgraph_query_foreach.cc
+++ b/source/blender/depsgraph/intern/depsgraph_query_foreach.cc
@@ -51,17 +51,17 @@ namespace DEG {
 
 typedef std::deque<OperationNode *> TraversalQueue;
 enum {
-	DEG_NODE_VISITED = (1 << 0),
+  DEG_NODE_VISITED = (1 << 0),
 };
 
 static void deg_foreach_clear_flags(const Depsgraph *graph)
 {
-	for (OperationNode *op_node : graph->operations) {
-		op_node->scheduled = false;
-	}
-	for (IDNode *id_node : graph->id_nodes) {
-		id_node->custom_flags = 0;
-	}
+  for (OperationNode *op_node : graph->operations) {
+    op_node->scheduled = false;
+  }
+  for (IDNode *id_node : graph->id_nodes) {
+    id_node->custom_flags = 0;
+  }
 }
 
 static void deg_foreach_dependent_ID(const Depsgraph *graph,
@@ -69,165 +69,161 @@ static void deg_foreach_dependent_ID(const Depsgraph *graph,
                                      DEGForeachIDCallback callback,
                                      void *user_data)
 {
-	/* Start with getting ID node from the graph. */
-	IDNode *target_id_node = graph->find_id_node(id);
-	if (target_id_node == NULL) {
-		/* TODO(sergey): Shall we inform or assert here about attempt to start
-		 * iterating over non-existing ID? */
-		return;
-	}
-	/* Make sure all runtime flags are ready and clear. */
-	deg_foreach_clear_flags(graph);
-	/* Start with scheduling all operations from ID node. */
-	TraversalQueue queue;
-	GHASH_FOREACH_BEGIN(ComponentNode *, comp_node, target_id_node->components)
-	{
-		for (OperationNode *op_node : comp_node->operations) {
-			queue.push_back(op_node);
-			op_node->scheduled = true;
-		}
-	}
-	GHASH_FOREACH_END();
-	target_id_node->custom_flags |= DEG_NODE_VISITED;
-	/* Process the queue. */
-	while (!queue.empty()) {
-		/* get next operation node to process. */
-		OperationNode *op_node = queue.front();
-		queue.pop_front();
-		for (;;) {
-			/* Check whether we need to inform callee about corresponding ID node. */
-			ComponentNode *comp_node = op_node->owner;
-			IDNode *id_node = comp_node->owner;
-			if ((id_node->custom_flags & DEG_NODE_VISITED) == 0) {
-				/* TODO(sergey): Is it orig or CoW? */
-				callback(id_node->id_orig, user_data);
-				id_node->custom_flags |= DEG_NODE_VISITED;
-			}
-			/* Schedule outgoing operation nodes. */
-			if (op_node->outlinks.size() == 1) {
-				OperationNode *to_node = (OperationNode *)op_node->outlinks[0]->to;
-				if (to_node->scheduled == false) {
-					to_node->scheduled = true;
-					op_node = to_node;
-				}
-				else {
-					break;
-				}
-			}
-			else {
-				for (Relation *rel : op_node->outlinks) {
-					OperationNode *to_node = (OperationNode *)rel->to;
-					if (to_node->scheduled == false) {
-						queue.push_front(to_node);
-						to_node->scheduled = true;
-					}
-				}
-				break;
-			}
-		}
-	}
+  /* Start with getting ID node from the graph. */
+  IDNode *target_id_node = graph->find_id_node(id);
+  if (target_id_node == NULL) {
+    /* TODO(sergey): Shall we inform or assert here about attempt to start
+     * iterating over non-existing ID? */
+    return;
+  }
+  /* Make sure all runtime flags are ready and clear. */
+  deg_foreach_clear_flags(graph);
+  /* Start with scheduling all operations from ID node. */
+  TraversalQueue queue;
+  GHASH_FOREACH_BEGIN (ComponentNode *, comp_node, target_id_node->components) {
+    for (OperationNode *op_node : comp_node->operations) {
+      queue.push_back(op_node);
+      op_node->scheduled = true;
+    }
+  }
+  GHASH_FOREACH_END();
+  target_id_node->custom_flags |= DEG_NODE_VISITED;
+  /* Process the queue. */
+  while (!queue.empty()) {
+    /* get next operation node to process. */
+    OperationNode *op_node = queue.front();
+    queue.pop_front();
+    for (;;) {
+      /* Check whether we need to inform callee about corresponding ID node. */
+      ComponentNode *comp_node = op_node->owner;
+      IDNode *id_node = comp_node->owner;
+      if ((id_node->custom_flags & DEG_NODE_VISITED) == 0) {
+        /* TODO(sergey): Is it orig or CoW? */
+        callback(id_node->id_orig, user_data);
+        id_node->custom_flags |= DEG_NODE_VISITED;
+      }
+      /* Schedule outgoing operation nodes. */
+      if (op_node->outlinks.size() == 1) {
+        OperationNode *to_node = (OperationNode *)op_node->outlinks[0]->to;
+        if (to_node->scheduled == false) {
+          to_node->scheduled = true;
+          op_node = to_node;
+        }
+        else {
+          break;
+        }
+      }
+      else {
+        for (Relation *rel : op_node->outlinks) {
+          OperationNode *to_node = (OperationNode *)rel->to;
+          if (to_node->scheduled == false) {
+            queue.push_front(to_node);
+            to_node->scheduled = true;
+          }
+        }
+        break;
+      }
+    }
+  }
 }
 
 static void deg_foreach_ancestor_ID(const Depsgraph *graph,
-                                     const ID *id,
-                                     DEGForeachIDCallback callback,
-                                     void *user_data)
+                                    const ID *id,
+                                    DEGForeachIDCallback callback,
+                                    void *user_data)
 {
-	/* Start with getting ID node from the graph. */
-	IDNode *target_id_node = graph->find_id_node(id);
-	if (target_id_node == NULL) {
-		/* TODO(sergey): Shall we inform or assert here about attempt to start
-		 * iterating over non-existing ID? */
-		return;
-	}
-	/* Make sure all runtime flags are ready and clear. */
-	deg_foreach_clear_flags(graph);
-	/* Start with scheduling all operations from ID node. */
-	TraversalQueue queue;
-	GHASH_FOREACH_BEGIN(ComponentNode *, comp_node, target_id_node->components)
-	{
-		for (OperationNode *op_node : comp_node->operations) {
-			queue.push_back(op_node);
-			op_node->scheduled = true;
-		}
-	}
-	GHASH_FOREACH_END();
-	target_id_node->custom_flags |= DEG_NODE_VISITED;
-	/* Process the queue. */
-	while (!queue.empty()) {
-		/* get next operation node to process. */
-		OperationNode *op_node = queue.front();
-		queue.pop_front();
-		for (;;) {
-			/* Check whether we need to inform callee about corresponding ID node. */
-			ComponentNode *comp_node = op_node->owner;
-			IDNode *id_node = comp_node->owner;
-			if ((id_node->custom_flags & DEG_NODE_VISITED) == 0) {
-				/* TODO(sergey): Is it orig or CoW? */
-				callback(id_node->id_orig, user_data);
-				id_node->custom_flags |= DEG_NODE_VISITED;
-			}
-			/* Schedule incoming operation nodes. */
-			if (op_node->inlinks.size() == 1) {
-				Node *from = op_node->inlinks[0]->from;
-				if (from->get_class() == NodeClass::OPERATION) {
-					OperationNode *from_node = (OperationNode *)from;
-					if (from_node->scheduled == false) {
-						from_node->scheduled = true;
-						op_node = from_node;
-					}
-					else {
-						break;
-					}
-				}
-			}
-			else {
-				for (Relation *rel : op_node->inlinks) {
-					Node *from = rel->from;
-					if (from->get_class() == NodeClass::OPERATION) {
-						OperationNode *from_node = (OperationNode *)from;
-						if (from_node->scheduled == false) {
-							queue.push_front(from_node);
-							from_node->scheduled = true;
-						}
-					}
-				}
-				break;
-			}
-		}
-	}
+  /* Start with getting ID node from the graph. */
+  IDNode *target_id_node = graph->find_id_node(id);
+  if (target_id_node == NULL) {
+    /* TODO(sergey): Shall we inform or assert here about attempt to start
+     * iterating over non-existing ID? */
+    return;
+  }
+  /* Make sure all runtime flags are ready and clear. */
+  deg_foreach_clear_flags(graph);
+  /* Start with scheduling all operations from ID node. */
+  TraversalQueue queue;
+  GHASH_FOREACH_BEGIN (ComponentNode *, comp_node, target_id_node->components) {
+    for (OperationNode *op_node : comp_node->operations) {
+      queue.push_back(op_node);
+      op_node->scheduled = true;
+    }
+  }
+  GHASH_FOREACH_END();
+  target_id_node->custom_flags |= DEG_NODE_VISITED;
+  /* Process the queue. */
+  while (!queue.empty()) {
+    /* get next operation node to process. */
+    OperationNode *op_node = queue.front();
+    queue.pop_front();
+    for (;;) {
+      /* Check whether we need to inform callee about corresponding ID node. */
+      ComponentNode *comp_node = op_node->owner;
+      IDNode *id_node = comp_node->owner;
+      if ((id_node->custom_flags & DEG_NODE_VISITED) == 0) {
+        /* TODO(sergey): Is it orig or CoW? */
+        callback(id_node->id_orig, user_data);
+        id_node->custom_flags |= DEG_NODE_VISITED;
+      }
+      /* Schedule incoming operation nodes. */
+      if (op_node->inlinks.size() == 1) {
+        Node *from = op_node->inlinks[0]->from;
+        if (from->get_class() == NodeClass::OPERATION) {
+          OperationNode *from_node = (OperationNode *)from;
+          if (from_node->scheduled == false) {
+            from_node->scheduled = true;
+            op_node = from_node;
+          }
+          else {
+            break;
+          }
+        }
+      }
+      else {
+        for (Relation *rel : op_node->inlinks) {
+          Node *from = rel->from;
+          if (from->get_class() == NodeClass::OPERATION) {
+            OperationNode *from_node = (OperationNode *)from;
+            if (from_node->scheduled == false) {
+              queue.push_front(from_node);
+              from_node->scheduled = true;
+            }
+          }
+        }
+        break;
+      }
+    }
+  }
 }
 
 static void deg_foreach_id(const Depsgraph *depsgraph,
-                           DEGForeachIDCallback callback, void *user_data)
+                           DEGForeachIDCallback callback,
+                           void *user_data)
 {
-	for (const IDNode *id_node : depsgraph->id_nodes) {
-		callback(id_node->id_orig, user_data);
-	}
+  for (const IDNode *id_node : depsgraph->id_nodes) {
+    callback(id_node->id_orig, user_data);
+  }
 }
 
 }  // namespace DEG
 
 void DEG_foreach_dependent_ID(const Depsgraph *depsgraph,
                               const ID *id,
-                              DEGForeachIDCallback callback, void *user_data)
+                              DEGForeachIDCallback callback,
+                              void *user_data)
 {
-	DEG::deg_foreach_dependent_ID((const DEG::Depsgraph *)depsgraph,
-	                              id,
-	                              callback, user_data);
+  DEG::deg_foreach_dependent_ID((const DEG::Depsgraph *)depsgraph, id, callback, user_data);
 }
 
 void DEG_foreach_ancestor_ID(const Depsgraph *depsgraph,
                              const ID *id,
-                             DEGForeachIDCallback callback, void *user_data)
+                             DEGForeachIDCallback callback,
+                             void *user_data)
 {
-	DEG::deg_foreach_ancestor_ID((const DEG::Depsgraph *)depsgraph,
-	                             id,
-	                             callback, user_data);
+  DEG::deg_foreach_ancestor_ID((const DEG::Depsgraph *)depsgraph, id, callback, user_data);
 }
 
-void DEG_foreach_ID(const Depsgraph *depsgraph,
-                    DEGForeachIDCallback callback, void *user_data)
+void DEG_foreach_ID(const Depsgraph *depsgraph, DEGForeachIDCallback callback, void *user_data)
 {
-	DEG::deg_foreach_id((const DEG::Depsgraph *)depsgraph, callback, user_data);
+  DEG::deg_foreach_id((const DEG::Depsgraph *)depsgraph, callback, user_data);
 }