diff for duplicates of <20151215114714.GL4598@redhat.com> diff --git a/a/1.txt b/N1/1.txt index 077ef28..721ac6c 100644 --- a/a/1.txt +++ b/N1/1.txt @@ -37,8 +37,8 @@ On Tue, Dec 15, 2015 at 02:41:21PM +0800, yalin wang wrote: > > here. > > > this should be <= here, -> because vmaa??s effect address space doesna??t include vm_end add, -> so if an address vm_end <= add , this means this addr dona??t belong to this vma, +> because vma’s effect address space doesn’t include vm_end add, +> so if an address vm_end <= add , this means this addr don’t belong to this vma, We need to return the vma with lowest vm_end that satisifes "addr < vm_end", so if vm_prev has "addr >= vm_end" would imply we can return @@ -50,7 +50,7 @@ tmp->vm_prev->vm_end too and stop in such case too. > > Anyway, I don't think it's possible to gain anything measurable from this > > optimization. > > -> the advantage is that if addr dona??t belong to any vma, we dona??t need loop all vma, +> the advantage is that if addr don’t belong to any vma, we don’t need loop all vma, > we can break earlier if we found the most closest vma which vma->end_add > addr, But that costs CPU for all cases were we cannot stop: it would waste @@ -97,9 +97,3 @@ priority here. Thanks, Andrea - --- -To unsubscribe, send a message with 'unsubscribe linux-mm' in -the body to majordomo@kvack.org. For more info on Linux MM, -see: http://www.linux-mm.org/ . -Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a> diff --git a/a/content_digest b/N1/content_digest index 0d3db73..7fa5268 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -58,8 +58,8 @@ "> > here.\n" "> > \n" "> this should be <= here,\n" - "> because vmaa??s effect address space doesna??t include vm_end add,\n" - "> so if an address vm_end <= add , this means this addr dona??t belong to this vma,\n" + "> because vma\342\200\231s effect address space doesn\342\200\231t include vm_end add,\n" + "> so if an address vm_end <= add , this means this addr don\342\200\231t belong to this vma,\n" "\n" "We need to return the vma with lowest vm_end that satisifes \"addr <\n" "vm_end\", so if vm_prev has \"addr >= vm_end\" would imply we can return\n" @@ -71,7 +71,7 @@ "> > Anyway, I don't think it's possible to gain anything measurable from this\n" "> > optimization.\n" "> > \n" - "> the advantage is that if addr dona??t belong to any vma, we dona??t need loop all vma,\n" + "> the advantage is that if addr don\342\200\231t belong to any vma, we don\342\200\231t need loop all vma,\n" "> we can break earlier if we found the most closest vma which vma->end_add > addr,\n" "\n" "But that costs CPU for all cases were we cannot stop: it would waste\n" @@ -117,12 +117,6 @@ "priority here.\n" "\n" "Thanks,\n" - "Andrea\n" - "\n" - "--\n" - "To unsubscribe, send a message with 'unsubscribe linux-mm' in\n" - "the body to majordomo@kvack.org. For more info on Linux MM,\n" - "see: http://www.linux-mm.org/ .\n" - "Don't email: <a href=mailto:\"dont@kvack.org\"> email@kvack.org </a>" + Andrea -363d5f16a31d25372a96e15524941a281fa7ed2949d03b33c4425b31e3533091 +e43fac29720733fbefdf3aadffe9c7d98b644e1e0be9d48bee27cd621fd1cf11
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.