test_utils.go 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519
  1. /*
  2. Copyright 2016 The Kubernetes Authors.
  3. Licensed under the Apache License, Version 2.0 (the "License");
  4. you may not use this file except in compliance with the License.
  5. You may obtain a copy of the License at
  6. http://www.apache.org/licenses/LICENSE-2.0
  7. Unless required by applicable law or agreed to in writing, software
  8. distributed under the License is distributed on an "AS IS" BASIS,
  9. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. See the License for the specific language governing permissions and
  11. limitations under the License.
  12. */
  13. package testutil
  14. import (
  15. "encoding/json"
  16. "errors"
  17. "fmt"
  18. "reflect"
  19. "sync"
  20. "testing"
  21. "time"
  22. apierrors "k8s.io/apimachinery/pkg/api/errors"
  23. "k8s.io/apimachinery/pkg/api/resource"
  24. metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
  25. "k8s.io/apimachinery/pkg/runtime"
  26. "k8s.io/apimachinery/pkg/types"
  27. "k8s.io/apimachinery/pkg/util/sets"
  28. "k8s.io/apimachinery/pkg/util/strategicpatch"
  29. "k8s.io/apimachinery/pkg/watch"
  30. "k8s.io/apimachinery/pkg/util/clock"
  31. ref "k8s.io/client-go/tools/reference"
  32. "k8s.io/api/core/v1"
  33. "k8s.io/client-go/kubernetes/fake"
  34. v1core "k8s.io/client-go/kubernetes/typed/core/v1"
  35. "k8s.io/client-go/tools/cache"
  36. "k8s.io/kubernetes/pkg/api/legacyscheme"
  37. api "k8s.io/kubernetes/pkg/apis/core"
  38. utilnode "k8s.io/kubernetes/pkg/util/node"
  39. jsonpatch "github.com/evanphx/json-patch"
  40. "k8s.io/klog"
  41. )
  42. var (
  43. keyFunc = cache.DeletionHandlingMetaNamespaceKeyFunc
  44. )
  45. // FakeNodeHandler is a fake implementation of NodesInterface and NodeInterface. It
  46. // allows test cases to have fine-grained control over mock behaviors. We also need
  47. // PodsInterface and PodInterface to test list & delete pods, which is implemented in
  48. // the embedded client.Fake field.
  49. type FakeNodeHandler struct {
  50. *fake.Clientset
  51. // Input: Hooks determine if request is valid or not
  52. CreateHook func(*FakeNodeHandler, *v1.Node) bool
  53. Existing []*v1.Node
  54. // Output
  55. CreatedNodes []*v1.Node
  56. DeletedNodes []*v1.Node
  57. UpdatedNodes []*v1.Node
  58. UpdatedNodeStatuses []*v1.Node
  59. RequestCount int
  60. // Synchronization
  61. lock sync.Mutex
  62. DeleteWaitChan chan struct{}
  63. PatchWaitChan chan struct{}
  64. }
  65. // FakeLegacyHandler is a fake implementation of CoreV1Interface.
  66. type FakeLegacyHandler struct {
  67. v1core.CoreV1Interface
  68. n *FakeNodeHandler
  69. }
  70. // GetUpdatedNodesCopy returns a slice of Nodes with updates applied.
  71. func (m *FakeNodeHandler) GetUpdatedNodesCopy() []*v1.Node {
  72. m.lock.Lock()
  73. defer m.lock.Unlock()
  74. updatedNodesCopy := make([]*v1.Node, len(m.UpdatedNodes), len(m.UpdatedNodes))
  75. for i, ptr := range m.UpdatedNodes {
  76. updatedNodesCopy[i] = ptr
  77. }
  78. return updatedNodesCopy
  79. }
  80. // Core returns fake CoreInterface.
  81. func (m *FakeNodeHandler) Core() v1core.CoreV1Interface {
  82. return &FakeLegacyHandler{m.Clientset.CoreV1(), m}
  83. }
  84. // CoreV1 returns fake CoreV1Interface
  85. func (m *FakeNodeHandler) CoreV1() v1core.CoreV1Interface {
  86. return &FakeLegacyHandler{m.Clientset.CoreV1(), m}
  87. }
  88. // Nodes return fake NodeInterfaces.
  89. func (m *FakeLegacyHandler) Nodes() v1core.NodeInterface {
  90. return m.n
  91. }
  92. // Create adds a new Node to the fake store.
  93. func (m *FakeNodeHandler) Create(node *v1.Node) (*v1.Node, error) {
  94. m.lock.Lock()
  95. defer func() {
  96. m.RequestCount++
  97. m.lock.Unlock()
  98. }()
  99. for _, n := range m.Existing {
  100. if n.Name == node.Name {
  101. return nil, apierrors.NewAlreadyExists(api.Resource("nodes"), node.Name)
  102. }
  103. }
  104. if m.CreateHook == nil || m.CreateHook(m, node) {
  105. nodeCopy := *node
  106. m.CreatedNodes = append(m.CreatedNodes, &nodeCopy)
  107. return node, nil
  108. }
  109. return nil, errors.New("create error")
  110. }
  111. // Get returns a Node from the fake store.
  112. func (m *FakeNodeHandler) Get(name string, opts metav1.GetOptions) (*v1.Node, error) {
  113. m.lock.Lock()
  114. defer func() {
  115. m.RequestCount++
  116. m.lock.Unlock()
  117. }()
  118. for i := range m.UpdatedNodes {
  119. if m.UpdatedNodes[i].Name == name {
  120. nodeCopy := *m.UpdatedNodes[i]
  121. return &nodeCopy, nil
  122. }
  123. }
  124. for i := range m.Existing {
  125. if m.Existing[i].Name == name {
  126. nodeCopy := *m.Existing[i]
  127. return &nodeCopy, nil
  128. }
  129. }
  130. return nil, nil
  131. }
  132. // List returns a list of Nodes from the fake store.
  133. func (m *FakeNodeHandler) List(opts metav1.ListOptions) (*v1.NodeList, error) {
  134. m.lock.Lock()
  135. defer func() {
  136. m.RequestCount++
  137. m.lock.Unlock()
  138. }()
  139. var nodes []*v1.Node
  140. for i := 0; i < len(m.UpdatedNodes); i++ {
  141. if !contains(m.UpdatedNodes[i], m.DeletedNodes) {
  142. nodes = append(nodes, m.UpdatedNodes[i])
  143. }
  144. }
  145. for i := 0; i < len(m.Existing); i++ {
  146. if !contains(m.Existing[i], m.DeletedNodes) && !contains(m.Existing[i], nodes) {
  147. nodes = append(nodes, m.Existing[i])
  148. }
  149. }
  150. for i := 0; i < len(m.CreatedNodes); i++ {
  151. if !contains(m.CreatedNodes[i], m.DeletedNodes) && !contains(m.CreatedNodes[i], nodes) {
  152. nodes = append(nodes, m.CreatedNodes[i])
  153. }
  154. }
  155. nodeList := &v1.NodeList{}
  156. for _, node := range nodes {
  157. nodeList.Items = append(nodeList.Items, *node)
  158. }
  159. return nodeList, nil
  160. }
  161. // Delete deletes a Node from the fake store.
  162. func (m *FakeNodeHandler) Delete(id string, opt *metav1.DeleteOptions) error {
  163. m.lock.Lock()
  164. defer func() {
  165. m.RequestCount++
  166. if m.DeleteWaitChan != nil {
  167. m.DeleteWaitChan <- struct{}{}
  168. }
  169. m.lock.Unlock()
  170. }()
  171. m.DeletedNodes = append(m.DeletedNodes, NewNode(id))
  172. return nil
  173. }
  174. // DeleteCollection deletes a collection of Nodes from the fake store.
  175. func (m *FakeNodeHandler) DeleteCollection(opt *metav1.DeleteOptions, listOpts metav1.ListOptions) error {
  176. return nil
  177. }
  178. // Update updates a Node in the fake store.
  179. func (m *FakeNodeHandler) Update(node *v1.Node) (*v1.Node, error) {
  180. m.lock.Lock()
  181. defer func() {
  182. m.RequestCount++
  183. m.lock.Unlock()
  184. }()
  185. nodeCopy := *node
  186. for i, updateNode := range m.UpdatedNodes {
  187. if updateNode.Name == nodeCopy.Name {
  188. m.UpdatedNodes[i] = &nodeCopy
  189. return node, nil
  190. }
  191. }
  192. m.UpdatedNodes = append(m.UpdatedNodes, &nodeCopy)
  193. return node, nil
  194. }
  195. // UpdateStatus updates a status of a Node in the fake store.
  196. func (m *FakeNodeHandler) UpdateStatus(node *v1.Node) (*v1.Node, error) {
  197. m.lock.Lock()
  198. defer func() {
  199. m.RequestCount++
  200. m.lock.Unlock()
  201. }()
  202. var origNodeCopy v1.Node
  203. found := false
  204. for i := range m.Existing {
  205. if m.Existing[i].Name == node.Name {
  206. origNodeCopy = *m.Existing[i]
  207. found = true
  208. break
  209. }
  210. }
  211. updatedNodeIndex := -1
  212. for i := range m.UpdatedNodes {
  213. if m.UpdatedNodes[i].Name == node.Name {
  214. origNodeCopy = *m.UpdatedNodes[i]
  215. updatedNodeIndex = i
  216. found = true
  217. break
  218. }
  219. }
  220. if !found {
  221. return nil, fmt.Errorf("Not found node %v", node)
  222. }
  223. origNodeCopy.Status = node.Status
  224. if updatedNodeIndex < 0 {
  225. m.UpdatedNodes = append(m.UpdatedNodes, &origNodeCopy)
  226. } else {
  227. m.UpdatedNodes[updatedNodeIndex] = &origNodeCopy
  228. }
  229. nodeCopy := *node
  230. m.UpdatedNodeStatuses = append(m.UpdatedNodeStatuses, &nodeCopy)
  231. return node, nil
  232. }
  233. // PatchStatus patches a status of a Node in the fake store.
  234. func (m *FakeNodeHandler) PatchStatus(nodeName string, data []byte) (*v1.Node, error) {
  235. m.RequestCount++
  236. return m.Patch(nodeName, types.StrategicMergePatchType, data, "status")
  237. }
  238. // Watch watches Nodes in a fake store.
  239. func (m *FakeNodeHandler) Watch(opts metav1.ListOptions) (watch.Interface, error) {
  240. return watch.NewFake(), nil
  241. }
  242. // Patch patches a Node in the fake store.
  243. func (m *FakeNodeHandler) Patch(name string, pt types.PatchType, data []byte, subresources ...string) (*v1.Node, error) {
  244. m.lock.Lock()
  245. defer func() {
  246. m.RequestCount++
  247. if m.PatchWaitChan != nil {
  248. m.PatchWaitChan <- struct{}{}
  249. }
  250. m.lock.Unlock()
  251. }()
  252. var nodeCopy v1.Node
  253. for i := range m.Existing {
  254. if m.Existing[i].Name == name {
  255. nodeCopy = *m.Existing[i]
  256. }
  257. }
  258. updatedNodeIndex := -1
  259. for i := range m.UpdatedNodes {
  260. if m.UpdatedNodes[i].Name == name {
  261. nodeCopy = *m.UpdatedNodes[i]
  262. updatedNodeIndex = i
  263. }
  264. }
  265. originalObjJS, err := json.Marshal(nodeCopy)
  266. if err != nil {
  267. klog.Errorf("Failed to marshal %v", nodeCopy)
  268. return nil, nil
  269. }
  270. var originalNode v1.Node
  271. if err = json.Unmarshal(originalObjJS, &originalNode); err != nil {
  272. klog.Errorf("Failed to unmarshal original object: %v", err)
  273. return nil, nil
  274. }
  275. var patchedObjJS []byte
  276. switch pt {
  277. case types.JSONPatchType:
  278. patchObj, err := jsonpatch.DecodePatch(data)
  279. if err != nil {
  280. klog.Error(err.Error())
  281. return nil, nil
  282. }
  283. if patchedObjJS, err = patchObj.Apply(originalObjJS); err != nil {
  284. klog.Error(err.Error())
  285. return nil, nil
  286. }
  287. case types.MergePatchType:
  288. if patchedObjJS, err = jsonpatch.MergePatch(originalObjJS, data); err != nil {
  289. klog.Error(err.Error())
  290. return nil, nil
  291. }
  292. case types.StrategicMergePatchType:
  293. if patchedObjJS, err = strategicpatch.StrategicMergePatch(originalObjJS, data, originalNode); err != nil {
  294. klog.Error(err.Error())
  295. return nil, nil
  296. }
  297. default:
  298. klog.Errorf("unknown Content-Type header for patch: %v", pt)
  299. return nil, nil
  300. }
  301. var updatedNode v1.Node
  302. if err = json.Unmarshal(patchedObjJS, &updatedNode); err != nil {
  303. klog.Errorf("Failed to unmarshal patched object: %v", err)
  304. return nil, nil
  305. }
  306. if updatedNodeIndex < 0 {
  307. m.UpdatedNodes = append(m.UpdatedNodes, &updatedNode)
  308. } else {
  309. m.UpdatedNodes[updatedNodeIndex] = &updatedNode
  310. }
  311. return &updatedNode, nil
  312. }
  313. // FakeRecorder is used as a fake during testing.
  314. type FakeRecorder struct {
  315. sync.Mutex
  316. source v1.EventSource
  317. Events []*v1.Event
  318. clock clock.Clock
  319. }
  320. // Event emits a fake event to the fake recorder
  321. func (f *FakeRecorder) Event(obj runtime.Object, eventtype, reason, message string) {
  322. f.generateEvent(obj, metav1.Now(), eventtype, reason, message)
  323. }
  324. // Eventf emits a fake formatted event to the fake recorder
  325. func (f *FakeRecorder) Eventf(obj runtime.Object, eventtype, reason, messageFmt string, args ...interface{}) {
  326. f.Event(obj, eventtype, reason, fmt.Sprintf(messageFmt, args...))
  327. }
  328. // PastEventf is a no-op
  329. func (f *FakeRecorder) PastEventf(obj runtime.Object, timestamp metav1.Time, eventtype, reason, messageFmt string, args ...interface{}) {
  330. }
  331. // AnnotatedEventf emits a fake formatted event to the fake recorder
  332. func (f *FakeRecorder) AnnotatedEventf(obj runtime.Object, annotations map[string]string, eventtype, reason, messageFmt string, args ...interface{}) {
  333. f.Eventf(obj, eventtype, reason, messageFmt, args...)
  334. }
  335. func (f *FakeRecorder) generateEvent(obj runtime.Object, timestamp metav1.Time, eventtype, reason, message string) {
  336. f.Lock()
  337. defer f.Unlock()
  338. ref, err := ref.GetReference(legacyscheme.Scheme, obj)
  339. if err != nil {
  340. klog.Errorf("Encountered error while getting reference: %v", err)
  341. return
  342. }
  343. event := f.makeEvent(ref, eventtype, reason, message)
  344. event.Source = f.source
  345. if f.Events != nil {
  346. f.Events = append(f.Events, event)
  347. }
  348. }
  349. func (f *FakeRecorder) makeEvent(ref *v1.ObjectReference, eventtype, reason, message string) *v1.Event {
  350. t := metav1.Time{Time: f.clock.Now()}
  351. namespace := ref.Namespace
  352. if namespace == "" {
  353. namespace = metav1.NamespaceDefault
  354. }
  355. clientref := v1.ObjectReference{
  356. Kind: ref.Kind,
  357. Namespace: ref.Namespace,
  358. Name: ref.Name,
  359. UID: ref.UID,
  360. APIVersion: ref.APIVersion,
  361. ResourceVersion: ref.ResourceVersion,
  362. FieldPath: ref.FieldPath,
  363. }
  364. return &v1.Event{
  365. ObjectMeta: metav1.ObjectMeta{
  366. Name: fmt.Sprintf("%v.%x", ref.Name, t.UnixNano()),
  367. Namespace: namespace,
  368. },
  369. InvolvedObject: clientref,
  370. Reason: reason,
  371. Message: message,
  372. FirstTimestamp: t,
  373. LastTimestamp: t,
  374. Count: 1,
  375. Type: eventtype,
  376. }
  377. }
  378. // NewFakeRecorder returns a pointer to a newly constructed FakeRecorder.
  379. func NewFakeRecorder() *FakeRecorder {
  380. return &FakeRecorder{
  381. source: v1.EventSource{Component: "nodeControllerTest"},
  382. Events: []*v1.Event{},
  383. clock: clock.NewFakeClock(time.Now()),
  384. }
  385. }
  386. // NewNode is a helper function for creating Nodes for testing.
  387. func NewNode(name string) *v1.Node {
  388. return &v1.Node{
  389. ObjectMeta: metav1.ObjectMeta{Name: name},
  390. Status: v1.NodeStatus{
  391. Capacity: v1.ResourceList{
  392. v1.ResourceName(v1.ResourceCPU): resource.MustParse("10"),
  393. v1.ResourceName(v1.ResourceMemory): resource.MustParse("10G"),
  394. },
  395. },
  396. }
  397. }
  398. // NewPod is a helper function for creating Pods for testing.
  399. func NewPod(name, host string) *v1.Pod {
  400. pod := &v1.Pod{
  401. ObjectMeta: metav1.ObjectMeta{
  402. Namespace: "default",
  403. Name: name,
  404. },
  405. Spec: v1.PodSpec{
  406. NodeName: host,
  407. },
  408. Status: v1.PodStatus{
  409. Conditions: []v1.PodCondition{
  410. {
  411. Type: v1.PodReady,
  412. Status: v1.ConditionTrue,
  413. },
  414. },
  415. },
  416. }
  417. return pod
  418. }
  419. func contains(node *v1.Node, nodes []*v1.Node) bool {
  420. for i := 0; i < len(nodes); i++ {
  421. if node.Name == nodes[i].Name {
  422. return true
  423. }
  424. }
  425. return false
  426. }
  427. // GetZones returns list of zones for all Nodes stored in FakeNodeHandler
  428. func GetZones(nodeHandler *FakeNodeHandler) []string {
  429. nodes, _ := nodeHandler.List(metav1.ListOptions{})
  430. zones := sets.NewString()
  431. for _, node := range nodes.Items {
  432. zones.Insert(utilnode.GetZoneKey(&node))
  433. }
  434. return zones.List()
  435. }
  436. // CreateZoneID returns a single zoneID for a given region and zone.
  437. func CreateZoneID(region, zone string) string {
  438. return region + ":\x00:" + zone
  439. }
  440. // GetKey is a helper function used by controllers unit tests to get the
  441. // key for a given kubernetes resource.
  442. func GetKey(obj interface{}, t *testing.T) string {
  443. tombstone, ok := obj.(cache.DeletedFinalStateUnknown)
  444. if ok {
  445. // if tombstone , try getting the value from tombstone.Obj
  446. obj = tombstone.Obj
  447. }
  448. val := reflect.ValueOf(obj).Elem()
  449. name := val.FieldByName("Name").String()
  450. kind := val.FieldByName("Kind").String()
  451. // Note kind is not always set in the tests, so ignoring that for now
  452. if len(name) == 0 || len(kind) == 0 {
  453. t.Errorf("Unexpected object %v", obj)
  454. }
  455. key, err := keyFunc(obj)
  456. if err != nil {
  457. t.Errorf("Unexpected error getting key for %v %v: %v", kind, name, err)
  458. return ""
  459. }
  460. return key
  461. }