小组成员: 曹可心-10223903406 朴祉燕-10224602413
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

133 lines
4.5 KiB

  1. // Copyright (c) 2011 The LevelDB Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file. See the AUTHORS file for names of contributors.
  4. //
  5. // This file contains the specification, but not the implementations,
  6. // of the types/operations/etc. that should be defined by a platform
  7. // specific port_<platform>.h file. Use this file as a reference for
  8. // how to port this package to a new platform.
  9. #ifndef STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_
  10. #define STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_
  11. #include "port/thread_annotations.h"
  12. namespace leveldb {
  13. namespace port {
  14. // TODO(jorlow): Many of these belong more in the environment class rather than
  15. // here. We should try moving them and see if it affects perf.
  16. // The following boolean constant must be true on a little-endian machine
  17. // and false otherwise.
  18. static const bool kLittleEndian = true /* or some other expression */;
  19. // ------------------ Threading -------------------
  20. // A Mutex represents an exclusive lock.
  21. class LOCKABLE Mutex {
  22. public:
  23. Mutex();
  24. ~Mutex();
  25. // Lock the mutex. Waits until other lockers have exited.
  26. // Will deadlock if the mutex is already locked by this thread.
  27. void Lock() EXCLUSIVE_LOCK_FUNCTION();
  28. // Unlock the mutex.
  29. // REQUIRES: This mutex was locked by this thread.
  30. void Unlock() UNLOCK_FUNCTION();
  31. // Optionally crash if this thread does not hold this mutex.
  32. // The implementation must be fast, especially if NDEBUG is
  33. // defined. The implementation is allowed to skip all checks.
  34. void AssertHeld() ASSERT_EXCLUSIVE_LOCK();
  35. };
  36. class CondVar {
  37. public:
  38. explicit CondVar(Mutex* mu);
  39. ~CondVar();
  40. // Atomically release *mu and block on this condition variable until
  41. // either a call to SignalAll(), or a call to Signal() that picks
  42. // this thread to wakeup.
  43. // REQUIRES: this thread holds *mu
  44. void Wait();
  45. // If there are some threads waiting, wake up at least one of them.
  46. void Signal();
  47. // Wake up all waiting threads.
  48. void SignallAll();
  49. };
  50. // A type that holds a pointer that can be read or written atomically
  51. // (i.e., without word-tearing.)
  52. class AtomicPointer {
  53. private:
  54. intptr_t rep_;
  55. public:
  56. // Initialize to arbitrary value
  57. AtomicPointer();
  58. // Initialize to hold v
  59. explicit AtomicPointer(void* v) : rep_(v) { }
  60. // Read and return the stored pointer with the guarantee that no
  61. // later memory access (read or write) by this thread can be
  62. // reordered ahead of this read.
  63. void* Acquire_Load() const;
  64. // Set v as the stored pointer with the guarantee that no earlier
  65. // memory access (read or write) by this thread can be reordered
  66. // after this store.
  67. void Release_Store(void* v);
  68. // Read the stored pointer with no ordering guarantees.
  69. void* NoBarrier_Load() const;
  70. // Set va as the stored pointer with no ordering guarantees.
  71. void NoBarrier_Store(void* v);
  72. };
  73. // ------------------ Compression -------------------
  74. // Store the snappy compression of "input[0,input_length-1]" in *output.
  75. // Returns false if snappy is not supported by this port.
  76. bool Snappy_Compress(const char* input, size_t input_length,
  77. std::string* output);
  78. // If input[0,input_length-1] looks like a valid snappy compressed
  79. // buffer, store the size of the uncompressed data in *result and
  80. // return true. Else return false.
  81. bool Snappy_GetUncompressedLength(const char* input, size_t length,
  82. size_t* result);
  83. // Attempt to snappy uncompress input[0,input_length-1] into *output.
  84. // Returns true if successful, false if the input is invalid lightweight
  85. // compressed data.
  86. //
  87. // REQUIRES: at least the first "n" bytes of output[] must be writable
  88. // where "n" is the result of a successful call to
  89. // Snappy_GetUncompressedLength.
  90. bool Snappy_Uncompress(const char* input_data, size_t input_length,
  91. char* output);
  92. // ------------------ Miscellaneous -------------------
  93. // If heap profiling is not supported, returns false.
  94. // Else repeatedly calls (*func)(arg, data, n) and then returns true.
  95. // The concatenation of all "data[0,n-1]" fragments is the heap profile.
  96. bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg);
  97. // Extend the CRC to include the first n bytes of buf.
  98. //
  99. // Returns zero if the CRC cannot be extended using acceleration, else returns
  100. // the newly extended CRC value (which may also be zero).
  101. uint32_t AcceleratedCRC32C(uint32_t crc, const char* buf, size_t size);
  102. } // namespace port
  103. } // namespace leveldb
  104. #endif // STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_