mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-10-31 04:22:25 -05:00 
			
		
		
		
	* persist queued worker tasks to database on shutdown, fill worker queues from database on startup
* ensure the tasks are sorted by creation time before pushing them
* add migration to insert WorkerTask{} into database, add test for worker task persistence
* add test for recovering worker queues from database
* quick tweak
* whoops we ended up with double cleaner job scheduling
* insert each task separately, because bun is throwing some reflection error??
* add specific checking of cancelled worker contexts
* add http request signing to deliveries recovered from database
* add test for outgoing public key ID being correctly set on delivery
* replace select with Queue.PopCtx()
* get rid of loop now we don't use it
* remove field now we don't use it
* ensure that signing func is set
* header values weren't being copied over 🤦
* use ptr for httpclient.Request in delivery
* move worker queue filling to later in server init process
* fix rebase issues
* make logging less shouty
* use slices.Delete() instead of copying / reslicing
* have database return tasks in ascending order instead of sorting them
* add a 1 minute timeout to persisting worker queues
		
	
			
		
			
				
	
	
		
			75 lines
		
	
	
	
		
			2.1 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			75 lines
		
	
	
	
		
			2.1 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| // GoToSocial
 | |
| // Copyright (C) GoToSocial Authors admin@gotosocial.org
 | |
| // SPDX-License-Identifier: AGPL-3.0-or-later
 | |
| //
 | |
| // This program is free software: you can redistribute it and/or modify
 | |
| // it under the terms of the GNU Affero General Public License as published by
 | |
| // the Free Software Foundation, either version 3 of the License, or
 | |
| // (at your option) any later version.
 | |
| //
 | |
| // This program is distributed in the hope that it will be useful,
 | |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of
 | |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | |
| // GNU Affero General Public License for more details.
 | |
| //
 | |
| // You should have received a copy of the GNU Affero General Public License
 | |
| // along with this program.  If not, see <http://www.gnu.org/licenses/>.
 | |
| 
 | |
| package httpclient
 | |
| 
 | |
| import (
 | |
| 	"net/http"
 | |
| 	"time"
 | |
| 
 | |
| 	"github.com/superseriousbusiness/gotosocial/internal/log"
 | |
| )
 | |
| 
 | |
| const (
 | |
| 	// starting backoff duration.
 | |
| 	baseBackoff = 2 * time.Second
 | |
| )
 | |
| 
 | |
| // Request wraps an HTTP request
 | |
| // to add our own retry / backoff.
 | |
| type Request struct {
 | |
| 	// Current backoff dur.
 | |
| 	backoff time.Duration
 | |
| 
 | |
| 	// Delivery attempts.
 | |
| 	attempts uint
 | |
| 
 | |
| 	// log fields.
 | |
| 	log.Entry
 | |
| 
 | |
| 	// underlying request.
 | |
| 	*http.Request
 | |
| }
 | |
| 
 | |
| // WrapRequest wraps an existing http.Request within
 | |
| // our own httpclient.Request with retry / backoff tracking.
 | |
| func WrapRequest(r *http.Request) *Request {
 | |
| 	rr := new(Request)
 | |
| 	rr.Request = r
 | |
| 	entry := log.WithContext(r.Context())
 | |
| 	entry = entry.WithField("method", r.Method)
 | |
| 	entry = entry.WithField("url", r.URL.String())
 | |
| 	if r.Body != nil {
 | |
| 		// Only add content-type header if a request body exists.
 | |
| 		entry = entry.WithField("contentType", r.Header.Get("Content-Type"))
 | |
| 	}
 | |
| 	// note our formatting library follows ptr values
 | |
| 	entry = entry.WithField("attempt", &rr.attempts)
 | |
| 	rr.Entry = entry
 | |
| 	return rr
 | |
| }
 | |
| 
 | |
| // GetBackOff returns the currently set backoff duration,
 | |
| // (using a default according to no. attempts if needed).
 | |
| func (r *Request) BackOff() time.Duration {
 | |
| 	if r.backoff <= 0 {
 | |
| 		// No backoff dur found, set our predefined
 | |
| 		// backoff according to a multiplier of 2^n.
 | |
| 		r.backoff = baseBackoff * 1 << (r.attempts + 1)
 | |
| 	}
 | |
| 	return r.backoff
 | |
| }
 |