Fri, 17 Jul 2009 06:14:09 -0700 (PDT)

Related articles |
---|

[17 earlier articles] |

Re: Best Ref-counting algorithms? gene.ressler@gmail.com (Gene) (2009-07-15) |

Re: Best Ref-counting algorithms? torbenm@pc-003.diku.dk (2009-07-16) |

Re: Best Ref-counting algorithms? bartc@freeuk.com (BartC) (2009-07-16) |

Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-16) |

Re: Best Ref-counting algorithms? haberg_20080406@math.su.se (Hans Aberg) (2009-07-17) |

Re: Best Ref-counting algorithms? haberg_20080406@math.su.se (Hans Aberg) (2009-07-17) |

Re: Best Ref-counting algorithms? cppljevans@gmail.com (Larry) (2009-07-17) |

Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-17) |

Re: Best Ref-counting algorithms? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2009-07-17) |

Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-17) |

Re: Best Ref-counting algorithms? gneuner2@comcast.net (George Neuner) (2009-07-17) |

Re: Best Ref-counting algorithms? DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-07-18) |

Re: Best Ref-counting algorithms? lerno@dragonascendant.com (=?ISO-8859-1?Q?Christoffer_Lern=F6?=) (2009-07-18) |

[10 later articles] |

From: | Larry <cppljevans@gmail.com> |

Newsgroups: | comp.compilers |

Date: | Fri, 17 Jul 2009 06:14:09 -0700 (PDT) |

Organization: | Compilers Central |

References: | 09-07-018 09-07-039 09-07-043 |

Keywords: | GC |

Posted-Date: | 17 Jul 2009 14:47:17 EDT |

On Jul 15, 2:05 am, Christoffer Lernv <le...@dragonascendant.com>

wrote:

*> On Jul 14, 8:27 pm, George Neuner <gneun...@comcast.net> wrote:*

*>*

*> > On Sun, 12 Jul 2009 13:41:59 -0700 (PDT), Christoffer Lernv*

*> > >I've read papers by Lins 2003 "Lazy Cyclic Reference Counting",*

*> > >Bacon / Rajan 2001 "Concurrent Cycle Collection in Reference Counted*

*> > >Systems" and a few others.*

[snip]

*> I implemented the simple non-concurrent version of the algorithm as*

*> described in Bacon's paper and I did not find it all that complex, the*

*> concurrent version is naturally more involved though.*

How did you implement the children function in figure 2 on page 6 of

the Bacon 2001 article available at:

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.132.2464&rep=rep1&ty

pe=url&i=0

? More specifically, how would you calculate children for:

boost::fusion::vector<T1,T2,.., Tn>

for any types, T1,T2,..., Tn, where boost::fusion is the template

described here:

http://www.boost.org/doc/libs/1_39_0/libs/fusion/doc/html/fusion/container/ve

ctor.html

? In general, how would children for any fusion container or for that

matter any

structure of the general form:

template<typename T1, typename T2, ...>

struct Container: public Super<T1,T2,...>

{

field1<T1,.T2,...> member1;

field2<T1,T2,...> member2;

...

fieldm<T1,T2,...> memberm;

};

?

-regards,

Larry

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.