mirror of
https://github.com/kovidgoyal/kitty.git
synced 2026-10-18 09:47:46 +02:00
SinityandClaude
b8da20444e
Move the periodic collection check to PREPARE_FOR_DRAW_TEXT so ordinary and fixed-width text share one safe integration point, while tab handling no longer initiates collection. Reset the additions counter only after the live-cell remap completes successfully. Co-Authored-By: Claude <noreply@anthropic.com>
70 lines
2.9 KiB
C
70 lines
2.9 KiB
C
/*
|
|
* text-cache.h
|
|
* Copyright (C) 2024 Kovid Goyal <kovid at kovidgoyal.net>
|
|
*
|
|
* Distributed under terms of the GPL3 license.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "data-types.h"
|
|
|
|
typedef struct ListOfChars {
|
|
char_type *chars;
|
|
size_t count, capacity;
|
|
} ListOfChars;
|
|
|
|
#define LIST_OF_CHARS_STACK_SIZE 4
|
|
static inline void cleanup_list_of_chars(ListOfChars *lc) { if (lc->capacity > LIST_OF_CHARS_STACK_SIZE) free(lc->chars); }
|
|
#define RAII_ListOfChars(name) char_type name##lcbuf[LIST_OF_CHARS_STACK_SIZE]; __attribute__((cleanup(cleanup_list_of_chars))) ListOfChars name = {.chars=name##lcbuf, .capacity = LIST_OF_CHARS_STACK_SIZE};
|
|
static inline ListOfChars* alloc_list_of_chars(void) {
|
|
ListOfChars *ans = calloc(1, sizeof(ListOfChars));
|
|
if (ans) {
|
|
ans->capacity = LIST_OF_CHARS_STACK_SIZE * 2;
|
|
ans->chars = malloc(ans->capacity * sizeof(ans->chars[0]));
|
|
if (!ans->chars) { free(ans); ans = NULL; }
|
|
}
|
|
return ans;
|
|
}
|
|
|
|
static inline void
|
|
ensure_space_for_chars(ListOfChars *lc, size_t count) {
|
|
if (lc->capacity >= count) return;
|
|
if (lc->capacity > LIST_OF_CHARS_STACK_SIZE) {
|
|
ensure_space_for(lc, chars, char_type, count, capacity, count, false);
|
|
} else {
|
|
lc->capacity = count + LIST_OF_CHARS_STACK_SIZE;
|
|
void *chars = malloc(lc->capacity * sizeof(lc->chars[0]));
|
|
if (!chars) fatal("Out of memory allocating LCChars char space");
|
|
memcpy(chars, lc->chars, LIST_OF_CHARS_STACK_SIZE * sizeof(lc->chars[0]));
|
|
lc->chars = chars;
|
|
}
|
|
}
|
|
|
|
#ifndef TEXT_CACHE_IMPLEMENTATION
|
|
typedef struct {int x; } *TextCache;
|
|
#endif
|
|
|
|
TextCache* tc_alloc(void);
|
|
TextCache* tc_incref(TextCache *self);
|
|
TextCache* tc_decref(TextCache *self);
|
|
void tc_chars_at_index(const TextCache *self, char_type idx, ListOfChars *ans);
|
|
unsigned tc_chars_at_index_ansi(const TextCache *self, char_type idx, ANSIBuf *output);
|
|
char_type tc_get_or_insert_chars(TextCache *self, const ListOfChars *chars);
|
|
char_type tc_num_entries(const TextCache *self);
|
|
|
|
// Garbage collection: TextCache interns unique cell texts forever, so a
|
|
// stream of unique multi-codepoint cells grows it without bound. The GC
|
|
// mirrors the hyperlink pool design: steal the current entries, then have
|
|
// the owner (Screen) remap every live cell index via tc_gc_map_index(),
|
|
// which re-interns only referenced entries into the fresh cache.
|
|
bool tc_should_gc(const TextCache *self);
|
|
typedef struct TextCacheGCData TextCacheGCData;
|
|
TextCacheGCData* tc_gc_begin(TextCache *self);
|
|
bool tc_gc_map_index(TextCache *self, TextCacheGCData *gc, char_type old_idx, char_type *new_idx);
|
|
void tc_gc_end(TextCache *self, TextCacheGCData *gc);
|
|
char_type tc_first_char_at_index(const TextCache *self, char_type idx);
|
|
char_type tc_last_char_at_index(const TextCache *self, char_type idx);
|
|
bool tc_chars_at_index_without_alloc(const TextCache *self, char_type idx, ListOfChars *ans);
|
|
unsigned tc_num_codepoints(const TextCache *self, char_type idx);
|