| Server IP : 88.222.222.40 / Your IP : 216.73.217.153 Web Server : LiteSpeed System : Linux id-dci-web1986.main-hosting.eu 5.14.0-611.26.1.el9_7.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Jan 29 05:24:47 EST 2026 x86_64 User : u686484674 ( 686484674) PHP Version : 8.0.30 Disable Function : system, exec, shell_exec, passthru, mysql_list_dbs, ini_alter, dl, symlink, link, chgrp, leak, popen, apache_child_terminate, virtual, mb_send_mail MySQL : OFF | cURL : ON | WGET : ON | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /proc/self/root/proc/self/root/opt/golang/1.22.0/src/cmd/compile/internal/ssa/ |
Upload File : |
// Copyright 2022 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 "cmd/internal/src"
// from https://research.swtch.com/sparse
// in turn, from Briggs and Torczon
type sparseEntryPos struct {
key ID
val int32
pos src.XPos
}
type sparseMapPos struct {
dense []sparseEntryPos
sparse []int32
}
// newSparseMapPos returns a sparseMapPos that can map
// integers between 0 and n-1 to the pair <int32,src.XPos>.
func newSparseMapPos(n int) *sparseMapPos {
return &sparseMapPos{dense: nil, sparse: make([]int32, n)}
}
func (s *sparseMapPos) cap() int {
return len(s.sparse)
}
func (s *sparseMapPos) size() int {
return len(s.dense)
}
func (s *sparseMapPos) contains(k ID) bool {
i := s.sparse[k]
return i < int32(len(s.dense)) && s.dense[i].key == k
}
// get returns the value for key k, or -1 if k does
// not appear in the map.
func (s *sparseMapPos) get(k ID) int32 {
i := s.sparse[k]
if i < int32(len(s.dense)) && s.dense[i].key == k {
return s.dense[i].val
}
return -1
}
func (s *sparseMapPos) set(k ID, v int32, a src.XPos) {
i := s.sparse[k]
if i < int32(len(s.dense)) && s.dense[i].key == k {
s.dense[i].val = v
s.dense[i].pos = a
return
}
s.dense = append(s.dense, sparseEntryPos{k, v, a})
s.sparse[k] = int32(len(s.dense)) - 1
}
func (s *sparseMapPos) remove(k ID) {
i := s.sparse[k]
if i < int32(len(s.dense)) && s.dense[i].key == k {
y := s.dense[len(s.dense)-1]
s.dense[i] = y
s.sparse[y.key] = i
s.dense = s.dense[:len(s.dense)-1]
}
}
func (s *sparseMapPos) clear() {
s.dense = s.dense[:0]
}
func (s *sparseMapPos) contents() []sparseEntryPos {
return s.dense
}