-/*******************************************************************************\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.db.impl.query;\r
-\r
-import gnu.trove.procedure.TIntProcedure;\r
-import gnu.trove.set.hash.TIntHashSet;\r
-\r
-import java.util.ArrayList;\r
-import java.util.Arrays;\r
-import java.util.concurrent.Semaphore;\r
-\r
-import org.simantics.db.impl.graph.ReadGraphImpl;\r
-import org.simantics.db.impl.procedure.IntProcedureAdapter;\r
-import org.simantics.db.impl.procedure.InternalProcedure;\r
-import org.simantics.db.procedure.ListenerBase;\r
-\r
-final public class PrincipalTypes extends CollectionUnaryQuery<IntProcedure> {\r
-\r
-// public ArrayList<IntProcedure> procs = null;\r
-\r
- private PrincipalTypes(final int resource) {\r
- super(resource);\r
- }\r
-\r
- final static PrincipalTypes entry(final QueryProcessor provider, final int r) {\r
- return (PrincipalTypes)provider.principalTypesMap.get(r);\r
- }\r
-\r
- final static void runner(ReadGraphImpl graph, final int r, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {\r
-\r
- QueryProcessor processor = graph.processor;\r
- \r
- PrincipalTypes entry = (PrincipalTypes)processor.principalTypesMap.get(r); \r
- if(entry == null) {\r
-\r
- entry = new PrincipalTypes(r);\r
- entry.setPending();\r
- entry.clearResult(processor.querySupport);\r
- entry.putEntry(processor);\r
- \r
- processor.performForEach(graph, entry, parent, listener, procedure);\r
- \r
- } else {\r
- \r
- if(entry.isPending()) {\r
- synchronized(entry) {\r
- if(entry.isPending()) {\r
- throw new IllegalStateException();\r
-// if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>(1);\r
-// entry.procs.add(procedure);\r
-// processor.registerDependencies(graph, entry, parent, listener, procedure, false);\r
-// return;\r
- }\r
- }\r
- }\r
- processor.performForEach(graph, entry, parent, listener, procedure);\r
- }\r
-\r
- }\r
-\r
- final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {\r
-\r
- assert(r != 0);\r
-\r
- if(parent == null && listener == null) {\r
- PrincipalTypes.computeForEach(graph, r, null, graph.processor, procedure);\r
- } else {\r
- runner(graph, r, parent, listener, procedure);\r
- }\r
-\r
- }\r
-\r
- @Override\r
- public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {\r
- return provider.principalTypesMap.get(id);\r
- }\r
-\r
- @Override\r
- public void putEntry(QueryProcessor provider) {\r
- provider.principalTypesMap.put(id, this);\r
- }\r
-\r
- @Override\r
- final public void removeEntry(QueryProcessor provider) {\r
- provider.principalTypesMap.remove(id);\r
- }\r
-\r
- static class Koss {\r
-\r
- private TIntHashSet set = null;\r
- public int single = 0;\r
-\r
- public boolean add(int val) {\r
- if(single == val) return false;\r
- if(single == 0) {\r
- single = val;\r
- return true;\r
- }\r
- if(set == null) set = new TIntHashSet(4);\r
- set.add(val);\r
- return true;\r
- }\r
-\r
- public int size() {\r
-\r
- if(single == 0) return 0;\r
- if(set == null) return 1;\r
- return set.size() + 1;\r
-\r
- }\r
-\r
- public int[] toArray() {\r
-\r
- int[] result = Arrays.copyOf(set.toArray(), set.size() + 1);\r
- result[set.size()] = single;\r
- return result;\r
-\r
- }\r
-\r
- public void forEach(TIntProcedure proc) {\r
- proc.execute(single);\r
- if(set != null) set.forEach(proc);\r
- }\r
-\r
- }\r
-\r
- @Override\r
- public Object computeForEach(final ReadGraphImpl procedureGraph, final QueryProcessor provider, final IntProcedure proc, final boolean store) {\r
-\r
- return computeForEach(procedureGraph, id, this, provider, proc);\r
- \r
- }\r
- \r
- public static Object computeForEach(final ReadGraphImpl graph, final int id, final PrincipalTypes entry, final QueryProcessor provider, final IntProcedure proc) {\r
- \r
- provider.querySupport.ensureLoaded(graph, id);\r
- assert(id != 0);\r
-\r
- int ret = provider.querySupport.getSingleInstance(id);\r
- if(ret > 0) {\r
- if(entry != null) {\r
- entry.add(ret);\r
- entry.finish(graph, provider);\r
- }\r
- proc.execute(graph, ret);\r
- proc.finished(graph);\r
- return ret;\r
- }\r
-\r
- final int instanceOf = provider.getInstanceOf();\r
- final int inherits = provider.getInherits();\r
- final int subrelationOf = provider.getSubrelationOf();\r
-\r
- final Koss indirect = new Koss();\r
- final Koss material = new Koss();\r
-\r
- IntProcedure directProc = new IntProcedure() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, int i) {\r
- material.add(i);\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- proc.exception(graph, t);\r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- }\r
-\r
- };\r
-\r
- IntProcedure indirectProc = new IntProcedure() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, int i) {\r
- indirect.add(i);\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- proc.exception(graph, t);\r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- }\r
-\r
- };\r
-\r
- provider.querySupport.getObjects(graph, id, instanceOf, directProc);\r
- provider.querySupport.getObjects(graph, id, inherits, indirectProc);\r
- provider.querySupport.getObjects(graph, id, subrelationOf, indirectProc);\r
-\r
- if(indirect.size() == 0) {\r
- int size = material.size(); \r
- if(size == 0) {\r
- if(entry != null) entry.finish(graph, provider);\r
- proc.finished(graph);\r
- return null;\r
- } else if(size == 1) {\r
- int single = material.single; \r
- if(entry != null) {\r
- entry.add(single);\r
- entry.finish(graph, provider);\r
- }\r
- proc.execute(graph, single);\r
- proc.finished(graph);\r
- return single;\r
- } else {\r
- addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);\r
- return null;\r
- }\r
- }\r
-\r
-// final AtomicInteger finishes = new AtomicInteger(0);\r
-\r
- indirect.forEach(new TIntProcedure() {\r
-\r
- int finishes = 0;\r
- \r
- @Override\r
- public boolean execute(final int arg0) {\r
-\r
- // No self-loops!\r
- if(arg0 == id) {\r
- int current = (++finishes);\r
- if(current == indirect.size()) {\r
- int size = material.size(); \r
- if(size == 0) {\r
- if(entry != null) entry.finish(graph, provider);\r
- proc.finished(graph);\r
- return true;\r
- } else if(size == 1) {\r
- int single = material.single; \r
- if(entry != null) {\r
- entry.add(single);\r
- entry.finish(graph, provider);\r
- }\r
- proc.execute(graph, single);\r
- proc.finished(graph);\r
- return true;\r
- } else {\r
- addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);\r
- return true;\r
- }\r
- }\r
- return true;\r
- }\r
-\r
- PrincipalTypes.queryEach(graph, arg0, provider, entry, null, new IntProcedure() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, int i) {\r
- synchronized(material) {\r
- material.add(i);\r
- }\r
- }\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
-\r
- int current = (++finishes);\r
- if(current == indirect.size()) {\r
- int size = material.size(); \r
- if(size == 0) {\r
- if(entry != null) entry.finish(graph, provider);\r
- proc.finished(graph);\r
- return;\r
- } else if(size == 1) {\r
- int single = material.single; \r
- if(entry != null) {\r
- entry.add(single);\r
- entry.finish(graph, provider);\r
- }\r
- proc.execute(graph, single);\r
- proc.finished(graph);\r
- return;\r
- } else {\r
- addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);\r
- return;\r
- }\r
- }\r
-\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- proc.exception(graph, t);\r
- }\r
-\r
- });\r
-\r
- return true;\r
-\r
- }\r
-\r
- });\r
- \r
- return null;\r
-\r
- }\r
-\r
- private static void finish(ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, final PrincipalTypes entry, final QueryProcessor provider, final IntProcedure proc) {\r
-\r
- if(entry != null) {\r
- for(int i : material) {\r
- if(!rejects.contains(i)) {\r
- entry.add(i);\r
- }\r
- }\r
- entry.finish(graph, provider);\r
- }\r
-\r
- for(int i : material) {\r
- if(!rejects.contains(i)) {\r
- proc.execute(graph, i);\r
- }\r
- }\r
-\r
- proc.finished(graph);\r
-\r
- return;\r
-\r
- }\r
-\r
- private static void addPrincipalType(final ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, int index, final QueryProcessor provider, final PrincipalTypes entry, final IntProcedure proc) {\r
-\r
- // if((counter++ % 500) == 0) System.out.println("PT " + counter + " mat = " + material.length);\r
-\r
- if(index == material.length) { \r
- finish(graph, rejects, material, entry, provider, proc);\r
- return;\r
- }\r
-\r
- int type = material[index++];\r
- while(rejects.contains(type)) {\r
- if(index == material.length) { \r
- finish(graph, rejects, material, entry, provider, proc);\r
- return;\r
- }\r
- type = material[index++];\r
- }\r
- final int nextIndex = index;\r
-\r
- SuperTypes.queryEach(graph, type, provider, entry, null, new InternalProcedure<IntSet>() {\r
-\r
- @Override\r
- public void execute(ReadGraphImpl graph, IntSet supers) {\r
-\r
- synchronized(rejects) {\r
-\r
- supers.forEach(new TIntProcedure() {\r
-\r
- @Override\r
- public boolean execute(int arg0) {\r
- rejects.add(arg0);\r
- return true;\r
- }\r
-\r
- });\r
-\r
- }\r
-\r
- addPrincipalType(graph, rejects, material, nextIndex, provider, entry, proc);\r
-\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- proc.exception(graph, t);\r
- }\r
-\r
- });\r
-\r
- }\r
-\r
- @Override\r
- public String toString() {\r
- return "PrincipalTypes[" + id + "]";\r
- }\r
-\r
- final private void add(int val) {\r
- assert(isPending());\r
- IntArray v = (IntArray)getResult();\r
- v.add(val);\r
- }\r
-\r
- final private void finish(ReadGraphImpl graph, QueryProcessor provider) {\r
-\r
- assert(isPending());\r
-\r
-// ArrayList<IntProcedure> p = null;\r
-\r
- synchronized(this) {\r
-\r
- setReady();\r
-// p = procs;\r
-// procs = null;\r
-\r
- }\r
-\r
-// if(p != null) {\r
-//\r
-// IntArray v = (IntArray)getResult();\r
-// if(v != null) {\r
-// if(v.data == null) {\r
-// if(v.sizeOrData != IntArray.NO_DATA) {\r
-// for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);\r
-// }\r
-// } else {\r
-// for(IntProcedure proc : p) {\r
-// for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);\r
-// }\r
-// }\r
-// }\r
-//\r
-// for(IntProcedure proc : p) proc.finished(graph);\r
-//\r
-// }\r
-\r
-\r
- }\r
-\r
- @Override\r
- public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {\r
-\r
- assert(isReady());\r
-\r
- if(handleException(graph, procedure)) return EXCEPTED;\r
- \r
- final IntArray value = (IntArray)getResult();\r
- if(value.data == null) {\r
- if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);\r
- } else {\r
- for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);\r
- }\r
-\r
- procedure.finished(graph);\r
- \r
- return getResult();\r
-\r
- }\r
-\r
- @Override\r
- public void recompute(ReadGraphImpl graph, QueryProcessor provider) {\r
-\r
- final Semaphore s = new Semaphore(0);\r
-\r
- computeForEach(graph, provider, new IntProcedureAdapter() {\r
-\r
- @Override\r
- public void finished(ReadGraphImpl graph) {\r
- s.release();\r
- }\r
-\r
- @Override\r
- public void exception(ReadGraphImpl graph, Throwable t) {\r
- s.release();\r
- new Error("Error in recompute.", t).printStackTrace();\r
- }\r
-\r
- }, true);\r
-\r
- while(!s.tryAcquire()) {\r
- provider.resume(graph);\r
- }\r
-\r
- }\r
-\r
-\r
- @Override\r
- boolean isImmutable(ReadGraphImpl graph) {\r
- return graph.processor.isImmutable(id);\r
- }\r
- \r
- @Override\r
- protected void fillImpliedParents(QueryProcessor processor, ArrayList<CacheEntry> result) {\r
-// for(Objects o : Objects.entries(processor, id)) result.add(o);\r
- }\r
-\r
-}\r
+/*******************************************************************************
+ * Copyright (c) 2007, 2018 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.db.impl.query;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+
+import org.simantics.db.common.utils.Logger;
+import org.simantics.db.exception.DatabaseException;
+import org.simantics.db.impl.graph.ReadGraphImpl;
+import org.simantics.db.impl.procedure.InternalProcedure;
+
+import gnu.trove.procedure.TIntProcedure;
+import gnu.trove.set.hash.TIntHashSet;
+
+public final class PrincipalTypes extends CollectionUnaryQuery {
+
+ PrincipalTypes(final int resource) {
+ super(resource);
+ }
+
+ @Override
+ final public void removeEntry(QueryProcessor provider) {
+ provider.cache.remove(this);
+ }
+
+ static class Ints {
+
+ private TIntHashSet set = null;
+ public int single = 0;
+
+ public boolean add(int val) {
+ if(single == val) return false;
+ if(single == 0) {
+ single = val;
+ return true;
+ }
+ if(set == null) set = new TIntHashSet(4);
+ set.add(val);
+ return true;
+ }
+
+ public int size() {
+
+ if(single == 0) return 0;
+ if(set == null) return 1;
+ return set.size() + 1;
+
+ }
+
+ public int[] toArray() {
+
+ int[] result = Arrays.copyOf(set.toArray(), set.size() + 1);
+ result[set.size()] = single;
+ return result;
+
+ }
+
+ public void forEach(TIntProcedure proc) {
+ proc.execute(single);
+ if(set != null) set.forEach(proc);
+ }
+
+ }
+
+ @Override
+ public void compute(final ReadGraphImpl graph, final IntProcedure proc) throws DatabaseException {
+ computeForEach(graph, id, this, proc);
+ }
+
+ public static Object computeForEach(final ReadGraphImpl graph, final int id, final PrincipalTypes entry, final IntProcedure procedure_) throws DatabaseException {
+
+ IntProcedure procedure = entry != null ? entry : procedure_;
+
+ Object result = computeForEach2(graph, id, entry, procedure);
+
+ if(entry != null) entry.performFromCache(graph, procedure_);
+
+ return result;
+
+ }
+
+ public static Object computeForEach2(final ReadGraphImpl graph, final int id, final PrincipalTypes parent, final IntProcedure procedure) throws DatabaseException {
+
+ QueryProcessor provider = graph.processor;
+
+ provider.querySupport.ensureLoaded(graph, id);
+ assert(id != 0);
+
+ int ret = provider.querySupport.getSingleInstance(id);
+ if(ret > 0) {
+ procedure.execute(graph, ret);
+ procedure.finished(graph);
+ return ret;
+ }
+
+ final int instanceOf = provider.getInstanceOf();
+ final int inherits = provider.getInherits();
+ final int subrelationOf = provider.getSubrelationOf();
+
+ final Ints indirect = new Ints();
+ final Ints material = new Ints();
+
+ IntProcedure directProc = new IntProcedure() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, int i) {
+ material.add(i);
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) throws DatabaseException {
+ procedure.exception(graph, t);
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ }
+
+ };
+
+ IntProcedure indirectProc = new IntProcedure() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, int i) {
+ indirect.add(i);
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) throws DatabaseException {
+ procedure.exception(graph, t);
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) {
+ }
+
+ };
+
+ provider.querySupport.getObjects(graph, id, instanceOf, directProc);
+ provider.querySupport.getObjects(graph, id, inherits, indirectProc);
+ provider.querySupport.getObjects(graph, id, subrelationOf, indirectProc);
+
+ if(indirect.size() == 0) {
+ int size = material.size();
+ if(size == 0) {
+ procedure.finished(graph);
+ return null;
+ } else if(size == 1) {
+ int single = material.single;
+ procedure.execute(graph, single);
+ procedure.finished(graph);
+ return single;
+ } else {
+ addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, parent, procedure);
+ return null;
+ }
+ }
+
+ indirect.forEach(new TIntProcedure() {
+
+ int finishes = 0;
+
+ @Override
+ public boolean execute(final int arg0) {
+ try {
+ return execute0(arg0);
+ } catch (DatabaseException e) {
+ Logger.defaultLogError(e);
+ }
+ return false;
+ }
+
+ public boolean execute0(final int arg0) throws DatabaseException {
+
+ // No self-loops!
+ if(arg0 == id) {
+ int current = (++finishes);
+ if(current == indirect.size()) {
+ int size = material.size();
+ if(size == 0) {
+ procedure.finished(graph);
+ return true;
+ } else if(size == 1) {
+ int single = material.single;
+ procedure.execute(graph, single);
+ procedure.finished(graph);
+ return true;
+ } else {
+ addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, parent, procedure);
+ return true;
+ }
+ }
+ return true;
+ }
+
+ QueryCache.runnerPrincipalTypes(graph, arg0, parent, null, new IntProcedure() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, int i) {
+ synchronized(material) {
+ material.add(i);
+ }
+ }
+
+ @Override
+ public void finished(ReadGraphImpl graph) throws DatabaseException {
+
+ int current = (++finishes);
+ if(current == indirect.size()) {
+ int size = material.size();
+ if(size == 0) {
+ procedure.finished(graph);
+ return;
+ } else if(size == 1) {
+ int single = material.single;
+ procedure.execute(graph, single);
+ procedure.finished(graph);
+ return;
+ } else {
+ addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, parent, procedure);
+ return;
+ }
+ }
+
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) throws DatabaseException {
+ procedure.exception(graph, t);
+ }
+
+ });
+
+ return true;
+
+ }
+
+ });
+
+ return null;
+
+ }
+
+ private static void finish(ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, final IntProcedure proc) throws DatabaseException {
+
+ for(int i : material) {
+ if(!rejects.contains(i)) {
+ proc.execute(graph, i);
+ }
+ }
+
+ proc.finished(graph);
+
+ return;
+
+ }
+
+ private static void addPrincipalType(final ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, int index, final QueryProcessor provider, final PrincipalTypes parent, final IntProcedure proc) throws DatabaseException {
+
+ if(index == material.length) {
+ finish(graph, rejects, material, proc);
+ return;
+ }
+
+ int type = material[index++];
+ while(rejects.contains(type)) {
+ if(index == material.length) {
+ finish(graph, rejects, material, proc);
+ return;
+ }
+ type = material[index++];
+ }
+
+ final int nextIndex = index;
+
+ QueryCache.runnerSuperTypes(graph, type, parent, null, new InternalProcedure<IntSet>() {
+
+ @Override
+ public void execute(ReadGraphImpl graph, IntSet supers) throws DatabaseException {
+
+ synchronized(rejects) {
+
+ supers.forEach(new TIntProcedure() {
+
+ @Override
+ public boolean execute(int arg0) {
+ rejects.add(arg0);
+ return true;
+ }
+
+ });
+
+ }
+
+ addPrincipalType(graph, rejects, material, nextIndex, provider, parent, proc);
+
+ }
+
+ @Override
+ public void exception(ReadGraphImpl graph, Throwable t) throws DatabaseException {
+ proc.exception(graph, t);
+ }
+
+ });
+
+ }
+
+ @Override
+ public String toString() {
+ return "PrincipalTypes[" + id + "]";
+ }
+
+ @Override
+ protected void fillImpliedParents(QueryProcessor processor, ArrayList<CacheEntry<?>> result) {
+ }
+
+}
Code Review / simantics / platform.git / blobdiff