Displaying 20 results from an estimated 600000 matches similar to: "[LLVMdev] (no subject)"
2011 May 13
0
[LLVMdev] [ptx] Propose a register class naming convention change
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html;charset=UTF-8" http-equiv="Content-Type">
</head>
<body bgcolor="#ffffff" text="#000000">
Justin Holewinski wrote:
<blockquote
cite="mid:BANLkTi=Y9EFmWRu-9dQxydq8zTyF7tEbJw@mail.gmail.com"
2011 Jan 13
0
[LLVMdev] Where is liveness analysis pass?
<style id="sinamailpaperfilter">.sinamailpaper-0{cursor:text;}.sinamailpaper-0 td,.sinamailpaper-0 textarea,.sinamailpaper-0 input,.sinamailpaper-0 br,.sinamailpaper-0 div,.sinamailpaper-0 span{font-size:14px;font-family:"宋体",Verdana,Arial,Helvetica,sans-serif;line-height:1.5;}.sinamailpaper-0 p{/**margin:0.2em auto;*/margin:0px;}.sinamailpaper-0
2011 Aug 10
3
[LLVMdev] (no subject)
Hi,
I am interested in getting llvm IR only for a subset of the input source code - basically starting from a specified top level function, including all its callee functions (recursively).
For example, in the following code, I am interested in a command like "extract -top_function blah()" that will create an llvm IR with just blah() and foo().
int foo() {
2003 Aug 08
1
[LLVMdev] Spammers
Clearly spammers have entered our midst. Having this list be moderated
would be a good thing I think.
-- Robert.
At 12:00 PM 8/8/03 -0500, you wrote:
>Send LLVMdev mailing list submissions to
> llvmdev at cs.uiuc.edu
>
>To subscribe or unsubscribe via the World Wide Web, visit
> http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev
>or, via email, send a message
2012 Jul 31
0
No subject
Emscripten is an LLVM-to-JavaScript compiler. It takes LLVM bitcode - which
can be generated from C/C++, using llvm-gcc or clang, or any other language
that can be converted into LLVM - and compiles that into JavaScript, which
can be run on the web (or anywhere else JavaScript can run).
I was able to successfully build libogg, libvorbis and libvorbis examples
using this tool and generate valid
2011 Apr 12
0
No subject
supported, beside Idle, On call and Ringing ?
Can we expect this list to match DEVICE_STATE's one (UNKNOWN | NOT_INUSE |
INUSE | BUSY | INVALID | UNAVAILABLE | RINGING | RINGINUSE | ONHOLD)
> Might be worth seeing if other phones do the same.
>
> S
> --
> _____________________________________________________________________
> -- Bandwidth and Colocation Provided by
2011 Jan 10
0
No subject
Regards,
Huy Nguyen
Date: Sun, 9 Jan 2011 20:01:57 -0800
From: ducphuongbk200586 at gmail.com
To: asterisk-users at lists.digium.com
Subject: [asterisk-users] How to check a number online or offline
Hi all,
Now i want to check a number (channel) online, offline or unreachable on asterisk but i don`t know to do. Can anyone help me to solve this issue.
Thanks and best regard!
--
2012 Aug 25
0
[LLVMdev] How to Check whether BasicBlock resides in a conditional branch
In the general sense you may get some help by looking at the control dependence graph.
- dibyendu
----- Original Message -----
From: Jianfei Hu [mailto:hujianfei258 at gmail.com]
Sent: Saturday, August 25, 2012 07:43 AM
To: LLVMdev at cs.uiuc.edu <LLVMdev at cs.uiuc.edu>
Subject: [LLVMdev] How to Check whether BasicBlock resides in a conditional branch
Hello All,
I want to dertermine
2011 Aug 05
1
[LLVMdev] (no subject)
http://194.1.157.25/catalog/images/work.php?html18
2008 Mar 25
0
No subject
sort of standard for getting media players to support dynamically mixing
different tracks and also making it easy for artists to do.
On Mon, Aug 18, 2008 at 7:09 PM, Andy <andycool22 at gmail.com> wrote:
> i'll chime in and say that i would love to get music recorded in
> separate tracks, maybe there would be some kind of settings embedded
> in the files so i could hear them
2011 Mar 11
0
[LLVMdev] Unnamed temporaries
On Fri, Mar 11, 2011 at 11:48 AM, Judison <judison at gmail.com> wrote:
> I hope this is the right place to ask it, sorry if I'm wrong...
It's the right place, though the IRC channel would have been good too.
> My compiler is generating this code:
>
> (line numbers included) (Please ignore the extra br label %b0 and the whole
> b0)
Sorry, but the extra branches
2011 Apr 01
0
[LLVMdev] GSOC Adaptive Compilation Framework for LLVM JIT Compiler
>
>
> No we will always have control over where the parent calls the functions that we are recompiling. As explained in the example below
>
> Original Code
>
> Binary for A: Binary for B:
>
> ... ...
> ... ...
> br B ...
> ... ...
>
2011 Apr 12
0
No subject
[0004f2xxxxxx](poly650)
defaultuser=0004f2xxxxxx
callerid="Front Desk" <1600>
mailbox=1600
*setvar=callidnum=1234561600*
and from extensions.conf:
[outgoing]
; Outbound unrestricted domestic calls
exten => _1NXXXXXXXXX,1,Verbose(Outbound call from ${callidnum} to ${EXTEN}
on ${STRFTIME(${EPOCH},,%D)} at ${STRFTIME(${EPOCH},,%T)}.)
*exten =>
2011 Apr 01
2
[LLVMdev] GSOC Adaptive Compilation Framework for LLVM JIT Compiler
On Thu, Mar 31, 2011 at 11:07 PM, Eric Christopher <echristo at apple.com>wrote:
> >
> >
> > No we will always have control over where the parent calls the functions
> that we are recompiling. As explained in the example below
> >
> > Original Code
> >
> > Binary for A: Binary for B:
> >
> > ... ...
2008 Mar 25
0
No subject
1. You pass in half the samples as the 'bits' arg. Speex looks at 1
frame worth of those bits and decodes them, decoded result in 'pcm'.
2. You pass in exactly 1 frame of data as the 'bits' arg. Speex looks at
1 frame worth of those bits (which is all there, exactly), decodes them,
stores decoded result in 'pcm'.
3. You pass in 2 frames of data as
2010 Jun 07
0
No subject
void inverse_mdct_slow(float *buffer, int n)
{
=A0=A0 int i,j;
=A0=A0 int n2 =3D n >> 1;
=A0=A0 float *x =3D (float *) malloc(sizeof(*x) * n2);
=A0=A0 memcpy(x, buffer, sizeof(*x) * n2);
=A0=A0 for (i=3D0; i < n; ++i) {
=A0=A0=A0=A0=A0 float acc =3D 0;
=A0=A0=A0=A0=A0 for (j=3D0; j < n2; ++j)
=A0=A0=A0=A0=A0=A0=A0=A0 // formula from paper:
=A0=A0=A0=A0=A0=A0=A0=A0 //acc +=3D n/4.0f *
2011 Jan 10
0
No subject
--
_____________________________________________________________________
-- Bandwidth and Colocation Provided by http://www.api-digital.com --
New to Asterisk? Join us for a live introductory webinar every Thurs:
http://www.asterisk.org/hello
asterisk-users mailing list
To UNSUBSCRIBE or update options visit:
http://lists.digium.com/mailman/listinfo/asterisk-users =
2007 Sep 17
0
[LLVMdev] constructing 'for' statement from LLVM bitcode
Wow... Thank you so much for this.
I'll try this one.
Thanks again, Wojciech.
SJL
---- Original message ----
>Date: Sat, 15 Sep 2007 15:07:34 +0200
>From: Wojciech Matyjewicz <wmatyjewicz at fastmail.fm>
>Subject: Re: [LLVMdev] constructing 'for' statement from LLVM bitcode
>To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu>
>
>Hi,
>
2010 Mar 10
1
[LLVMdev] SAFECode and Poolalloc Branches for LLVM 2.6
Please create a similar branch for Klee; I've been working on porting that to 2.7 as well.<br />
<br />
Best, Erich Ocean<br />
<br />
On Fri, Mar 5, 2010 at 8:43 PM, John Criswell (criswell@uiuc.edu) wrote:<br />
> <br />
> Dear SAFECoders and LLVMers,<br />
> <br />
> There is some new work on moving DSA to the new LLVM 2.7 API.
2011 Feb 25
1
[LLVMdev] Question about Value Range Propagation
Can't read your paper because the permission is not set.
Chuck
On 2/25/2011 12:16 PM, Douglas do Couto Teixeira wrote:
> Hi, Andrey,
>
> sorry for the delay: I made a page with the code available for
> download:
> http://homepages.dcc.ufmg.br/~douglas/projects/RangeAnalysis/RangeAnalysis.html
>