aboutsummaryrefslogtreecommitdiffstats
path: root/storage
Commit message (Collapse)AuthorAgeFilesLines
* Merge pull request #28062 from vespa-engine/vekterli/post-review-changesHenning Baldersheim2023-08-167-15/+15
|\ | | | | Minor post-review changes
| * Take existing map size into account when resizing upTor Brede Vekterli2023-08-161-1/+1
| |
| * Use `std::span` with fixed extent instead of `ConstArrayRef`Tor Brede Vekterli2023-08-162-3/+3
| |
| * Rename destructive statistics read function to be more clear in its semanticsTor Brede Vekterli2023-08-164-11/+11
| |
* | Go back to vertical listing of long parameter lists.Henning Baldersheim2023-08-161-4/+9
| |
* | Rename methods to follow style in classHenning Baldersheim2023-08-165-13/+11
| |
* | GC last use of hasItem, and use lookup interface directly.Henning Baldersheim2023-08-1615-58/+50
| |
* | Check size before checking content.Henning Baldersheim2023-08-161-0/+1
| |
* | Drop number of anonymous namespaces by grouping related methods together.Henning Baldersheim2023-08-161-46/+34
| |
* | - Avoid going via a temporary IdealNodesList.Henning Baldersheim2023-08-1417-236/+253
|/ | | | | | | - Use ConstArrayRef to hide implementation. - Store all 3 node categories in a single vector. - Use a small_vector that can handle redundancy up to 5 without requiring extra memory allocation. - Build a hash_map if redundancy/groups > 32 for constant lookup time.
* When splitting a large number of nodes into their leaf groups you end up ↵Henning Baldersheim2023-08-111-18/+21
| | | | | | with many vectors with only a single node in them. Then it is more efficient to use a small_vector that keeps the 4 first entries within. Reduces # allocations and avoids indirection.
* Merge pull request #28023 from vespa-engine/balder/minor-layout-cleanupHenning Baldersheim2023-08-113-132/+45
|\ | | | | Minor code health.
| * Minor code health.Henning Baldersheim2023-08-103-132/+45
| |
* | Modern c++ for loop.Henning Baldersheim2023-08-103-37/+33
| |
* | Reduce use of default values in method callsHenning Baldersheim2023-08-106-146/+63
| |
* | GC unused default value countInvalidAsConsistentHenning Baldersheim2023-08-104-43/+28
| |
* | Add noexceptHenning Baldersheim2023-08-103-80/+94
| |
* | Unify code layoutHenning Baldersheim2023-08-101-36/+16
|/
* Merge pull request #28021 from ↵Henning Baldersheim2023-08-1012-66/+58
|\ | | | | | | | | vespa-engine/balder/generate-fast-idealstate-lookup-once Balder/generate fast idealstate lookup once
| * Remove outdated commentHenning Baldersheim2023-08-101-30/+15
| |
| * Generate fast lookup table for ideal onceHenning Baldersheim2023-08-1012-36/+43
| |
* | Merge pull request #28017 from vespa-engine/balder/pass-time-alongHenning Baldersheim2023-08-109-92/+76
|\ \ | |/ |/| Balder/pass time along
| * Time tracking will not be started until html has been requested at least once.Henning Baldersheim2023-08-107-49/+61
| |
| * Unify code layoutHenning Baldersheim2023-08-102-43/+15
| |
* | Merge pull request #28011 from vespa-engine/balder/avoid-copying-idealstateHenning Baldersheim2023-08-106-186/+90
|\ \ | | | | | | Balder/avoid copying idealstate
| * | No need to check something that will always be false.Henning Baldersheim2023-08-101-1/+1
| | |
| * | Avoid copying the ideal state out from the ideal state bundle.Henning Baldersheim2023-08-105-185/+89
| |/ | | | | | | It is just used as a const reference.
* | Merge pull request #28005 from vespa-engine/balder/use-hash-mapHenning Baldersheim2023-08-105-51/+102
|\ \ | |/ |/| - Use hash_map instead of std::unordered_set dur to performance and m…
| * Properly reset duration.Henning Baldersheim2023-08-101-1/+1
| |
| * Clear all members.Henning Baldersheim2023-08-102-1/+3
| |
| * - Use hash_map instead of std::unordered_set dur to performance and memory ↵Henning Baldersheim2023-08-095-51/+100
| | | | | | | | | | | | fragmentation. - Move code from .h to .cpp that uses a lot of templated code.
* | Merge pull request #28008 from ↵Henning Baldersheim2023-08-1013-68/+57
|\ \ | | | | | | | | | | | | vespa-engine/balder/use-hash_map-for-message-tracking Use faster and lighter hash_map for message tracking in distributor.
| * | Move shared_ptrs where possible and reserve space in the vectors once.Henning Baldersheim2023-08-0913-59/+47
| | |
| * | Use faster and lighter hash_map for message tracking in distributor.Henning Baldersheim2023-08-092-9/+10
| | |
* | | - Since the vespalib::hash_map iterators are invalidated on modification ↵Henning Baldersheim2023-08-097-20/+16
|/ / | | | | | | | | | | store a unique_ptr in the map and deref the pointer instead. - Also expose vectors as const &.
* / GC void ignoreNewFeatures flag always false.Henning Baldersheim2023-08-091-1/+1
|/
* Merge pull request #27991 from ↵Henning Baldersheim2023-08-0913-20/+20
|\ | | | | | | | | vespa-engine/balder/use-hash-set-for-outdated-nodes Use a vespalib::hash_set<uint8_t> instead of std::unordered_set
| * Use a vespalib::hash_set<uint8_t> instead of std::unordered_setHenning Baldersheim2023-08-0913-20/+20
| |
* | Merge pull request #27990 from vespa-engine/balder/minor-noexceptHenning Baldersheim2023-08-092-4/+4
|\ \ | | | | | | Add noexcept and minor style changes
| * | Add noexcept and minor style changesHenning Baldersheim2023-08-082-4/+4
| | |
* | | Merge pull request #27989 from vespa-engine/balder/faster-bucketdb-metricsHenning Baldersheim2023-08-0912-68/+59
|\ \ \ | | | | | | | | Move where possible
| * | | Use vespalib::hash_mapHenning Baldersheim2023-08-081-3/+2
| | | |
| * | | Unify on a single definition of MinReplicaMapHenning Baldersheim2023-08-0811-32/+26
| | | |
| * | | Move where possibleHenning Baldersheim2023-08-083-35/+33
| |/ /
* | | Merge pull request #27988 from ↵Henning Baldersheim2023-08-0911-69/+34
|\ \ \ | |_|/ |/| | | | | | | | vespa-engine/balder/prepare-for-better-stats-reset-code Balder/prepare for better stats reset code
| * | GC unused codeHenning Baldersheim2023-08-083-30/+9
| | |
| * | Use std::arrayHenning Baldersheim2023-08-082-11/+10
| | |
| * | Inline simple methodHenning Baldersheim2023-08-082-11/+7
| | |
| * | GC unused codeHenning Baldersheim2023-08-082-10/+0
| | |
| * | Use ConstArrayRefHenning Baldersheim2023-08-082-2/+3
| | |