search for: instruciton

Displaying 17 results from an estimated 17 matches for "instruciton".

2002 Nov 27
1
[LLVMdev] Instruciton replacement
llvm is giving me some assertion errors when trying to replace an instruction, and I'm not quite sure of what to do. I have the following snippet of code: switch((*I)->getOpcode()) { case Instruction::Malloc: { AllocaInst *AI; AI = new AllocaInst(cast<AllocationInst>(*I)->getAllocatedType(), cast<AllocationInst>(*I)->getArraySize());
2012 Jun 24
2
[LLVMdev] Complex load patterns and token factors
...s DAG > tables for this kind of thing, TableGen gives output instructions that > should take chain a special flag: Opfl_Chain. > > Unfortunately the way it decides which instructions are worthy of this > flag is rather naive: > + If an instruction has a built-in pattern (in the Instruciton > record), it checks whether that makes use of a chain. > + Otherwise, the outer instruction of the Pat gets a chain. > > So if your QVLFDXb instruction doesn't set the Pattern(s?) field, > TableGen won't know it needs the chain. Tim, Correct, the instruction has no...
2012 Jun 23
0
[LLVMdev] Complex load patterns and token factors
...limitation. When generating its DAG tables for this kind of thing, TableGen gives output instructions that should take chain a special flag: Opfl_Chain. Unfortunately the way it decides which instructions are worthy of this flag is rather naive: + If an instruction has a built-in pattern (in the Instruciton record), it checks whether that makes use of a chain. + Otherwise, the outer instruction of the Pat gets a chain. So if your QVLFDXb instruction doesn't set the Pattern(s?) field, TableGen won't know it needs the chain. There's a big comment just above the test about how the cur...
2012 Jun 24
0
[LLVMdev] Complex load patterns and token factors
...s kind of thing, TableGen gives output > > instructions that should take chain a special flag: Opfl_Chain. > > > > Unfortunately the way it decides which instructions are worthy of > > this flag is rather naive: > > + If an instruction has a built-in pattern (in the Instruciton > > record), it checks whether that makes use of a chain. > > + Otherwise, the outer instruction of the Pat gets a chain. > > > > So if your QVLFDXb instruction doesn't set the Pattern(s?) field, > > TableGen won't know it needs the chain. > > Tim...
2012 Jun 23
2
[LLVMdev] Complex load patterns and token factors
Working on a target I added this pattern: def : Pat<(v4i64 (load xoaddr:$src)), (QVFCTIDb (QVLFDXb xoaddr:$src))>; which represents an actual load followed by a necessary conversion operation. The problem is that when this matches any TokenFactor that was attached to the load node gets attached, not to the inner load instruction, but the outer conversion operation. This is
2006 Oct 01
2
[LLVMdev] Instruction descriptions question
...re any plans to implement something like that for providing the possibilities for even cleaner, shorter and more expressive and concise descriptions? Of course, all extensions the I described are just sketches, but what do you think about this approach as such? 2. Another related question is about instruciton costs. In BURG-based selectors there is usually a possibility to describe costs for the instructions so that a least-cost cover can be found during the instruction selection process. I have not seen any such cost descriptions in TableGen files. Does it mean that it is not supported? Why? As far as...
2006 May 19
0
how to estimate adding-regression GARCH Model
...regression. e_t=sqrt(h_t)*N(0,1) h_t=alpha0+alpha1*e_t^2+beta*h_{t_1}~~~~~~~GARCH(1,1). I didn't know how to estimate the model using function garchFit or garchOxFit or other functions? because the argument in garchFit/garchOxFit is formular.mean=~arma(1,1). Do you have some instrucitons? thank you very much for you help. Best wishes Ma Yuchao [[alternative HTML version deleted]]
2013 Jul 02
0
[LLVMdev] SCEV update problem
...So, if a SCEVUnknown is invalidated, the compiler needs to figure out who depends on this invalidated SCEVUnknown, and invalidate them accordingly. To enforce the consistency between SCEV and IR, currently compiler: ec1) Reset SCEVUnknown::ThePtr via callback function if the Instruciton corresponding to the SCEVUnknown in question. ec2) it is up to the optimizer, which change the IR, update the SCEV at once. However, there are flaws: ec1.f): for ec1), it only invalidate an SCEVUnknown. The SCEVs that depends on this SCEVUnknown are not aut...
2006 Oct 02
0
[LLVMdev] Instruction descriptions question
...gt; > def rm : (GR32 :$dst, i32mem:$src) > { > "$assm_op{l} {$src, $dst|$dst, $src}", > [(set GR32:$dst, ($insn_effect_op GR16:$dst, (load addr:$src)))] > > }; Yep. tblgen gives you lots of tools to factor your instructions. > 2. Another related question is about instruciton costs. In BURG-based > selectors there is usually a possibility to describe costs for the > instructions so that a least-cost cover can be found during the > instruction selection process. I have not seen any such cost > descriptions in TableGen files. Does it mean that it is not suppor...
2012 Jun 24
2
[LLVMdev] Complex load patterns and token factors
...gives output > > > instructions that should take chain a special flag: Opfl_Chain. > > > > > > Unfortunately the way it decides which instructions are worthy of > > > this flag is rather naive: > > > + If an instruction has a built-in pattern (in the Instruciton > > > record), it checks whether that makes use of a chain. > > > + Otherwise, the outer instruction of the Pat gets a chain. > > > > > > So if your QVLFDXb instruction doesn't set the Pattern(s?) field, > > > TableGen won't know it needs...
2011 Dec 02
1
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
...only considers only the first possible tree that can be > built from connected pairs for each remaining candidate pair. This is > important for the following reason: If a block of N instructions had the > maximum number of candidate pairs: N*(N-1)/2, then it must be the case > that all instrucitons are independent, and, thus, none of them are > connected. Thus, in this regime, the algorithm is O(N^2). On the other > extreme, if the block has N candidate pairs, then they could all be > connected, but then there are only N of them. In this extreme, the > algorithm is also O(N^2). B...
2004 May 24
2
routing with multiple uplinks problem
...t I am trying to achieve: I want ilex to respond to any incoming trafic on 80.72.34.162 address (it is running a DNS server). All outgoing trafic from localnet should go through tpsa link (faster but non-static IP). Resposnses to the latter should also return through tpsa link. I have followed instrucitons from LARTC howto, chapter 4.2 but to no avail. 3. The problem: after running: ip route del default ip route add default via 213.25.2.3 localnet traffic flows fine, BUT ilex no longer responds to pings from salix on 80.72.34.162 address this happens also in the opposite direction, after runni...
2006 Oct 02
2
[LLVMdev] Instruction descriptions question
...emely useful construct. Thanks a lot for explanations. Multiclasses seem to provide almost everything (if not all) of the features that I was asking for. I'll try to use it for writing a short and concise definition of instructions for my target. >> 2. Another related question is about instruciton costs. In BURG-based >> selectors there is usually a possibility to describe costs for the >> instructions so that a least-cost cover can be found during the >> instruction selection process. I have not seen any such cost >> descriptions in TableGen files. Does it mean that...
2011 Dec 02
0
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
...O(N^4). However, it only considers only the first possible tree that can be built from connected pairs for each remaining candidate pair. This is important for the following reason: If a block of N instructions had the maximum number of candidate pairs: N*(N-1)/2, then it must be the case that all instrucitons are independent, and, thus, none of them are connected. Thus, in this regime, the algorithm is O(N^2). On the other extreme, if the block has N candidate pairs, then they could all be connected, but then there are only N of them. In this extreme, the algorithm is also O(N^2). Because both extremes...
2015 Aug 17
4
Aggregate load/stores
Even if I turn to -O0 [in other words, no optimisation passes at all], it takes the same amount of time. The time is spent in 12.94% lacsap lacsap [.] llvm::SDNode::use_iterator::operator== 7.68% lacsap lacsap [.] llvm::SDNode::use_iterator::operator* 7.53% lacsap lacsap [.] llvm::SelectionDAG::ReplaceAllUsesOfValueWith 7.28% lacsap
2018 Jun 13
4
Success: Bring-up of LLVM/clang-built Linux ARM(32-bit) kernel for Android - Nexus 5
...I can use "-target" option to specify the androideabi target and by that clang was made to search for the assembler with that target as prefix which actually was not present under /usr/bin by default. Hence, it took the host x86_64 GNU assembler and was complaining about unknown assembly instrucitons. So, I created the necessary symlinks over there pointing to that of Android NDK r13b binutils binaries - this fixed the issue of picking the right assembler. By the way, I saw some reports on successful ARM64/AARCH64 clang-kernel for Google Pixel* but the steps therein didn't work for my ARM(...
2011 Dec 02
5
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
On 11/23/2011 05:52 PM, Hal Finkel wrote: > On Mon, 2011-11-21 at 21:22 -0600, Hal Finkel wrote: >> > On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: >>> > > Tobias, >>> > > >>> > > I've attached an updated patch. It contains a few bug fixes and many >>> > > (refactoring and coding-convention) changes inspired