Displaying 20 results from an estimated 107 matches for "in1".
Did you mean:
in
2009 Jul 03
1
DTMF is not working occasionally over IAX Trunk
...on A. So I can rule out the DTMF problem in
E1. So this has to be some thing with the way E1 is getting
transmitted over IAX trunk.
My iax.conf in A is like:
[general]
bindport = 4569
bindaddr = 0.0.0.0
disallow=all
allow=ulaw
allow=alaw
allow=gsm
jitterbuffer=no
forcejitterbuffer=no
[ccsrv-a16-in1]
type=peer
host=192.168.79.177
auth=plaintext
secret=password
username=a16-in1
qualify=yes
trunk=yes
and in B
[general]
bindport = 4569
bindaddr = 0.0.0.0
disallow=all
allow=ulaw
jitterbuffer=no
forcejitterbuffer=no
transfer = no
[a16-in1]
type=user
auth=plaintext
secret=password
context=inboun...
2009 Jul 03
1
Some IAX calls do not disconnect.
...hat there are about 30 calls in B which is
not disconnected. This comprise of both calls from B -> A as well as B
-> C. There are no such lingering calls in A or C.
Every day I manually disconnect the calls, shown below are two example
with first one from B -> C and second B -> A.
a16-in1*CLI> soft hangup IAX2/a16-in1-11080
Requested Hangup on channel 'IAX2/a16-in1-11080'
-- Hungup 'IAX2/a16-in1-a16-q1-16420'
== Spawn extension (queue, s, 20) exited non-zero on 'IAX2/a16-in1-11080'
-- Hungup 'IAX2/a16-in1-11080'
a16-in1*CLI> soft hang...
2017 Feb 06
2
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...y s0, s1,
..., s9. And suppose we simultaneously process 8 input in SIMD, from in0 to
in7. Let PROC(inx(sy)) denote processing input[x] at stage y.
If there is no dependency between inx(sy) and in(x+1)(sy), then we can do
this
FOR in=0 TO N WITH in+=8
FOR y=0 TO order-1 WITH y++
PROC(in0(sy) in1(sy) in2(sy) in3(sy) in4(sy) in5(sy) in6(sy) in7(sy))
END FOR
END FOR
Definitely there is no any prolog and epilog needed.
However, the critical thing is that all the states in each stage when
processing input[i] are reused by the next input[i+1]. That is input[i+1]
must wait input[i] for 1 stag...
2017 Feb 07
2
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...he only solution. What I was proposing though is to
> instead chop the "order" in chunks of N. Using your notation, you would
> be doing:
>
> PROC( in0(s0))
> PROC( in0(s1) in1(s0))
> PROC( in0(s2) in1(s1) in2(s0))
> PROC( in0(s3) in1(s2) in2(s1) in3(s0))
> PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0))
> PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) in5...
2017 Feb 07
3
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...t; to
> > instead chop the "order" in chunks of N. Using your notation, you
> would
> > be doing:
> >
> > PROC( in0(s0))
> > PROC( in0(s1) in1(s0))
> > PROC( in0(s2) in1(s1) in2(s0))
> > PROC( in0(s3) in1(s2) in2(s1) in3(s0))
> > PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0))
> > PROC( in0(s5)...
2017 Feb 06
0
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...you
are describing is the only solution. What I was proposing though is to
instead chop the "order" in chunks of N. Using your notation, you would
be doing:
PROC( in0(s0))
PROC( in0(s1) in1(s0))
PROC( in0(s2) in1(s1) in2(s0))
PROC( in0(s3) in1(s2) in2(s1) in3(s0))
PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0))
PROC( in0(s5) in1(s4) in2(s3) in3(s2) in4(s1) in5(s0))
PROC( i...
2017 Apr 05
2
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...> instead chop the "order" in chunks of N. Using your notation, you
>>> would
>>> > be doing:
>>> >
>>> > PROC(
>>> in0(s0))
>>> > PROC( in0(s1)
>>> in1(s0))
>>> > PROC( in0(s2) in1(s1)
>>> in2(s0))
>>> > PROC( in0(s3) in1(s2) in2(s1)
>>> in3(s0))
>>> > PROC( in0(s4) in1(s3) in2(s2) in3(s1)
&...
2017 Feb 07
0
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...What I was proposing though is to
> instead chop the "order" in chunks of N. Using your notation, you would
> be doing:
>
> PROC( in0(s0))
> PROC( in0(s1) in1(s0))
> PROC( in0(s2) in1(s1) in2(s0))
> PROC( in0(s3) in1(s2) in2(s1) in3(s0))
> PROC( in0(s4) in1(s3) in2(s2) in3(s1) in4(s0))
> PROC( in0(s5) in1(s4) in2(s3) in3...
2016 Aug 29
2
GVN / Alias Analysis issue with llvm.masked.scatter/gather intrinsics
Hello everyone,
I think I have found an gvn / alias analysis related bug, but before
opening an issue on the tracker I wanted to see if I am missing something.
I have the following testcase:
define spir_kernel void @test(<2 x i32*> %in1, <2 x i32*> %in2, i32* %out) {
> entry:
> ; Just some temporary storage
> %tmp.0 = alloca i32
> %tmp.1 = alloca i32
> %tmp.i = insertelement <2 x i32*> undef, i32* %tmp.0, i32 0
> %tmp = insertelement <2 x i32*> %tmp.i, i32* %tmp.1, i32 1
> ; Read...
2017 Apr 03
0
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...ugh is
>> to
>> > instead chop the "order" in chunks of N. Using your notation, you
>> would
>> > be doing:
>> >
>> > PROC(
>> in0(s0))
>> > PROC( in0(s1)
>> in1(s0))
>> > PROC( in0(s2) in1(s1)
>> in2(s0))
>> > PROC( in0(s3) in1(s2) in2(s1)
>> in3(s0))
>> > PROC( in0(s4) in1(s3) in2(s2) in3(s1)
>> in4(s0))
>...
2018 Apr 07
0
SCEV and LoopStrengthReduction Formulae
...I used to do x86 SIMD optimization for a living, I did similar tricks pretty much everywhere in DSP functions. It’d be pretty nice if the compiler could do it too.
There is one alternate approach that I recall, which looks like this:
Original code (example, pseudocode):
int add_delta_256(uint8 *in1, uint8 *in2) {
int accum = 0;
for (int i = 0; i < 16; ++i) {
uint8x16 a = load16(in1 + i *16); // NOTE: takes an extra addressing op because x86
uint8x16 b = load16(in2 + i *16); // NOTE: takes an extra addressing op because x86
accum += psadbw(a, b);
}
return accum;
}
end of l...
2011 May 14
1
odfWeave 0.7.17 stutters on Debian testing 64-bit amd64 systems.
...utf8 LC_IDENTIFICATION=C
attached base packages:
[1] stats graphics grDevices utils datasets methods base
other attached packages:
[1] odfWeave_0.7.17 XML_3.2-0 lattice_0.19-26
loaded via a namespace (and not attached):
[1] grid_2.13.0
> system.time(odfWeave("In1.odt", "Out1-32.odt"))
Copying In1.odt
Setting wd to /tmp/RtmpS8lBt8/odfWeave11161739126
Unzipping ODF file using unzip -o In1.odt
Archive: In1.odt
extracting: mimetype
creating: Configurations2/statusbar/
inflating: Configurations2/accelerator/curren...
2017 Apr 05
4
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...the "order" in chunks of N. Using your
> > notation, you would
> > > be doing:
> > >
> > > PROC(
> > in0(s0))
> > > PROC(
> > in0(s1) in1(s0))
> > > PROC( in0(s2)
> > in1(s1) in2(s0))
> > > PROC( in0(s3) in1(s2)
> > in2(s1) in3(s0))
> > > PROC(...
2017 Apr 05
0
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...notation, you would
> > be doing:
> >
> > PROC(
> in0(s0))
> > PROC(
> in0(s1) in1(s0))
> > PROC( in0(s2)
> in1(s1) in2(s0))
> > PROC( in0(s3) in1(s2)
> in2(s1) in3(s0))
> > PROC( in0(s4) in1(s...
2016 Aug 29
2
GVN / Alias Analysis issue with llvm.masked.scatter/gather intrinsics
...eryone,
> >
> > I think I have found an gvn / alias analysis related bug, but before
> opening
> > an issue on the tracker I wanted to see if I am missing something. I have
> > the following testcase:
> >
> >> define spir_kernel void @test(<2 x i32*> %in1, <2 x i32*> %in2, i32*
> %out)
> >> {
> >> entry:
> >> ; Just some temporary storage
> >> %tmp.0 = alloca i32
> >> %tmp.1 = alloca i32
> >> %tmp.i = insertelement <2 x i32*> undef, i32* %tmp.0, i32 0
> >> %tmp =...
2017 Apr 06
0
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
...nks of N. Using your
> > notation, you would
> > > be doing:
> > >
> > > PROC(
> > in0(s0))
> > > PROC(
> > in0(s1) in1(s0))
> > > PROC( in0(s2)
> > in1(s1) in2(s0))
> > > PROC( in0(s3) in1(s2)
> > in2(s1) in3(s0))
> > >...
2013 Feb 14
2
[LLVMdev] Question about fastcc assumptions and seemingly superfluous %esp updates
...hile investigating one of the existing tests
(test/CodeGen/X86/tailcallpic2.ll), I ran into IR that produces some
interesting code. The IR is very straightforward:
define protected fastcc i32 @tailcallee(i32 %a1, i32 %a2, i32 %a3, i32 %a4) {
entry:
ret i32 %a3
}
define fastcc i32 @tailcaller(i32 %in1, i32 %in2) {
entry:
%tmp11 = tail call fastcc i32 @tailcallee( i32 %in1, i32 %in2, i32
%in1, i32 %in2)
ret i32 %tmp11
}
define i32 @foo(i32 %in1, i32 %in2) {
entry:
%q = call fastcc i32 @tailcaller(i32 %in2, i32 %in1)
%ww = sub i32 %q, 6
ret i32 %ww
}
Built with (ToT LLVM):
llc < ~/temp/...
2015 Dec 01
11
[PATCH 1/6] x86: Add VMWare Host Communication Macros
...*
+ * Hypervisor-specific bi-directional communication channel. Should never
+ * execute on bare metal hardware. The caller must make sure to check for
+ * supported hypervisor before using these macros.
+ *
+ * Several of the parameters are both input and output and must be initialized.
+ *
+ * @in1: [IN] Message Len or Message Cmd (HB)
+ * @in2: [IN] Message Len (HB) or Message Cmd
+ * @port_num: [IN] port number + [channel id]
+ * @magic: [IN] hypervisor magic value
+ * @eax: [OUT] value of EAX register
+ * @ebx: [OUT] e.g. status from an HB message status command
+ * @ecx: [OUT] e.g. status...
2015 Dec 01
11
[PATCH 1/6] x86: Add VMWare Host Communication Macros
...*
+ * Hypervisor-specific bi-directional communication channel. Should never
+ * execute on bare metal hardware. The caller must make sure to check for
+ * supported hypervisor before using these macros.
+ *
+ * Several of the parameters are both input and output and must be initialized.
+ *
+ * @in1: [IN] Message Len or Message Cmd (HB)
+ * @in2: [IN] Message Len (HB) or Message Cmd
+ * @port_num: [IN] port number + [channel id]
+ * @magic: [IN] hypervisor magic value
+ * @eax: [OUT] value of EAX register
+ * @ebx: [OUT] e.g. status from an HB message status command
+ * @ecx: [OUT] e.g. status...
2004 Oct 31
1
another question about fisher.test
Dear all,
I have another question about fisher.test:
Is there any way to save the resulting p-value in a
matrix or file after a loop as below?
for (i in 1:42) {
# testing difference in income(pinc) between people in
# (with in1=1) and out (with in1=0) of the program for
# group i
fisher.test(m$pinc[m$group==i], m$in1[m$group==i],
workspace=40000000, hybrid=F)}
When I run this loop, there is no results shown on
the terminal. I wonder if there is a way to store the
result for each i in a file or matrix.
Many thanks,
Fang...