a (reference) in projects: rocksdb-6.9 - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:a (Results 1 – 25 of 236) sorted by relevance

12 3 4 5 6 7 8 9 10

/rocksdb-6.9/tools/rdb/
D	unit_test.js	`9 a = RDB() 31 a = RDB() 33 assert(a.open(DB_NAME), true) 43 a = RDB() 44 assert(a.open(DB_NAME)) 73 assert.equal(a.get(), null) 80 assert(a.put('a', 'axe')) 102 assert(a.delete('a')) 107 assert(a.delete('b', 'b')) 112 assert(a.dump()) [all …]`
D	API.md	7 # Creates a new database wrapper object 12 # Open a new or existing RocksDB database. 26 # Get the value of a given key. 39 # Associate a value with a key. 53 # Delete a value associated with a given key. 62 # whether a value was deleted; in the case of a specified key not having 69 # Print out all the key-value pairs in a given column family of the 95 # Create a new column family for the database. 105 # Compact the underlying storage for a given range. 108 # accept a non-default column family, a set of options, or both. [all …]
/rocksdb-6.9/util/
D	ppc-opcode.h	10 #define __PPC_RA(a) (((a)&0x1f) << 16) argument 12 #define __PPC_XA(a) ((((a)&0x1f) << 16) \| (((a)&0x20) >> 3)) argument 16 #define VSX_XX3(t, a, b) (__PPC_XT(t) \| __PPC_XA(a) \| __PPC_XB(b)) argument 17 #define VSX_XX1(s, a, b) (__PPC_XS(s) \| __PPC_RA(a) \| __PPC_RB(b)) argument 24 #define VPMSUMW(t, a, b) .long PPC_INST_VPMSUMW \| VSX_XX3((t), a, b) argument 25 #define VPMSUMD(t, a, b) .long PPC_INST_VPMSUMD \| VSX_XX3((t), a, b) argument 26 #define MFVRD(a, t) .long PPC_INST_MFVSRD \| VSX_XX1((t) + 32, a, 0) argument 27 #define MTVRD(t, a) .long PPC_INST_MTVSRD \| VSX_XX1((t) + 32, a, 0) argument
D	dynamic_bloom.h	129 size_t a = fastrange32(kLen, hashes[i]); in MayContain() local 130 PREFETCH(data_ + a, 0, 3); in MayContain() 131 byte_offsets[i] = a; in MayContain() 145 size_t a = fastrange32(kLen, h32); in Prefetch() local 146 PREFETCH(data_ + a, 0, 3); in Prefetch() 174 size_t a = fastrange32(kLen, h32); in MayContainHash() local 175 PREFETCH(data_ + a, 0, 3); in MayContainHash() 176 return DoubleProbe(h32, a); in MayContainHash() 198 size_t a = fastrange32(kLen, h32); in AddHash() local 199 PREFETCH(data_ + a, 0, 3); in AddHash() [all …]
/rocksdb-6.9/third-party/folly/folly/
D	Optional.h	`418 void swap(Optional<T>& a, Optional<T>& b) noexcept(noexcept(a.swap(b))) { in swap() argument 419 a.swap(b); in swap() 448 return a.hasValue() && a.value() == b; 453 return !(a == b); 463 return !(a == b); 471 if (a.hasValue()) { 479 return !(a == b); 487 if (a.hasValue()) { 495 return b < a; 500 return !(b < a); [all …]`
D	ConstexprMath.h	`10 constexpr T constexpr_max(T a) { in constexpr_max() argument 11 return a; in constexpr_max() 14 constexpr T constexpr_max(T a, T b, Ts... ts) { in constexpr_max() argument 15 return b < a ? constexpr_max(a, ts...) : constexpr_max(b, ts...); in constexpr_max() 20 constexpr T constexpr_log2_(T a, T e) { in constexpr_log2_() argument 21 return e == T(1) ? a : constexpr_log2_(a + T(1), e / T(2)); in constexpr_log2_()`
/rocksdb-6.9/docs/_posts/
D	2018-11-21-delete-range.markdown	13 Deleting a range of keys is a common pattern in RocksDB. Most systems built on top of 17 MyRocks is a MySQL fork using RocksDB as its storage engine. Each key's first 19 a table or index involves deleting all the keys with that prefix. 47 version at a lower level to reappear. 73 We could not think of a good way to do it, however, since the start of a range 88 tombstone is obsolete, and seqnum zeroing can cause a key 98 that newer versions of a key are always in a higher level to prevent the seqnum 100 tombstones seen during reads to ones in a similar key-range. 119 are flushed together into a single SST with a range tombstone meta-block. SSTs 180 Iterating in a database with v1 range tombstones is usually slower than in a [all …]
D	2015-02-27-write-batch-with-index.markdown	10 …a storage engine of a higher level database. In fact, we are currently plugging RocksDB into MySQL… 14 …a read happens they need to merge the result from RocksDB and from this buffer. This is a problem … 16 …a RocksDB data structure for atomic writes of multiple keys. Users can buffer their updates to a `… 18 …a transaction, we create a `WriteBatchWithIndex` attached to it. All the writes of the transaction… 20 …-your-own-writes in the RocksDB storage engine of MongoDB. If you also have a read-your-own-write …
D	2015-11-10-use-checkpoints-for-efficient-snapshots.markdown	10 …a feature in RocksDB which provides the ability to take a snapshot of a running RocksDB database i… 15 …a consistent snapshot of a given RocksDB database in the specified directory. If the snapshot is o… 20 A Checkpoint object needs to be created for a database before checkpoints are created. The API is a… 30 Given a checkpoint object and a directory, the CreateCheckpoint function creates a consistent snaps… 40 … be an absolute path. The checkpoint can be used as a read-only copy of the DB or can be opened a…
D	2015-07-17-spatial-indexing-in-rocksdb.markdown	10 …a year ago, there was a need to develop a spatial database at Facebook. We needed to store and ind… 14 …Earth's entire map data can fit in memory on a reasonably high-end machine. Thus, we also decided … 16 …streetmap.org/) dataset and hooked it up with [Mapnik](http://mapnik.org/), a map rendering engine. 18 …d the map data into a SQL-based database and then define map layers with SQL statements. To render… 20 …ading pipeline. However, the spatial indexing is available in RocksDB under a name [SpatialDB](htt… 22 …a tour of the API. When you create a spatial database, you specify the spatial indexes that need t… 37 When you insert a feature (building, street, country border) into SpatialDB, you need to specify th… 50 …a list of index tiles that it intersects. Then, we add a link from the tile's [quad key](https://m… 61 SpatialDB's query specifies: 1) bounding box we're interested in, and 2) a zoom level. We find all …
D	2018-08-23-data-block-hash-index.markdown	7 …d a _data block hash index_ in RocksDB that has the benefit of both reducing the CPU util and incr… 41 …a restart interval. One block consists of multiple restart intervals. The byte offset of the begin… 47 We implemented a hash map at the end of the block to index the key to reduce the CPU overhead of th… 52 …a hash bucket when storing the location of a key (or more precisely, the restart index of the rest… 54 …a utilization ratio is 0.5 and there are 100 buckets, 50 keys are stored in the bucket. The less t… 56 Space overhead depends on the util ratio. Each bucket is a `uint8_t` (i.e. one byte). For a util r… 68 We add a new function member to the comparator interface: 75 … the behavior of the comparator. If a comparator can regard different keys equal, the function ret… 82 …a very small util ratio will result in a large data block cache miss ratio, and the extra I/O may … 110 Orange bars are representing our hash index performance. We use a hash util ratio of 1.0 in this te… [all …]
D	2016-01-29-compaction_pri.markdown	10 …l increasing target size. Except a special level 0, every level is key-range partitioned into many… 20 …a level to the next level, it creates a hole. Over time, incoming compaction will fill data to the… 22 …ed, LevelDB's approach optimizes write amplification, because a file being picked covers a range w… 24 …a compaction priority kOldestSmallestSeqFirst for the same effect. With this mode, we always p… 28 …a DB only key 150-160 are updated and other keys are seldom updated. If level 1 contains 20 keys, … 30 …a file whose latest update is the oldest. It means there is no incoming data for the range for the… 34 If one file contains a lot of delete markers, it may slow down iterating over this area, because we… 36 …a file exceeds number of inserts, it is more likely to be picked for compaction. The more number o… 40 …a a compaction priority to optimize this case. In some of our use cases, we solved the problem in … 43 …es of compaction priority modes optimizing different scenarios. if you have a new use case, we sug… [all …]
D	2014-06-27-avoid-expensive-locks-in-get.markdown	12 …DB employs a multiversion concurrency control strategy. Before reading data, it needs to grab the … 27 …sDB from scaling read throughput beyond 8 cores. Running 32 read threads on a 32-core CPU leads to… 32 …a way to circumvent this problem by using [thread local storage](http://en.wikipedia.org/wiki/Thre… 59 …a pretty good [comparison between mutex and atomic](https://blogs.oracle.com/d/entry/the_cost_of_m… 64 …a thread can visit GetImpl() once but can never come back again. SuperVersion is referenced and ca… 69 (1) A reader thread uses CAS to acquire SuperVersion from its local storage and to put in a special… 74 …in its local storage. If it does not see SuperVersion::kSVInUse, that means a “sweep” was done and… 79 …d thread performs a sweep (CAS) across all threads’ local storage and frees encountered SuperVersi…
D	2014-03-27-how-to-backup-rocksdb.markdown	10 In RocksDB, we have implemented an easy way to backup your DB. Here is a simple example: 28 This simple example will create a backup of your DB in "/tmp/rocksdb_backup". Creating new Backupab… 73 …a new backup with `CreateNewBackup()` and only the new data will be copied to backup directory (fo… 77 …a backup ID and restores that particular backup. Checksum is calculated for any restored file and … 86 `BackupableDBOptions::info_log` is a Logger object that is used to print out LOG messages if not-nu… 88 … that backups will be consistent after a reboot or if machine crashes. Setting it to false will sp… 92 …thod takes a parameter `flush_before_backup`, which is false by default. When `flush_before_backup… 115 …a table file that is already present in the backup directory. For example, if there is a file `000… 128 …increasing and we have a file `LATEST_BACKUP` that contains the ID of the latest backup. If we cra…
D	2014-06-23-plaintable-a-new-file-format.markdown	7 - /blog/599/plaintable-a-new-file-format/ 10 …this post, we are introducing "PlainTable" -- a file format we designed for RocksDB, initially to … 22 …a balance between query performance and memory consumption. PlainTable query performance is not as… 28 1. to use a hash index, which is 31 Having addressed our latency goal, the next task was to design a very compact hash index to minimiz… 33 1. We only use 32-bit integers for data and index offsets.The first bit serves as a flag, so we can… 37 …a bloom filter check before the query. This adds only one cache miss for non-empty cases [1], but … 41 …proved the bloom filter to improve data locality - we may cover this further in a future blog post.
/rocksdb-6.9/
D	USERS.md	1 This document lists users of RocksDB and their use cases. If you are using RocksDB, please open a p… 10 4. Dragon -- a distributed graph query engine. https://code.facebook.com/posts/1737605303120405/dra… 11 5. Stylus -- a low-level stream processing framework writtenin C++.[1] 12 6. LogDevice -- a distributed data store for logs [2] 16 [2] https://code.facebook.com/posts/357056558062811/logdevice-a-distributed-data-store-for-logs/ 19 Two different use cases at Linkedin are using RocksDB as a storage engine: 37 Iron.io is using RocksDB as a storage engine for their distributed queueing system. 41 Tango is using RocksDB as a graph storage to store all users' connection data and other social acti… 71 quasardb uses a heavily tuned RocksDB as its persistence layer. 86 [Uber](http://eng.uber.com/cherami/) uses RocksDB as a durable and scalable task queue. [all …]
D	HISTORY.md	65 * Fix a bug that can cause write threads to hang when a slowdown/stall happens and there is a mix o… 85 * Fix a bug in which a snapshot read through an iterator could be affected by a DeleteRange after t… 132 * Add a new Env::LoadEnv() overloaded function to return a shared_ptr to Env. 170 …a lightweight API GetCurrentWalFile() to get last live WAL filename and size. Meant to be used as … 189 …b sometimes uses a string-append merge operator if no merge operator is passed in. This is to allo… 232 * Accessing a partition of a partitioned filter or index through a pinned reference is no longer co… 320 * Add a place holder in manifest which indicate a record from future that can be safely ignored. 505 * Close() method now returns a status when closing a db. 880 * Env::FileExists now returns a Status instead of a boolean 970 * New API to create a checkpoint added. Given a directory name, creates a new [all …]
D	COPYING	33 For example, if you distribute copies of such a program, whether 67 that is to say, a work containing the Program or a portion of it, 75 is covered only if its contents constitute a work based on the 87 You may charge a fee for the physical act of transferring a copy, and 91 of it, thus forming a work based on the Program, and copy and 114 These requirements apply to the modified work as a whole. If 119 distribute the same sections as part of a whole which is a work based 130 with the Program (or with a work based on the Program) on a volume of 197 7. If, as a consequence of a court judgment or allegation of patent 227 be a consequence of the rest of this License. [all …]
D	ROCKSDB_LITE.md	`3 …a project focused on mobile use cases, which don't need a lot of fancy things we've built for serv… 13 When adding a new big feature to RocksDB, please add ROCKSDB_LITE compile guard if: 15 * Your feature is adding a lot of weight to the binary. 18 * It would introduce a lot of code complexity. Compile guards make code harder to read. It's a trad… 19 * Your feature is not adding a lot of weight.`
/rocksdb-6.9/utilities/merge_operators/string_append/
D	stringappend_test.cc	`277 std::string a, b, c; in TEST_F() local 407 std::string a, b, c; in TEST_F() local 408 slists.Get("a", &a); in TEST_F() 433 std::string a, b, c; in TEST_F() local 434 slists.Get("a", &a); in TEST_F() 449 std::string a, b, c; in TEST_F() local 450 slists.Get("a", &a); in TEST_F() 465 std::string a, b, c; in TEST_F() local 498 slists.Get("a", &a); in TEST_F() 511 std::string a, b, c; in TEST_F() local [all …]`
/rocksdb-6.9/docs/
D	LICENSE-DOCUMENTATION	`7 Creative Commons public licenses does not create a lawyer-client or 78 synched in timed relation with a moving image. 119 public may access the material from a place and at a time 133 a. License grant. 151 6(a). 185 provided in Section 3(a)(1)(A)(i). 212 a. Attribution. 226 ii. a copyright notice; 263 a. for the avoidance of doubt, Section 2(a)(1) grants You the right 315 Section 6(a), it reinstates: [all …]`
D	CONTRIBUTING.md	16 Most content is written in markdown. You name the file `something.md`, then have a header that look… 35 If you want a `GridBlock` as part of your content, you can do so directly with HTML: 43 <li>The <a href="http://example.org/">Example</a></li> 44 <li><a href="http://example.com">Another Example</a></li> 60 or with a combination of changing `./_data/features.yml` and adding some Liquid to `index.md`, such… 68 To modify a blog post, edit the appopriate markdown file in `./_posts/`. 70 Adding a new blog post is a four-step process. 98 To modify a top-level page, edit the appropriate markdown file in `./top-level/` 100 If you want a top-level page (e.g., http://your-site.com/top-level.html) -- not in `/blog/` or `/do… 102 1. Create a markdown file in the root `./top-level/`. See `./doc-type-examples/top-level-example.md… [all …]
/rocksdb-6.9/java/src/main/java/org/rocksdb/util/
D	BytewiseComparator.java	36 public int compare(final ByteBuffer a, final ByteBuffer b) { in compare() argument 37 return _compare(a, b); in compare() 40 static int _compare(final ByteBuffer a, final ByteBuffer b) { in _compare() argument 41 assert(a != null && b != null); in _compare() 42 final int minLen = a.remaining() < b.remaining() ? in _compare() 43 a.remaining() : b.remaining(); in _compare() 44 int r = memcmp(a, b, minLen); in _compare() 46 if (a.remaining() < b.remaining()) { in _compare() 48 } else if (a.remaining() > b.remaining()) { in _compare()
/rocksdb-6.9/docs/_docs/
D	faq.md	12 …nt key-value store for fast storage. RocksDB can also be the foundation for a client-server databa… 20 …a database whose size was smaller than the size of RAM on the test machine – where the entire data… 22 …used 99-percentile latency to be tremendously large. We found that mmap-ing a file into the OS cac… 28 * A user-facing application that stores the viewing history and state of users of a website. 30 * A graph-search query that needs to scan a data set in realtime. 32 * A message-queue that supports a high number of inserts and deletes. 36 …a number of backend systems at Facebook. In the Facebook newsfeed’s backend, it replaced another i… 38 … is proving to be a useful component for a lot of other groups in the industry. For a list of proj… 40 ## How good is RocksDB as a database storage engine? 44 …a-space-and-write-optimized-mysql-database/) is the RocksDB based storage engine for MySQL. Using …
/rocksdb-6.9/examples/
D	Makefile	20 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 23 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 26 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 29 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 35 $(CXX) [email protected] -o$@ ../librocksdb.a $(PLATFORM_LDFLAGS) $(EXEC_LDFLAGS) 38 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 41 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 44 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL… 47 …$(CXX) $(CXXFLAGS) [email protected] -o$@ ../librocksdb.a -I../include -O2 -std=c++11 $(PLATFORM_LDFLAGS) $(PL…

12 3 4 5 6 7 8 9 10

TaskScheduler
dpdk
expo
f-stack
freebsd-12.1
freebsd-13.1
freebsd-14.2
iperf
leveldb-1.20
libedit-20250104-3.1
libev
libevent-2.1.12
libpciaccess
libtiff-4.0.7
lighttpd1.4
linux-6.15
llvm-project-15.0.7
mOS-networking-stack
memcached-1.4.29
memcached-1.6.32
oneTBB
pciutils
potrace-1.14
redis-3.2.3
rocksdb-6.9
rust-libc-0.2.174
sqlite-3.40.0
tonic
vim-8.2.3635
wasmtime-44.0.1
webrtc
xiu
xnu-11215