From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-wg0-f49.google.com (mail-wg0-f49.google.com [74.125.82.49]) by dpdk.org (Postfix) with ESMTP id 109209A87 for ; Mon, 18 May 2015 15:31:18 +0200 (CEST) Received: by wguv19 with SMTP id v19so127718047wgu.1 for ; Mon, 18 May 2015 06:31:17 -0700 (PDT) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20130820; h=x-gm-message-state:message-id:date:from:user-agent:mime-version:to :subject:references:in-reply-to:content-type :content-transfer-encoding; bh=JUUPJg6sUp3OknNu8y/Wx8nHwmCoJFRxcwV05TnIVY4=; b=DRkDcRNEjpK082m80GLtS8G+6UIruekVjXtHZqzZQuQw8TYhdgX7gTrDSbFGcu/zzb cEqK2BgfKbDKO7cuiLnYCHuVcpggPZtopLcXya72pUqD6H96WNxtPwj8gnAFQWv3wDCI gyZViPO6pAr9dq46kH9KhBzJAh1K3RJrTQvRiKKGpzDxJh8X2OgawpIBopNuALjbvFQJ XoHfMgxskQ/8kG4Y79EwsqmnHARJqpFF2WzJ4tuHMSkuhcqK+qbdoppLXohrwGN0opqg k6lMiDqG9Viw/UWzePslNjxfuJQl9H4ZbwRJGvi305N3/oGE6EiKAAClmohDjsfjXdrk wLZg== X-Gm-Message-State: ALoCoQmgowq6CyTgjWFvlln8BIAErsy7bJbpsAE9VInLW7a8G74YvJUSnPkusuzVM/jhXZgs7QWt X-Received: by 10.180.88.72 with SMTP id be8mr22214062wib.45.1431955877900; Mon, 18 May 2015 06:31:17 -0700 (PDT) Received: from [192.168.0.101] ([90.152.119.35]) by mx.google.com with ESMTPSA id g8sm16952829wjn.18.2015.05.18.06.31.16 (version=TLSv1.2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 18 May 2015 06:31:17 -0700 (PDT) Message-ID: <5559E9A4.3020400@linaro.org> Date: Mon, 18 May 2015 14:31:16 +0100 From: Zoltan Kiss User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Thunderbird/31.6.0 MIME-Version: 1.0 To: "Ananyev, Konstantin" , "dev@dpdk.org" References: <1431543554-442-1-git-send-email-zoltan.kiss@linaro.org> <5559DAC1.8050106@linaro.org> <2601191342CEEE43887BDE71AB9772582142FA3B@irsmsx105.ger.corp.intel.com> <5559E00C.3050708@linaro.org> <2601191342CEEE43887BDE71AB9772582142FA79@irsmsx105.ger.corp.intel.com> In-Reply-To: <2601191342CEEE43887BDE71AB9772582142FA79@irsmsx105.ger.corp.intel.com> Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit Subject: Re: [dpdk-dev] [PATCH] mempool: limit cache_size X-BeenThere: dev@dpdk.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: patches and discussions about DPDK List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 18 May 2015 13:31:18 -0000 On 18/05/15 14:14, Ananyev, Konstantin wrote: > > >> -----Original Message----- >> From: Zoltan Kiss [mailto:zoltan.kiss@linaro.org] >> Sent: Monday, May 18, 2015 1:50 PM >> To: Ananyev, Konstantin; dev@dpdk.org >> Subject: Re: [dpdk-dev] [PATCH] mempool: limit cache_size >> >> >> >> On 18/05/15 13:41, Ananyev, Konstantin wrote: >>> >>> >>>> -----Original Message----- >>>> From: dev [mailto:dev-bounces@dpdk.org] On Behalf Of Zoltan Kiss >>>> Sent: Monday, May 18, 2015 1:28 PM >>>> To: dev@dpdk.org >>>> Subject: Re: [dpdk-dev] [PATCH] mempool: limit cache_size >>>> >>>> Hi, >>>> >>>> Any opinion on this patch? >>>> >>>> Regards, >>>> >>>> Zoltan >>>> >>>> On 13/05/15 19:59, Zoltan Kiss wrote: >>>>> Otherwise cache_flushthresh can be bigger than n, and >>>>> a consumer can starve others by keeping every element >>>>> either in use or in the cache. >>>>> >>>>> Signed-off-by: Zoltan Kiss >>>>> --- >>>>> lib/librte_mempool/rte_mempool.c | 3 ++- >>>>> lib/librte_mempool/rte_mempool.h | 2 +- >>>>> 2 files changed, 3 insertions(+), 2 deletions(-) >>>>> >>>>> diff --git a/lib/librte_mempool/rte_mempool.c b/lib/librte_mempool/rte_mempool.c >>>>> index cf7ed76..ca6cd9c 100644 >>>>> --- a/lib/librte_mempool/rte_mempool.c >>>>> +++ b/lib/librte_mempool/rte_mempool.c >>>>> @@ -440,7 +440,8 @@ rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size, >>>>> mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list); >>>>> >>>>> /* asked cache too big */ >>>>> - if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE) { >>>>> + if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE || >>>>> + (uint32_t) cache_size * CACHE_FLUSHTHRESH_MULTIPLIER > n) { >>>>> rte_errno = EINVAL; >>>>> return NULL; >>>>> } >>> >>> Why just no 'cache_size > n' then? >> >> The commit message says: "Otherwise cache_flushthresh can be bigger than >> n, and a consumer can starve others by keeping every element either in >> use or in the cache." > > Ah yes, you right - your condition is more restrictive, which is better. > Though here you implicitly convert cache_size and n to floats and compare 2 floats : > (uint32_t) cache_size * CACHE_FLUSHTHRESH_MULTIPLIER > n) > Shouldn't it be: > (uint32_t)(cache_size * CACHE_FLUSHTHRESH_MULTIPLIER) > n) > So we do conversion back to uint32_t compare to unsigned integers instead? > Same as below: > mp->cache_flushthresh = (uint32_t) > (cache_size * CACHE_FLUSHTHRESH_MULTIPLIER); To bring it further: how about ditching the whole cache_flushthresh member of the mempool structure, and use this: #define CACHE_FLUSHTHRESH(mp) (uint32_t)((mp)->cache_size * 1.5) Furthermore, do we want to expose the flush threshold multiplier through the config file? > ? > > In fact, as we use it more than once, it probably makes sense to create a macro for it, > something like: > #define CALC_CACHE_FLUSHTHRESH(c) ((uint32_t)((c) * CACHE_FLUSHTHRESH_MULTIPLIER) > > Or even > > #define CALC_CACHE_FLUSHTHRESH(c) ((typeof (c))((c) * CACHE_FLUSHTHRESH_MULTIPLIER) > > > Konstantin > >> >>> Konstantin >>> >>>>> diff --git a/lib/librte_mempool/rte_mempool.h b/lib/librte_mempool/rte_mempool.h >>>>> index 9001312..a4a9610 100644 >>>>> --- a/lib/librte_mempool/rte_mempool.h >>>>> +++ b/lib/librte_mempool/rte_mempool.h >>>>> @@ -468,7 +468,7 @@ typedef void (rte_mempool_ctor_t)(struct rte_mempool *, void *); >>>>> * If cache_size is non-zero, the rte_mempool library will try to >>>>> * limit the accesses to the common lockless pool, by maintaining a >>>>> * per-lcore object cache. This argument must be lower or equal to >>>>> - * CONFIG_RTE_MEMPOOL_CACHE_MAX_SIZE. It is advised to choose >>>>> + * CONFIG_RTE_MEMPOOL_CACHE_MAX_SIZE and n / 1.5. It is advised to choose >>>>> * cache_size to have "n modulo cache_size == 0": if this is >>>>> * not the case, some elements will always stay in the pool and will >>>>> * never be used. The access to the per-lcore table is of course >>>>>