IOBuf.cpp File Reference

#include <folly/io/IOBuf.h>
#include <cassert>
#include <cstdint>
#include <cstdlib>
#include <stdexcept>
#include <folly/Conv.h>
#include <folly/Likely.h>
#include <folly/Memory.h>
#include <folly/ScopeGuard.h>
#include <folly/hash/SpookyHashV2.h>
#include <folly/io/Cursor.h>
#include <folly/lang/Align.h>
#include <folly/memory/Malloc.h>

Go to the source code of this file.

Classes
struct	folly::IOBuf::HeapPrefix
struct	folly::IOBuf::HeapStorage
struct	folly::IOBuf::HeapFullStorage

Namespaces
	folly
	—— Concurrent Priority Queue Implementation ——

Macros
#define	__STDC_LIMIT_MACROS

Enumerations
enum	: uint16_t
enum	: std::size_t

Macro Definition Documentation

#define __STDC_LIMIT_MACROS

Definition at line 18 of file IOBuf.cpp.

Enumeration Type Documentation

anonymous enum : uint16_t

Definition at line 41 of file IOBuf.cpp.

     : uint16_t {
  kHeapMagic = 0xa5a5,
  // This memory segment contains an IOBuf that is still in use
  kIOBufInUse = 0x01,
  // This memory segment contains buffer data that is still in use
  kDataInUse = 0x02,
};

anonymous enum : std::size_t

Definition at line 49 of file IOBuf.cpp.

     : std::size_t {
  // When create() is called for buffers less than kDefaultCombinedBufSize,
  // we allocate a single combined memory segment for the IOBuf and the data
  // together.  See the comments for createCombined()/createSeparate() for more
  // details.
  //
  // (The size of 1k is largely just a guess here.  We could could probably do
  // benchmarks of real applications to see if adjusting this number makes a
  // difference.  Callers that know their exact use case can also explicitly
  // call createCombined() or createSeparate().)
  kDefaultCombinedBufSize = 1024
};