Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | delete copy yield awaiter copy constructor explicitly | Håvard Pettersen | 2022-10-21 | 1 | -0/+1 |
| | |||||
* | generator coroutine return value | Håvard Pettersen | 2022-10-19 | 4 | -0/+394 |
| | |||||
* | Small array is most likely. | Henning Baldersheim | 2022-10-18 | 1 | -1/+1 |
| | |||||
* | Ref [[unlikely]] not valid. | Henning Baldersheim | 2022-10-18 | 1 | -1/+1 |
| | |||||
* | - Use unique_ptr to hide FuzzyMatcher to make most common SearchContext smaller. | Henning Baldersheim | 2022-10-17 | 2 | -7/+6 |
| | | | | - GC unused stringattribute files. | ||||
* | - Always check if enough space to write. | Henning Baldersheim | 2022-10-17 | 1 | -1/+2 |
| | | | | | | - Split large initSortData method. - make buffer resizing explicit and readable. - Make a better initial estimate for buffer size. | ||||
* | Stop bypassing hold list for btree nodes that were never reachable for readers. | Tor Egge | 2022-10-14 | 7 | -45/+16 |
| | |||||
* | Add fallback variant when std::jthread is not available. (#24440) | Tor Egge | 2022-10-14 | 1 | -2/+5 |
| | | | | | * just use thread instead Co-authored-by: Håvard Pettersen <havardpe@yahooinc.com> | ||||
* | Adjust expected size for array store when using libc++. | Tor Egge | 2022-10-14 | 1 | -1/+1 |
| | |||||
* | Use the generic CompactionContext in ArrayStore. | Geir Storli | 2022-10-13 | 3 | -38/+13 |
| | |||||
* | Merge pull request #24423 from ↵ | Henning Baldersheim | 2022-10-13 | 1 | -6/+5 |
|\ | | | | | | | | | vespa-engine/havardpe/better-return-value-handling unify return value handling using universal references | ||||
| * | unify return value handling using universal references | Håvard Pettersen | 2022-10-13 | 1 | -6/+5 |
| | | | | | | | | | | | | | | | | | | | | | | | | the requires clause is there to make sure we are only allowed to return values that are implicitly convertible to T; this will avoid calling explicit constructors 'implicitly' (as seem from the co_return statement). (the internal optional requires assignability to also cover the case where the value is not constructed, but overwritten, which probably imposes a similar restriction, but if we stop using optional, the require becomes more useful) | ||||
* | | Merge pull request #24419 from vespa-engine/geirst/hash-map-hold-list | Tor Egge | 2022-10-13 | 2 | -48/+35 |
|\ \ | |/ |/| | Use the generic generation hold list for node indexes. | ||||
| * | Use the generic generation hold list for node indexes. | Geir Storli | 2022-10-13 | 2 | -48/+35 |
| | | |||||
* | | add suppression and make safer | Håvard Pettersen | 2022-10-13 | 1 | -5/+5 |
| | | | | | | | | | | | | - add new valgrind suppression variant for leaked thread stack cache - hold lock while editing list of threads - use jthread for join in destructor | ||||
* | | Apply suggestions from code review | Håvard Pettersen | 2022-10-13 | 1 | -3/+3 |
| | | | | | | | | | | typos Co-authored-by: Tor Brede Vekterli <vekterli@yahooinc.com> | ||||
* | | Merge branch 'master' into havardpe/more-coroutines | Håvard Pettersen | 2022-10-13 | 44 | -253/+255 |
|\| | |||||
| * | Merge pull request #24412 from ↵ | Henning Baldersheim | 2022-10-12 | 1 | -2/+2 |
| |\ | | | | | | | | | | | | | vespa-engine/toregge/avoid-shadowing-warning-with-clang-15 Avoid shadowing warning with clang 15. | ||||
| | * | Avoid shadowing warning with clang 15. | Tor Egge | 2022-10-12 | 1 | -2/+2 |
| | | | |||||
| * | | Include utility to get definition of std::exchange. | Tor Egge | 2022-10-12 | 1 | -0/+1 |
| | | | |||||
| * | | Include algorithm to get definition of std::sort | Tor Egge | 2022-10-12 | 1 | -0/+1 |
| |/ | |||||
| * | Rename removeOldGenerations() -> reclaim_memory(). | Geir Storli | 2022-10-12 | 4 | -6/+6 |
| | | |||||
| * | Rename clearHoldLists() -> reclaim_all_memory(). | Geir Storli | 2022-10-12 | 10 | -14/+14 |
| | | |||||
| * | Rename trimHoldLists() -> reclaim_memory(). | Geir Storli | 2022-10-12 | 28 | -89/+89 |
| | | |||||
| * | Rename transferHoldLists() -> assign_generation(). | Geir Storli | 2022-10-12 | 28 | -78/+77 |
| | | |||||
| * | Rename first used generation -> oldest used generation. | Geir Storli | 2022-10-12 | 13 | -51/+51 |
| | | |||||
| * | Merge pull request #24393 from ↵v8.67.17 | Geir Storli | 2022-10-11 | 16 | -32/+33 |
| |\ | | | | | | | | | | | | | vespa-engine/toregge/rename-icompactable-move-to-move-on-compact Rename ICompactable::move to move_on_compact. | ||||
| | * | Rename ICompactable::move to move_on_compact. | Tor Egge | 2022-10-11 | 16 | -32/+33 |
| | | | |||||
* | | | more coroutines | Håvard Pettersen | 2022-10-12 | 4 | -23/+173 |
|/ / | |||||
* | | Merge pull request #24339 from vespa-engine/havardpe/experiment-with-coroutines | Håvard Pettersen | 2022-10-11 | 9 | -3/+218 |
|\ \ | |/ |/| | experiment with coroutines | ||||
| * | experiment with coroutines | Håvard Pettersen | 2022-10-06 | 9 | -3/+218 |
| | | |||||
* | | Use the generic hold list for entry refs in a datastore. | Geir Storli | 2022-10-11 | 11 | -126/+152 |
| | | |||||
* | | Implement GenerationHolder in terms of the generic generation hold list. | Geir Storli | 2022-10-10 | 13 | -213/+81 |
| | | |||||
* | | Implement a generic hold list for data elements associated with a generation. | Geir Storli | 2022-10-10 | 7 | -10/+211 |
| | | |||||
* | | Use more modern C++ features. | Geir Storli | 2022-10-07 | 2 | -29/+30 |
| | | |||||
* | | Hide implementation details in datastore classes. | Geir Storli | 2022-10-07 | 3 | -29/+41 |
| | | |||||
* | | Hide more details inside BufferState and reduce external API on BufferStats. | Geir Storli | 2022-10-07 | 12 | -85/+122 |
| | | | | | | | | | | Using incDead() directly is no longer supported as marking elements as dead right before they are put on hold is unnecessary. | ||||
* | | Include algorithm to get definition of std::find | Tor Egge | 2022-10-06 | 1 | -0/+1 |
| | | |||||
* | | Move tracking of datastore buffer statistics to separate classes. | Geir Storli | 2022-10-06 | 20 | -217/+319 |
| | | |||||
* | | Remove unused DataStoreBase::startCompactWorstBuffer() member functions. | Tor Egge | 2022-10-06 | 2 | -40/+0 |
| | | |||||
* | | Stop using DataStoreBase::startCompact() member function. | Tor Egge | 2022-10-06 | 12 | -64/+22 |
| | | |||||
* | | Use vespalib::datastore::CompactionContext when compacting tensor attributes. | Tor Egge | 2022-10-06 | 4 | -1/+66 |
| | | |||||
* | | Use datastore free list handling with a simpler API. | Geir Storli | 2022-10-05 | 13 | -192/+70 |
| | | |||||
* | | Implement new free list handling for datastores with a simpler API. | Geir Storli | 2022-10-05 | 8 | -2/+324 |
| | | |||||
* | | Update expected sizes when using libc++. | Tor Egge | 2022-10-04 | 1 | -2/+2 |
| | | |||||
* | | Add vespalib::datastore::CompactingBuffers. | Tor Egge | 2022-10-04 | 18 | -131/+147 |
| | | |||||
* | | Add vespalib::datastore::Aligner. | Tor Egge | 2022-10-04 | 1 | -0/+45 |
| | | |||||
* | | Remove AlignedEntryRef. | Tor Egge | 2022-10-03 | 9 | -92/+24 |
| | | |||||
* | | Implement allocate() function on ArrayStore. | Geir Storli | 2022-10-03 | 3 | -35/+122 |
| | | | | | | | | | | This can be used when serializing objects into char buffers when e.g. using an ArrayStore<char> for memory management. | ||||
* | | Add TensorBufferStore. | Tor Egge | 2022-09-30 | 1 | -1/+2 |
| | |