-
Notifications
You must be signed in to change notification settings - Fork 7
/
CompareTablesQuery.java
2918 lines (2753 loc) · 121 KB
/
CompareTablesQuery.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*******************************************************************************
* Copyright (c) 2010, 2020 SAP AG and IBM Corporation.
* 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: SAP AG - initial API and implementation
* Andrew Johnson - conversion to proper query, set operations via contexts
******************************************************************************/
package org.eclipse.mat.internal.snapshot.inspections;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.Serializable;
import java.net.URISyntaxException;
import java.net.URL;
import java.text.FieldPosition;
import java.text.Format;
import java.text.ParsePosition;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Locale;
import java.util.Map;
import java.util.Set;
import java.util.regex.Pattern;
import org.eclipse.mat.SnapshotException;
import org.eclipse.mat.collect.ArrayInt;
import org.eclipse.mat.internal.Messages;
import org.eclipse.mat.query.Bytes;
import org.eclipse.mat.query.BytesFormat;
import org.eclipse.mat.query.Column;
import org.eclipse.mat.query.ContextDerivedData;
import org.eclipse.mat.query.ContextDerivedData.DerivedOperation;
import org.eclipse.mat.query.ContextProvider;
import org.eclipse.mat.query.IContextObject;
import org.eclipse.mat.query.IContextObjectSet;
import org.eclipse.mat.query.IDecorator;
import org.eclipse.mat.query.IIconProvider;
import org.eclipse.mat.query.IQuery;
import org.eclipse.mat.query.IQueryContext;
import org.eclipse.mat.query.IResult;
import org.eclipse.mat.query.IResultTable;
import org.eclipse.mat.query.IResultTree;
import org.eclipse.mat.query.IStructuredResult;
import org.eclipse.mat.query.ResultMetaData;
import org.eclipse.mat.query.annotations.Argument;
import org.eclipse.mat.query.annotations.HelpUrl;
import org.eclipse.mat.query.annotations.Icon;
import org.eclipse.mat.query.annotations.Menu;
import org.eclipse.mat.query.annotations.Menu.Entry;
import org.eclipse.mat.query.refined.Filter;
import org.eclipse.mat.snapshot.ISnapshot;
import org.eclipse.mat.snapshot.OQL;
import org.eclipse.mat.snapshot.model.IObject;
import org.eclipse.mat.snapshot.model.IObjectArray;
import org.eclipse.mat.snapshot.model.NamedReference;
import org.eclipse.mat.snapshot.query.Icons;
import org.eclipse.mat.util.IProgressListener;
import org.eclipse.mat.util.MessageUtil;
import org.eclipse.mat.util.SimpleMonitor;
import org.eclipse.mat.util.VoidProgressListener;
import com.ibm.icu.text.DecimalFormat;
import com.ibm.icu.text.DecimalFormatSymbols;
import com.ibm.icu.text.NumberFormat;
@Icon("/META-INF/icons/compare.gif")
@HelpUrl("/org.eclipse.mat.ui.help/tasks/comparingdata.html")
@Menu({ @Entry(options = "-setop ALL")
,@Entry(options = "-mode DIFF_TO_PREVIOUS -prefix -mask \"\\s@ 0x[0-9a-f]+|^\\[[0-9]+\\]$\" -x java.util.HashMap$Node:key java.util.Hashtable$Entry:key java.util.WeakHashMap$Entry:referent java.util.concurrent.ConcurrentHashMap$Node:key")
,@Entry(options = "-mode DIFF_TO_PREVIOUS -prefix -mask \"\\s@ 0x[0-9a-f]+|^\\[[0-9]+\\]$|(?<=\\p{javaJavaIdentifierPart}\\[)\\d+(?=\\])\" -x java.util.HashMap$Node:key java.util.Hashtable$Entry:key java.util.WeakHashMap$Entry:referent java.util.concurrent.ConcurrentHashMap$Node:key")
,@Entry(options = "-mode DIFF_TO_PREVIOUS -prefix -mask \"\\s@ 0x[0-9a-f]+|^\\[[0-9]+\\]$|(?<=\\p{javaJavaIdentifierPart}\\[)\\d+(?=\\])\" -x java.util.HashMap$Node:key java.util.Hashtable$Entry:key java.util.WeakHashMap$Entry:referent java.util.concurrent.ConcurrentHashMap$Node:key -setop ALL")
})
public class CompareTablesQuery implements IQuery
{
@Argument
public IStructuredResult[] tables;
@Argument
public IQueryContext queryContext;
@Argument(isMandatory = false)
public ISnapshot[] snapshots;
@Argument(isMandatory = false)
public Mode mode = Mode.ABSOLUTE;
@Argument(isMandatory = false)
public Operation setOp = Operation.NONE;
@Argument(isMandatory = false)
public int keyColumn = 1;
@Argument(isMandatory = false)
public Pattern mask;
@Argument(isMandatory = false)
public String replace;
@Argument(isMandatory = false)
public boolean prefix;
@Argument(isMandatory = false)
public boolean suffix;
// @Argument(isMandatory = false)
public boolean addrefs = true;
@Argument(isMandatory = false, flag = "x")
public String[] extraReferences;
@Argument(isMandatory = false, flag = "xfile")
public File extraReferencesListFile;
private boolean[] sameSnapshot;
public enum Mode
{
ABSOLUTE("ABSOLUTE"), // //$NON-NLS-1$
DIFF_TO_FIRST("DIFF_TO_FIRST"), // //$NON-NLS-1$
DIFF_TO_PREVIOUS("DIFF_TO_PREVIOUS"), //$NON-NLS-1$
DIFF_RATIO_TO_FIRST("DIFF_RATIO_TO_FIRST"), // //$NON-NLS-1$
DIFF_RATIO_TO_PREVIOUS("DIFF_RATIO_TO_PREVIOUS"); //$NON-NLS-1$
String label;
private Mode(String label)
{
this.label = label;
}
public String toString()
{
return label;
}
}
public enum Operation
{
NONE,
ALL,
INTERSECTION,
UNION,
SYMMETRIC_DIFFERENCE,
DIFFERENCE,
REVERSE_DIFFERENCE
}
public IResult execute(IProgressListener listener) throws Exception
{
if (tables == null) return null;
// Length 1 table is valid, and we need to process it in case it is from a different snapshot
// Check key column is present
for (int i = 0; i < tables.length; ++i)
{
if (keyColumn > tables[i].getColumns().length || keyColumn < 1)
throw new IllegalArgumentException(MessageUtil.format(Messages.CompareTablesQuery_MissingKeyColumn, keyColumn, i + 1));
}
IStructuredResult base = tables[0];
Column[] baseColumns = base.getColumns();
Column key = baseColumns[keyColumn-1];
sameSnapshot = new boolean[tables.length];
ISnapshot sn = (ISnapshot)queryContext.get(ISnapshot.class, null);
boolean foundTree = false;
for (int i = 0; i < tables.length; ++i)
{
sameSnapshot[i] = (snapshots[i] == null || sn.equals(snapshots[i]));
if (tables[i] instanceof IResultTree)
foundTree = true;
}
List<ComparedColumn> attributes = new ArrayList<ComparedColumn>();
for (int i = 0; i < baseColumns.length; i++)
{
if (i == keyColumn-1)
continue;
// Check for duplicate column names
int prevDuplicateCol = -1;
for (int k = 0; k < i - 1; ++k)
{
if (baseColumns[i].getLabel().equals(baseColumns[k].getLabel()))
prevDuplicateCol = k > keyColumn - 1 ? k - 1 : k; // Adjust for key column
}
int[] indexes = new int[tables.length];
for (int j = 0; j < indexes.length; j++)
{
if (prevDuplicateCol >= 0)
{
// Start search after previous found column
int pc = attributes.get(prevDuplicateCol).getColumnIndexes()[j];
int ci = getColumnIndex(baseColumns[i].getLabel(), tables[j], pc + 1);
// Not found, so duplicate the last column
if (ci == -1)
ci = pc;
indexes[j] = ci;
}
else
{
indexes[j] = getColumnIndex(baseColumns[i].getLabel(), tables[j], 0);
}
}
attributes.add(new ComparedColumn(baseColumns[i], indexes, true));
}
collectExtraRefs();
return foundTree ? new ComparisonResultTree(mergeKeys(null, listener), key, attributes, mode, setOp)
: new ComparisonResultTable(mergeKeys(null, listener), key, attributes, mode, setOp);
}
private int getColumnIndex(String name, IStructuredResult table, int colstart)
{
Column[] columns = table.getColumns();
for (int i = colstart; i < columns.length; i++)
{
if (columns[i].getLabel().equals(name)) return i;
}
return -1;
}
/**
* Calculate extra parts for the key.
* @param table index
* @param row
* @return a String or null
*/
String extraKey(int table, Object row)
{
final String noextra = null;
if (extraReferences == null || extraReferences.length == 0)
return noextra;
if (snapshots[table] == null)
return noextra;
IContextObject ctx = tables[table].getContext(row);
if (ctx == null)
return noextra;
int objId = ctx.getObjectId();
if (objId == -1)
return noextra;
IObject obj;
try
{
obj = snapshots[table].getObject(objId);
}
catch (SnapshotException e)
{
return noextra;
}
StringBuilder sb = new StringBuilder();
for (String s : extraReferences)
{
String p1[] = s.split(":", 2); //$NON-NLS-1$
if (p1.length < 1)
continue;
else if (p1.length < 2)
{
// Just the class name, so resolve just the object
String val = obj.getClassSpecificName();
if (val != null)
{
if (sb.length() > 0)
sb.append(' ');
sb.append(val);
}
continue;
}
try
{
if (obj.getClazz().doesExtend(p1[0]))
{
for (String field : p1[1].split(",")) //$NON-NLS-1$
{
Object o;
try
{
o = obj.resolveValue(field);
}
catch (SnapshotException e)
{
continue;
}
String val;
if (o instanceof IObject)
{
val = ((IObject)o).getClassSpecificName();
}
else if (o != null)
{
val = o.toString();
}
else
{
val = null;
}
if (val != null)
{
if (sb.length() > 0)
sb.append(' ');
sb.append(val);
}
}
}
}
catch (SnapshotException e)
{
}
}
if (sb.length() > 0)
return sb.toString();
return noextra;
}
/**
* Calculate extra prefix for the key.
* Look for the immediate dominator and see if any fields point to this.
* Also do this for small object arrays.
* @param table index
* @param row
* @return a String or null
*/
String extraPrefix(int table, Object row)
{
// Only generate prefixes for small dominator arrays
final int SMALL_ARRAY_SIZE = 512;
final String noextra = null;
if (!addrefs)
return noextra;
if (snapshots[table] == null)
return noextra;
IContextObject ctx = tables[table].getContext(row);
if (ctx == null)
return noextra;
int objId = ctx.getObjectId();
if (objId == -1)
return noextra;
IObject obj;
try
{
obj = snapshots[table].getObject(objId);
}
catch (SnapshotException e)
{
return noextra;
}
StringBuilder sb = new StringBuilder();
try
{
int immdom = snapshots[table].getImmediateDominatorId(obj.getObjectId());
if (immdom >= 0)
{
if (!snapshots[table].isArray(immdom))
{
IObject immobj = snapshots[table].getObject(immdom);
for (NamedReference ref : immobj.getOutboundReferences())
{
if (ref.getObjectId() == objId)
{
if (sb.length() > 0)
sb.append(',');
sb.append(ref.getName());
}
}
}
else
{
if (snapshots[table].getClassOf(immdom).getObjectId() == obj.getObjectId())
sb.append("<class>"); //$NON-NLS-1$
// Big arrays could be expensive to read
if (snapshots[table].getHeapSize(immdom) < SMALL_ARRAY_SIZE)
{
IObject immobj = snapshots[table].getObject(immdom);
// Don't get named references for object array - expensive
if (immobj instanceof IObjectArray)
{
// Arrays can be huge, extracting references could be huge
IObjectArray heapArray = (IObjectArray)immobj;
int length = heapArray.getLength();
int step = 65536;
int maxarray = 1024*1024;
int maxattribute = 1024;
if (length <= maxarray)
{
for (int i = 0; i < length; i += step)
{
long l[] = heapArray.getReferenceArray(i, Math.min(step, length - i));
for (int j = 0; j < l.length; ++j)
{
if (l[j] == obj.getObjectAddress())
{
if (sb.length() > 0)
sb.append(", "); //$NON-NLS-1$
sb.append('[');
sb.append(i + j);
sb.append(']');
if (sb.length() > maxattribute)
{
sb.append(",..."); //$NON-NLS-1$
i = length;
break;
}
}
}
}
}
}
}
}
}
}
catch (SnapshotException e1)
{
}
if (sb.length() > 0)
return sb.toString();
return noextra;
}
/**
* Collect the extra type+field references.
*/
void collectExtraRefs() throws IOException
{
// extra key refs
// read the file (if any)
String[] fromFile = getLinesFromFile();
if (fromFile != null && fromFile.length > 0)
{
if (extraReferences != null)
{
// merge from file and manually entered entries
String[] tmp = new String[fromFile.length + extraReferences.length];
System.arraycopy(fromFile, 0, tmp, 0, fromFile.length);
System.arraycopy(extraReferences, 0, tmp, fromFile.length, extraReferences.length);
extraReferences = tmp;
}
else
{
extraReferences = fromFile;
}
}
}
/**
* Read from a file.
* @return
* @throws IOException
*/
private String[] getLinesFromFile() throws IOException
{
if (extraReferencesListFile == null)
return null;
BufferedReader in = null;
List<String> result = new ArrayList<String>();
try
{
in = new BufferedReader(new FileReader(extraReferencesListFile));
String line = null;
while ((line = in.readLine()) != null)
{
result.add(line);
}
}
finally
{
if (in != null)
{
in.close();
}
}
return result.toArray(new String[0]);
}
/**
* Hold a place for a row when the key is a duplicate.
*/
static class PlaceHolder
{
Object key;
int pos;
PlaceHolder(Object key, int pos)
{
this.key = key;
this.pos = pos;
}
}
private List<ComparedRow> mergeKeys(ComparedRow parent, IProgressListener listener)
{
SimpleMonitor sm = new SimpleMonitor(Messages.CompareTablesQuery_Comparing, listener, new int[] {60,30,10});
Map<Object, Object[]> map = new LinkedHashMap<Object, Object[]>();
int sizes[] = new int[tables.length];
// Only get elements once
List<?>elements[] = new List<?>[tables.length];
// Calculate the total number of rows
int totalsize = 0;
for (int i = 0; i < tables.length; i++)
{
IStructuredResult table = tables[i];
int size;
if (table instanceof IResultTable)
{
if (parent == null)
size = ((IResultTable)table).getRowCount();
else
size = 0;
}
else if (table instanceof IResultTree)
{
if (parent == null)
{
elements[i] = ((IResultTree)table).getElements();
size = elements[i].size();
}
else
{
Object treerow = parent.getRows()[i];
if (treerow != null && ((IResultTree)table).hasChildren(treerow))
{
elements[i] = ((IResultTree)table).getChildren(treerow);
size = elements[i].size();
}
else
{
size = 0;
}
}
}
else
{
size = 0;
}
sizes[i] = size;
totalsize += size;
// For overflow
if (totalsize < 0)
totalsize = Integer.MAX_VALUE;
}
listener = sm.nextMonitor();
listener.beginTask(Messages.CompareTablesQuery_Initial, totalsize);
long sortwork = 0;
for (int i = 0; i < tables.length; i++)
{
listener.subTask(MessageUtil.format(Messages.CompareTablesQuery_InitialComparisonForTable, i + 1));
IStructuredResult table = tables[i];
int size = sizes[i];
List<?>treeRows;
if (table instanceof IResultTree)
{
treeRows = elements[i];
}
else
{
treeRows = null;
}
Map<Object, Integer>lastcache = new HashMap<Object,Integer>();
for (int j = 0; j < size; j++)
{
Object row;
if (table instanceof IResultTable)
{
row = ((IResultTable)table).getRow(j);
}
else if (table instanceof IResultTree)
{
row = treeRows.get(j);
}
else
{
row = null;
}
Object key = table.getColumnValue(row, keyColumn-1);
key = modifyKey(i, row, key);
Object[] rows = map.get(key);
if (rows == null)
{
rows = new Object[tables.length];
map.put(key, rows);
}
int ii = 0;
if (lastcache.containsKey(key))
{
ii = lastcache.get(key);
}
while (rows[ii + i] != null)
{
/*
* Normally:
* rows[rowTable1, rowTableb]
* With duplicate keys from one Table we extend the array
* rows[rowTable1, rowTable2, rowTable1v2, rowTable2v2, rowTable1v3, null]
* etc.
* and later convert to multiple rows
*/
ii += tables.length;
if (ii >= rows.length)
{
sortwork -= rows.length * rows.length;
// Grow the row array
int spare = rows.length / tables.length / 2;
rows = Arrays.copyOf(rows, rows.length + (spare + 1) * tables.length);
map.put(key, rows);
sortwork += rows.length * rows.length;
}
}
rows[ii + i] = row;
if (ii > 0)
{
// With many duplicates it can take a long time to find a free slot, so cache the last used
lastcache.put(key, ii);
// Add a placeholder so that a row goes here
map.put(new PlaceHolder(key, ii), new Object[0]);
}
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
listener.worked(1);
}
}
listener.done();
listener = sm.nextMonitor();
listener.beginTask(Messages.CompareTablesQuery_Initial, totalsize);
// Match up duplicate keys
for (Map.Entry<Object, Object[]> entry : map.entrySet())
{
Object rows[] = entry.getValue();
if (rows.length > tables.length)
{
listener.subTask(MessageUtil.format(Messages.CompareTablesQuery_ResolvingDuplicateKey, entry.getKey()));
// Duplicated key, so expand to separate rows
sortRows(rows);
// Guess n-squared work
listener.worked((int)(totalsize * (long)rows.length * rows.length / sortwork));
}
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
}
listener.done();
listener = sm.nextMonitor();
listener.beginTask(Messages.CompareTablesQuery_BuildingResult, totalsize);
List<ComparedRow> result = new ArrayList<ComparedRow>(map.size());
for (Map.Entry<Object, Object[]> entry : map.entrySet())
{
Object key = entry.getKey();
Object rows[] = entry.getValue();
if (key instanceof PlaceHolder)
{
// A subsequent duplicated key
PlaceHolder ph = (PlaceHolder)key;
// Find the real, sorted row list
rows = map.get(ph.key);
// Extract the appropriate part
Object rows1[] = Arrays.copyOfRange(rows, ph.pos, ph.pos + tables.length);
result.add(new ComparedRow(ph.key, rows1));
}
else if (rows.length <= tables.length)
result.add(new ComparedRow(entry.getKey(), entry.getValue()));
else
{
// Duplicated key, but this is the first record
Object rows1[] = Arrays.copyOfRange(rows, 0, tables.length);
result.add(new ComparedRow(entry.getKey(), rows1));
}
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
listener.worked(1);
}
listener.done();
return result;
}
private Object modifyKey(int i, Object row, Object key)
{
String extrakey = extraKey(i, row);
if (extrakey != null)
{
key = key + " " + extrakey; //$NON-NLS-1$
}
if (mask != null && key != null)
{
String keystr = key.toString();
String keystr2 = mask.matcher(keystr).replaceAll(replace == null ? "" : replace); //$NON-NLS-1$
if (!keystr.equals(keystr2))
{
key = keystr2;
}
}
// Fix up decoration
if (prefix || suffix)
{
Column c = tables[i].getColumns()[keyColumn - 1];
IDecorator id = c.getDecorator();
String pfx;
if (prefix)
{
if (id != null)
{
pfx = id.prefix(row);
if (pfx == null)
pfx = extraPrefix(i, row);
}
else
{
pfx = extraPrefix(i, row);
}
}
else
{
pfx = null;
}
String sfx = suffix && id != null ? id.suffix(row) : null;
if (mask != null && pfx != null)
{
pfx = mask.matcher(pfx).replaceAll(replace == null ? "" : replace); //$NON-NLS-1$
if (pfx.length() == 0)
pfx = null;
}
if (mask != null && sfx != null)
{
sfx = mask.matcher(sfx).replaceAll(replace == null ? "" : replace); //$NON-NLS-1$
if (sfx.length() == 0)
sfx = null;
}
if (pfx != null || sfx != null)
key = new ComparedRow(pfx, key, sfx, null);
}
return key;
}
/**
* See if two rows from two tables match.
* Do a bit more matching via IContextObject.
* Match via context object ID or address.
* @param table1 index
* @param row1
* @param table2 index
* @param row2
* @param matchType - the higher the number the more likely a match
* @return true if they seem the same
*/
boolean rowMatches(int table1, Object row1, int table2, Object row2, int matchType)
{
IContextObject ctx1 = tables[table1].getContext(row1);
IContextObject ctx2 = tables[table2].getContext(row2);
if (ctx1 == null && ctx2 == null)
return true;
if (ctx1 == null || ctx2 == null)
return false;
int objectId1 = ctx1.getObjectId();
int objectId2 = ctx2.getObjectId();
if (sameSnapshot[table1] && sameSnapshot[table2] ||
snapshots[table1].equals(snapshots[table2]))
{
//System.out.println("compare "+ctx1.getObjectId() +" "+ ctx2.getObjectId());
return objectId1 == objectId2;
}
if (objectId1 == -1 && objectId2 == -1)
return true;
if (objectId1 == -1 || objectId2 == -1)
return false;
try
{
long addr1 = snapshots[table1].mapIdToAddress(objectId1);
long addr2 = snapshots[table2].mapIdToAddress(objectId2);
// Address match, guess the same?
if (addr1 == addr2)
return true;
// Classes don't match, so different
if (!snapshots[table1].getClassOf(objectId1).getName().equals(snapshots[table2].getClassOf(objectId2).getName()))
return false;
if (matchType >= 1)
{
// Guess match on retained size, presuming it retains more than itself!
if (snapshots[table1].getRetainedHeapSize(objectId1) > snapshots[table1].getHeapSize(1)
&& snapshots[table1].getRetainedHeapSize(objectId1) == snapshots[table2]
.getRetainedHeapSize(objectId2))
return true;
}
// Don't compare using getClassSpecificName() as this could be done
// on the key
if (matchType >= 2)
{
String val1 = snapshots[table1].getObject(objectId1).getClassSpecificName();
String val2 = snapshots[table1].getObject(objectId1).getClassSpecificName();
if (val1 != null && val1.equals(val2))
return true;
}
return false;
}
catch (SnapshotException e)
{
return false;
}
}
/**
* Try to match rows from different tables. Have definite matches in same
* row. Unmatched can be anywhere.
*
* <pre>
* A2=B3,A2=C1,A3=B5,A4=C2
* [A1,B1,C1,A2,B2,C2,A3,B3,null,A4,B4,null,null,B5,null]
* A1 B1 C1
* A2 B2 C2
* A3 B3
* A4 B4
* B5
* </pre>
*
* Goes to:
*
* <pre>
* A1 B1
* A2 B3 C1
* A3 B5
* A4 B2 C2
* B4
* </pre>
* <ol>
* <li>find first match of B[1]..B[5] with A[1] and put in first slot (&
* shift others up)</li>
* <li>find next match of B[2]..B[5] in with A[2] and put in second slot (&
* shift others up)</li>
* <li>..</li>
* <li>find first match of C[1]..C[2] with A[1] and put in first slot (&
* shift others up)</li>
* <li>if no match find first match of C[1]..C[2] with B[1] and put in first
* slot (& shift others up)</li>
* <li>if no match find first match of C[2]..C[2] with A[2] and put in first
* slot (& shift others up)</li>
* </ol>
* Not perfect though:
*
* <pre>
* 1 1 2
* 2 3 5
* 3 5
* 4
* </pre>
*
* gives
*
* <pre>
* 1 1 5
* 2 5 2
* 3 3
* 4
* </pre>
*
* not
*
* <pre>
* 1 1
* 2 2
* 3 3
* 4 5 5
* </pre>
* Try a second pass to fix up those.
* @param rows
*/
void sortRows(Object rows[])
{
int rn = rows.length;
int tn = tables.length;
int n = rn / tn;
Object queue[] = new Object[n];
// This entry is matched to another table
boolean matched[] = new boolean[rows.length];
//System.out.println("Sorting " + n);
// Consider each table other than the first
for (int i = 1; i < tn; ++i)
{
// Distribute this table to matching slots
// Fill the queue
int q1 = 0, q2 = 0;
for (int l = 0; l < n; ++l)
{
Object o = rows[l * tn + i];
if (o != null)
{
queue[q2++] = o;
rows[l * tn + i] = null;
}
}
// We don't need to clear the remainder of the queue
// Matching slot in preceding table
slot: for (int j = 0; j < n; ++j)
{
// System.out.println("Slot "+i+":"+j);
for (int pass = 0; pass < 2; ++pass)
{
// Choose preceding table
for (int k = 0; k < i; ++k)
{
// Preceding value
Object rowPrev = rows[j * tn + k];
if (rowPrev == null)
continue;
// Matching preceding tables
// Choose entry from the queue
for (int l = q1; l < q2; ++l)
{
Object rowThis = queue[l];
if (rowThis == null)
{
// Optimization - adjust the queue limit
if (l == q1)
++q1;
continue;
}
//System.out.println("Comparing " + i + ":" + l + " to " + k + ":" + j);
if (rowMatches(i, rowThis, k, rowPrev, pass))
{
//System.out.println("Matched " + i + ":" + l + " to " + k + ":" + j);
matched[j * tn + i] = true;
matched[j * tn + k] = true;
rows[j * tn + i] = rowThis;
// stop reuse
queue[l] = null;
// optimization: last queue entry, so avoid looking here again
if (l == q2 - 1)
--q2;
continue slot;
}
}
}
}
// Say this slot might need to be filled later
rows[j * tn + i] = null;
}
// Distribute the unused
for (int l = 0, lq = q1; l < n && lq < q2; ++l)
{
// Read slot
Object o = rows[l * tn + i];
if (o == null)
{
// Read unused element from queue
while (lq < q2)
{
Object q = queue[lq++];
if (q != null)
{
// and fill the slot
rows[l * tn + i] = q;
break;
}
}
}
}
}
// Try some polishing of the result
// Consider each table other than the first
for (int i = 1; i < tn; ++i)
{
// Matching slot in preceding table
for (int j = 0; j < n; ++j)
{
for (int pass = 0; pass < 2; ++pass)
{
// Choose preceding table
for (int k = 0; k < i; ++k)
{
if (matched[j * tn + k])
continue;
// Preceding value
Object rowPrev = rows[j * tn + k];
if (rowPrev == null)
continue;
for (int l = 0; l < n; ++l)
{
if (matched[l * tn + i])
continue;
Object rowThis = rows[l * tn + i];
if (rowThis == null)
continue;
if (rowMatches(i, rowThis, k, rowPrev, 0))
{
// System.out.println("extra match " + i + ":" + l + " " + k + ":" + j);
// Find a corresponding free slot in both tables
for (int m = 0; m < n; ++m)
{