Displaying 14 results from an estimated 14 matches for "p_b".
Did you mean:
p_0
2010 May 06
2
Problem with nested functions - functions nested too deeply in source code
...essage saying that
functions are nested too deeply in source code. I found out that the problem
is in the so called refinement procedure of the algorithm which consists of
10 different functions, returning an adjacency matrix. I¹m calling the
refinement procedure with
M <- refine1(M, A, B, p_A, p_B, FAIL) (note that all parameters in call
refine1 have been defined previosly)
Then the following steps look like this
#####################################
# Refinement process #
#####################################
refine1 <- function(M, A, B, p_A, p_B, FAIL, elim, i, j, k, s...
2023 Aug 31
2
[PATCH v2] vdpa/mlx5: Fix firmware error on creation of 1k VQs
...ET(virtio_emulation_cap, caps, umem_3_buffer_param_b);
+
+out:
+ kfree(out);
+ return 0;
+}
+
static void set_umem_size(struct mlx5_vdpa_net *ndev, struct mlx5_vdpa_virtqueue *mvq, int num,
struct mlx5_vdpa_umem **umemp)
{
- struct mlx5_core_dev *mdev = ndev->mvdev.mdev;
- int p_a;
- int p_b;
+ u32 p_a;
+ u32 p_b;
switch (num) {
case 1:
- p_a = MLX5_CAP_DEV_VDPA_EMULATION(mdev, umem_1_buffer_param_a);
- p_b = MLX5_CAP_DEV_VDPA_EMULATION(mdev, umem_1_buffer_param_b);
+ p_a = ndev->umem_1_buffer_param_a;
+ p_b = ndev->umem_1_buffer_param_b;
*umemp = &mvq->umem1;...
2011 Dec 12
0
Rsolnp package: warning messages
...##########################################################
## MAX FUNCTION
budget=2
library(Rsolnp)
# the objective function to maximize
#NOTE: by default the solver minimizes the objective. therefore the
original minus sign is not used
obj=function(x){
all1=sum(mat%*%x)
Hp=0
for (j in 1:BR){
p_b=mat[j,]%*%x/all1
Hp=Hp+p_b*log(p_b)*br[j]
}
return(Hp)
}
# the equality constraint function:
equal1=function(x){
all2=sum(mat%*%x)
sum_pterm=sum(mat[1:N,]%*%x/all2)
sum_x=sum(x)
return(c(sum_pterm,sum_x))
}
# the right hand side for the constraint
eqB=c(1,budget)
# the inequality function
in...
2005 Jul 21
5
[LLVMdev] Re: Dependence Analysis
...; P[i]
>
> If you're interested in dependence analysis, the next important step is
to
> start analyzing distance and direction vectors.
Well, specifically, I was thinking of a mechanism to turn this:
int A[100], B[100], C[100], X, Y, Z;
int *p_a = &A[0];
int *p_b = &B[0];
int *p_c = &C[0];
int i, j, k, f;
for ( k = 0; k < Z; k++ )
{
p_a = &A[0];
for ( i = 0; i < X; i++ )
{
p_b = &B[k*Y];
*p_c = *p_a+...
2005 Jul 21
0
[LLVMdev] Re: Dependence Analysis
...s. To enable
this, remove the two if's at IndVarSimplify.cpp:647 (unconditionally
pushing the discovered indvar on the IndVars list).
See the comments in that code for a justification.
-Chris
> int A[100], B[100], C[100], X, Y, Z;
>
> int *p_a = &A[0];
> int *p_b = &B[0];
> int *p_c = &C[0];
>
> int i, j, k, f;
> for ( k = 0; k < Z; k++ )
> {
> p_a = &A[0];
> for ( i = 0; i < X; i++ )
> {
> p_b = &B[k*Y];
>...
2005 Jul 26
1
[LLVMdev] llvm::ConvertibleToGEP
Well, I guess I was hoping soemthing like this would help in the
pointer-to-array transformation for the following code:
> > int A[100], B[100], C[100], X, Y, Z;
> >
> > int *p_a = &A[0];
> > int *p_b = &B[0];
> > int *p_c = &C[0];
> >
> > int i, j, k, f;
> > for ( k = 0; k < Z; k++ )
> > {
> > p_a = &A[0];
> > for ( i = 0; i < X; i++ )
> > {
> >...
2017 Dec 04
1
YNT: ggtern and bquote...
...6,.6,.6),B=c(.20,.20,.20),C=c(0.20,.20,.20))
ggtern(data=x11,aes(A,B,C,xend = c(0.7,.00,0.7),yend = c(.30,.50,.0),zend =c(.0,.50,0.3)))+
geom_point()+
theme_showarrows()+geom_segment(size=.5)+
geom_text_viewport(x=c(.45,.27,.37),y=c(.32,.29,.22),label=as.expression("P_a","P_b","P_c"))
ggtern(data=x11,aes(A,B,C,xend = c(0.7,.00,0.7),yend = c(.30,.50,.0),zend =c(.0,.50,0.3)))+
geom_point()+
theme_showarrows()+geom_segment(size=.5)+
geom_text_viewport(x=c(.45,.27,.37),y=c(.32,.29,.22),label=as.expression(quote(c("P_a","P_b",&...
2017 Dec 04
0
YNT: ggtern and bquote...
...,.20),C=c(0.20,.20,.20))
> ggtern(data=x11,aes(A,B,C,xend = c(0.7,.00,0.7),yend = c(.30,.50,.0),zend =c(.0,.50,0.3)))+
> geom_point()+
> theme_showarrows()+geom_segment(size=.5)+
> geom_text_viewport(x=c(.45,.27,.37),y=c(.32,.29,.22),label=as.expression("P_a","P_b","P_c"))
>
> ggtern(data=x11,aes(A,B,C,xend = c(0.7,.00,0.7),yend = c(.30,.50,.0),zend =c(.0,.50,0.3)))+
> geom_point()+
> theme_showarrows()+geom_segment(size=.5)+
> geom_text_viewport(x=c(.45,.27,.37),y=c(.32,.29,.22),label=as.expression(quote(c("P_...
2017 Dec 04
1
ggtern and bquote...
...0,.20,.20))
>> ggtern(data=x11,aes(A,B,C,xend = c(0.7,.00,0.7),yend = c(.30,.50,.0),zend =c(.0,.50,0.3)))+
>> geom_point()+
>> theme_showarrows()+geom_segment(size=.5)+
>> geom_text_viewport(x=c(.45,.27,.37),y=c(.32,.29,.22),label=as.expression("P_a","P_b","P_c"))
>>
>> ggtern(data=x11,aes(A,B,C,xend = c(0.7,.00,0.7),yend = c(.30,.50,.0),zend =c(.0,.50,0.3)))+
>> geom_point()+
>> theme_showarrows()+geom_segment(size=.5)+
>> geom_text_viewport(x=c(.45,.27,.37),y=c(.32,.29,.22),label=as.expression...
2015 Oct 27
2
How to create global symbol from record offset
...@b = global %struct.b { i32 848 }, align 4
----
What I don't want is to introduce a global pointer like this
%struct.c = type { %struct.a, %struct.b }
%struct.a = type { i32 }
%struct.b = type { i32 }
@c = internal global %struct.c { %struct.a { i32 18 }, %struct.b { i32
48 } }, align 4
@p_b = global %struct.b* bitcast (i32* getelementptr inbounds
(%struct.c* @c, i64 0, i32 1, i32 0) to %struct.b*), align 8
Thanks for any hints how to do this.
Ciao
Nat!
2017 Dec 04
2
ggtern and bquote...
>>>>> peter dalgaard <pdalgd at gmail.com>
>>>>> on Mon, 4 Dec 2017 14:55:19 +0100 writes:
>> On 4 Dec 2017, at 11:58 , Levent TERLEMEZ via R-help
>> <r-help at r-project.org> wrote:
>>
>> Dear Users,
>>
>> What is the proper way to write symbol, superscript,
>> subscript in
2005 Jul 26
0
[LLVMdev] llvm::ConvertibleToGEP
On Tue, 26 Jul 2005, Naftali Schwartz wrote:
> I'm sorry, it had seemed to me that the documented functionality:
>
> // ConvertibleToGEP - This function returns true if the specified value V is
> // a valid index into a pointer of type Ty. If it is valid, Idx is filled in
> // with the values that would be appropriate to make this a getelementptr
> // instruction. The type
2005 Jul 26
2
[LLVMdev] llvm::ConvertibleToGEP
I'm sorry, it had seemed to me that the documented functionality:
// ConvertibleToGEP - This function returns true if the specified value V
is
// a valid index into a pointer of type Ty. If it is valid, Idx is filled
in
// with the values that would be appropriate to make this a getelementptr
// instruction. The type returned is the root type that the GEP would
point to
would be quite
2020 Jul 16
0
[PATCH vhost next 10/10] vdpa/mlx5: Add VDPA driver for supported mlx5 devices
...mlx5_db_free(ndev->mvdev.mdev, &vcq->db);
> +}
> +
> +static int umem_size(struct mlx5_vdpa_net *ndev, struct mlx5_vdpa_virtqueue *mvq, int num,
> + struct mlx5_vdpa_umem **umemp)
> +{
> + struct mlx5_core_dev *mdev = ndev->mvdev.mdev;
> + int p_a;
> + int p_b;
> +
> + switch (num) {
> + case 1:
> + p_a = MLX5_CAP_DEV_VDPA_EMULATION(mdev, umem_1_buffer_param_a);
> + p_b = MLX5_CAP_DEV_VDPA_EMULATION(mdev, umem_1_buffer_param_b);
> + *umemp = &mvq->umem1;
> + break;
> + case 2:
> + p_a = MLX5_CAP_DEV_VDPA_EMULATION(m...