代码拉取完成,页面将自动刷新
From 97eea7a09e8c7c72a763e21608a52cc0e07e3fc6 Mon Sep 17 00:00:00 2001
From: Xin Wang <wangxin03@loongson.cn>
Date: Mon, 20 Jan 2025 14:46:44 +0800
Subject: [PATCH] Fix slowdown about partial linking
---
ld/ldlang.c | 66 ++++++++++++++++++++++++++++++++++++-----------------
1 file changed, 45 insertions(+), 21 deletions(-)
diff --git a/ld/ldlang.c b/ld/ldlang.c
index a357f802..3b6b8563 100644
--- a/ld/ldlang.c
+++ b/ld/ldlang.c
@@ -1246,6 +1246,7 @@ struct out_section_hash_entry
{
struct bfd_hash_entry root;
lang_statement_union_type s;
+ struct out_section_hash_entry *tail;
};
/* The hash table. */
@@ -1255,10 +1256,10 @@ static struct bfd_hash_table output_section_statement_table;
/* Support routines for the hash table used by lang_output_section_find,
initialize the table, fill in an entry and remove the table. */
-static struct bfd_hash_entry *
-output_section_statement_newfunc (struct bfd_hash_entry *entry,
- struct bfd_hash_table *table,
- const char *string)
+static struct out_section_hash_entry *
+output_section_statement_newfunc_1 (struct bfd_hash_entry *entry,
+ struct bfd_hash_table *table,
+ const char *string)
{
lang_output_section_statement_type **nextp;
struct out_section_hash_entry *ret;
@@ -1268,12 +1269,12 @@ output_section_statement_newfunc (struct bfd_hash_entry *entry,
entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
sizeof (*ret));
if (entry == NULL)
- return entry;
+ return NULL;
}
entry = bfd_hash_newfunc (entry, table, string);
if (entry == NULL)
- return entry;
+ return NULL;
ret = (struct out_section_hash_entry *) entry;
memset (&ret->s, 0, sizeof (ret->s));
@@ -1298,6 +1299,20 @@ output_section_statement_newfunc (struct bfd_hash_entry *entry,
instead. */
nextp = &ret->s.output_section_statement.next;
lang_statement_append (&lang_os_list, &ret->s, nextp);
+ return ret;
+}
+
+static struct bfd_hash_entry *
+output_section_statement_newfunc (struct bfd_hash_entry *entry,
+ struct bfd_hash_table *table,
+ const char *string)
+{
+ struct out_section_hash_entry *ret;
+
+ ret = output_section_statement_newfunc_1 (entry, table, string);
+ if (ret == NULL)
+ return NULL;
+ ret->tail = ret;
return &ret->root;
}
@@ -1523,31 +1538,39 @@ lang_output_section_statement_lookup (const char *name,
{
/* We have a section of this name, but it might not have the correct
constraint. */
+ struct out_section_hash_entry *first_ent = entry;
struct out_section_hash_entry *last_ent;
name = entry->s.output_section_statement.name;
- do
+ if (create != 2
+ && !(create && constraint == SPECIAL))
{
- if (create != 2
- && !(create && constraint == SPECIAL)
- && (constraint == entry->s.output_section_statement.constraint
+ do
+ {
+ if (constraint == entry->s.output_section_statement.constraint
|| (constraint == 0
- && entry->s.output_section_statement.constraint >= 0)))
- return &entry->s.output_section_statement;
- last_ent = entry;
- entry = (struct out_section_hash_entry *) entry->root.next;
+ && entry->s.output_section_statement.constraint >= 0))
+ return &entry->s.output_section_statement;
+ last_ent = entry;
+ entry = (struct out_section_hash_entry *) entry->root.next;
+ }
+ while (entry != NULL
+ && name == entry->s.output_section_statement.name);
}
- while (entry != NULL
- && name == entry->s.output_section_statement.name);
+ else
+ last_ent = first_ent->tail;
if (!create)
return NULL;
- entry
- = ((struct out_section_hash_entry *)
- output_section_statement_newfunc (NULL,
- &output_section_statement_table,
- name));
+ /* Only the first entry needs the tail pointer. */
+ entry = bfd_hash_allocate (&output_section_statement_table,
+ offsetof (struct out_section_hash_entry, tail));
+ if (entry != NULL)
+ entry
+ = output_section_statement_newfunc_1 (&entry->root,
+ &output_section_statement_table,
+ name);
if (entry == NULL)
{
einfo (_("%F%P: failed creating section `%s': %E\n"), name);
@@ -1555,6 +1578,7 @@ lang_output_section_statement_lookup (const char *name,
}
entry->root = last_ent->root;
last_ent->root.next = &entry->root;
+ first_ent->tail = entry;
}
entry->s.output_section_statement.name = name;
--
2.33.0
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。