{"push_id":694814075,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2d9971c0b7044513cfc40a2ce889fd6d5536ee8a","before":"a16af61a3f321a3a3563cbf0bd22e211f21df15e","commits":[{"sha":"2d9971c0b7044513cfc40a2ce889fd6d5536ee8a","author":{"email":"9859bfdd707ff32cd8296706d92426aabc865b73@berkeley.edu","name":"Valmon Leymarie"},"message":"Change algorithm of decref_node_recursive\n\nThe previous algorithm of decref_node_recursive failed to decrease numa and\nsocket refcount. The new algorithm update all refcount of the given node.\nTo do so, it updates the refcount at level i-1 by summing the children's\nrefcount at this level. Then it simply decrease to 0 at level n->type if the\nrefcount at level n->type-1 is 0. If the node is a core, then we simply decref\nits refcount.\nSo far all tests are passing. Maybe we can improve the way I coded it.","distinct":true,"url":"https://api.github.com/repos/klueska/cputopology/commits/2d9971c0b7044513cfc40a2ce889fd6d5536ee8a"}]}