| 
									
										
										
										
											2023-03-12 16:00:57 +01:00
										 |  |  | // 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/>. | 
					
						
							| 
									
										
										
										
											2021-07-11 16:22:21 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | package timeline | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | import ( | 
					
						
							| 
									
										
										
										
											2021-06-21 12:27:23 +02:00
										 |  |  | 	"container/list" | 
					
						
							| 
									
										
										
										
											2021-08-25 15:34:33 +02:00
										 |  |  | 	"context" | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 	"errors" | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2022-07-19 09:47:55 +01:00
										 |  |  | 	"codeberg.org/gruf/go-kv" | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 	"github.com/superseriousbusiness/gotosocial/internal/db" | 
					
						
							| 
									
										
										
										
											2024-05-06 04:49:08 -07:00
										 |  |  | 	statusfilter "github.com/superseriousbusiness/gotosocial/internal/filter/status" | 
					
						
							| 
									
										
										
										
											2023-06-04 18:55:30 +02:00
										 |  |  | 	"github.com/superseriousbusiness/gotosocial/internal/gtserror" | 
					
						
							| 
									
										
										
										
											2022-07-19 09:47:55 +01:00
										 |  |  | 	"github.com/superseriousbusiness/gotosocial/internal/log" | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | ) | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | func (t *timeline) prepareXBetweenIDs(ctx context.Context, amount int, behindID string, beforeID string, frontToBack bool) error { | 
					
						
							|  |  |  | 	l := log. | 
					
						
							|  |  |  | 		WithContext(ctx). | 
					
						
							| 
									
										
										
										
											2023-02-17 12:02:29 +01:00
										 |  |  | 		WithFields(kv.Fields{ | 
					
						
							|  |  |  | 			{"amount", amount}, | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			{"behindID", behindID}, | 
					
						
							|  |  |  | 			{"beforeID", beforeID}, | 
					
						
							|  |  |  | 			{"frontToBack", frontToBack}, | 
					
						
							| 
									
										
										
										
											2023-02-17 12:02:29 +01:00
										 |  |  | 		}...) | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	l.Trace("entering prepareXBetweenIDs") | 
					
						
							| 
									
										
										
										
											2021-08-15 18:43:08 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	if beforeID >= behindID { | 
					
						
							|  |  |  | 		// This is an impossible situation, we | 
					
						
							|  |  |  | 		// can't prepare anything between these. | 
					
						
							|  |  |  | 		return nil | 
					
						
							| 
									
										
										
										
											2021-08-15 18:43:08 +02:00
										 |  |  | 	} | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	if err := t.indexXBetweenIDs(ctx, amount, behindID, beforeID, frontToBack); err != nil { | 
					
						
							|  |  |  | 		// An error here doesn't necessarily mean we | 
					
						
							|  |  |  | 		// can't prepare anything, so log + keep going. | 
					
						
							|  |  |  | 		l.Debugf("error calling prepareXBetweenIDs: %s", err) | 
					
						
							| 
									
										
										
										
											2021-06-21 12:27:23 +02:00
										 |  |  | 	} | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2021-08-15 18:43:08 +02:00
										 |  |  | 	t.Lock() | 
					
						
							|  |  |  | 	defer t.Unlock() | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	// Try to prepare everything between (and including) the two points. | 
					
						
							|  |  |  | 	var ( | 
					
						
							|  |  |  | 		toPrepare      = make(map[*list.Element]*indexedItemsEntry) | 
					
						
							|  |  |  | 		foundToPrepare int | 
					
						
							|  |  |  | 	) | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	if frontToBack { | 
					
						
							|  |  |  | 		// Paging forwards / down. | 
					
						
							|  |  |  | 		for e := t.items.data.Front(); e != nil; e = e.Next() { | 
					
						
							| 
									
										
										
										
											2023-10-04 13:09:42 +01:00
										 |  |  | 			entry := e.Value.(*indexedItemsEntry) | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 
 | 
					
						
							|  |  |  | 			if entry.itemID > behindID { | 
					
						
							|  |  |  | 				l.Trace("item is too new, continuing") | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 				continue | 
					
						
							|  |  |  | 			} | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			if entry.itemID < beforeID { | 
					
						
							|  |  |  | 				// We've gone beyond the bounds of | 
					
						
							|  |  |  | 				// items we're interested in; stop. | 
					
						
							|  |  |  | 				l.Trace("reached older items, breaking") | 
					
						
							|  |  |  | 				break | 
					
						
							|  |  |  | 			} | 
					
						
							| 
									
										
										
										
											2021-06-21 12:27:23 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			// Only prepare entry if it's not | 
					
						
							|  |  |  | 			// already prepared, save db calls. | 
					
						
							|  |  |  | 			if entry.prepared == nil { | 
					
						
							|  |  |  | 				toPrepare[e] = entry | 
					
						
							|  |  |  | 			} | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			foundToPrepare++ | 
					
						
							|  |  |  | 			if foundToPrepare >= amount { | 
					
						
							|  |  |  | 				break | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 			} | 
					
						
							|  |  |  | 		} | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	} else { | 
					
						
							|  |  |  | 		// Paging backwards / up. | 
					
						
							|  |  |  | 		for e := t.items.data.Back(); e != nil; e = e.Prev() { | 
					
						
							| 
									
										
										
										
											2023-10-04 13:09:42 +01:00
										 |  |  | 			entry := e.Value.(*indexedItemsEntry) | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			if entry.itemID < beforeID { | 
					
						
							|  |  |  | 				l.Trace("item is too old, continuing") | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 				continue | 
					
						
							|  |  |  | 			} | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			if entry.itemID > behindID { | 
					
						
							|  |  |  | 				// We've gone beyond the bounds of | 
					
						
							|  |  |  | 				// items we're interested in; stop. | 
					
						
							|  |  |  | 				l.Trace("reached newer items, breaking") | 
					
						
							|  |  |  | 				break | 
					
						
							|  |  |  | 			} | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			if entry.prepared == nil { | 
					
						
							|  |  |  | 				toPrepare[e] = entry | 
					
						
							|  |  |  | 			} | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			// Only prepare entry if it's not | 
					
						
							|  |  |  | 			// already prepared, save db calls. | 
					
						
							|  |  |  | 			foundToPrepare++ | 
					
						
							|  |  |  | 			if foundToPrepare >= amount { | 
					
						
							|  |  |  | 				break | 
					
						
							|  |  |  | 			} | 
					
						
							|  |  |  | 		} | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 	} | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	for e, entry := range toPrepare { | 
					
						
							| 
									
										
										
										
											2023-05-25 10:37:38 +02:00
										 |  |  | 		prepared, err := t.prepareFunction(ctx, t.timelineID, entry.itemID) | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 		if err != nil { | 
					
						
							| 
									
										
										
										
											2024-05-06 04:49:08 -07:00
										 |  |  | 			if errors.Is(err, statusfilter.ErrHideStatus) { | 
					
						
							|  |  |  | 				// This item has been filtered out by the requesting user's filters. | 
					
						
							|  |  |  | 				// Remove it and skip past it. | 
					
						
							|  |  |  | 				t.items.data.Remove(e) | 
					
						
							|  |  |  | 				continue | 
					
						
							|  |  |  | 			} | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			if errors.Is(err, db.ErrNoEntries) { | 
					
						
							|  |  |  | 				// ErrNoEntries means something has been deleted, | 
					
						
							|  |  |  | 				// so we'll likely not be able to ever prepare this. | 
					
						
							|  |  |  | 				// This means we can remove it and skip past it. | 
					
						
							|  |  |  | 				l.Debugf("db.ErrNoEntries while trying to prepare %s; will remove from timeline", entry.itemID) | 
					
						
							|  |  |  | 				t.items.data.Remove(e) | 
					
						
							| 
									
										
										
										
											2023-07-18 10:39:16 +02:00
										 |  |  | 				continue | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 			} | 
					
						
							|  |  |  | 			// We've got a proper db error. | 
					
						
							| 
									
										
										
										
											2023-06-04 18:55:30 +02:00
										 |  |  | 			return gtserror.Newf("db error while trying to prepare %s: %w", entry.itemID, err) | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 		} | 
					
						
							|  |  |  | 		entry.prepared = prepared | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | 	} | 
					
						
							| 
									
										
										
										
											2022-02-05 12:47:38 +01:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2023-04-06 13:43:13 +02:00
										 |  |  | 	return nil | 
					
						
							| 
									
										
										
										
											2021-06-13 18:42:28 +02:00
										 |  |  | } |