Skip to content

X
xv6-public
提交 8bd18a4d 创建 作者: Frans Kaashoek's avatar Frans Kaashoek
浏览文件
操作

Nits

上级 27fd8087
隐藏空白字符变更
内嵌 并排
正在显示 包含 2 行增加 和 2 行删除
gc.c
浏览文件 @ 8bd18a4d
...@@ -118,7 +118,7 @@ void * ...@@ -118,7 +118,7 @@ void *
gc_move_to_tofree_cpu(int c, u64 epoch) gc_move_to_tofree_cpu(int c, u64 epoch)
{ {
struct gc *head; struct gc *head;
uint32 fe = (epoch - (NEPOCH-2)) % NEPOCH; u32 fe = (epoch - (NEPOCH-2)) % NEPOCH;
int cas; int cas;
assert(gc_state[c].delayed[fe].epoch == epoch-(NEPOCH-2)); // XXX race with setting epoch = 0 assert(gc_state[c].delayed[fe].epoch == epoch-(NEPOCH-2)); // XXX race with setting epoch = 0
// unhook list for fe epoch atomically; this shouldn't fail // unhook list for fe epoch atomically; this shouldn't fail
...@@ -274,7 +274,7 @@ gc_worker(void *x) ...@@ -274,7 +274,7 @@ gc_worker(void *x)
int nfree = gc_free_tofreelist(&(gc_state[mycpu()->id].tofree[i%NEPOCH].next), i); int nfree = gc_free_tofreelist(&(gc_state[mycpu()->id].tofree[i%NEPOCH].next), i);
gc_state[mycpu()->id].tofree[i%NEPOCH].epoch += NEPOCH; gc_state[mycpu()->id].tofree[i%NEPOCH].epoch += NEPOCH;
if (gc_debug && nfree > 0) { if (gc_debug && nfree > 0) {
cprintf("%d: epoch %d freed %d\n", mycpu()->id, i, nfree); cprintf("%d: epoch %lu freed %d\n", mycpu()->id, i, nfree);
} }
} }
gc_state[mycpu()->id].min_epoch = i; gc_state[mycpu()->id].min_epoch = i;
......
您添加了 0 人 到此讨论。请谨慎行事。
请先完成此评论的编辑！
请 注册 或者 后发表评论