fake.go 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126
  1. // Copyright (c) Tailscale Inc & AUTHORS
  2. // SPDX-License-Identifier: BSD-3-Clause
  3. //go:build linux
  4. package linuxfw
  5. import (
  6. "errors"
  7. "fmt"
  8. "strings"
  9. )
  10. type fakeIPTables struct {
  11. n map[string][]string
  12. }
  13. type fakeRule struct {
  14. table, chain string
  15. args []string
  16. }
  17. func newFakeIPTables() *fakeIPTables {
  18. return &fakeIPTables{
  19. n: map[string][]string{
  20. "filter/INPUT": nil,
  21. "filter/OUTPUT": nil,
  22. "filter/FORWARD": nil,
  23. "nat/PREROUTING": nil,
  24. "nat/OUTPUT": nil,
  25. "nat/POSTROUTING": nil,
  26. "mangle/FORWARD": nil,
  27. },
  28. }
  29. }
  30. func (n *fakeIPTables) Insert(table, chain string, pos int, args ...string) error {
  31. k := table + "/" + chain
  32. if rules, ok := n.n[k]; ok {
  33. if pos > len(rules)+1 {
  34. return fmt.Errorf("bad position %d in %s", pos, k)
  35. }
  36. rules = append(rules, "")
  37. copy(rules[pos:], rules[pos-1:])
  38. rules[pos-1] = strings.Join(args, " ")
  39. n.n[k] = rules
  40. } else {
  41. return fmt.Errorf("unknown table/chain %s", k)
  42. }
  43. return nil
  44. }
  45. func (n *fakeIPTables) Append(table, chain string, args ...string) error {
  46. k := table + "/" + chain
  47. return n.Insert(table, chain, len(n.n[k])+1, args...)
  48. }
  49. func (n *fakeIPTables) Exists(table, chain string, args ...string) (bool, error) {
  50. k := table + "/" + chain
  51. if rules, ok := n.n[k]; ok {
  52. for _, rule := range rules {
  53. if rule == strings.Join(args, " ") {
  54. return true, nil
  55. }
  56. }
  57. return false, nil
  58. } else {
  59. return false, fmt.Errorf("unknown table/chain %s", k)
  60. }
  61. }
  62. func (n *fakeIPTables) Delete(table, chain string, args ...string) error {
  63. k := table + "/" + chain
  64. if rules, ok := n.n[k]; ok {
  65. for i, rule := range rules {
  66. if rule == strings.Join(args, " ") {
  67. rules = append(rules[:i], rules[i+1:]...)
  68. n.n[k] = rules
  69. return nil
  70. }
  71. }
  72. return fmt.Errorf("delete of unknown rule %q from %s", strings.Join(args, " "), k)
  73. } else {
  74. return fmt.Errorf("unknown table/chain %s", k)
  75. }
  76. }
  77. func (n *fakeIPTables) ClearChain(table, chain string) error {
  78. k := table + "/" + chain
  79. if _, ok := n.n[k]; ok {
  80. n.n[k] = nil
  81. return nil
  82. } else {
  83. return errors.New("exitcode:1")
  84. }
  85. }
  86. func (n *fakeIPTables) NewChain(table, chain string) error {
  87. k := table + "/" + chain
  88. if _, ok := n.n[k]; ok {
  89. return fmt.Errorf("table/chain %s already exists", k)
  90. }
  91. n.n[k] = nil
  92. return nil
  93. }
  94. func (n *fakeIPTables) DeleteChain(table, chain string) error {
  95. k := table + "/" + chain
  96. if rules, ok := n.n[k]; ok {
  97. if len(rules) != 0 {
  98. return fmt.Errorf("table/chain %s is not empty", k)
  99. }
  100. delete(n.n, k)
  101. return nil
  102. } else {
  103. return fmt.Errorf("unknown table/chain %s", k)
  104. }
  105. }
  106. func NewFakeIPTablesRunner() *iptablesRunner {
  107. ipt4 := newFakeIPTables()
  108. ipt6 := newFakeIPTables()
  109. iptr := &iptablesRunner{ipt4, ipt6, true, true}
  110. return iptr
  111. }