search for: edges

...after CFGMST Number of Basic Blocks: 10 BB: FakeNode Index=0 BB: if.then Index=5 BB: for.body Index=4 BB: for.body.lr.ph Index=3 BB: entry Index=1 BB: for.inc Index=8 BB: if.then5 Index=7 BB: if.end Index=6 BB: for.end Index=2 BB: for.end.loopexit Index=9 Number of Edges: 14 (*: Instrument, C: CriticalEdge, -: Removed) Edge 0: 8-->4 c W=247031 Edge 1: 6-->8 c W=159375 Edge 2: 4-->6 *c W=127500 Edge 3: 1-->2 c W=4500 Edge 4: 4-->5 W=127 Edge 5: 5-->6 * W=127 Edge 6: 6-->7 W=95 Edge 7: 7-->8 * W=95 Edge 8:...

Hi guys, my computer suddenly failed to boot. It seams that it is unable to mount /home which is btrfs. Here are the messages I get during the boot (the relevant part; hopefully): Feb 02 13:59:58 Edge kernel: kernel BUG at fs/btrfs/extent-tree.c:6185! Feb 02 13:59:58 Edge kernel: invalid opcode: 0000 [#1] PREEMPT SMP Feb 02 13:59:58 Edge kernel: Modules linked in: joydev coretemp kvm_intel kvm

Hi all, I have a Toshiba Tecra M9 and have not been able to boot it dom0. This is running SXDE 01/08, snv79b. After booting under kmdb and setting moddebug=80000000 before booting the Solaris kernel (with help from Dan Mick), I was able to see mac_ether as the last thing loading, right after loading the e1000g driver. I cannot drop into kmdb via F1-A after it hangs. I''ve also

Dear all, I have some network data - about 300 vertices and several thousand edges. I am looking for a way to turn multiple edges into weights of the edges. I looked around and - surprisingly? - haven't found anything. Is there an easy way to do this? Best, Jonas [[alternative HTML version deleted]]

Hi Dan, Thanks for the reply. I got the labels for each outgoing edge (at the source node's 'structure' field) working. Is there a way to find out the outgoing edge number from EdgeIter. (Basically the Node in my graph has a a bunch of outgoing edges, so that I can just index into that collection within the node to get the appropriate edges' attributes). regards, Prakash On Tue, Sep 16, 2008 at 3:59 PM, Dan Gohman <gohman at apple.com> wrote: > Hello Prakash, > > The SelectionDAG viewers (llc -view-isel-dags etc.) support &...

I have been trying to model a labeled graph using ActiveRecord (trunk version). Basically, I have a ''Node'' model which represents a node linking to other nodes. Links (aka edges) are labeled (i.e., have a ''label'' attribute and other behavior). Thus I decided to model edges as an ''Edge'' model and use a ''has_many :trough'' association in the Node model. However, it just doesn''t work, regardless of how hard I'&...

...ay { CompTimeoutHandle autoRaiseHandle; Window autoRaiseWindow; + CompTimeoutHandle edgeDelayHandle; + CompOptionValue plugin; Bool dirtyPluginList; @@ -1107,6 +1110,16 @@ findCursorAtDisplay (CompDisplay *display); /* event.c */ +typedef struct _CompDelayedEdgeSettings +{ + CompDisplay *d; + + unsigned int edge; + unsigned int state; + + CompOption option[7]; +} CompDelayedEdgeSettings; + void handleEvent (CompDisplay *display, XEvent *event); diff --git a/metadata/core.xml.in b/metadata/core.xml.in index 8424ab1..64d418a 100644 -...

when subsetting a matrix results in a single row, it is converted to a vector, not a matrix. how do I avoid this? 1. __GOOD__ > edges <- get.edges(g,E(g)) > edges [,1] [,2] [1,] 0 2 [2,] 0 3 [3,] 0 4 [4,] 0 5 [5,] 1 1 [6,] 0 4 [7,] 0 6 [8,] 0 7 [9,] 0 8 [10,] 0 9 [11,] 0 5 [12,] 0 10 [13,] 0 11 [14,] 0 12 [15,] 0 11 [16,]...

...nd igraph and I was wondering if anybody can help me with the following. I want to find the edge weight between two vertices in a graph. My graph structure is defined by the normal ego (node1), alter (node2) and the weight of the edge between them. I know that I can get the weight for each of the edges in the list of edges that originate from node number 5 using E(igraph_friendship) [ from(5) ]$weight And that I can find the weight for each of the edges in the list of edges that end onto node number 10 using E(igraph_friendship) [ to(10) ]$weight But what if I simply want to find the weight of t...

...ob Stoklund Olesen wrote: > On Jul 23, 2011, at 1:11 AM, Bill Wendling wrote: > >> On Jul 22, 2011, at 11:44 PM, Jakob Stoklund Olesen wrote: >>> Could we add: >>> >>> - A landing pad block is not the destination of any other kind of terminator. Only unwind edges are allowed. >>> >>> - The landingpad instruction must only appear at the top of a landing pad. It cannot appear in any other block, or following non-phi instructions. >>> >> Most of this is covered by 2&3. But it would be good to explicitly state that a landi...

Hi guys, I am trying to perform edge profiling using on hello.bc file by using following command opt -insert-edge-profiling hello.bc -o hello-edge.bc but I get the error that option "-insert-edge-profiling" is unknown. Can you please help me to solve the issue. Please note that I am following the paper available at this link http://llvm.org/pubs/2010-12-Preuss-PathProfiling.pdf

Problem: I am sorting through model selection process for first time and want to make sure that I have used glm, stepAIC, and update correctly. Something is strange because I get a different result between: 1) a glm of 12 predictor variables followed by a stepAIC where all interactions are considered and then an update to remove one specific interaction. vs. 2) entering all the terms

...; } .dot file as generated by opt —view-regions attached. Essentially, there are 3 regions: one that has the whole function, one that has the entry block and the loop, and one that has the loop only. The second one puzzles me. The definition of single-entry single-exit region that I know of uses edges instead of blocks but can rather easily be extended to blocks: edge A dominates edge B, edge B postdominates edge A, and any cycle containing edge A also contains edge B. I'm confused because in the case of the second region, the loop block does not postdominate the entry, and I can't thin...

Hello all! (I apologize if I've ended up in the wrong list!) I'm trying to get a better understanding of LLVM's critical edge splitting, as documented in `Transforms/Utils/BasicBlockUtils.h`; specifically in the case of critical edges which are indirect transfer. The code comments discuss the following example: a CFG with direct edges A->D, B->D, and an indirect critical edge I->D; in this case two identical "dummy" nodes D0A and D0B would be inserted before D, and the edges would be re-routed as such: A->...

...ore break; case 104: // now something different break; default: // handle other cases } } The compiler creates a jumptable for this and inserts an entry for 'case 101' that points to the default block. The machine-basic-block (MBB) of the switch therefore contains two edges to the default MBB, one edge for the jumptable, and another one for the jump handling the case when the index is not in the jumptable. For some reason, our backend assigns those edges different weights (let's say 24 for the default edge and 16 for the others). In LLVM 3.1, getSumForBlock in...

Hi Prakash, I don't know of an easy way to do this, other than to use random-access iterators so you can compute the distance between the edge and the beginning of the list of edges. Dan On Sep 16, 2008, at 2:58 PM, Prakash Prabhu wrote: > Hi Dan, > > Thanks for the reply. I got the labels for each outgoing edge (at the > source node's 'structure' field) working. Is there a way to find out > the outgoing edge number from EdgeIter. (Basically the N...

Hello all, In one of the packages (phylobase) I'm contributing to, we define a class as follows: setClass("phylo4", representation(edge = "matrix", edge.length = "numeric", label = "character", edge.label = "character", order =

...es of graphs as: setOldClass("graphsh") setOldClass("ugsh") setIs("ugsh", "graphsh") (I know that I "should have" used setClass instead - and I will eventually - but right now I am just puzzled about the reason for my problem...) I need an 'edges' method for ugsh graphs, so I set: if (!isGeneric("edges")) { if (is.function("edges")) fun <- edges else fun <- function(object,which) standardGeneric("edges") setGeneric("edges", fun) } setMethod("edges", signature(obje...

...n EH > pads. Yeah I could see how exception handling branches are a challenge, but wouldn't this also break if the critical edge is one of 2+ incoming indirect branches to its target? For example, if the CFG is A->D, I1->D, I2->D (assuming I1 and I2 have multiple outgoing indirect edges), we could redirect A to D0A; but because I1 and I2 both need to indirectly jump to D, we couldn't give them their own "copies" of D (i.e., D0B and D0C). Is my understanding correct? Thanks, -Stefan On Wed, Nov 6, 2019 at 12:23 PM Joseph Tremoulet <jotrem at microsoft.com> wro...

Using Rgraphviz, I draw the undirected graph with vertices A,B,C and D and edges A:B, B:C, C:D, D:A, A:C. I want the vertices A and B to be red and C and D to be blue. The problem is the following: I want the edges A:B and B:C to be green and the edges C:D and C:A to be yellow, while the edge A:C can have the default colour black. I assume that I have to specify this using the...