mirror of
https://github.com/evilsocket/opensnitch.git
synced 2025-03-04 16:44:46 +01:00
126 lines
3 KiB
Go
126 lines
3 KiB
Go
![]() |
package procmon
|
||
|
|
||
|
|
||
|
import (
|
||
|
"fmt"
|
||
|
"os"
|
||
|
"time"
|
||
|
"sort"
|
||
|
)
|
||
|
|
||
|
type Inode struct {
|
||
|
Pid int
|
||
|
FdPath string
|
||
|
}
|
||
|
|
||
|
type ProcEntry struct {
|
||
|
Pid int
|
||
|
FdPath string
|
||
|
Descriptors []string
|
||
|
Time time.Time
|
||
|
}
|
||
|
|
||
|
var (
|
||
|
// cache of inodes, which help to not iterate over all the pidsCache and
|
||
|
// descriptors of /proc/<pid>/fd/
|
||
|
// 20-50us vs 50-80ms
|
||
|
inodesCache = make(map[string]*Inode)
|
||
|
maxCachedInodes = 24
|
||
|
// 2nd cache of already known running pids, which also saves time by
|
||
|
// iterating only over a few pids' descriptors, (30us-2ms vs. 50-80ms)
|
||
|
// since it's more likely that most of the connections will be made by the
|
||
|
// same (running) processes.
|
||
|
// The cache is ordered by time, placing in the first places those PIDs with
|
||
|
// active connections.
|
||
|
pidsCache []*ProcEntry
|
||
|
pidsDescriptorsCache = make(map[int][]string)
|
||
|
maxCachedPids = 24
|
||
|
)
|
||
|
|
||
|
func addProcEntry(fdPath string, fd_list []string, pid int) {
|
||
|
for n, _ := range pidsCache {
|
||
|
if pidsCache[n].Pid == pid {
|
||
|
pidsCache[n].Time = time.Now()
|
||
|
return
|
||
|
}
|
||
|
}
|
||
|
pidsCache = append(pidsCache, &ProcEntry{ Pid: pid, FdPath: fdPath, Descriptors: fd_list, Time: time.Now() })
|
||
|
}
|
||
|
|
||
|
func sortProcEntries() {
|
||
|
sort.Slice(pidsCache, func(i, j int) bool {
|
||
|
t := pidsCache[i].Time.UnixNano()
|
||
|
u := pidsCache[j].Time.UnixNano()
|
||
|
return u == t || t > u
|
||
|
})
|
||
|
}
|
||
|
|
||
|
func deleteProcEntry(pid int) {
|
||
|
for n, procEntry := range pidsCache {
|
||
|
if procEntry.Pid == pid {
|
||
|
pidsCache = append(pidsCache[:n], pidsCache[n+1:]...)
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func cleanUpCaches() {
|
||
|
if len(inodesCache) > maxCachedInodes {
|
||
|
for k, _ := range inodesCache {
|
||
|
delete(inodesCache, k)
|
||
|
}
|
||
|
}
|
||
|
if len(pidsCache) > maxCachedPids {
|
||
|
pidsCache = nil
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func GetPidByInodeFromCache(inodeKey string) int {
|
||
|
if _, found := inodesCache[inodeKey]; found == true {
|
||
|
// sometimes the process may have dissapeared at this point
|
||
|
if _, err := os.Lstat(fmt.Sprint("/proc/", inodesCache[inodeKey].Pid, "/exe")); err == nil {
|
||
|
return inodesCache[inodeKey].Pid
|
||
|
}
|
||
|
deleteProcEntry(inodesCache[inodeKey].Pid)
|
||
|
delete(inodesCache, inodeKey)
|
||
|
}
|
||
|
|
||
|
return -1
|
||
|
}
|
||
|
|
||
|
func getPidDescriptorsFromCache(pid int, fdPath string, expect string, descriptors []string) int {
|
||
|
for fdIdx:=0; fdIdx < len(descriptors); fdIdx++ {
|
||
|
descLink := fmt.Sprint(fdPath, descriptors[fdIdx])
|
||
|
if link, err := os.Readlink(descLink); err == nil && link == expect {
|
||
|
if err != nil {
|
||
|
deleteProcEntry(pid)
|
||
|
}
|
||
|
return fdIdx
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return -1
|
||
|
}
|
||
|
|
||
|
func getPidFromCache(inode int, inodeKey string, expect string) int {
|
||
|
// loop over the processes that have generated connections
|
||
|
for n, procEntry := range pidsCache {
|
||
|
if idxDesc := getPidDescriptorsFromCache(procEntry.Pid, procEntry.FdPath, expect, procEntry.Descriptors); idxDesc != -1 {
|
||
|
pidsCache[n].Time = time.Now()
|
||
|
return procEntry.Pid
|
||
|
}
|
||
|
|
||
|
if descriptors := lookupPidDescriptors(procEntry.FdPath); descriptors != nil {
|
||
|
pidsCache[n].Descriptors = descriptors
|
||
|
|
||
|
if idxDesc := getPidDescriptorsFromCache(procEntry.Pid, procEntry.FdPath, expect, descriptors); idxDesc != -1 {
|
||
|
pidsCache[n].Time = time.Now()
|
||
|
return procEntry.Pid
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return -1
|
||
|
}
|
||
|
|