mirror of
git://git.sv.gnu.org/emacs.git
synced 2025-12-29 08:31:35 -08:00
Fix GC bugs related to uninitialized vectors
Avoid problems if GC occurs while initializing a vector. Problem with Fdelete reported by Pip Cet in: https://lists.gnu.org/r/emacs-devel/2020-08/msg00313.html I looked for similar problems elsewhere and found quite a few. * src/coding.c (make_subsidiaries): * src/composite.c (syms_of_composite): * src/font.c (build_style_table, Ffont_get_glyphs): * src/nsselect.m (clean_local_selection_data): * src/nsxwidget.m (js_to_lisp): * src/syntax.c (init_syntax_once): * src/window.c (Fcurrent_window_configuration): * src/xselect.c (selection_data_to_lisp_data) (clean_local_selection_data): Use make_nil_vector instead of make_uninit_vector. * src/fns.c (Fdelete): * src/xwidget.c (webkit_js_to_lisp): Use allocate_nil_vector instead of allocate_vector. * src/search.c (Fnewline_cache_check): Use make_vector instead of make_uninit_vector.
This commit is contained in:
parent
4cba236749
commit
d0145537fa
12 changed files with 26 additions and 31 deletions
|
|
@ -10856,20 +10856,17 @@ HIGHESTP non-nil means just return the highest priority one. */)
|
|||
return Fnreverse (val);
|
||||
}
|
||||
|
||||
static const char *const suffixes[] = { "-unix", "-dos", "-mac" };
|
||||
|
||||
static Lisp_Object
|
||||
make_subsidiaries (Lisp_Object base)
|
||||
{
|
||||
Lisp_Object subsidiaries;
|
||||
static char const suffixes[][8] = { "-unix", "-dos", "-mac" };
|
||||
ptrdiff_t base_name_len = SBYTES (SYMBOL_NAME (base));
|
||||
USE_SAFE_ALLOCA;
|
||||
char *buf = SAFE_ALLOCA (base_name_len + 6);
|
||||
int i;
|
||||
|
||||
memcpy (buf, SDATA (SYMBOL_NAME (base)), base_name_len);
|
||||
subsidiaries = make_uninit_vector (3);
|
||||
for (i = 0; i < 3; i++)
|
||||
Lisp_Object subsidiaries = make_nil_vector (3);
|
||||
for (int i = 0; i < 3; i++)
|
||||
{
|
||||
strcpy (buf + base_name_len, suffixes[i]);
|
||||
ASET (subsidiaries, i, intern (buf));
|
||||
|
|
|
|||
|
|
@ -1939,7 +1939,7 @@ syms_of_composite (void)
|
|||
staticpro (&gstring_hash_table);
|
||||
|
||||
staticpro (&gstring_work_headers);
|
||||
gstring_work_headers = make_uninit_vector (8);
|
||||
gstring_work_headers = make_nil_vector (8);
|
||||
for (i = 0; i < 8; i++)
|
||||
ASET (gstring_work_headers, i, make_nil_vector (i + 2));
|
||||
staticpro (&gstring_work);
|
||||
|
|
|
|||
|
|
@ -1755,7 +1755,7 @@ changing the value of a sequence `foo'. */)
|
|||
|
||||
if (n != ASIZE (seq))
|
||||
{
|
||||
struct Lisp_Vector *p = allocate_vector (n);
|
||||
struct Lisp_Vector *p = allocate_nil_vector (n);
|
||||
|
||||
for (i = n = 0; i < ASIZE (seq); ++i)
|
||||
if (NILP (Fequal (AREF (seq, i), elt)))
|
||||
|
|
|
|||
|
|
@ -4889,7 +4889,7 @@ the corresponding element is nil. */)
|
|||
{
|
||||
struct font *font = CHECK_FONT_GET_OBJECT (font_object);
|
||||
ptrdiff_t len;
|
||||
Lisp_Object *chars, vec;
|
||||
Lisp_Object *chars;
|
||||
USE_SAFE_ALLOCA;
|
||||
|
||||
if (NILP (object))
|
||||
|
|
@ -4957,7 +4957,7 @@ the corresponding element is nil. */)
|
|||
else
|
||||
wrong_type_argument (Qarrayp, object);
|
||||
|
||||
vec = make_uninit_vector (len);
|
||||
Lisp_Object vec = make_nil_vector (len);
|
||||
for (ptrdiff_t i = 0; i < len; i++)
|
||||
{
|
||||
Lisp_Object g;
|
||||
|
|
@ -5203,7 +5203,7 @@ If the named font cannot be opened and loaded, return nil. */)
|
|||
static Lisp_Object
|
||||
build_style_table (const struct table_entry *entry, int nelement)
|
||||
{
|
||||
Lisp_Object table = make_uninit_vector (nelement);
|
||||
Lisp_Object table = make_nil_vector (nelement);
|
||||
for (int i = 0; i < nelement; i++)
|
||||
{
|
||||
int j;
|
||||
|
|
|
|||
|
|
@ -3916,7 +3916,6 @@ build_string (const char *str)
|
|||
|
||||
extern Lisp_Object pure_cons (Lisp_Object, Lisp_Object);
|
||||
extern Lisp_Object make_vector (ptrdiff_t, Lisp_Object);
|
||||
extern struct Lisp_Vector *allocate_vector (ptrdiff_t);
|
||||
extern struct Lisp_Vector *allocate_nil_vector (ptrdiff_t);
|
||||
|
||||
/* Make an uninitialized vector for SIZE objects. NOTE: you must
|
||||
|
|
@ -3926,7 +3925,11 @@ extern struct Lisp_Vector *allocate_nil_vector (ptrdiff_t);
|
|||
v = make_uninit_vector (3);
|
||||
ASET (v, 0, obj0);
|
||||
ASET (v, 1, Ffunction_can_gc ());
|
||||
ASET (v, 2, obj1); */
|
||||
ASET (v, 2, obj1);
|
||||
|
||||
allocate_vector has a similar problem. */
|
||||
|
||||
extern struct Lisp_Vector *allocate_vector (ptrdiff_t);
|
||||
|
||||
INLINE Lisp_Object
|
||||
make_uninit_vector (ptrdiff_t size)
|
||||
|
|
|
|||
|
|
@ -114,7 +114,7 @@ clean_local_selection_data (Lisp_Object obj)
|
|||
|
||||
if (size == 1)
|
||||
return clean_local_selection_data (AREF (obj, 0));
|
||||
copy = make_uninit_vector (size);
|
||||
copy = make_nil_vector (size);
|
||||
for (i = 0; i < size; i++)
|
||||
ASET (copy, i, clean_local_selection_data (AREF (obj, i)));
|
||||
return copy;
|
||||
|
|
|
|||
|
|
@ -388,7 +388,7 @@ js_to_lisp (id value)
|
|||
NSArray *nsarr = (NSArray *) value;
|
||||
EMACS_INT n = nsarr.count;
|
||||
Lisp_Object obj;
|
||||
struct Lisp_Vector *p = allocate_vector (n);
|
||||
struct Lisp_Vector *p = allocate_nil_vector (n);
|
||||
|
||||
for (ptrdiff_t i = 0; i < n; ++i)
|
||||
p->contents[i] = js_to_lisp ([nsarr objectAtIndex:i]);
|
||||
|
|
@ -401,7 +401,7 @@ js_to_lisp (id value)
|
|||
NSArray *keys = nsdict.allKeys;
|
||||
ptrdiff_t n = keys.count;
|
||||
Lisp_Object obj;
|
||||
struct Lisp_Vector *p = allocate_vector (n);
|
||||
struct Lisp_Vector *p = allocate_nil_vector (n);
|
||||
|
||||
for (ptrdiff_t i = 0; i < n; ++i)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -3271,7 +3271,7 @@ the buffer. If the buffer doesn't have a cache, the value is nil. */)
|
|||
TYPE_MAXIMUM (ptrdiff_t), &nl_count_cache, NULL, true);
|
||||
|
||||
/* Create vector and populate it. */
|
||||
cache_newlines = make_uninit_vector (nl_count_cache);
|
||||
cache_newlines = make_vector (nl_count_cache, make_fixnum (-1));
|
||||
|
||||
if (nl_count_cache)
|
||||
{
|
||||
|
|
@ -3285,15 +3285,12 @@ the buffer. If the buffer doesn't have a cache, the value is nil. */)
|
|||
break;
|
||||
ASET (cache_newlines, i, make_fixnum (found - 1));
|
||||
}
|
||||
/* Fill the rest of slots with an invalid position. */
|
||||
for ( ; i < nl_count_cache; i++)
|
||||
ASET (cache_newlines, i, make_fixnum (-1));
|
||||
}
|
||||
|
||||
/* Now do the same, but without using the cache. */
|
||||
find_newline1 (BEGV, BEGV_BYTE, ZV, ZV_BYTE,
|
||||
TYPE_MAXIMUM (ptrdiff_t), &nl_count_buf, NULL, true);
|
||||
buf_newlines = make_uninit_vector (nl_count_buf);
|
||||
buf_newlines = make_vector (nl_count_buf, make_fixnum (-1));
|
||||
if (nl_count_buf)
|
||||
{
|
||||
for (from = BEGV, found = from, i = 0; from < ZV; from = found, i++)
|
||||
|
|
@ -3306,8 +3303,6 @@ the buffer. If the buffer doesn't have a cache, the value is nil. */)
|
|||
break;
|
||||
ASET (buf_newlines, i, make_fixnum (found - 1));
|
||||
}
|
||||
for ( ; i < nl_count_buf; i++)
|
||||
ASET (buf_newlines, i, make_fixnum (-1));
|
||||
}
|
||||
|
||||
/* Construct the value and return it. */
|
||||
|
|
|
|||
|
|
@ -3617,9 +3617,9 @@ init_syntax_once (void)
|
|||
DEFSYM (Qsyntax_table, "syntax-table");
|
||||
|
||||
/* Create objects which can be shared among syntax tables. */
|
||||
Vsyntax_code_object = make_uninit_vector (Smax);
|
||||
Vsyntax_code_object = make_nil_vector (Smax);
|
||||
for (i = 0; i < Smax; i++)
|
||||
ASET (Vsyntax_code_object, i, Fcons (make_fixnum (i), Qnil));
|
||||
ASET (Vsyntax_code_object, i, list1 (make_fixnum (i)));
|
||||
|
||||
/* Now we are ready to set up this property, so we can
|
||||
create syntax tables. */
|
||||
|
|
|
|||
|
|
@ -7465,7 +7465,7 @@ saved by this function. */)
|
|||
data->minibuf_selected_window = minibuf_level > 0 ? minibuf_selected_window : Qnil;
|
||||
data->root_window = FRAME_ROOT_WINDOW (f);
|
||||
data->focus_frame = FRAME_FOCUS_FRAME (f);
|
||||
Lisp_Object tem = make_uninit_vector (n_windows);
|
||||
Lisp_Object tem = make_nil_vector (n_windows);
|
||||
data->saved_windows = tem;
|
||||
for (ptrdiff_t i = 0; i < n_windows; i++)
|
||||
ASET (tem, i, make_nil_vector (VECSIZE (struct saved_window)));
|
||||
|
|
|
|||
|
|
@ -1594,7 +1594,7 @@ selection_data_to_lisp_data (struct x_display_info *dpyinfo,
|
|||
return x_atom_to_symbol (dpyinfo, (Atom) idata[0]);
|
||||
else
|
||||
{
|
||||
Lisp_Object v = make_uninit_vector (size / sizeof (int));
|
||||
Lisp_Object v = make_nil_vector (size / sizeof (int));
|
||||
|
||||
for (i = 0; i < size / sizeof (int); i++)
|
||||
ASET (v, i, x_atom_to_symbol (dpyinfo, (Atom) idata[i]));
|
||||
|
|
@ -1653,7 +1653,7 @@ selection_data_to_lisp_data (struct x_display_info *dpyinfo,
|
|||
else
|
||||
{
|
||||
ptrdiff_t i;
|
||||
Lisp_Object v = make_uninit_vector (size / X_LONG_SIZE);
|
||||
Lisp_Object v = make_nil_vector (size / X_LONG_SIZE);
|
||||
|
||||
if (type == XA_INTEGER)
|
||||
{
|
||||
|
|
@ -1860,7 +1860,7 @@ clean_local_selection_data (Lisp_Object obj)
|
|||
Lisp_Object copy;
|
||||
if (size == 1)
|
||||
return clean_local_selection_data (AREF (obj, 0));
|
||||
copy = make_uninit_vector (size);
|
||||
copy = make_nil_vector (size);
|
||||
for (i = 0; i < size; i++)
|
||||
ASET (copy, i, clean_local_selection_data (AREF (obj, i)));
|
||||
return copy;
|
||||
|
|
|
|||
|
|
@ -343,7 +343,7 @@ webkit_js_to_lisp (JSCValue *value)
|
|||
memory_full (SIZE_MAX);
|
||||
|
||||
ptrdiff_t n = dlen;
|
||||
struct Lisp_Vector *p = allocate_vector (n);
|
||||
struct Lisp_Vector *p = allocate_nil_vector (n);
|
||||
|
||||
for (ptrdiff_t i = 0; i < n; ++i)
|
||||
{
|
||||
|
|
@ -361,7 +361,7 @@ webkit_js_to_lisp (JSCValue *value)
|
|||
Lisp_Object obj;
|
||||
if (PTRDIFF_MAX < n)
|
||||
memory_full (n);
|
||||
struct Lisp_Vector *p = allocate_vector (n);
|
||||
struct Lisp_Vector *p = allocate_nil_vector (n);
|
||||
|
||||
for (ptrdiff_t i = 0; i < n; ++i)
|
||||
{
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue