Displaying 20 results from an estimated 76 matches for "acyclicity".
2016 Oct 28
2
mischeduler
Hi,
Regarding the mischeduler, I wonder
// For loops that are acyclic path limited, aggressively schedule for
// latency. This can result in very long dependence chains scheduled in
// sequence, so once every cycle (when CurrMOps == 0), switch to normal
// heuristics.
if (Rem.IsAcyclicLatencyLimited && !Zone->getCurrMOps() &&
tryLatency(TryCand, Cand, *Zone))
2016 Mar 15
2
GSoC Proposal : Path Profiling Support
This proposal adds support for path profiling [Ball96] to LLVM. Path
profiling compactly represents acyclic paths in a directed acyclic graph
representation of the control flow graph of a routine. Instrumentation can
be added to uniquely identify paths executed at runtime.
Path profiles enable precise enumeration of the sequence of basic blocks
executed in order for a particular path. Using path
2013 Mar 05
3
[LLVMdev] tbaa metadata representation
Hi all,
A while ago there was a discussion on changing the current "set of trees"
representation of TBAA metadata to be more expressive, prompted by the need
to support C structs. Dan Gohman also talked about the issue here:
http://llvm.org/devmtg/2012-11/Gohman-AliasAnalysis.pdf. It was suggested
that the trees be replaced by a type DAG then. While working on this
compiler
2004 Oct 28
1
transitivity
Dear all,
Is there a function in R that checks transitivity and acyclicity of a
given nXn matrix with entries representing a decision-maker's
comparisons of n objects? Like
0 1 0 1 1 1
0 0 0 1 0 0
1 0 0 0 1 1
0 0 1 0 0 0
0 1 0 1 0 1
0 1 0 1 0 0
1 represents xPy and 0 represents ~xPy. Is there a vectorized solution
to this? n can be quite large.
Thanks in advance,...
2009 Sep 16
1
cycles in a graphical model
Hi,
Is there is any R package or existing codes in R to detect cycles in a graphical model or DAG (Directed Acyclic Graph) ?
Thanks.
[[alternative HTML version deleted]]
2015 May 13
8
[LLVMdev] RFC: Convergent attribute
Below is a proposal for a new "convergent" intrinsic attribute and MachineInstr property, needed for correctly modeling many SPMD/SIMT programming models in LLVM. Comments and feedback welcome.
—Owen
In order to make LLVM more suitable for programming models variously called SPMD
and SIMT, we would like to propose a new intrinsic and MachineInstr annotation
called
2008 Feb 08
2
xyplot and lsegments
Hi,
How might I use xyplot to plot segments where the segments are in the
input data? (ie a directed acyclic forest).
Here's an example in base graphics:
n = data.frame(id = c(1,2,3,4), parent = c(0,1,2,2), value =
c(5,5.5,7,3), date = c(1,2,3,3.5))
plot(n$date, n$value)
do.call(
segments,
with(
merge(n,n,by.x="parent", by.y="id"),
2011 Jul 11
3
Intransitive DAG
Aloha all,
I have an adjacency matrix for an acyclic digraph that contains
transitive relations, e.g. (u,v), (v,w), (u,w). I want a DAG with only
intransitive relations. Can someone point me to an R function that will
take my adjacency matrix and give me back one with only intransitive
relations? In the example, I'd like to get rid of (u,w) and keep (u,v)
and (v,w).
All the best,
Tom
--
2011 Mar 09
2
[LLVMdev] Question about TableGen when adding LLVM Backend.
Hello all,
I have some question about usage of TableGen when adding a new LLVM Backend.
There are three place to use TableGen in basic steps of document "Writing an
LLVM Compiler
Backend":
2. Describe the register set of the target. Use "TableGen" to generate code
for register definition, register aliases, and register classes from a
target-specific RegisterInfo.td input
2015 May 14
2
[LLVMdev] RFC: Convergent attribute
Why is this a regalloc problem? I assume in the example below the "r0" is somehow forced by the ABI? Because otherwise moving the texture2d operation into the branch wouldn't matter as long as we assign different registers to the two branches and use a technique like lib/Target/R600/SIFixSGPRLiveRanges.cpp.
- Matthias
> On May 13, 2015, at 6:00 PM, Philip Reames <listmail at
2015 Aug 14
2
[LLVMdev] RFC: Convergent attribute
Hi Jingyue,
Convergent is not intended to prevent inlining. It’s tricky to formalize this inter-procedurally, but the intended interpretation is that a convergent operation cannot be move either into or out of a conditionally executed region. Normal inlining would not violate that.
I would imagine that it would make sense to use a combination of convergent and noduplicate for barrier-like
2013 Mar 06
0
[LLVMdev] tbaa metadata representation
On 07/03/2013, at 1:45 AM, Daniel Berlin <dberlin at dberlin.org> wrote:
> On Wed, Mar 6, 2013 at 4:23 AM, Tran Ma <tranma at cse.unsw.edu.au> wrote:
>> It was derived from what I read in Dan Gohman's slides about one of the
>> possible forms a type DAG could take. Your forest is what we should get in
>> the current tree representation (I believe), so when we
2007 Oct 07
3
[LLVMdev] Predication before CodeGen
Hi,
I am planning to generate code for a peculiar architecture with _no_ branch
instructions (!), but with predicated loads and stores to memory. This means
the architecture is not Turing complete, is going to waste a lot of
computation, and any input program that can hope to get compiled for this
architecture must have loops that can be fully unrolled, and all its
functions must get fully
2018 Jun 18
2
Building rpcclient statically linked?
On Mon, 2018-06-18 at 10:35 -0400, pisymbol via samba wrote:
> Small addendum, I did try:
>
> ./configure --nonshared-binary=ALL
>
> ERROR: source source3/smbd/notify_msg.c is in more than one subsystem of
> target 'smbstatus': ['smbd_base.objlist', 'smbstatus.objlist']
>
> This is CentOS 7.5.
>
> -aps
Building more than smbd and
2015 Aug 21
3
Would a spreadsheet be a good project using LLVM?
I am thinking about writing a new open source spreadsheet
application since I think the spreadsheet applications out
there (Microsoft Excel, LibreOffice Calc, etc.) do not have
some features that I would really like to use. I would like
the spreadsheet to recalculate very fast and wondered if it
would make sense to use LLVM to calculate the cell values
quickly. Each cell of a spreadsheet
2008 Mar 21
1
idea for GSoC: an R package for fitting Bayesian Hierarchical Models
Dear R developers,
these days I'm working on some R code for fitting completely generic
Bayesian Hierarchical Models in R, a la OpenBUGS and JAGS.
A key feature of OpenBUGS and JAGS is that they automatically build an
appropriate MCMC sampler from a generic model, specified as a directed
acyclic graph (DAG).
The spirit of my (would-be) implementation is instead more focused on
experimentation
2016 Jan 29
2
Specifying DAG patterns in the instruction
On Thu, Jan 28, 2016 at 8:34 PM, Dylan McKay <dylanmckay34 at gmail.com> wrote:
> Try visualising the DAG like this.
>
> ```
> ---- GPR:$rA
> /
> set GPR:$rd ---- add
> \
> ---- GPR:$rB
> ```
>
> Each instruction forms a DAG with its operands being subnodes.
>
>
2011 Mar 09
0
[LLVMdev] Question about TableGen when adding LLVM Backend.
On Mar 9, 2011, at 2:13 PM, Lu Mitnick wrote:
> Hello all,
>
> I have some question about usage of TableGen when adding a new LLVM Backend. There are three place to use TableGen in basic steps of document "Writing an LLVM Compiler
> Backend":
>
> 2. Describe the register set of the target. Use "TableGen" to generate code for register definition, register
2015 Aug 14
2
[LLVMdev] RFC: Convergent attribute
Hi Mehdi,
My reading of it is that if you have a convergent instruction A, it is
legal to duplicate it to instruction B if (assuming B is after A in program
flow) A dominates B and B post-dominates A.
James
On Fri, 14 Aug 2015 at 08:32 Mehdi Amini via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> On Aug 13, 2015, at 9:43 PM, Owen Anderson via llvm-dev <
> llvm-dev at
2016 Jan 28
2
Specifying DAG patterns in the instruction
I'm confused about how to specify DAG patterns for a given instruction
Here is an example for my target
class ALU1_RR<bits<4> subOp, string asmstr, SDNode OpNode>
: ALU_RR<subOp, asmstr,
[(set GPR:$rD, (OpNode (i32 GPR:$rA), (i32 GPR:$rB)))]>;
def ADD : ALU1_RR<0x0, "l.add", add>;
The set operation simply creates a list. The add operation