search for: continue_node

...ts for a long time. Too long? > > What do you think if we give "budgets" to the above function? > For example, budget=1000, and there are 2000 nodes on the list. > record() returns with "incomplete" status in the first round, along with the > status info, "*continue_node". > > *continue_node: pointer to the starting node of the leftover. If > *continue_node > has been used at the time of the second call (i.e. continue_node->next == > NULL), > which implies that the previous 1000 nodes have been used, then the record() > function can si...

...ts for a long time. Too long? > > What do you think if we give "budgets" to the above function? > For example, budget=1000, and there are 2000 nodes on the list. > record() returns with "incomplete" status in the first round, along with the > status info, "*continue_node". > > *continue_node: pointer to the starting node of the leftover. If > *continue_node > has been used at the time of the second call (i.e. continue_node->next == > NULL), > which implies that the previous 1000 nodes have been used, then the record() > function can si...

On Thu, 16 Mar 2017 15:08:46 +0800 Wei Wang <wei.w.wang at intel.com> wrote: > From: Liang Li <liang.z.li at intel.com> > > This patch adds a function to provides a snapshot of the present system > unused pages. An important usage of this function is to provide the > unsused pages to the Live migration thread, which skips the transfer of > thoses unused pages. Newly

On Thu, 16 Mar 2017 15:08:46 +0800 Wei Wang <wei.w.wang at intel.com> wrote: > From: Liang Li <liang.z.li at intel.com> > > This patch adds a function to provides a snapshot of the present system > unused pages. An important usage of this function is to provide the > unsused pages to the Live migration thread, which skips the transfer of > thoses unused pages. Newly

...ong time. Too long? >> What do you think if we give "budgets" to the above function? >> For example, budget=1000, and there are 2000 nodes on the list. >> record() returns with "incomplete" status in the first round, along with the >> status info, "*continue_node". >> >> *continue_node: pointer to the starting node of the leftover. If >> *continue_node >> has been used at the time of the second call (i.e. continue_node->next == >> NULL), >> which implies that the previous 1000 nodes have been used, then the record...

...it could disable interrupts for a long time. Too long? What do you think if we give "budgets" to the above function? For example, budget=1000, and there are 2000 nodes on the list. record() returns with "incomplete" status in the first round, along with the status info, "*continue_node". *continue_node: pointer to the starting node of the leftover. If *continue_node has been used at the time of the second call (i.e. continue_node->next == NULL), which implies that the previous 1000 nodes have been used, then the record() function can simply start from the head of the l...