On Thu, Jun 02, 2016 at 01:11:56PM +0200, Michael Haggerty wrote:
> On 06/01/2016 11:07 PM, Jeff King wrote:
> > On Wed, Jun 01, 2016 at 03:42:18AM -0400, Jeff King wrote:
> >
> >> I have no idea if those ideas would work. But I wouldn't want to start
> >> looking into either of them without
On Thu, Jun 02, 2016 at 02:58:22PM +0200, Matthieu Moy wrote:
> Michael Haggerty writes:
>
>> 1. The amount of added code complexity is small and quite
>>encapsulated.
>
> Actually, STRBUF_OWNS_MEMORY can even be seen as a simplification if
> done properly: we already
Michael Haggerty writes:
> 1. The amount of added code complexity is small and quite
>encapsulated.
Actually, STRBUF_OWNS_MEMORY can even be seen as a simplification if
done properly: we already have the case where the strbuf does not own
the memory with
On 06/01/2016 11:07 PM, Jeff King wrote:
> On Wed, Jun 01, 2016 at 03:42:18AM -0400, Jeff King wrote:
>
>> I have no idea if those ideas would work. But I wouldn't want to start
>> looking into either of them without some idea of how much time we're
>> actually spending on strbuf mallocs (or how
On Wed, Jun 01, 2016 at 03:42:18AM -0400, Jeff King wrote:
> I have no idea if those ideas would work. But I wouldn't want to start
> looking into either of them without some idea of how much time we're
> actually spending on strbuf mallocs (or how much time we would spend if
> strbufs were used
On Wed, 2016-06-01 at 16:09 -0400, Jeff King wrote:
> On Wed, Jun 01, 2016 at 03:50:29PM -0400, David Turner wrote:
>
> > On Wed, 2016-06-01 at 03:42 -0400, Jeff King wrote:
> > > 2. Do caching tricks for strbufs used in tight loops. For
> > > example,
> > > have strbuf_release() throw its
On Wed, Jun 01, 2016 at 03:50:29PM -0400, David Turner wrote:
> On Wed, 2016-06-01 at 03:42 -0400, Jeff King wrote:
> > 2. Do caching tricks for strbufs used in tight loops. For example,
> > have strbuf_release() throw its buffer into a last-used cache,
> > and
> > let the next
On Wed, 2016-06-01 at 03:42 -0400, Jeff King wrote:
> 2. Do caching tricks for strbufs used in tight loops. For example,
> have strbuf_release() throw its buffer into a last-used cache,
> and
> let the next strbuf_grow() use that cache entry. This cuts
> malloc()
> out of the
On Mon, May 30, 2016 at 01:32:08PM +0200, Remi Galan Alfonso wrote:
> William Duclot writes:
> > This patch series implements an improvment of the strbuf API, allowing
> > strbuf to use preallocated memory. This makes strbuf fit to be used
> > in
William Duclot writes:
> This patch series implements an improvment of the strbuf API, allowing
> strbuf to use preallocated memory. This makes strbuf fit to be used
> in performance-critical operations.
>
> The first patch is simply a preparatory work,
This patch series implements an improvment of the strbuf API, allowing
strbuf to use preallocated memory. This makes strbuf fit to be used
in performance-critical operations.
The first patch is simply a preparatory work, adding tests for
existing strbuf implementation.
Most of the work is made in
11 matches
Mail list logo