forked from golang/go
/
poset.go
1192 lines (1063 loc) · 32.4 KB
/
poset.go
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 2018 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package ssa
import (
"errors"
"fmt"
"os"
)
const uintSize = 32 << (^uint(0) >> 32 & 1) // 32 or 64
// bitset is a bit array for dense indexes.
type bitset []uint
func newBitset(n int) bitset {
return make(bitset, (n+uintSize-1)/uintSize)
}
func (bs bitset) Reset() {
for i := range bs {
bs[i] = 0
}
}
func (bs bitset) Set(idx uint32) {
bs[idx/uintSize] |= 1 << (idx % uintSize)
}
func (bs bitset) Clear(idx uint32) {
bs[idx/uintSize] &^= 1 << (idx % uintSize)
}
func (bs bitset) Test(idx uint32) bool {
return bs[idx/uintSize]&(1<<(idx%uintSize)) != 0
}
type undoType uint8
const (
undoInvalid undoType = iota
undoCheckpoint // a checkpoint to group undo passes
undoSetChl // change back left child of undo.idx to undo.edge
undoSetChr // change back right child of undo.idx to undo.edge
undoNonEqual // forget that SSA value undo.ID is non-equal to undo.idx (another ID)
undoNewNode // remove new node created for SSA value undo.ID
undoAliasNode // unalias SSA value undo.ID so that it points back to node index undo.idx
undoNewRoot // remove node undo.idx from root list
undoChangeRoot // remove node undo.idx from root list, and put back undo.edge.Target instead
undoMergeRoot // remove node undo.idx from root list, and put back its children instead
)
// posetUndo represents an undo pass to be performed.
// It's an union of fields that can be used to store information,
// and typ is the discriminant, that specifies which kind
// of operation must be performed. Not all fields are always used.
type posetUndo struct {
typ undoType
idx uint32
ID ID
edge posetEdge
}
const (
// Make poset handle constants as unsigned numbers.
posetFlagUnsigned = 1 << iota
)
// A poset edge. The zero value is the null/empty edge.
// Packs target node index (31 bits) and strict flag (1 bit).
type posetEdge uint32
func newedge(t uint32, strict bool) posetEdge {
s := uint32(0)
if strict {
s = 1
}
return posetEdge(t<<1 | s)
}
func (e posetEdge) Target() uint32 { return uint32(e) >> 1 }
func (e posetEdge) Strict() bool { return uint32(e)&1 != 0 }
func (e posetEdge) String() string {
s := fmt.Sprint(e.Target())
if e.Strict() {
s += "*"
}
return s
}
// posetNode is a node of a DAG within the poset.
type posetNode struct {
l, r posetEdge
}
// poset is a union-find data structure that can represent a partially ordered set
// of SSA values. Given a binary relation that creates a partial order (eg: '<'),
// clients can record relations between SSA values using SetOrder, and later
// check relations (in the transitive closure) with Ordered. For instance,
// if SetOrder is called to record that A<B and B<C, Ordered will later confirm
// that A<C.
//
// It is possible to record equality relations between SSA values with SetEqual and check
// equality with Equal. Equality propagates into the transitive closure for the partial
// order so that if we know that A<B<C and later learn that A==D, Ordered will return
// true for D<C.
//
// poset will refuse to record new relations that contradict existing relations:
// for instance if A<B<C, calling SetOrder for C<A will fail returning false; also
// calling SetEqual for C==A will fail.
//
// It is also possible to record inequality relations between nodes with SetNonEqual;
// given that non-equality is not transitive, the only effect is that a later call
// to SetEqual for the same values will fail. NonEqual checks whether it is known that
// the nodes are different, either because SetNonEqual was called before, or because
// we know that they are strictly ordered.
//
// It is implemented as a forest of DAGs; in each DAG, if node A dominates B,
// it means that A<B. Equality is represented by mapping two SSA values to the same
// DAG node; when a new equality relation is recorded between two existing nodes,
// the nodes are merged, adjusting incoming and outgoing edges.
//
// Constants are specially treated. When a constant is added to the poset, it is
// immediately linked to other constants already present; so for instance if the
// poset knows that x<=3, and then x is tested against 5, 5 is first added and linked
// 3 (using 3<5), so that the poset knows that x<=3<5; at that point, it is able
// to answer x<5 correctly.
//
// poset is designed to be memory efficient and do little allocations during normal usage.
// Most internal data structures are pre-allocated and flat, so for instance adding a
// new relation does not cause any allocation. For performance reasons,
// each node has only up to two outgoing edges (like a binary tree), so intermediate
// "dummy" nodes are required to represent more than two relations. For instance,
// to record that A<I, A<J, A<K (with no known relation between I,J,K), we create the
// following DAG:
//
// A
// / \
// I dummy
// / \
// J K
//
type poset struct {
lastidx uint32 // last generated dense index
flags uint8 // internal flags
values map[ID]uint32 // map SSA values to dense indexes
constants []*Value // record SSA constants together with their value
nodes []posetNode // nodes (in all DAGs)
roots []uint32 // list of root nodes (forest)
noneq map[ID]bitset // non-equal relations
undo []posetUndo // undo chain
}
func newPoset() *poset {
return &poset{
values: make(map[ID]uint32),
constants: make([]*Value, 0, 8),
nodes: make([]posetNode, 1, 16),
roots: make([]uint32, 0, 4),
noneq: make(map[ID]bitset),
undo: make([]posetUndo, 0, 4),
}
}
func (po *poset) SetUnsigned(uns bool) {
if uns {
po.flags |= posetFlagUnsigned
} else {
po.flags &^= posetFlagUnsigned
}
}
// Handle children
func (po *poset) setchl(i uint32, l posetEdge) { po.nodes[i].l = l }
func (po *poset) setchr(i uint32, r posetEdge) { po.nodes[i].r = r }
func (po *poset) chl(i uint32) uint32 { return po.nodes[i].l.Target() }
func (po *poset) chr(i uint32) uint32 { return po.nodes[i].r.Target() }
func (po *poset) children(i uint32) (posetEdge, posetEdge) {
return po.nodes[i].l, po.nodes[i].r
}
// upush records a new undo step. It can be used for simple
// undo passes that record up to one index and one edge.
func (po *poset) upush(typ undoType, p uint32, e posetEdge) {
po.undo = append(po.undo, posetUndo{typ: typ, idx: p, edge: e})
}
// upushnew pushes an undo pass for a new node
func (po *poset) upushnew(id ID, idx uint32) {
po.undo = append(po.undo, posetUndo{typ: undoNewNode, ID: id, idx: idx})
}
// upushneq pushes a new undo pass for a nonequal relation
func (po *poset) upushneq(id1 ID, id2 ID) {
po.undo = append(po.undo, posetUndo{typ: undoNonEqual, ID: id1, idx: uint32(id2)})
}
// upushalias pushes a new undo pass for aliasing two nodes
func (po *poset) upushalias(id ID, i2 uint32) {
po.undo = append(po.undo, posetUndo{typ: undoAliasNode, ID: id, idx: i2})
}
// addchild adds i2 as direct child of i1.
func (po *poset) addchild(i1, i2 uint32, strict bool) {
i1l, i1r := po.children(i1)
e2 := newedge(i2, strict)
if i1l == 0 {
po.setchl(i1, e2)
po.upush(undoSetChl, i1, 0)
} else if i1r == 0 {
po.setchr(i1, e2)
po.upush(undoSetChr, i1, 0)
} else {
// If n1 already has two children, add an intermediate dummy
// node to record the relation correctly (without relating
// n2 to other existing nodes). Use a non-deterministic value
// to decide whether to append on the left or the right, to avoid
// creating degenerated chains.
//
// n1
// / \
// i1l dummy
// / \
// i1r n2
//
dummy := po.newnode(nil)
if (i1^i2)&1 != 0 { // non-deterministic
po.setchl(dummy, i1r)
po.setchr(dummy, e2)
po.setchr(i1, newedge(dummy, false))
po.upush(undoSetChr, i1, i1r)
} else {
po.setchl(dummy, i1l)
po.setchr(dummy, e2)
po.setchl(i1, newedge(dummy, false))
po.upush(undoSetChl, i1, i1l)
}
}
}
// newnode allocates a new node bound to SSA value n.
// If n is nil, this is a dummy node (= only used internally).
func (po *poset) newnode(n *Value) uint32 {
i := po.lastidx + 1
po.lastidx++
po.nodes = append(po.nodes, posetNode{})
if n != nil {
if po.values[n.ID] != 0 {
panic("newnode for Value already inserted")
}
po.values[n.ID] = i
po.upushnew(n.ID, i)
} else {
po.upushnew(0, i)
}
return i
}
// lookup searches for a SSA value into the forest of DAGS, and return its node.
// Constants are materialized on the fly during lookup.
func (po *poset) lookup(n *Value) (uint32, bool) {
i, f := po.values[n.ID]
if !f && n.isGenericIntConst() {
po.newconst(n)
i, f = po.values[n.ID]
}
return i, f
}
// newconst creates a node for a constant. It links it to other constants, so
// that n<=5 is detected true when n<=3 is known to be true.
// TODO: this is O(N), fix it.
func (po *poset) newconst(n *Value) {
if !n.isGenericIntConst() {
panic("newconst on non-constant")
}
// If this is the first constant, put it into a new root, as
// we can't record an existing connection so we don't have
// a specific DAG to add it to.
if len(po.constants) == 0 {
i := po.newnode(n)
po.roots = append(po.roots, i)
po.upush(undoNewRoot, i, 0)
po.constants = append(po.constants, n)
return
}
// Find the lower and upper bound among existing constants. That is,
// find the higher constant that is lower than the one that we're adding,
// and the lower constant that is higher.
// The loop is duplicated to handle signed and unsigned comparison,
// depending on how the poset was configured.
var lowerptr, higherptr *Value
if po.flags&posetFlagUnsigned != 0 {
var lower, higher uint64
val1 := n.AuxUnsigned()
for _, ptr := range po.constants {
val2 := ptr.AuxUnsigned()
if val1 == val2 {
po.aliasnode(ptr, n)
return
}
if val2 < val1 && (lowerptr == nil || val2 > lower) {
lower = val2
lowerptr = ptr
} else if val2 > val1 && (higherptr == nil || val2 < higher) {
higher = val2
higherptr = ptr
}
}
} else {
var lower, higher int64
val1 := n.AuxInt
for _, ptr := range po.constants {
val2 := ptr.AuxInt
if val1 == val2 {
po.aliasnode(ptr, n)
return
}
if val2 < val1 && (lowerptr == nil || val2 > lower) {
lower = val2
lowerptr = ptr
} else if val2 > val1 && (higherptr == nil || val2 < higher) {
higher = val2
higherptr = ptr
}
}
}
if lowerptr == nil && higherptr == nil {
// This should not happen, as at least one
// other constant must exist if we get here.
panic("no constant found")
}
// Create the new node and connect it to the bounds, so that
// lower < n < higher. We could have found both bounds or only one
// of them, depending on what other constants are present in the poset.
// Notice that we always link constants together, so they
// are always part of the same DAG.
i := po.newnode(n)
switch {
case lowerptr != nil && higherptr != nil:
// Both bounds are present, record lower < n < higher.
po.addchild(po.values[lowerptr.ID], i, true)
po.addchild(i, po.values[higherptr.ID], true)
case lowerptr != nil:
// Lower bound only, record lower < n.
po.addchild(po.values[lowerptr.ID], i, true)
case higherptr != nil:
// Higher bound only. To record n < higher, we need
// a dummy root:
//
// dummy
// / \
// root \
// / n
// .... /
// \ /
// higher
//
i2 := po.values[higherptr.ID]
r2 := po.findroot(i2)
dummy := po.newnode(nil)
po.changeroot(r2, dummy)
po.upush(undoChangeRoot, dummy, newedge(r2, false))
po.addchild(dummy, r2, false)
po.addchild(dummy, i, false)
po.addchild(i, i2, true)
}
po.constants = append(po.constants, n)
}
// aliasnode records that n2 is an alias of n1
func (po *poset) aliasnode(n1, n2 *Value) {
i1 := po.values[n1.ID]
if i1 == 0 {
panic("aliasnode for non-existing node")
}
i2 := po.values[n2.ID]
if i2 != 0 {
// Rename all references to i2 into i1
// (do not touch i1 itself, otherwise we can create useless self-loops)
for idx, n := range po.nodes {
if uint32(idx) != i1 {
l, r := n.l, n.r
if l.Target() == i2 {
po.setchl(uint32(idx), newedge(i1, l.Strict()))
po.upush(undoSetChl, uint32(idx), l)
}
if r.Target() == i2 {
po.setchr(uint32(idx), newedge(i1, r.Strict()))
po.upush(undoSetChr, uint32(idx), r)
}
}
}
// Reassign all existing IDs that point to i2 to i1.
// This includes n2.ID.
for k, v := range po.values {
if v == i2 {
po.values[k] = i1
po.upushalias(k, i2)
}
}
} else {
// n2.ID wasn't seen before, so record it as alias to i1
po.values[n2.ID] = i1
po.upushalias(n2.ID, 0)
}
}
func (po *poset) isroot(r uint32) bool {
for i := range po.roots {
if po.roots[i] == r {
return true
}
}
return false
}
func (po *poset) changeroot(oldr, newr uint32) {
for i := range po.roots {
if po.roots[i] == oldr {
po.roots[i] = newr
return
}
}
panic("changeroot on non-root")
}
func (po *poset) removeroot(r uint32) {
for i := range po.roots {
if po.roots[i] == r {
po.roots = append(po.roots[:i], po.roots[i+1:]...)
return
}
}
panic("removeroot on non-root")
}
// dfs performs a depth-first search within the DAG whose root is r.
// f is the visit function called for each node; if it returns true,
// the search is aborted and true is returned. The root node is
// visited too.
// If strict, ignore edges across a path until at least one
// strict edge is found. For instance, for a chain A<=B<=C<D<=E<F,
// a strict walk visits D,E,F.
// If the visit ends, false is returned.
func (po *poset) dfs(r uint32, strict bool, f func(i uint32) bool) bool {
closed := newBitset(int(po.lastidx + 1))
open := make([]uint32, 1, 64)
open[0] = r
if strict {
// Do a first DFS; walk all paths and stop when we find a strict
// edge, building a "next" list of nodes reachable through strict
// edges. This will be the bootstrap open list for the real DFS.
next := make([]uint32, 0, 64)
for len(open) > 0 {
i := open[len(open)-1]
open = open[:len(open)-1]
// Don't visit the same node twice. Notice that all nodes
// across non-strict paths are still visited at least once, so
// a non-strict path can never obscure a strict path to the
// same node.
if !closed.Test(i) {
closed.Set(i)
l, r := po.children(i)
if l != 0 {
if l.Strict() {
next = append(next, l.Target())
} else {
open = append(open, l.Target())
}
}
if r != 0 {
if r.Strict() {
next = append(next, r.Target())
} else {
open = append(open, r.Target())
}
}
}
}
open = next
closed.Reset()
}
for len(open) > 0 {
i := open[len(open)-1]
open = open[:len(open)-1]
if !closed.Test(i) {
if f(i) {
return true
}
closed.Set(i)
l, r := po.children(i)
if l != 0 {
open = append(open, l.Target())
}
if r != 0 {
open = append(open, r.Target())
}
}
}
return false
}
// Returns true if i1 dominates i2.
// If strict == true: if the function returns true, then i1 < i2.
// If strict == false: if the function returns true, then i1 <= i2.
// If the function returns false, no relation is known.
func (po *poset) dominates(i1, i2 uint32, strict bool) bool {
return po.dfs(i1, strict, func(n uint32) bool {
return n == i2
})
}
// findroot finds i's root, that is which DAG contains i.
// Returns the root; if i is itself a root, it is returned.
// Panic if i is not in any DAG.
func (po *poset) findroot(i uint32) uint32 {
// TODO(rasky): if needed, a way to speed up this search is
// storing a bitset for each root using it as a mini bloom filter
// of nodes present under that root.
for _, r := range po.roots {
if po.dominates(r, i, false) {
return r
}
}
panic("findroot didn't find any root")
}
// mergeroot merges two DAGs into one DAG by creating a new dummy root
func (po *poset) mergeroot(r1, r2 uint32) uint32 {
r := po.newnode(nil)
po.setchl(r, newedge(r1, false))
po.setchr(r, newedge(r2, false))
po.changeroot(r1, r)
po.removeroot(r2)
po.upush(undoMergeRoot, r, 0)
return r
}
// collapsepath marks i1 and i2 as equal and collapses as equal all
// nodes across all paths between i1 and i2. If a strict edge is
// found, the function does not modify the DAG and returns false.
func (po *poset) collapsepath(n1, n2 *Value) bool {
i1, i2 := po.values[n1.ID], po.values[n2.ID]
if po.dominates(i1, i2, true) {
return false
}
// TODO: for now, only handle the simple case of i2 being child of i1
l, r := po.children(i1)
if l.Target() == i2 || r.Target() == i2 {
po.aliasnode(n1, n2)
po.addchild(i1, i2, false)
return true
}
return true
}
// Check whether it is recorded that id1!=id2
func (po *poset) isnoneq(id1, id2 ID) bool {
if id1 < id2 {
id1, id2 = id2, id1
}
// Check if we recorded a non-equal relation before
if bs, ok := po.noneq[id1]; ok && bs.Test(uint32(id2)) {
return true
}
return false
}
// Record that id1!=id2
func (po *poset) setnoneq(id1, id2 ID) {
if id1 < id2 {
id1, id2 = id2, id1
}
bs := po.noneq[id1]
if bs == nil {
// Given that we record non-equality relations using the
// higher ID as a key, the bitsize will never change size.
// TODO(rasky): if memory is a problem, consider allocating
// a small bitset and lazily grow it when higher IDs arrive.
bs = newBitset(int(id1))
po.noneq[id1] = bs
} else if bs.Test(uint32(id2)) {
// Already recorded
return
}
bs.Set(uint32(id2))
po.upushneq(id1, id2)
}
// CheckIntegrity verifies internal integrity of a poset. It is intended
// for debugging purposes.
func (po *poset) CheckIntegrity() (err error) {
// Record which index is a constant
constants := newBitset(int(po.lastidx + 1))
for _, c := range po.constants {
if idx, ok := po.values[c.ID]; !ok {
err = errors.New("node missing for constant")
return err
} else {
constants.Set(idx)
}
}
// Verify that each node appears in a single DAG, and that
// all constants are within the same DAG
var croot uint32
seen := newBitset(int(po.lastidx + 1))
for _, r := range po.roots {
if r == 0 {
err = errors.New("empty root")
return
}
po.dfs(r, false, func(i uint32) bool {
if seen.Test(i) {
err = errors.New("duplicate node")
return true
}
seen.Set(i)
if constants.Test(i) {
if croot == 0 {
croot = r
} else if croot != r {
err = errors.New("constants are in different DAGs")
return true
}
}
return false
})
if err != nil {
return
}
}
// Verify that values contain the minimum set
for id, idx := range po.values {
if !seen.Test(idx) {
err = fmt.Errorf("spurious value [%d]=%d", id, idx)
return
}
}
// Verify that only existing nodes have non-zero children
for i, n := range po.nodes {
if n.l|n.r != 0 {
if !seen.Test(uint32(i)) {
err = fmt.Errorf("children of unknown node %d->%v", i, n)
return
}
if n.l.Target() == uint32(i) || n.r.Target() == uint32(i) {
err = fmt.Errorf("self-loop on node %d", i)
return
}
}
}
return
}
// CheckEmpty checks that a poset is completely empty.
// It can be used for debugging purposes, as a poset is supposed to
// be empty after it's fully rolled back through Undo.
func (po *poset) CheckEmpty() error {
if len(po.nodes) != 1 {
return fmt.Errorf("non-empty nodes list: %v", po.nodes)
}
if len(po.values) != 0 {
return fmt.Errorf("non-empty value map: %v", po.values)
}
if len(po.roots) != 0 {
return fmt.Errorf("non-empty root list: %v", po.roots)
}
if len(po.constants) != 0 {
return fmt.Errorf("non-empty constants: %v", po.constants)
}
if len(po.undo) != 0 {
return fmt.Errorf("non-empty undo list: %v", po.undo)
}
if po.lastidx != 0 {
return fmt.Errorf("lastidx index is not zero: %v", po.lastidx)
}
for _, bs := range po.noneq {
for _, x := range bs {
if x != 0 {
return fmt.Errorf("non-empty noneq map")
}
}
}
return nil
}
// DotDump dumps the poset in graphviz format to file fn, with the specified title.
func (po *poset) DotDump(fn string, title string) error {
f, err := os.Create(fn)
if err != nil {
return err
}
defer f.Close()
// Create reverse index mapping (taking aliases into account)
names := make(map[uint32]string)
for id, i := range po.values {
s := names[i]
if s == "" {
s = fmt.Sprintf("v%d", id)
} else {
s += fmt.Sprintf(", v%d", id)
}
names[i] = s
}
// Create constant mapping
consts := make(map[uint32]int64)
for _, v := range po.constants {
idx := po.values[v.ID]
if po.flags&posetFlagUnsigned != 0 {
consts[idx] = int64(v.AuxUnsigned())
} else {
consts[idx] = v.AuxInt
}
}
fmt.Fprintf(f, "digraph poset {\n")
fmt.Fprintf(f, "\tedge [ fontsize=10 ]\n")
for ridx, r := range po.roots {
fmt.Fprintf(f, "\tsubgraph root%d {\n", ridx)
po.dfs(r, false, func(i uint32) bool {
if val, ok := consts[i]; ok {
// Constant
var vals string
if po.flags&posetFlagUnsigned != 0 {
vals = fmt.Sprint(uint64(val))
} else {
vals = fmt.Sprint(int64(val))
}
fmt.Fprintf(f, "\t\tnode%d [shape=box style=filled fillcolor=cadetblue1 label=<%s <font point-size=\"6\">%s [%d]</font>>]\n",
i, vals, names[i], i)
} else {
// Normal SSA value
fmt.Fprintf(f, "\t\tnode%d [label=<%s <font point-size=\"6\">[%d]</font>>]\n", i, names[i], i)
}
chl, chr := po.children(i)
for _, ch := range []posetEdge{chl, chr} {
if ch != 0 {
if ch.Strict() {
fmt.Fprintf(f, "\t\tnode%d -> node%d [label=\" <\" color=\"red\"]\n", i, ch.Target())
} else {
fmt.Fprintf(f, "\t\tnode%d -> node%d [label=\" <=\" color=\"green\"]\n", i, ch.Target())
}
}
}
return false
})
fmt.Fprintf(f, "\t}\n")
}
fmt.Fprintf(f, "\tlabelloc=\"t\"\n")
fmt.Fprintf(f, "\tlabeldistance=\"3.0\"\n")
fmt.Fprintf(f, "\tlabel=%q\n", title)
fmt.Fprintf(f, "}\n")
return nil
}
// Ordered reports whether n1<n2. It returns false either when it is
// certain that n1<n2 is false, or if there is not enough information
// to tell.
// Complexity is O(n).
func (po *poset) Ordered(n1, n2 *Value) bool {
if n1.ID == n2.ID {
panic("should not call Ordered with n1==n2")
}
i1, f1 := po.lookup(n1)
i2, f2 := po.lookup(n2)
if !f1 || !f2 {
return false
}
return i1 != i2 && po.dominates(i1, i2, true)
}
// Ordered reports whether n1<=n2. It returns false either when it is
// certain that n1<=n2 is false, or if there is not enough information
// to tell.
// Complexity is O(n).
func (po *poset) OrderedOrEqual(n1, n2 *Value) bool {
if n1.ID == n2.ID {
panic("should not call Ordered with n1==n2")
}
i1, f1 := po.lookup(n1)
i2, f2 := po.lookup(n2)
if !f1 || !f2 {
return false
}
return i1 == i2 || po.dominates(i1, i2, false) ||
(po.dominates(i2, i1, false) && !po.dominates(i2, i1, true))
}
// Equal reports whether n1==n2. It returns false either when it is
// certain that n1==n2 is false, or if there is not enough information
// to tell.
// Complexity is O(1).
func (po *poset) Equal(n1, n2 *Value) bool {
if n1.ID == n2.ID {
panic("should not call Equal with n1==n2")
}
i1, f1 := po.lookup(n1)
i2, f2 := po.lookup(n2)
return f1 && f2 && i1 == i2
}
// NonEqual reports whether n1!=n2. It returns false either when it is
// certain that n1!=n2 is false, or if there is not enough information
// to tell.
// Complexity is O(n) (because it internally calls Ordered to see if we
// can infer n1!=n2 from n1<n2 or n2<n1).
func (po *poset) NonEqual(n1, n2 *Value) bool {
if n1.ID == n2.ID {
panic("should not call Equal with n1==n2")
}
if po.isnoneq(n1.ID, n2.ID) {
return true
}
// Check if n1<n2 or n2<n1, in which case we can infer that n1!=n2
if po.Ordered(n1, n2) || po.Ordered(n2, n1) {
return true
}
return false
}
// setOrder records that n1<n2 or n1<=n2 (depending on strict).
// Implements SetOrder() and SetOrderOrEqual()
func (po *poset) setOrder(n1, n2 *Value, strict bool) bool {
// If we are trying to record n1<=n2 but we learned that n1!=n2,
// record n1<n2, as it provides more information.
if !strict && po.isnoneq(n1.ID, n2.ID) {
strict = true
}
i1, f1 := po.lookup(n1)
i2, f2 := po.lookup(n2)
switch {
case !f1 && !f2:
// Neither n1 nor n2 are in the poset, so they are not related
// in any way to existing nodes.
// Create a new DAG to record the relation.
i1, i2 = po.newnode(n1), po.newnode(n2)
po.roots = append(po.roots, i1)
po.upush(undoNewRoot, i1, 0)
po.addchild(i1, i2, strict)
case f1 && !f2:
// n1 is in one of the DAGs, while n2 is not. Add n2 as children
// of n1.
i2 = po.newnode(n2)
po.addchild(i1, i2, strict)
case !f1 && f2:
// n1 is not in any DAG but n2 is. If n2 is a root, we can put
// n1 in its place as a root; otherwise, we need to create a new
// dummy root to record the relation.
i1 = po.newnode(n1)
if po.isroot(i2) {
po.changeroot(i2, i1)
po.upush(undoChangeRoot, i1, newedge(i2, strict))
po.addchild(i1, i2, strict)
return true
}
// Search for i2's root; this requires a O(n) search on all
// DAGs
r := po.findroot(i2)
// Re-parent as follows:
//
// dummy
// r / \
// \ ===> r i1
// i2 \ /
// i2
//
dummy := po.newnode(nil)
po.changeroot(r, dummy)
po.upush(undoChangeRoot, dummy, newedge(r, false))
po.addchild(dummy, r, false)
po.addchild(dummy, i1, false)
po.addchild(i1, i2, strict)
case f1 && f2:
// If the nodes are aliased, fail only if we're setting a strict order
// (that is, we cannot set n1<n2 if n1==n2).
if i1 == i2 {
return !strict
}
// Both n1 and n2 are in the poset. This is the complex part of the algorithm
// as we need to find many different cases and DAG shapes.
// Check if n1 somehow dominates n2
if po.dominates(i1, i2, false) {
// This is the table of all cases we need to handle:
//
// DAG New Action
// ---------------------------------------------------
// #1: N1<=X<=N2 | N1<=N2 | do nothing
// #2: N1<=X<=N2 | N1<N2 | add strict edge (N1<N2)
// #3: N1<X<N2 | N1<=N2 | do nothing (we already know more)
// #4: N1<X<N2 | N1<N2 | do nothing
// Check if we're in case #2
if strict && !po.dominates(i1, i2, true) {
po.addchild(i1, i2, true)
return true
}
// Case #1, #3 o #4: nothing to do
return true
}
// Check if n2 somehow dominates n1
if po.dominates(i2, i1, false) {
// This is the table of all cases we need to handle:
//
// DAG New Action
// ---------------------------------------------------
// #5: N2<=X<=N1 | N1<=N2 | collapse path (learn that N1=X=N2)
// #6: N2<=X<=N1 | N1<N2 | contradiction
// #7: N2<X<N1 | N1<=N2 | contradiction in the path
// #8: N2<X<N1 | N1<N2 | contradiction
if strict {
// Cases #6 and #8: contradiction
return false
}
// We're in case #5 or #7. Try to collapse path, and that will
// fail if it realizes that we are in case #7.
return po.collapsepath(n2, n1)
}
// We don't know of any existing relation between n1 and n2. They could
// be part of the same DAG or not.
// Find their roots to check whether they are in the same DAG.
r1, r2 := po.findroot(i1), po.findroot(i2)
if r1 != r2 {
// We need to merge the two DAGs to record a relation between the nodes
po.mergeroot(r1, r2)
}
// Connect n1 and n2
po.addchild(i1, i2, strict)
}
return true
}
// SetOrder records that n1<n2. Returns false if this is a contradiction
// Complexity is O(1) if n2 was never seen before, or O(n) otherwise.
func (po *poset) SetOrder(n1, n2 *Value) bool {
if n1.ID == n2.ID {
panic("should not call SetOrder with n1==n2")
}
return po.setOrder(n1, n2, true)
}
// SetOrderOrEqual records that n1<=n2. Returns false if this is a contradiction
// Complexity is O(1) if n2 was never seen before, or O(n) otherwise.
func (po *poset) SetOrderOrEqual(n1, n2 *Value) bool {
if n1.ID == n2.ID {
panic("should not call SetOrder with n1==n2")
}
return po.setOrder(n1, n2, false)
}