motorhead/qemu
1
0
Fork 0
mirror of https://github.com/Motorhead1991/qemu.git synced 2025-08-11 03:24:58 -06:00
Code Issues Projects Releases Packages Wiki Activity Actions

tcg: use QTree instead of GTree

Browse source 
qemu-user can hang in a multi-threaded fork. One common
reason is that when creating a TB, between fork and exec
we manipulate a GTree whose memory allocator (GSlice) is
not fork-safe.

Although POSIX does not mandate it, the system's allocator
(e.g. tcmalloc, libc malloc) is probably fork-safe.

Fix some of these hangs by using QTree, which uses the system's
allocator regardless of the Glib version that we used at
configuration time.

Tested with the test program in the original bug report, i.e.:
```

void garble() {
  int pid = fork();
  if (pid == 0) {
    exit(0);
  } else {
    int wstatus;
    waitpid(pid, &wstatus, 0);
  }
}

void supragarble(unsigned depth) {
  if (depth == 0)
    return ;

  std::thread a(supragarble, depth-1);
  std::thread b(supragarble, depth-1);
  garble();
  a.join();
  b.join();
}

int main() {
  supragarble(10);
}
```

Resolves: https://gitlab.com/qemu-project/qemu/-/issues/285
Reported-by: Valentin David <me@valentindavid.com>
Reviewed-by: Philippe Mathieu-Daudé <philmd@linaro.org>
Signed-off-by: Emilio Cota <cota@braap.org>
Message-Id: <20230205163758.416992-3-cota@braap.org>
[rth: Add QEMU_DISABLE_CFI for all callback using functions.]
Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
This commit is contained in:
Emilio Cota 2023-02-05 11:37:58 -05:00 • committed by Richard Henderson
parent e3feb2cc22
commit 1ff4a81bd3
3 changed files with 23 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

17
accel/tcg/tb-maint.c
View file

@ -19,6 +19,7 @@
#include "qemu/osdep.h" #include "qemu/osdep.h"
#include "qemu/interval-tree.h" #include "qemu/interval-tree.h"
#include "qemu/qtree.h"
#include "exec/cputlb.h" #include "exec/cputlb.h"
#include "exec/log.h" #include "exec/log.h"
#include "exec/exec-all.h" #include "exec/exec-all.h"
@ -314,7 +315,7 @@ struct page_entry {
* See also: page_collection_lock(). * See also: page_collection_lock().
*/ */
struct page_collection { struct page_collection {
GTree *tree; QTree *tree;
struct page_entry *max; struct page_entry *max;
}; };
@ -467,7 +468,7 @@ static bool page_trylock_add(struct page_collection *set, tb_page_addr_t addr)
struct page_entry *pe; struct page_entry *pe;
PageDesc *pd; PageDesc *pd;
pe = g_tree_lookup(set->tree, &index); pe = q_tree_lookup(set->tree, &index);
if (pe) { if (pe) {
return false; return false;
} }
@ -478,7 +479,7 @@ static bool page_trylock_add(struct page_collection *set, tb_page_addr_t addr)
} }
pe = page_entry_new(pd, index); pe = page_entry_new(pd, index);
g_tree_insert(set->tree, &pe->index, pe); q_tree_insert(set->tree, &pe->index, pe);
/* /*
* If this is either (1) the first insertion or (2) a page whose index * If this is either (1) the first insertion or (2) a page whose index
@ -525,13 +526,13 @@ static struct page_collection *page_collection_lock(tb_page_addr_t start,
end >>= TARGET_PAGE_BITS; end >>= TARGET_PAGE_BITS;
g_assert(start <= end); g_assert(start <= end);
set->tree = g_tree_new_full(tb_page_addr_cmp, NULL, NULL, set->tree = q_tree_new_full(tb_page_addr_cmp, NULL, NULL,
page_entry_destroy); page_entry_destroy);
set->max = NULL; set->max = NULL;
assert_no_pages_locked(); assert_no_pages_locked();
retry: retry:
g_tree_foreach(set->tree, page_entry_lock, NULL); q_tree_foreach(set->tree, page_entry_lock, NULL);
for (index = start; index <= end; index++) { for (index = start; index <= end; index++) {
TranslationBlock *tb; TranslationBlock *tb;
@ -542,7 +543,7 @@ static struct page_collection *page_collection_lock(tb_page_addr_t start,
continue; continue;
} }
if (page_trylock_add(set, index << TARGET_PAGE_BITS)) { if (page_trylock_add(set, index << TARGET_PAGE_BITS)) {
g_tree_foreach(set->tree, page_entry_unlock, NULL); q_tree_foreach(set->tree, page_entry_unlock, NULL);
goto retry; goto retry;
} }
assert_page_locked(pd); assert_page_locked(pd);
@ -551,7 +552,7 @@ static struct page_collection *page_collection_lock(tb_page_addr_t start,
(tb_page_addr1(tb) != -1 && (tb_page_addr1(tb) != -1 &&
page_trylock_add(set, tb_page_addr1(tb)))) { page_trylock_add(set, tb_page_addr1(tb)))) {
/* drop all locks, and reacquire in order */ /* drop all locks, and reacquire in order */
g_tree_foreach(set->tree, page_entry_unlock, NULL); q_tree_foreach(set->tree, page_entry_unlock, NULL);
goto retry; goto retry;
} }
} }
@ -562,7 +563,7 @@ static struct page_collection *page_collection_lock(tb_page_addr_t start,
static void page_collection_unlock(struct page_collection *set) static void page_collection_unlock(struct page_collection *set)
{ {
/* entries are unlocked and freed via page_entry_destroy */ /* entries are unlocked and freed via page_entry_destroy */
g_tree_destroy(set->tree); q_tree_destroy(set->tree);
g_free(set); g_free(set);
} }

19
tcg/region.c
View file

@ -28,6 +28,7 @@
#include "qemu/mprotect.h" #include "qemu/mprotect.h"
#include "qemu/memalign.h" #include "qemu/memalign.h"
#include "qemu/cacheinfo.h" #include "qemu/cacheinfo.h"
#include "qemu/qtree.h"
#include "qapi/error.h" #include "qapi/error.h"
#include "exec/exec-all.h" #include "exec/exec-all.h"
#include "tcg/tcg.h" #include "tcg/tcg.h"
@ -36,7 +37,7 @@
struct tcg_region_tree { struct tcg_region_tree {
QemuMutex lock; QemuMutex lock;
GTree *tree; QTree *tree;
/* padding to avoid false sharing is computed at run-time */ /* padding to avoid false sharing is computed at run-time */
}; };
@ -163,7 +164,7 @@ static void tcg_region_trees_init(void)
struct tcg_region_tree *rt = region_trees + i * tree_size; struct tcg_region_tree *rt = region_trees + i * tree_size;
qemu_mutex_init(&rt->lock); qemu_mutex_init(&rt->lock);
rt->tree = g_tree_new_full(tb_tc_cmp, NULL, NULL, tb_destroy); rt->tree = q_tree_new_full(tb_tc_cmp, NULL, NULL, tb_destroy);
} }
} }
@ -202,7 +203,7 @@ void tcg_tb_insert(TranslationBlock *tb)
g_assert(rt != NULL); g_assert(rt != NULL);
qemu_mutex_lock(&rt->lock); qemu_mutex_lock(&rt->lock);
g_tree_insert(rt->tree, &tb->tc, tb); q_tree_insert(rt->tree, &tb->tc, tb);
qemu_mutex_unlock(&rt->lock); qemu_mutex_unlock(&rt->lock);
} }
@ -212,7 +213,7 @@ void tcg_tb_remove(TranslationBlock *tb)
g_assert(rt != NULL); g_assert(rt != NULL);
qemu_mutex_lock(&rt->lock); qemu_mutex_lock(&rt->lock);
g_tree_remove(rt->tree, &tb->tc); q_tree_remove(rt->tree, &tb->tc);
qemu_mutex_unlock(&rt->lock); qemu_mutex_unlock(&rt->lock);
} }
@ -232,7 +233,7 @@ TranslationBlock *tcg_tb_lookup(uintptr_t tc_ptr)
} }
qemu_mutex_lock(&rt->lock); qemu_mutex_lock(&rt->lock);
tb = g_tree_lookup(rt->tree, &s); tb = q_tree_lookup(rt->tree, &s);
qemu_mutex_unlock(&rt->lock); qemu_mutex_unlock(&rt->lock);
return tb; return tb;
} }
@ -267,7 +268,7 @@ void tcg_tb_foreach(GTraverseFunc func, gpointer user_data)
for (i = 0; i < region.n; i++) { for (i = 0; i < region.n; i++) {
struct tcg_region_tree *rt = region_trees + i * tree_size; struct tcg_region_tree *rt = region_trees + i * tree_size;
g_tree_foreach(rt->tree, func, user_data); q_tree_foreach(rt->tree, func, user_data);
} }
tcg_region_tree_unlock_all(); tcg_region_tree_unlock_all();
} }
@ -281,7 +282,7 @@ size_t tcg_nb_tbs(void)
for (i = 0; i < region.n; i++) { for (i = 0; i < region.n; i++) {
struct tcg_region_tree *rt = region_trees + i * tree_size; struct tcg_region_tree *rt = region_trees + i * tree_size;
nb_tbs += g_tree_nnodes(rt->tree); nb_tbs += q_tree_nnodes(rt->tree);
} }
tcg_region_tree_unlock_all(); tcg_region_tree_unlock_all();
return nb_tbs; return nb_tbs;
@ -296,8 +297,8 @@ static void tcg_region_tree_reset_all(void)
struct tcg_region_tree *rt = region_trees + i * tree_size; struct tcg_region_tree *rt = region_trees + i * tree_size;
/* Increment the refcount first so that destroy acts as a reset */ /* Increment the refcount first so that destroy acts as a reset */
g_tree_ref(rt->tree); q_tree_ref(rt->tree);
g_tree_destroy(rt->tree); q_tree_destroy(rt->tree);
} }
tcg_region_tree_unlock_all(); tcg_region_tree_unlock_all();
} }

8
util/qtree.c
View file

@ -310,7 +310,7 @@ q_tree_node_next(QTreeNode *node)
* *
* Since: 2.70 in GLib. Internal in Qtree, i.e. not in the public API. * Since: 2.70 in GLib. Internal in Qtree, i.e. not in the public API.
*/ */
static void static void QEMU_DISABLE_CFI
q_tree_remove_all(QTree *tree) q_tree_remove_all(QTree *tree)
{ {
QTreeNode *node; QTreeNode *node;
@ -532,7 +532,7 @@ q_tree_replace(QTree *tree,
} }
/* internal insert routine */ /* internal insert routine */
static QTreeNode * static QTreeNode * QEMU_DISABLE_CFI
q_tree_insert_internal(QTree *tree, q_tree_insert_internal(QTree *tree,
gpointer key, gpointer key,
gpointer value, gpointer value,
@ -721,7 +721,7 @@ q_tree_steal(QTree *tree,
} }
/* internal remove routine */ /* internal remove routine */
static gboolean static gboolean QEMU_DISABLE_CFI
q_tree_remove_internal(QTree *tree, q_tree_remove_internal(QTree *tree,
gconstpointer key, gconstpointer key,
gboolean steal) gboolean steal)
@ -1182,7 +1182,7 @@ q_tree_node_balance(QTreeNode *node)
return node; return node;
} }
static QTreeNode * static QTreeNode * QEMU_DISABLE_CFI
q_tree_find_node(QTree *tree, q_tree_find_node(QTree *tree,
gconstpointer key) gconstpointer key)
{ {