search for: newnode

First off, I would like to express my appreciation for the tinc software, it has been such a great vpn solution for what i need, its amazing. I am setting up another node on the vpn. "KVM" is my public facing node, "MacbookAir" is my workstation, "NewNode" is my node i have recently configured and the one with the issue presumably. NewNode and MacbookAir are on the same network, KVM is on a separate physical network. I configure NewNode per usual, and then when i ping from MacbookAir to NewNode over the vpn network, i get very slow speeds, but...

...source => "puppet:///modules/baseos/hosts", } [.............] But I need add other node in nodes.pp and this need apply the class baseos but without /etc/hots because this use other hosts table that I declared as follows: [.............] node ''newnode.example.com'' inherits basenode { file { "/etc/hosts": ensure => "file", source => "puppet:///modules/baseos/newnode/hosts", mode => "644", } } [.............] But when I go n...

...same and clang poped up with below error . llvm[1]: Compiling IntervalMap.cpp for Debug build In file included from /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: error: use 'template' keyword to treat 'newNode' as a dependent template name Node[NewNode] = this->map->newNode<NodeT>(); ^ template 1 error generated. make[1]: *** [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o] Error 1 Any lights will be apprec...

...John T. > > > llvm[1]: Compiling IntervalMap.cpp for Debug build > In file included from > /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: > /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: > error: use 'template' keyword to treat 'newNode' as a dependent template > name > Node[NewNode] = this->map->newNode<NodeT>(); > ^ > template > 1 error generated. > make[1]: *** > [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o]...

...crese/write a number in memory while providing nothing in &Results. The problem is that the Chain of the va_arg node needs to be updated but I dont know how to do that. I tried stuff like: SDValue Ops[] = { InChain, VAListPtr, N->getOperand(2), N->getOperand(3) }; SDValue NewNode = DAG.getNode(ISD::VAARG, dl, DAG.getVTList(VT, MVT::Other), Ops, 4); DAG.ReplaceAllUsesWith(N, NewNode.getNode()); // or this variant //DAG.ReplaceAllUsesWith(SDValue(N, 1), NewNode); but that does not work for various reasons (N having more than one value in the first case and...

...-- John T. > > llvm[1]: Compiling IntervalMap.cpp for Debug build > In file included from > /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: > /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: > error: use 'template' keyword to treat 'newNode' as a dependent > template name > Node[NewNode] = this->map->newNode<NodeT>(); > ^ > template > 1 error generated. > make[1]: *** > [/root/projects/safecode/build/lib/Support/Debug/IntervalMap.o...

...er::RemapValue(SDValue &N)" because it does not expect that a remap to a new node exists. However looking at the code for a while this seems to be a valid case. I see that many times nodes are added to ReplacedValues map as a value when their NodeID is 0, and therefore they might become a NewNode later. As soon as they become NewNode they are analyzed in AnalyzeNewNode() and in this process, which recurs through the new node operands, it's possible to reach RemapValue and find there the node as a NewNode. That's the scenario in which my test fails. But I probably miss something bec...

...gt;> llvm[1]: Compiling IntervalMap.cpp for Debug build >> In file included from >> /root/projects/safecode/llvm/lib/Support/IntervalMap.cpp:14: >> /root/projects/safecode/llvm/include/llvm/ADT/IntervalMap.h:1980:32: >> error: use 'template' keyword to treat 'newNode' as a dependent template >> name >> Node[NewNode] = this->map->newNode<NodeT>(); >> ^ >> template >> 1 error generated. >> make[1]: *** >> [/root/projects/safecode/build/lib/S...

...gt; } > > I'm trying to lower FSQRT down, but getting a casting issue, my code is: > > SDValue XXXLowering::LowerFSQRT(SDValue Op, SelectionDAG &DAG) const { > SDLoc DL(Op); > EVT VT = Op.getValueType(); > SDValue LHS = Op.getOperand(0); > > SDValue newNode = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, DL, VT, DAG.getTargetConstantFP(Intrinsic::my_intrinsic, DL, VT), LHS); > return newNode; > } > > The error I'm getting is: Assertion 'isa<X>(Val) && "cast<Ty>() argument of incompatible type!" > > I...

...rying to lower FSQRT down, but getting a casting issue, my code is: >> >> SDValue XXXLowering::LowerFSQRT(SDValue Op, SelectionDAG &DAG) const { >> SDLoc DL(Op); >> EVT VT = Op.getValueType(); >> SDValue LHS = Op.getOperand(0); >> >> SDValue newNode = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, DL, VT, >> DAG.getTargetConstantFP(Intrinsic::my_intrinsic, DL, VT), LHS); >> return newNode; >> } >> >> The error I'm getting is: Assertion 'isa<X>(Val) && "cast<Ty>() argument >> of inco...

...ext/javascript" src="prototype.js"></script> </head> <body> <script type="text/javascript"> //<![CDATA[ objTreeMenu_1 = new TreeMenu("TMimages", "objTreeMenu_1", "_self", "", true, false); newNode = objTreeMenu_1.addItem(new TreeNode(''a'', null, '''', true, true, '''', '''', null)); newNode_1 = newNode.addItem(new TreeNode(''b'', null, '''', true, true, '''', ''...

I try to create a big treelike list structure using the RDefines/RInternal macros. The tree carries information at each node (attribute list) and at each leaf (vector). My understanding is that for each node I add to the binary tree I have to call PROTECT(newnode = NEW_LIST(2)); and cannot UNPROTECT before I return the whole tree. Same story for node attributes and leaf vectors. However, this way I easily reach the limit of the proteckt stack at 10000 (BTW this error is not catched). How can I increase the protect stack? Is there a better way to create suc...

Matt, The added intrinsic in DAG looks like: 0xbedb698: i32 = llvm.MyIntrinsic 0xbedb200, 0xbedac18 [ORD=4] The builtin in DAG looks like: 0xbedb2a8: i32,ch = llvm 0xbedb158:1, 0xbedb200, 0xbedb158 [ORD=7] [ID=16] The only difference I'm seeing is the extra operand, which is a 'ch' from a load. On Tue, Feb 2, 2016 at 3:55 PM, Matt Arsenault <arsenm2 at gmail.com>

...a custom scheduler, I stumbled accross a highly suspicious code in all schedulers. In both ScheduleDAGFast.cpp and ScheduleDAGRRList.cpp, one can find this piece of code: SUnit *CopyFromSU = CreateNewSUnit(NULL); and then in the same files: SUnit *CreateNewSUnit(SDNode *N) { [...] SUnit *NewNode = NewSUnit(N); And finally in ScheduleDAGSDNodes.cpp: SUnit *ScheduleDAGSDNodes::NewSUnit(SDNode *N) { [...] if (N->isMachineOpcode() && [...] So basically, it means that calling CreateNewSUnit with NULL will call NewSUnit with NULL and with result in NULL->isMachineOpcode() wh...

Hello everyone, If I understand correctly after the Metadata/Value split the Metadata support of RAUW is limited by ValueAsMetadata and MDNodeFwdDecl (i.e. until cycled in MDNode are not resovled). And my question is. Is where any way to replace an MDNode which is referenced by other MDNodes w\o iterating over all MDNodes in LLMVContext to find and replace those references? Unfortunately I

...encoding); croak (_parse_error ($_, $lineno)) unless defined $value; push @newvalues, $value; - } elsif (/^\s*$/) { # blank line after values + } elsif (/^\s*(;.*)?$/) { # blank line after values _merge_node ($hmap, \%params, $newnode, \@newvalues, \@delvalues); $state = "outer"; } else { -- 2.25.0

...node could become ready. Recompute its flags. assert(N->getNodeId() != DAGTypeLegalizer::ReadyToProcess && N->getNodeId() != DAGTypeLegalizer::Processed && "Invalid node ID for RAUW deletion!"); N->setNodeId(DAGTypeLegalizer::NewNode); NodesToAnalyze.insert(N); } First off, I wonder if this assert is actually valid. NodeUpdated is called for more than node deletion (in fact AFAICT it's called for everything *but* deletion). The NodeDeleted member right above it has the exact same assert, with the same message,...

We have created a new alias -- llvmbugs at cs.uiuc.edu. Please use this for reporting bugs or turning in patches for LLVM. Any such feedback would be appreciated! Please continue to use llvmdev to post questions or have discussions about LLVM. --Vikram http://www.cs.uiuc.edu/~vadve

2015-07-08 17:58 GMT+02:00 escha <escha at apple.com>: > [...] > > If you want to “revert" this sort of thing, you can do it at Select() time > or PreprocessISelDAG(), which is what I did on an out-of-tree backend to > turn add X, -C into sub X, C on selection time. This still lets all the > intermediate optimizations take advantage of the canonicalization. > >

...:: CodeGen/MSP430/2009-05-19-DoubleSplit.ll LLVM :: CodeGen/MSP430/2009-08-25-DynamicStackAlloc.ll LLVM :: CodeGen/MSP430/2009-09-18-AbsoluteAddr.ll LLVM :: CodeGen/MSP430/2009-10-10-OrImpDef.ll LLVM :: CodeGen/MSP430/2009-11-08-InvalidResNo.ll LLVM :: CodeGen/MSP430/2009-11-20-NewNode.ll LLVM :: CodeGen/MSP430/2009-12-21-FrameAddr.ll LLVM :: CodeGen/MSP430/AddrMode-bis-rx.ll LLVM :: CodeGen/MSP430/AddrMode-bis-xr.ll LLVM :: CodeGen/MSP430/AddrMode-mov-rx.ll LLVM :: CodeGen/MSP430/AddrMode-mov-xr.ll LLVM :: CodeGen/MSP430/Inst16mi.ll LLVM :: CodeGen/MS...