search for: edged

Hello, I have a question regarding PGO instrumented BBs (I use IR-level instrumentation). It seems that instrumented BBs do not match between the two compilations for profile-gen and profile-use for some cases. Here is an example from SPECcpu 2006 lbm (a simple case consisting of just two modules). In the first compilation, we have 5 instrumentation points for the main function as follows: $

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,

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''

...59 +#define COMP_DISPLAY_OPTION_NUM 60 typedef CompOption *(*GetDisplayOptionsProc) (CompDisplay *display, int *count); @@ -904,6 +905,8 @@ struct _CompDisplay { 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 opti...

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

I'm new to R and 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

On Jul 23, 2011, at 2:00 AM, Jakob 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

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

Hi all, I'm working with regions, and I was surprised by the region set of this function: > define void @foo() { > br i1 false, label %loop, label %end > > loop: > br i1 false, label %loop, label %end > > end: > ret void > } .dot file as generated by opt —view-regions attached. Essentially, there are 3 regions: one that has the whole function, one that has

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

We are developing a new backend for a custom processor using LLVM. After updating to LLVM 3.2, we run into an assertion in BlockFrequencyImpl.h. The offending test-case looks basically like this: for ( ... ) { switch (i) { case 100: // do something break; case 102: // do something else break; case 103: // do some more break; case 104: // now something different

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

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 =

I am new to using S4 methods and have run into this problem (on Windows XP using R 2.4.1): I am writing a package in which I use the graph package. I define my own classes 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

That makes way more sense, thank you so much! >From your description it sounds like you were assuming that “D1”, rather > than “D0B”, is the original block “D”. In the source, “D1” is “BodyBlock” > and “D”/”D0”/”D0B” are “Target” (and “D0A” is “DirectSucc”). > I’d guess that the “easy cases” remark corresponds to bailing out on EH > pads. Yeah I could see how exception handling

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 edgeAttrs-argument