On 08/28/2013 04:58 PM, Gleb Natapov wrote:
> On Wed, Aug 28, 2013 at 04:37:32PM +0800, Xiao Guangrong wrote:
>> On 08/28/2013 04:12 PM, Gleb Natapov wrote:
>>
+
+ rmap_printk("pte_list_add: %p %llx many->many\n", spte, *spte);
+ desc = (struct pte_list_desc *)(*pte_list & ~1ul);
On Wed, Aug 28, 2013 at 04:37:32PM +0800, Xiao Guangrong wrote:
> On 08/28/2013 04:12 PM, Gleb Natapov wrote:
>
> >> +
> >> + rmap_printk("pte_list_add: %p %llx many->many\n", spte, *spte);
> >> + desc = (struct pte_list_desc *)(*pte_list & ~1ul);
> >> +
> >> + /* No empty position in the
On 08/28/2013 04:12 PM, Gleb Natapov wrote:
>> +
>> +rmap_printk("pte_list_add: %p %llx many->many\n", spte, *spte);
>> +desc = (struct pte_list_desc *)(*pte_list & ~1ul);
>> +
>> +/* No empty position in the desc. */
>> +if (desc->sptes[PTE_LIST_EXT - 1]) {
>> +struct
On Tue, Jul 30, 2013 at 09:02:05PM +0800, Xiao Guangrong wrote:
> Change the algorithm to:
> 1) always add new desc to the first desc (pointed by parent_ptes/rmap)
>that is good to implement rcu-nulls-list-like lockless rmap
>walking
>
> 2) always move the entry in first desc to the the
On Tue, Jul 30, 2013 at 09:02:05PM +0800, Xiao Guangrong wrote:
Change the algorithm to:
1) always add new desc to the first desc (pointed by parent_ptes/rmap)
that is good to implement rcu-nulls-list-like lockless rmap
walking
2) always move the entry in first desc to the the
On 08/28/2013 04:12 PM, Gleb Natapov wrote:
+
+rmap_printk(pte_list_add: %p %llx many-many\n, spte, *spte);
+desc = (struct pte_list_desc *)(*pte_list ~1ul);
+
+/* No empty position in the desc. */
+if (desc-sptes[PTE_LIST_EXT - 1]) {
+struct pte_list_desc
On Wed, Aug 28, 2013 at 04:37:32PM +0800, Xiao Guangrong wrote:
On 08/28/2013 04:12 PM, Gleb Natapov wrote:
+
+ rmap_printk(pte_list_add: %p %llx many-many\n, spte, *spte);
+ desc = (struct pte_list_desc *)(*pte_list ~1ul);
+
+ /* No empty position in the desc. */
+ if
On 08/28/2013 04:58 PM, Gleb Natapov wrote:
On Wed, Aug 28, 2013 at 04:37:32PM +0800, Xiao Guangrong wrote:
On 08/28/2013 04:12 PM, Gleb Natapov wrote:
+
+ rmap_printk(pte_list_add: %p %llx many-many\n, spte, *spte);
+ desc = (struct pte_list_desc *)(*pte_list ~1ul);
+
+ /* No empty
8 matches
Mail list logo