mirror of
https://github.com/superseriousbusiness/gotosocial.git
synced 2025-11-03 23:22:25 -06:00
84279f6a6a* improvements to caching for lists and relationship to accounts / follows * fix nil panic in AddToList() * ensure list related caches are correctly invalidated * ensure returned ID lists are ordered correctly * bump go-structr to v0.8.9 (returns early if zero uncached keys to be loaded) * remove zero checks in uncached key load functions (go-structr now handles this) * fix issues after rebase on upstream/main * update the expected return order of CSV exports (since list entries are now down by entry creation date) * rename some funcs, allow deleting list entries for multiple follow IDs at a time, fix up more tests * use returning statements on delete to get cache invalidation info * fixes to recent database delete changes * fix broken list entries delete sql * remove unused db function * update remainder of delete functions to behave in similar way, some other small tweaks * fix delete user sql, allow returning on err no entries * uncomment + fix list database tests * update remaining list tests * update envparsing test * add comments to each specific key being invalidated * add more cache invalidation explanatory comments * whoops; actually delete poll votes from database in the DeletePollByID() func * remove added but-commented-out field * improved comment regarding paging being disabled * make cache invalidation comments match what's actually happening * fix up delete query comments to match what is happening * rename function to read a bit better * don't use ErrNoEntries on delete when not needed (it's only needed for a RETURNING call) * update function name in test * move list exclusivity check to AFTER eligibility check. use log.Panic() instead of panic() * use the poll_id column in poll_votes for selecting votes in poll ID * fix function name
62 lines
1.3 KiB
Go
62 lines
1.3 KiB
Go
package structr
|
|
|
|
import (
|
|
"sync"
|
|
"unsafe"
|
|
)
|
|
|
|
type indexed_item struct {
|
|
// linked list elem this item
|
|
// is stored in a main list.
|
|
elem list_elem
|
|
|
|
// cached data with type.
|
|
data interface{}
|
|
|
|
// indexed stores the indices
|
|
// this item is stored under.
|
|
indexed []*index_entry
|
|
}
|
|
|
|
var indexed_item_pool sync.Pool
|
|
|
|
// new_indexed_item returns a new prepared indexed_item.
|
|
func new_indexed_item() *indexed_item {
|
|
v := indexed_item_pool.Get()
|
|
if v == nil {
|
|
v = new(indexed_item)
|
|
}
|
|
item := v.(*indexed_item)
|
|
ptr := unsafe.Pointer(item)
|
|
item.elem.data = ptr
|
|
return item
|
|
}
|
|
|
|
// free_indexed_item releases the indexed_item.
|
|
func free_indexed_item(item *indexed_item) {
|
|
item.elem.data = nil
|
|
item.indexed = item.indexed[:0]
|
|
item.data = nil
|
|
indexed_item_pool.Put(item)
|
|
}
|
|
|
|
// drop_index will drop the given index entry from item's indexed.
|
|
func (i *indexed_item) drop_index(entry *index_entry) {
|
|
for x := 0; x < len(i.indexed); x++ {
|
|
if i.indexed[x] != entry {
|
|
// Prof. Obiwan:
|
|
// this is not the index
|
|
// we are looking for.
|
|
continue
|
|
}
|
|
|
|
// Unset tptr value to
|
|
// ensure GC can take it.
|
|
i.indexed[x] = nil
|
|
|
|
// Move all index entries down + reslice.
|
|
_ = copy(i.indexed[x:], i.indexed[x+1:])
|
|
i.indexed = i.indexed[:len(i.indexed)-1]
|
|
break
|
|
}
|
|
}
|