monotonic_counter_database_sqlite_cache.h 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
  1. /*
  2. * Copyright (C) 2011-2018 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. #ifndef _VMC_SQLITE_CACHE_H
  32. #define _VMC_SQLITE_CACHE_H
  33. #include "monotonic_counter_database_types.h"
  34. typedef struct _tree_node_cache_t {
  35. uint32_t ref_counter;
  36. uint8_t node[0];
  37. }tree_node_cache_t;
  38. typedef enum _cache_op_t {
  39. CACHE_OP_READ, // Read from cache
  40. CACHE_OP_UPDATE // Write to cache
  41. }cache_op_t;
  42. typedef struct _leaf_cache_node_t
  43. {
  44. uint32_t leaf_id;
  45. _leaf_cache_node_t* next;
  46. } leaf_cache_node_t;
  47. typedef struct _leaf_cache_t
  48. {
  49. leaf_cache_node_t* list; // the list of cached leaves. The most recently accessed node is at the head.
  50. uint32_t size; // list length, should never exceed MAX_LEAF_CACHE_NUM
  51. } leaf_cache_t;
  52. void flush_hash_tree_cache();
  53. pse_op_error_t access_hash_tree_cache(const rpdb_op_t rpdb_op, // vmc operation type
  54. const cache_op_t cache_op, // read/update cache
  55. pse_vmc_hash_tree_cache_t *cache, // buffer that stores tree nodes required by a VMC operation
  56. const uint8_t *root_hash); // current root hash
  57. #endif