mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-11-04 08:02:26 -06:00 
			
		
		
		
	* start work rewriting timeline cache type
* further work rewriting timeline caching
* more work integration new timeline code
* remove old code
* add local timeline, fix up merge conflicts
* remove old use of go-bytes
* implement new timeline code into more areas of codebase, pull in latest go-mangler, go-mutexes, go-structr
* remove old timeline package, add local timeline cache
* remove references to old timeline types that needed starting up in tests
* start adding page validation
* fix test-identified timeline cache package issues
* fix up more tests, fix missing required changes, etc
* add exclusion for test.out in gitignore
* clarify some things better in code comments
* tweak cache size limits
* fix list timeline cache fetching
* further list timeline fixes
* linter, ssssssssshhhhhhhhhhhh please
* fix linter hints
* reslice the output if it's beyond length of 'lim'
* remove old timeline initialization code, bump go-structr to v0.9.4
* continued from previous commit
* improved code comments
* don't allow multiple entries for BoostOfID values to prevent repeated boosts of same boosts
* finish writing more code comments
* some variable renaming, for ease of following
* change the way we update lo,hi paging values during timeline load
* improved code comments for updated / returned lo , hi paging values
* finish writing code comments for the StatusTimeline{} type itself
* fill in more code comments
* update go-structr version to latest with changed timeline unique indexing logic
* have a local and public timeline *per user*
* rewrite calls to public / local timeline calls
* remove the zero length check, as lo, hi values might still be set
* simplify timeline cache loading, fix lo/hi returns, fix timeline invalidation side-effects missing for some federated actions
* swap the lo, hi values 🤦
* add (now) missing slice reverse of tag timeline statuses when paging ASC
* remove local / public caches (is out of scope for this work), share more timeline code
* remove unnecessary change
* again, remove more unused code
* remove unused function to appease the linter
* move boost checking to prepare function
* fix use of timeline.lastOrder, fix incorrect range functions used
* remove comments for repeat code
* remove the boost logic from prepare function
* do a maximum of 5 loads, not 10
* add repeat boost filtering logic, update go-structr, general improvements
* more code comments
* add important note
* fix timeline tests now that timelines are returned in page order
* remove unused field
* add StatusTimeline{} tests
* add more status timeline tests
* start adding preloading support
* ensure repeat boosts are marked in preloaded entries
* share a bunch of the database load code in timeline cache, don't clear timelines on relationship change
* add logic to allow dynamic clear / preloading of timelines
* comment-out unused functions, but leave in place as we might end-up using them
* fix timeline preload state check
* much improved status timeline code comments
* more code comments, don't bother inserting statuses if timeline not preloaded
* shift around some logic to make sure things aren't accidentally left set
* finish writing code comments
* remove trim-after-insert behaviour
* fix-up some comments referring to old logic
* remove unsetting of lo, hi
* fix preload repeatBoost checking logic
* don't return on status filter errors, these are usually transient
* better concurrency safety in Clear() and Done()
* fix test broken due to addition of preloader
* fix repeatBoost logic that doesn't account for already-hidden repeatBoosts
* ensure edit submodels are dropped on cache insertion
* update code-comment to expand CAS accronym
* use a plus1hULID() instead of 24h
* remove unused functions
* add note that public / local timeline requester can be nil
* fix incorrect visibility filtering of tag timeline statuses
* ensure we filter home timeline statuses on local only
* some small re-orderings to confirm query params in correct places
* fix the local only home timeline filter func
		
	
			
		
			
				
	
	
		
			284 lines
		
	
	
	
		
			6.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			284 lines
		
	
	
	
		
			6.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
//go:build go1.22 && !go1.25
 | 
						|
 | 
						|
package structr
 | 
						|
 | 
						|
import (
 | 
						|
	"fmt"
 | 
						|
	"reflect"
 | 
						|
	"runtime"
 | 
						|
	"strings"
 | 
						|
	"unicode"
 | 
						|
	"unicode/utf8"
 | 
						|
	"unsafe"
 | 
						|
 | 
						|
	"codeberg.org/gruf/go-mangler"
 | 
						|
)
 | 
						|
 | 
						|
// struct_field contains pre-prepared type
 | 
						|
// information about a struct's field member,
 | 
						|
// including memory offset and hash function.
 | 
						|
type struct_field struct {
 | 
						|
	rtype reflect.Type
 | 
						|
 | 
						|
	// struct field type mangling
 | 
						|
	// (i.e. fast serializing) fn.
 | 
						|
	mangle mangler.Mangler
 | 
						|
 | 
						|
	// zero value data, used when
 | 
						|
	// nil encountered during ptr
 | 
						|
	// offset following.
 | 
						|
	zero unsafe.Pointer
 | 
						|
 | 
						|
	// mangled zero value string,
 | 
						|
	// if set this indicates zero
 | 
						|
	// values of field not allowed
 | 
						|
	zerostr string
 | 
						|
 | 
						|
	// offsets defines whereabouts in
 | 
						|
	// memory this field is located.
 | 
						|
	offsets []next_offset
 | 
						|
 | 
						|
	// determines whether field type
 | 
						|
	// is ptr-like in-memory, and so
 | 
						|
	// requires a further dereference.
 | 
						|
	likeptr bool
 | 
						|
}
 | 
						|
 | 
						|
// next_offset defines a next offset location
 | 
						|
// in a struct_field, first by the number of
 | 
						|
// derefences required, then by offset from
 | 
						|
// that final memory location.
 | 
						|
type next_offset struct {
 | 
						|
	derefs uint
 | 
						|
	offset uintptr
 | 
						|
}
 | 
						|
 | 
						|
// find_field will search for a struct field with given set of names,
 | 
						|
// where names is a len > 0 slice of names account for struct nesting.
 | 
						|
func find_field(t reflect.Type, names []string) (sfield struct_field) {
 | 
						|
	var (
 | 
						|
		// is_exported returns whether name is exported
 | 
						|
		// from a package; can be func or struct field.
 | 
						|
		is_exported = func(name string) bool {
 | 
						|
			r, _ := utf8.DecodeRuneInString(name)
 | 
						|
			return unicode.IsUpper(r)
 | 
						|
		}
 | 
						|
 | 
						|
		// pop_name pops the next name from
 | 
						|
		// the provided slice of field names.
 | 
						|
		pop_name = func() string {
 | 
						|
			name := names[0]
 | 
						|
			names = names[1:]
 | 
						|
			if !is_exported(name) {
 | 
						|
				panic(fmt.Sprintf("field is not exported: %s", name))
 | 
						|
			}
 | 
						|
			return name
 | 
						|
		}
 | 
						|
 | 
						|
		// field is the iteratively searched
 | 
						|
		// struct field value in below loop.
 | 
						|
		field reflect.StructField
 | 
						|
	)
 | 
						|
 | 
						|
	for len(names) > 0 {
 | 
						|
		// Pop next name.
 | 
						|
		name := pop_name()
 | 
						|
 | 
						|
		var off next_offset
 | 
						|
 | 
						|
		// Dereference any ptrs to struct.
 | 
						|
		for t.Kind() == reflect.Pointer {
 | 
						|
			t = t.Elem()
 | 
						|
			off.derefs++
 | 
						|
		}
 | 
						|
 | 
						|
		// Check for valid struct type.
 | 
						|
		if t.Kind() != reflect.Struct {
 | 
						|
			panic(fmt.Sprintf("field %s is not struct (or ptr-to): %s", t, name))
 | 
						|
		}
 | 
						|
 | 
						|
		var ok bool
 | 
						|
 | 
						|
		// Look for next field by name.
 | 
						|
		field, ok = t.FieldByName(name)
 | 
						|
		if !ok {
 | 
						|
			panic(fmt.Sprintf("unknown field: %s", name))
 | 
						|
		}
 | 
						|
 | 
						|
		// Set next offset value.
 | 
						|
		off.offset = field.Offset
 | 
						|
		sfield.offsets = append(sfield.offsets, off)
 | 
						|
 | 
						|
		// Set the next type.
 | 
						|
		t = field.Type
 | 
						|
	}
 | 
						|
 | 
						|
	// Check if ptr-like in-memory.
 | 
						|
	sfield.likeptr = like_ptr(t)
 | 
						|
 | 
						|
	// Set final type.
 | 
						|
	sfield.rtype = t
 | 
						|
 | 
						|
	// Find mangler for field type.
 | 
						|
	sfield.mangle = mangler.Get(t)
 | 
						|
 | 
						|
	// Get new zero value data ptr.
 | 
						|
	v := reflect.New(t).Elem()
 | 
						|
	zptr := eface_data(v.Interface())
 | 
						|
	zstr := sfield.mangle(nil, zptr)
 | 
						|
	sfield.zerostr = string(zstr)
 | 
						|
	sfield.zero = zptr
 | 
						|
 | 
						|
	return
 | 
						|
}
 | 
						|
 | 
						|
// extract_fields extracts given structfields from the provided value type,
 | 
						|
// this is done using predetermined struct field memory offset locations.
 | 
						|
func extract_fields(ptr unsafe.Pointer, fields []struct_field) []unsafe.Pointer {
 | 
						|
 | 
						|
	// Prepare slice of field value pointers.
 | 
						|
	ptrs := make([]unsafe.Pointer, len(fields))
 | 
						|
	if len(ptrs) != len(fields) {
 | 
						|
		panic(assert("BCE"))
 | 
						|
	}
 | 
						|
 | 
						|
	for i, field := range fields {
 | 
						|
		// loop scope.
 | 
						|
		fptr := ptr
 | 
						|
 | 
						|
		for _, offset := range field.offsets {
 | 
						|
			// Dereference any ptrs to offset.
 | 
						|
			fptr = deref(fptr, offset.derefs)
 | 
						|
			if fptr == nil {
 | 
						|
				break
 | 
						|
			}
 | 
						|
 | 
						|
			// Jump forward by offset to next ptr.
 | 
						|
			fptr = unsafe.Pointer(uintptr(fptr) +
 | 
						|
				offset.offset)
 | 
						|
		}
 | 
						|
 | 
						|
		if field.likeptr && fptr != nil {
 | 
						|
			// Further dereference value ptr.
 | 
						|
			fptr = *(*unsafe.Pointer)(fptr)
 | 
						|
		}
 | 
						|
 | 
						|
		if fptr == nil {
 | 
						|
			// Use zero value.
 | 
						|
			fptr = field.zero
 | 
						|
		}
 | 
						|
 | 
						|
		// Set field ptr.
 | 
						|
		ptrs[i] = fptr
 | 
						|
	}
 | 
						|
 | 
						|
	return ptrs
 | 
						|
}
 | 
						|
 | 
						|
// pkey_field contains pre-prepared type
 | 
						|
// information about a primary key struct's
 | 
						|
// field member, including memory offset.
 | 
						|
type pkey_field struct {
 | 
						|
	rtype reflect.Type
 | 
						|
 | 
						|
	// offsets defines whereabouts in
 | 
						|
	// memory this field is located.
 | 
						|
	offsets []next_offset
 | 
						|
 | 
						|
	// determines whether field type
 | 
						|
	// is ptr-like in-memory, and so
 | 
						|
	// requires a further dereference.
 | 
						|
	likeptr bool
 | 
						|
}
 | 
						|
 | 
						|
// extract_pkey will extract a pointer from 'ptr', to
 | 
						|
// the primary key struct field defined by 'field'.
 | 
						|
func extract_pkey(ptr unsafe.Pointer, field pkey_field) unsafe.Pointer {
 | 
						|
	for _, offset := range field.offsets {
 | 
						|
		// Dereference any ptrs to offset.
 | 
						|
		ptr = deref(ptr, offset.derefs)
 | 
						|
		if ptr == nil {
 | 
						|
			return nil
 | 
						|
		}
 | 
						|
 | 
						|
		// Jump forward by offset to next ptr.
 | 
						|
		ptr = unsafe.Pointer(uintptr(ptr) +
 | 
						|
			offset.offset)
 | 
						|
	}
 | 
						|
 | 
						|
	if field.likeptr && ptr != nil {
 | 
						|
		// Further dereference value ptr.
 | 
						|
		ptr = *(*unsafe.Pointer)(ptr)
 | 
						|
	}
 | 
						|
 | 
						|
	return ptr
 | 
						|
}
 | 
						|
 | 
						|
// like_ptr returns whether type's kind is ptr-like in-memory,
 | 
						|
// which indicates it may need a final additional dereference.
 | 
						|
func like_ptr(t reflect.Type) bool {
 | 
						|
	switch t.Kind() {
 | 
						|
	case reflect.Array:
 | 
						|
		switch n := t.Len(); n {
 | 
						|
		case 1:
 | 
						|
			// specifically single elem arrays
 | 
						|
			// follow like_ptr for contained type.
 | 
						|
			return like_ptr(t.Elem())
 | 
						|
		}
 | 
						|
	case reflect.Struct:
 | 
						|
		switch n := t.NumField(); n {
 | 
						|
		case 1:
 | 
						|
			// specifically single field structs
 | 
						|
			// follow like_ptr for contained type.
 | 
						|
			return like_ptr(t.Field(0).Type)
 | 
						|
		}
 | 
						|
	case reflect.Pointer,
 | 
						|
		reflect.Map,
 | 
						|
		reflect.Chan,
 | 
						|
		reflect.Func:
 | 
						|
		return true
 | 
						|
	}
 | 
						|
	return false
 | 
						|
}
 | 
						|
 | 
						|
// deref will dereference ptr 'n' times (or until nil).
 | 
						|
func deref(p unsafe.Pointer, n uint) unsafe.Pointer {
 | 
						|
	for ; n > 0; n-- {
 | 
						|
		if p == nil {
 | 
						|
			return nil
 | 
						|
		}
 | 
						|
		p = *(*unsafe.Pointer)(p)
 | 
						|
	}
 | 
						|
	return p
 | 
						|
}
 | 
						|
 | 
						|
// eface_data returns the data ptr from an empty interface.
 | 
						|
func eface_data(a any) unsafe.Pointer {
 | 
						|
	type eface struct{ _, data unsafe.Pointer }
 | 
						|
	return (*eface)(unsafe.Pointer(&a)).data
 | 
						|
}
 | 
						|
 | 
						|
// assert can be called to indicated a block
 | 
						|
// of code should not be able to be reached,
 | 
						|
// it returns a BUG report with callsite.
 | 
						|
//
 | 
						|
//go:noinline
 | 
						|
func assert(assert string) string {
 | 
						|
	pcs := make([]uintptr, 1)
 | 
						|
	_ = runtime.Callers(2, pcs)
 | 
						|
	fn := runtime.FuncForPC(pcs[0])
 | 
						|
	funcname := "go-structr" // by default use just our library name
 | 
						|
	if fn != nil {
 | 
						|
		funcname = fn.Name()
 | 
						|
		if i := strings.LastIndexByte(funcname, '/'); i != -1 {
 | 
						|
			funcname = funcname[i+1:]
 | 
						|
		}
 | 
						|
	}
 | 
						|
	var buf strings.Builder
 | 
						|
	buf.Grow(32 + len(assert) + len(funcname))
 | 
						|
	buf.WriteString("BUG: assertion \"")
 | 
						|
	buf.WriteString(assert)
 | 
						|
	buf.WriteString("\" failed in ")
 | 
						|
	buf.WriteString(funcname)
 | 
						|
	return buf.String()
 | 
						|
}
 |