Hi, Since last week, I have continued on the quest towards increasing the number of per-process segments.
I have replaced the segment allocation and free algorithm, which currently walk an array for a free slot, with an in-place tree that takes log(N) time to find a free slot; I have also removed proc->seg's array; it is now dynamically allocated, which allows it to grow or to be realloc-ed. My goal for this week is to finish the conversion to the dynamic proc->seg[] sets and to restore the functionality of segdetach; after that, there will be a running p9 kernel with lots of low(er)-cost per-process segments. Take care, -- vs -- You received this message because you are subscribed to the Google Groups "Plan 9 Google Summer of Code" group. To post to this group, send email to plan9-g...@googlegroups.com. To unsubscribe from this group, send email to plan9-gsoc+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/plan9-gsoc?hl=en.
