1 /*******************************************************************************
\r
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
\r
3 * in Industry THTH ry.
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.db.impl.query;
\r
14 import gnu.trove.procedure.TIntProcedure;
\r
15 import gnu.trove.set.hash.TIntHashSet;
\r
17 import java.util.ArrayList;
\r
18 import java.util.Arrays;
\r
19 import java.util.concurrent.Semaphore;
\r
21 import org.simantics.db.impl.graph.ReadGraphImpl;
\r
22 import org.simantics.db.impl.procedure.IntProcedureAdapter;
\r
23 import org.simantics.db.impl.procedure.InternalProcedure;
\r
24 import org.simantics.db.procedure.ListenerBase;
\r
26 final public class PrincipalTypes extends CollectionUnaryQuery<IntProcedure> {
\r
28 // public ArrayList<IntProcedure> procs = null;
\r
30 private PrincipalTypes(final int resource) {
\r
34 final static PrincipalTypes entry(final QueryProcessor provider, final int r) {
\r
35 return (PrincipalTypes)provider.principalTypesMap.get(r);
\r
38 final static void runner(ReadGraphImpl graph, final int r, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
\r
40 QueryProcessor processor = graph.processor;
\r
42 PrincipalTypes entry = (PrincipalTypes)processor.principalTypesMap.get(r);
\r
45 entry = new PrincipalTypes(r);
\r
47 entry.clearResult(processor.querySupport);
\r
48 entry.putEntry(processor);
\r
50 processor.performForEach(graph, entry, parent, listener, procedure);
\r
54 if(entry.isPending()) {
\r
55 synchronized(entry) {
\r
56 if(entry.isPending()) {
\r
57 throw new IllegalStateException();
\r
58 // if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>(1);
\r
59 // entry.procs.add(procedure);
\r
60 // processor.registerDependencies(graph, entry, parent, listener, procedure, false);
\r
65 processor.performForEach(graph, entry, parent, listener, procedure);
\r
70 final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
\r
74 if(parent == null && listener == null) {
\r
75 PrincipalTypes.computeForEach(graph, r, null, graph.processor, procedure);
\r
77 runner(graph, r, parent, listener, procedure);
\r
83 public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
\r
84 return provider.principalTypesMap.get(id);
\r
88 public void putEntry(QueryProcessor provider) {
\r
89 provider.principalTypesMap.put(id, this);
\r
93 final public void removeEntry(QueryProcessor provider) {
\r
94 provider.principalTypesMap.remove(id);
\r
99 private TIntHashSet set = null;
\r
100 public int single = 0;
\r
102 public boolean add(int val) {
\r
103 if(single == val) return false;
\r
108 if(set == null) set = new TIntHashSet(4);
\r
113 public int size() {
\r
115 if(single == 0) return 0;
\r
116 if(set == null) return 1;
\r
117 return set.size() + 1;
\r
121 public int[] toArray() {
\r
123 int[] result = Arrays.copyOf(set.toArray(), set.size() + 1);
\r
124 result[set.size()] = single;
\r
129 public void forEach(TIntProcedure proc) {
\r
130 proc.execute(single);
\r
131 if(set != null) set.forEach(proc);
\r
137 public Object computeForEach(final ReadGraphImpl procedureGraph, final QueryProcessor provider, final IntProcedure proc, final boolean store) {
\r
139 return computeForEach(procedureGraph, id, this, provider, proc);
\r
143 public static Object computeForEach(final ReadGraphImpl graph, final int id, final PrincipalTypes entry, final QueryProcessor provider, final IntProcedure proc) {
\r
145 provider.querySupport.ensureLoaded(graph, id);
\r
148 int ret = provider.querySupport.getSingleInstance(id);
\r
150 if(entry != null) {
\r
152 entry.finish(graph, provider);
\r
154 proc.execute(graph, ret);
\r
155 proc.finished(graph);
\r
159 final int instanceOf = provider.getInstanceOf();
\r
160 final int inherits = provider.getInherits();
\r
161 final int subrelationOf = provider.getSubrelationOf();
\r
163 final Koss indirect = new Koss();
\r
164 final Koss material = new Koss();
\r
166 IntProcedure directProc = new IntProcedure() {
\r
169 public void execute(ReadGraphImpl graph, int i) {
\r
174 public void exception(ReadGraphImpl graph, Throwable t) {
\r
175 proc.exception(graph, t);
\r
179 public void finished(ReadGraphImpl graph) {
\r
184 IntProcedure indirectProc = new IntProcedure() {
\r
187 public void execute(ReadGraphImpl graph, int i) {
\r
192 public void exception(ReadGraphImpl graph, Throwable t) {
\r
193 proc.exception(graph, t);
\r
197 public void finished(ReadGraphImpl graph) {
\r
202 provider.querySupport.getObjects(graph, id, instanceOf, directProc);
\r
203 provider.querySupport.getObjects(graph, id, inherits, indirectProc);
\r
204 provider.querySupport.getObjects(graph, id, subrelationOf, indirectProc);
\r
206 if(indirect.size() == 0) {
\r
207 int size = material.size();
\r
209 if(entry != null) entry.finish(graph, provider);
\r
210 proc.finished(graph);
\r
212 } else if(size == 1) {
\r
213 int single = material.single;
\r
214 if(entry != null) {
\r
216 entry.finish(graph, provider);
\r
218 proc.execute(graph, single);
\r
219 proc.finished(graph);
\r
222 addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);
\r
227 // final AtomicInteger finishes = new AtomicInteger(0);
\r
229 indirect.forEach(new TIntProcedure() {
\r
234 public boolean execute(final int arg0) {
\r
238 int current = (++finishes);
\r
239 if(current == indirect.size()) {
\r
240 int size = material.size();
\r
242 if(entry != null) entry.finish(graph, provider);
\r
243 proc.finished(graph);
\r
245 } else if(size == 1) {
\r
246 int single = material.single;
\r
247 if(entry != null) {
\r
249 entry.finish(graph, provider);
\r
251 proc.execute(graph, single);
\r
252 proc.finished(graph);
\r
255 addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);
\r
262 PrincipalTypes.queryEach(graph, arg0, provider, entry, null, new IntProcedure() {
\r
265 public void execute(ReadGraphImpl graph, int i) {
\r
266 synchronized(material) {
\r
272 public void finished(ReadGraphImpl graph) {
\r
274 int current = (++finishes);
\r
275 if(current == indirect.size()) {
\r
276 int size = material.size();
\r
278 if(entry != null) entry.finish(graph, provider);
\r
279 proc.finished(graph);
\r
281 } else if(size == 1) {
\r
282 int single = material.single;
\r
283 if(entry != null) {
\r
285 entry.finish(graph, provider);
\r
287 proc.execute(graph, single);
\r
288 proc.finished(graph);
\r
291 addPrincipalType(graph, new TIntHashSet(4), material.toArray(), 0, provider, entry, proc);
\r
299 public void exception(ReadGraphImpl graph, Throwable t) {
\r
300 proc.exception(graph, t);
\r
315 private static void finish(ReadGraphImpl graph, final TIntHashSet rejects, final int[] material, final PrincipalTypes entry, final QueryProcessor provider, final IntProcedure proc) {
\r
317 if(entry != null) {
\r
318 for(int i : material) {
\r
319 if(!rejects.contains(i)) {
\r
323 entry.finish(graph, provider);
\r
326 for(int i : material) {
\r
327 if(!rejects.contains(i)) {
\r
328 proc.execute(graph, i);
\r
332 proc.finished(graph);
\r
338 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
340 // if((counter++ % 500) == 0) System.out.println("PT " + counter + " mat = " + material.length);
\r
342 if(index == material.length) {
\r
343 finish(graph, rejects, material, entry, provider, proc);
\r
347 int type = material[index++];
\r
348 while(rejects.contains(type)) {
\r
349 if(index == material.length) {
\r
350 finish(graph, rejects, material, entry, provider, proc);
\r
353 type = material[index++];
\r
355 final int nextIndex = index;
\r
357 SuperTypes.queryEach(graph, type, provider, entry, null, new InternalProcedure<IntSet>() {
\r
360 public void execute(ReadGraphImpl graph, IntSet supers) {
\r
362 synchronized(rejects) {
\r
364 supers.forEach(new TIntProcedure() {
\r
367 public boolean execute(int arg0) {
\r
376 addPrincipalType(graph, rejects, material, nextIndex, provider, entry, proc);
\r
381 public void exception(ReadGraphImpl graph, Throwable t) {
\r
382 proc.exception(graph, t);
\r
390 public String toString() {
\r
391 return "PrincipalTypes[" + id + "]";
\r
394 final private void add(int val) {
\r
395 assert(isPending());
\r
396 IntArray v = (IntArray)getResult();
\r
400 final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
\r
402 assert(isPending());
\r
404 // ArrayList<IntProcedure> p = null;
\r
406 synchronized(this) {
\r
416 // IntArray v = (IntArray)getResult();
\r
418 // if(v.data == null) {
\r
419 // if(v.sizeOrData != IntArray.NO_DATA) {
\r
420 // for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);
\r
423 // for(IntProcedure proc : p) {
\r
424 // for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
\r
429 // for(IntProcedure proc : p) proc.finished(graph);
\r
437 public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
\r
441 if(handleException(graph, procedure)) return EXCEPTED;
\r
443 final IntArray value = (IntArray)getResult();
\r
444 if(value.data == null) {
\r
445 if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);
\r
447 for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
\r
450 procedure.finished(graph);
\r
452 return getResult();
\r
457 public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
\r
459 final Semaphore s = new Semaphore(0);
\r
461 computeForEach(graph, provider, new IntProcedureAdapter() {
\r
464 public void finished(ReadGraphImpl graph) {
\r
469 public void exception(ReadGraphImpl graph, Throwable t) {
\r
471 new Error("Error in recompute.", t).printStackTrace();
\r
476 while(!s.tryAcquire()) {
\r
477 provider.resume(graph);
\r
484 boolean isImmutable(ReadGraphImpl graph) {
\r
485 return graph.processor.isImmutable(id);
\r
489 protected void fillImpliedParents(QueryProcessor processor, ArrayList<CacheEntry> result) {
\r
490 // for(Objects o : Objects.entries(processor, id)) result.add(o);
\r