1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66

// Copyright 2021 The Gitea Authors. All rights reserved.
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.

package process

import (
	"context"
	"sync"
	"time"
)

// Process represents a working process inheriting from Gitea.
type Process struct {
	PID         IDType // Process ID, not system one.
	ParentPID   IDType
	Description string
	Start       time.Time
	Cancel      context.CancelFunc

	lock     sync.Mutex
	children []*Process
}

// Children gets the children of the process
// Note: this function will behave nicely even if p is nil
func (p *Process) Children() (children []*Process) {
	if p == nil {
		return
	}

	p.lock.Lock()
	defer p.lock.Unlock()
	children = make([]*Process, len(p.children))
	copy(children, p.children)
	return children
}

// AddChild adds a child process
// Note: this function will behave nicely even if p is nil
func (p *Process) AddChild(child *Process) {
	if p == nil {
		return
	}

	p.lock.Lock()
	defer p.lock.Unlock()
	p.children = append(p.children, child)
}

// RemoveChild removes a child process
// Note: this function will behave nicely even if p is nil
func (p *Process) RemoveChild(process *Process) {
	if p == nil {
		return
	}

	p.lock.Lock()
	defer p.lock.Unlock()
	for i, child := range p.children {
		if child == process {
			p.children = append(p.children[:i], p.children[i+1:]...)
			return
		}
	}
}