node.cpp 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
  1. /*
  2. * Copyright (C) 2011-2017 Intel Corporation. All rights reserved.
  3. *
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions
  6. * are met:
  7. *
  8. * * Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * * Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in
  12. * the documentation and/or other materials provided with the
  13. * distribution.
  14. * * Neither the name of Intel Corporation nor the names of its
  15. * contributors may be used to endorse or promote products derived
  16. * from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. *
  30. */
  31. #include "node.h"
  32. #include <cstddef>
  33. #include "enclave.h"
  34. #include "tcs.h"
  35. template<class T1, class T2>
  36. Node<T1, T2>::Node(const T1& k, const T2& v)
  37. : key(k), value(v), next(nullptr)
  38. {
  39. }
  40. template<class T1, class T2>
  41. bool Node<T1, T2>::InsertNext(Node<T1, T2> *p)
  42. {
  43. if (this->Find(p->key) != NULL)
  44. return false;
  45. p->next = this->next;
  46. this->next = p;
  47. return true;
  48. }
  49. template<class T1, class T2>
  50. Node<T1, T2>* Node<T1, T2>::Remove(const T1& k)
  51. {
  52. Node<T1, T2> *c = this, *p = this;
  53. while (c != NULL) {
  54. if (c->key == k) {
  55. p->next = c->next;
  56. break;
  57. }
  58. p = c;
  59. c = c->next;
  60. }
  61. return c;
  62. }
  63. template<class T1, class T2>
  64. Node<T1, T2>* Node<T1, T2>::Find(const T1& k)
  65. {
  66. for(auto c= this; c != nullptr; c = c->next)
  67. {
  68. if (c->key == k)
  69. return c;
  70. }
  71. return nullptr;
  72. }
  73. template class Node<sgx_enclave_id_t, CEnclave*>;
  74. template class Node<se_thread_id_t, CTrustThread *>;