175
176 // For each slice s, a map from s to a len(s)/cap(s) value (if any)
177▶ // TODO: check if there are cases that matter where we have
178 // more than one len(s) for a slice. We could keep a list if necessary.
179 lens map[ssa.ID]*ssa.Value
· · ·
304 // the posets will not notice.
305 if ft.recurseCheck[v.ID] {
306▶ // This should only happen for unsatisfiable cases. TODO: check
307 return
308 }
· · ·
317 ft.limits[v.ID] = lim
318 if v.Block.Func.Pass.Debug > 2 {
319▶ // TODO: pos is probably wrong. This is the position where v is defined,
320 // not the position where we learned the fact about it (which was
321 // probably some subsequent compare+branch).
· · ·
430 r ^= lt | gt | eq
431 }
432▶ // TODO: v.Block is wrong?
433 addRestrictions(v.Block, ft, d, v.Args[0], v.Args[1], r)
434 }
· · ·
466 }
467 ft.update(v.Block, v.Args[0], v.Args[1], unsigned, r)
468▶ // TODO: v.Block is wrong here
469 }
470 }
+ 12 more matches in this file