aboutsummaryrefslogtreecommitdiffstats
path: root/vespalib
Commit message (Collapse)AuthorAgeFilesLines
* Merge pull request #18132 from vespa-engine/arnej/actually-wait-for-connectivityArne H Juul2021-06-071-0/+3
|\ | | | | Arnej/actually wait for connectivity
| * add convenience methodArne Juul2021-06-041-0/+3
| |
* | Merge pull request #18114 from ↵Henning Baldersheim2021-06-042-5/+13
|\ \ | |/ |/| | | | | vespa-engine/balder/explicit-erase-when-capacity-is-low Use explicit erase to avoid clearing and resizing the hashtable when …
| * Move roundUp2inN<T> to vespalib.Henning Baldersheim2021-06-042-5/+13
| |
* | Add some sanity checking to NonPOD benchmarkHenning Baldersheim2021-06-041-6/+32
| |
* | Add benchmark for non POD objects.Henning Baldersheim2021-06-041-2/+28
| |
* | - Add benchmark for hashtable reconstruction.Henning Baldersheim2021-06-043-1/+26
|/ | | | | - Optimize by not initializing hash_node._node char array. - Also skip reconstruction, if it is in initial state.
* drop empty buffersHåvard Pettersen2021-06-018-0/+39
|
* Avoid breaking up short linesHenning Baldersheim2021-05-121-50/+29
|
* Sync is not a mandatory operation. Assuming the fs that fails sync are safe ↵Henning Baldersheim2021-05-121-17/+8
| | | | | | anyway. So let us just log a warning for now.
* Merge pull request #17645 from ↵Henning Baldersheim2021-04-281-2/+1
|\ | | | | | | | | vespa-engine/toregge/use-yield-instead-of-pause-on-arm Use yield instead of pause on arm.
| * Use std::this_thread::yield()Tor Egge2021-04-281-10/+1
| |
| * Use yield instead of pause on arm.Tor Egge2021-04-281-0/+8
| |
* | Use int for FastOS_UNIX_Application::GetOpt() return value.Tor Egge2021-04-281-1/+1
|/
* Disable intel optimization on arm.Tor Egge2021-04-282-3/+16
|
* Take array size into account when resizing vector for remapping EntryRefTor Egge2021-04-234-5/+8
| | | | | | | (i.e. when compacting unique store values). Add get_used_arrays() method to buffer state. Use unscaled_offset(). Use allocator_large for inner remapping vector.
* print diff of mismatching tensorsHåvard Pettersen2021-04-202-0/+22
| | | | also stop using vespalib testkit
* Add compaction of BTreeStore.Tor Egge2021-04-164-15/+106
|
* Factor out sorting of children to avoid reserving stackspace in the ↵Henning Baldersheim2021-04-151-1/+7
| | | | recursive path.
* Add compaction of B-tree nodes in BTreeStore.Tor Egge2021-04-155-0/+142
|
* Merge pull request #17403 from ↵Henning Baldersheim2021-04-147-11/+142
|\ | | | | | | | | vespa-engine/toregge/compact-enum-store-dictionary-when-needed Compact enum store dictionary when needed.
| * Add explicit unit test for compact_worst_shard().Tor Egge2021-04-141-0/+13
| |
| * Improve method name.Tor Egge2021-04-143-3/+3
| |
| * Compact enum store dictionary when needed.Tor Egge2021-04-136-11/+129
| |
* | Merge pull request #17428 from ↵Henning Baldersheim2021-04-142-1/+8
|\ \ | | | | | | | | | | | | vespa-engine/toregge/move-alignas-to-proper-position Move alignas to proper position.
| * | Move alignas to proper position.Tor Egge2021-04-142-1/+8
| |/
* / Remove unused variables.Tor Egge2021-04-141-7/+3
|/
* Report hash and B-tree memory usage separately for enum store dictionary.Tor Egge2021-04-083-0/+24
|
* Sort unique values during load if needed.Tor Egge2021-04-085-9/+11
|
* Add noexcept specifier to lambda.Tor Egge2021-04-071-1/+1
|
* Extend unit test for ShardedHashMap.Tor Egge2021-04-071-0/+61
|
* Rename unit test type parameters.Tor Egge2021-04-061-16/+16
|
* Merge pull request #17266 from ↵Henning Baldersheim2021-04-061-12/+62
|\ | | | | | | | | vespa-engine/balder/-remove-need-for-default-constructor-for-hash-elements - Use a unitialized buffer to store hash keys and values.
| * Add constexpr to the if statement.Henning Baldersheim2021-04-061-1/+1
| |
| * Separate invalidation and destruction.Henning Baldersheim2021-04-061-9/+11
| |
| * Invert the logic.Henning Baldersheim2021-04-061-2/+2
| |
| * - Only destruct when necessary.Henning Baldersheim2021-04-061-12/+18
| | | | | | | | | | - Avoid initializing twice. - Do not move invalid nodes.
| * - Use a unitialized buffer to store hash keys and values.Henning Baldersheim2021-04-041-11/+53
| | | | | | | | | | - Use placement new and explicit destructor calls to not take the cost before necessary. - This removes the need for a default constructor and unnecessary initialization.
* | Follow codestyle: getComp -> get_compHenning Baldersheim2021-04-062-5/+5
|/
* Test that foreach_key_range and operator- member functions on B-tree iteratorTor Egge2021-04-043-8/+42
| | | | don't depend on node identity.
* Compaction of B-tree can cause identity of nodes to change.Tor Egge2021-04-042-2/+32
| | | | Change operator== for B-tree iterator accordingly.
* - Based on feedback from callgrind and perf add hint about most likely ↵Henning Baldersheim2021-03-311-1/+1
| | | | | | branch in frequently called code. - Inline small frequent methods.
* Inline frequently called find method to allow compiler better chance to ↵Henning Baldersheim2021-03-312-18/+14
| | | | start division early to hide its cost in teh pipeline.
* Add ShardedHashComparator so that a single divison will be used for both ↵Henning Baldersheim2021-03-315-45/+58
| | | | | | dividend and remainder. The compiler will also be smarter about it as it is a known constsnt compile time both.
* Really remove const......Henning Baldersheim2021-03-311-1/+1
|
* No const on static methods.Henning Baldersheim2021-03-311-1/+2
|
* Hide private method. The call will either be cheaper, or it will most likely ↵Henning Baldersheim2021-03-312-2/+2
| | | | be inlined.
* Inline small frequently called methodsHenning Baldersheim2021-03-312-34/+24
|
* Avoid null pointer dereference.Tor Egge2021-03-312-14/+24
|
* Merge pull request #17234 from ↵Henning Baldersheim2021-03-3015-77/+384
|\ | | | | | | | | vespa-engine/oregge/hash-only-unique-store-dictionary Handle UniqueStoreDictionary without B-tree.