-/*******************************************************************************\r
- * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
- * in Industry THTH ry.\r
- * All rights reserved. This program and the accompanying materials\r
- * are made available under the terms of the Eclipse Public License v1.0\r
- * which accompanies this distribution, and is available at\r
- * http://www.eclipse.org/legal/epl-v10.html\r
- *\r
- * Contributors:\r
- * VTT Technical Research Centre of Finland - initial API and implementation\r
- *******************************************************************************/\r
-package org.simantics.scenegraph.tests;\r
-\r
-import static junit.framework.Assert.assertEquals;\r
-import static junit.framework.Assert.assertSame;\r
-\r
-import java.util.ArrayList;\r
-import java.util.List;\r
-import java.util.UUID;\r
-import java.util.concurrent.BrokenBarrierException;\r
-import java.util.concurrent.CyclicBarrier;\r
-import java.util.concurrent.Semaphore;\r
-import java.util.concurrent.atomic.AtomicBoolean;\r
-\r
-import org.junit.Test;\r
-import org.simantics.scenegraph.INode;\r
-import org.simantics.scenegraph.ParentNode;\r
-import org.simantics.scenegraph.g2d.G2DParentNode;\r
-import org.simantics.scenegraph.g2d.G2DSceneGraph;\r
-import org.simantics.scenegraph.g2d.nodes.DataNode;\r
-import org.simantics.scenegraph.g2d.nodes.NavigationNode;\r
-import org.simantics.scenegraph.utils.NodeUtil;\r
-\r
-\r
-/**\r
- * @author Tuukka Lehtonen\r
- */\r
-public class LookupServiceSynchronizationTest {\r
-\r
- public static final int ITERATIONS = 10;\r
- public static final int ITERATION_TIME_MS = 1000;\r
- public static final int THREADS = 16;\r
-\r
- AtomicBoolean endTest;\r
- CyclicBarrier startBarrier;\r
- Semaphore ended;\r
-\r
- G2DSceneGraph root = new G2DSceneGraph();\r
- List<INode> nodes = new ArrayList<INode>();\r
- List<String> nodeIds = new ArrayList<String>();\r
- List<String> mappedIds = new ArrayList<String>();\r
-\r
- List<Throwable> errors = new ArrayList<Throwable>();\r
-\r
- public class Lookup implements Runnable {\r
- String id;\r
- INode node;\r
- public Lookup(String id, INode node) {\r
- this.id = id;\r
- this.node = node;\r
- }\r
- @Override\r
- public void run() {\r
- try {\r
- System.out.println("started " + Thread.currentThread().getName());\r
- System.out.flush();\r
- startBarrier.await();\r
- while (!endTest.get()) {\r
- Thread.yield();\r
- INode n = NodeUtil.lookup(this.node, this.id);\r
- String id = NodeUtil.lookupId(this.node);\r
- if (n != null)\r
- assertSame(this.node, n);\r
- if (id != null)\r
- assertSame(this.id, id);\r
- }\r
- } catch (InterruptedException e) {\r
- errors.add(e);\r
- } catch (BrokenBarrierException e) {\r
- errors.add(e);\r
- } finally {\r
- System.out.println("ending " + Thread.currentThread().getName());\r
- System.out.flush();\r
- ended.release();\r
- }\r
- }\r
- }\r
-\r
- public class Mapper implements Runnable {\r
- String id;\r
- INode node;\r
- public Mapper(String id, INode node) {\r
- this.id = id;\r
- this.node = node;\r
- }\r
- @Override\r
- public void run() {\r
- try {\r
- System.out.println("started " + Thread.currentThread().getName());\r
- System.out.flush();\r
- startBarrier.await();\r
- for (int i = 0; !endTest.get(); ++i) {\r
- Thread.yield();\r
- NodeUtil.map(node, id);\r
- if ((i & 1) == 0)\r
- NodeUtil.unmap(node);\r
- else\r
- root.unmap(id);\r
- }\r
- } catch (InterruptedException e) {\r
- errors.add(e);\r
- } catch (BrokenBarrierException e) {\r
- errors.add(e);\r
- } finally {\r
- System.out.println("ending " + Thread.currentThread().getName());\r
- System.out.flush();\r
- ended.release();\r
- }\r
- }\r
- }\r
-\r
- <T extends INode> T addAndMapNode(ParentNode<?> parent, String id, Class<T> clazz) {\r
- T node = parent.addNode(id, clazz);\r
- nodes.add( node );\r
- nodeIds.add( id );\r
- NodeUtil.map(node, id);\r
- return node;\r
- }\r
-\r
- <T extends INode> T addNode(ParentNode<?> parent, String id, Class<T> clazz) {\r
- T node = parent.addNode(id, clazz);\r
- nodes.add( node );\r
- nodeIds.add( id );\r
- return node;\r
- }\r
-\r
- <T extends INode> T addNode(ParentNode<?> parent, Class<T> clazz) {\r
- return addNode(parent, UUID.randomUUID().toString(), clazz);\r
- }\r
-\r
- @Test\r
- public void testLookup() throws Exception {\r
- NavigationNode nav = addAndMapNode(root, "navigation", NavigationNode.class);\r
- DataNode data = addAndMapNode(root, "data", DataNode.class);\r
- G2DParentNode elements = addNode(nav, "elements", G2DParentNode.class);\r
- @SuppressWarnings("unused")\r
- G2DParentNode ghosts = addNode(nav, "ghosts", G2DParentNode.class);\r
-\r
- // Basic checks\r
- assertSame(nav, root.lookupNode("navigation"));\r
- assertSame(data, root.lookupNode("data"));\r
- assertSame(nav, NodeUtil.lookup(nav, "navigation"));\r
- assertSame(data, NodeUtil.lookup(data, "data"));\r
-\r
- for (int iter = 1; iter <= ITERATIONS; ++iter) {\r
- System.out.println("Starting iteration " + iter);\r
- System.out.flush();\r
- // Start iteration\r
- endTest = new AtomicBoolean(false);\r
- startBarrier = new CyclicBarrier(THREADS * 2 + 1);\r
- ended = new Semaphore(0);\r
-\r
- for (int i = 0; i < THREADS; ++i) {\r
- String id = UUID.randomUUID().toString();\r
- INode node = addNode(elements, id, G2DParentNode.class);\r
- new Thread(new Mapper(id, node), "Mapper-" + i).start();\r
- new Thread(new Lookup(id, node), "Lookup-" + i).start();\r
- }\r
-\r
- startBarrier.await();\r
- // Sleep for the testing period\r
- synchronized (this) {\r
- wait(ITERATION_TIME_MS);\r
- }\r
- // Wait for threads to end\r
- System.out.println("Ending iteration " + iter);\r
- System.out.flush();\r
- endTest.set(true);\r
- ended.acquire(2*THREADS);\r
- System.out.println("Iteration " + iter + " ended");\r
- }\r
-\r
- assertEquals(errors.size(), 0);\r
- }\r
-\r
-}\r
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ * VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.scenegraph.tests;
+
+import static junit.framework.Assert.assertEquals;
+import static junit.framework.Assert.assertSame;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.UUID;
+import java.util.concurrent.BrokenBarrierException;
+import java.util.concurrent.CyclicBarrier;
+import java.util.concurrent.Semaphore;
+import java.util.concurrent.atomic.AtomicBoolean;
+
+import org.junit.Test;
+import org.simantics.scenegraph.INode;
+import org.simantics.scenegraph.ParentNode;
+import org.simantics.scenegraph.g2d.G2DParentNode;
+import org.simantics.scenegraph.g2d.G2DSceneGraph;
+import org.simantics.scenegraph.g2d.nodes.DataNode;
+import org.simantics.scenegraph.g2d.nodes.NavigationNode;
+import org.simantics.scenegraph.utils.NodeUtil;
+
+
+/**
+ * @author Tuukka Lehtonen
+ */
+public class LookupServiceSynchronizationTest {
+
+ public static final int ITERATIONS = 10;
+ public static final int ITERATION_TIME_MS = 1000;
+ public static final int THREADS = 16;
+
+ AtomicBoolean endTest;
+ CyclicBarrier startBarrier;
+ Semaphore ended;
+
+ G2DSceneGraph root = new G2DSceneGraph();
+ List<INode> nodes = new ArrayList<INode>();
+ List<String> nodeIds = new ArrayList<String>();
+ List<String> mappedIds = new ArrayList<String>();
+
+ List<Throwable> errors = new ArrayList<Throwable>();
+
+ public class Lookup implements Runnable {
+ String id;
+ INode node;
+ public Lookup(String id, INode node) {
+ this.id = id;
+ this.node = node;
+ }
+ @Override
+ public void run() {
+ try {
+ System.out.println("started " + Thread.currentThread().getName());
+ System.out.flush();
+ startBarrier.await();
+ while (!endTest.get()) {
+ Thread.yield();
+ INode n = NodeUtil.lookup(this.node, this.id);
+ String id = NodeUtil.lookupId(this.node);
+ if (n != null)
+ assertSame(this.node, n);
+ if (id != null)
+ assertSame(this.id, id);
+ }
+ } catch (InterruptedException e) {
+ errors.add(e);
+ } catch (BrokenBarrierException e) {
+ errors.add(e);
+ } finally {
+ System.out.println("ending " + Thread.currentThread().getName());
+ System.out.flush();
+ ended.release();
+ }
+ }
+ }
+
+ public class Mapper implements Runnable {
+ String id;
+ INode node;
+ public Mapper(String id, INode node) {
+ this.id = id;
+ this.node = node;
+ }
+ @Override
+ public void run() {
+ try {
+ System.out.println("started " + Thread.currentThread().getName());
+ System.out.flush();
+ startBarrier.await();
+ for (int i = 0; !endTest.get(); ++i) {
+ Thread.yield();
+ NodeUtil.map(node, id);
+ if ((i & 1) == 0)
+ NodeUtil.unmap(node);
+ else
+ root.unmap(id);
+ }
+ } catch (InterruptedException e) {
+ errors.add(e);
+ } catch (BrokenBarrierException e) {
+ errors.add(e);
+ } finally {
+ System.out.println("ending " + Thread.currentThread().getName());
+ System.out.flush();
+ ended.release();
+ }
+ }
+ }
+
+ <T extends INode> T addAndMapNode(ParentNode<?> parent, String id, Class<T> clazz) {
+ T node = parent.addNode(id, clazz);
+ nodes.add( node );
+ nodeIds.add( id );
+ NodeUtil.map(node, id);
+ return node;
+ }
+
+ <T extends INode> T addNode(ParentNode<?> parent, String id, Class<T> clazz) {
+ T node = parent.addNode(id, clazz);
+ nodes.add( node );
+ nodeIds.add( id );
+ return node;
+ }
+
+ <T extends INode> T addNode(ParentNode<?> parent, Class<T> clazz) {
+ return addNode(parent, UUID.randomUUID().toString(), clazz);
+ }
+
+ @Test
+ public void testLookup() throws Exception {
+ NavigationNode nav = addAndMapNode(root, "navigation", NavigationNode.class);
+ DataNode data = addAndMapNode(root, "data", DataNode.class);
+ G2DParentNode elements = addNode(nav, "elements", G2DParentNode.class);
+ @SuppressWarnings("unused")
+ G2DParentNode ghosts = addNode(nav, "ghosts", G2DParentNode.class);
+
+ // Basic checks
+ assertSame(nav, root.lookupNode("navigation"));
+ assertSame(data, root.lookupNode("data"));
+ assertSame(nav, NodeUtil.lookup(nav, "navigation"));
+ assertSame(data, NodeUtil.lookup(data, "data"));
+
+ for (int iter = 1; iter <= ITERATIONS; ++iter) {
+ System.out.println("Starting iteration " + iter);
+ System.out.flush();
+ // Start iteration
+ endTest = new AtomicBoolean(false);
+ startBarrier = new CyclicBarrier(THREADS * 2 + 1);
+ ended = new Semaphore(0);
+
+ for (int i = 0; i < THREADS; ++i) {
+ String id = UUID.randomUUID().toString();
+ INode node = addNode(elements, id, G2DParentNode.class);
+ new Thread(new Mapper(id, node), "Mapper-" + i).start();
+ new Thread(new Lookup(id, node), "Lookup-" + i).start();
+ }
+
+ startBarrier.await();
+ // Sleep for the testing period
+ synchronized (this) {
+ wait(ITERATION_TIME_MS);
+ }
+ // Wait for threads to end
+ System.out.println("Ending iteration " + iter);
+ System.out.flush();
+ endTest.set(true);
+ ended.acquire(2*THREADS);
+ System.out.println("Iteration " + iter + " ended");
+ }
+
+ assertEquals(errors.size(), 0);
+ }
+
+}
Code Review / simantics / platform.git / blobdiff