similar to: [LLVMdev] Worst Case Execution Time Calculation (Real Time)

> > LLVA specifically is refering to a research project offshoot of llvm. > > LLVM instructions do not have 1:1 mappings to native instructions > > (sometimes multiple llvm instructions map to fewer native insts, > > sometimes the other way around). > > That's correct, and furthermore, LLVA (now called SVA = Secure > Virtual Architecture) uses essentially the

Hello everybody, I'd like to know if there is way to extend an LLVM-backend outside the LLVM-tree. I am working on a transformation system between time- and event-triggered real-time systems and at some point I need to do a WCET analysis. Herefore, I extended the AsmPrinter to give me the asm code for every single basic block. This code then is analyzed by some external tool and the analysis

On Mar 13, 2010, at 11:54 AM, James Stanier wrote: > It > analyses the CFG and recognises specific region schema, such as if- > then, > if-then-else, while-loop, etc., and builds a "control tree" which > represents > the hierarchical structure of the input program. I am not sure if my definition of a control flow tree is the same as yours, but if it is, I am very

Hi, my question no really concerns 100% to Samba but since I use Samba ... I use Samba 3.0.13 as an PDC and have about 40 WinXp Pro Clients. I was wondering what happens if the WinXP Pro Clients won?t have any connection to the Samba Server anymore. Maybye due an error in the network or the PDC died for some reason. Is there any way to quickly change the clients profile to a local profile? I

Dear all, I have a problem with our samba installation and really need your input since I'm running out of ideas. Short story: UidNumbers on a DC have a strange behaviour Longer Story: 1) Self compiled samba ad-dc now on V4.8.5 (recently and painlessly upgraded from 4.6.14) +bind9 +dhcp on debian stretch mostly managed through RSAT 2) 2 DC's + 3 linux (debian/ubuntu) +20ish win10 clients

All - Does anyone know if there is a method to calculate a goodness-of-fit statistic for quantile regressions with package quantreg? Specifically, I'm wondering if anyone has implemented the goodness-of-fit process developed by Koenker and Machado (1999) for R? Though I have used package quantreg in the past, I may have overlooked this function, if it is included. Citation: Koenker, R. and

Yes, global variables are the only way to access shared memory. I'm just trying to get an idea of what you're aiming to accomplish to see if we can improve on the interface here. A MachineFunctionPass runs after instruction selection and relying on doInitialization to run before instruction selection is an implementation detail that I do not believe is guaranteed anywhere (I could be

On 7/8/11 4:49 PM, Andrew Ruef wrote: > I investigated the MachineFunctionPass (that is runOnMachineFunction, > I believe). A MachineFunctionPass is a class that you inherit from to write a transform that operates on MachineInstrs (i.e., native code instructions generated from the LLVM IR instructions). The runOnMachineFunction() method is its entry point (i.e., the code generator

Is there any way you could approximate the register/instruction usage and perform live-range analysis in a higher-level LLVM IR pass? I'm not sure how useful NVPTXRegisterInfo would be anyway. Unlike backends that target "real" ISAs, these structures do not contain any special properties about registers or instructions, like cost or scheduling information. Are you trying to figure

Does this count have to be exact, or just an accurate approximation? The back-end may add/remove registers fairly late in the codegen process, so if you need an exact count you may need to run *just* before the assembly printer. Perhaps we could introduce a special machine node that represents a shared memory allocation. The node's value would be the shared address space pointer of the

I found that : "Code generator passes are registered and initialized specially by TargetMachine::addPassesToEmitFile and similar routines, so they cannot generally be run from the *opt* or *bugpoint* commands."...So how I can run a MachineFunctionPass? In the end, I just want to apply a DFS on a CFG of a function. And I need oriented edges and wanted to use

Can you tell us a bit more about what you're trying to accomplish? Changes to the IR performed during MachineFunctionPass::doInitialization will likely propagate down through code generation, but at that point what is the purpose of using a MachineFunctionPass? You won't have any analysis or instruction information available until runOnMachineFunction. On Mon, Aug 5, 2013 at 12:00 PM,

OK. I know what you mean......... Simply speaking, I want to do some optimizations for PTX, and the information I need is similar to a register allocator. I know PTX is virtual ISA, but I will use PTX as the input of the simulator, gpgpu-sim, so it makes sense. Whether to insert shared memory is depend on the analysis that needs LiveAnalysis, PTX InstrInfo, PTX RegisterInfo, etc. That's why I

On Wednesday 11 July 2007 15:07, Christopher Lamb wrote: > Could it be possible for there to be a harness type interface that > would allow coalescers that support both modes to be hooked into the > pass registration, and those that depend on the allocator not be > registered as passes? I have a patch for this kind of thing attached. Please take a look and let me know if it looks

Hi, I'm currently working on a pass for symbolic loop analysis and like to start a small discussion. The goal is to get an expression for the loop enabling calculation of e.g. the trip count. Furthermore, inter-loop-dependencies should be regarded. I'm currently testing with Livermore loops. For instance, the following code (Livermore kernel 2) for (l = 1; l <= loop; l++) {

I am trying to write a MachineFunction pass and build it as a loadable module. I want the pass to run after prolog/epilog emmiter. So far, I have been using MachineFunctionPass, but by inserting it to lib/Codegen and hacking the LLVMTargetMachine file, and Pass.h files. I have created a directory "lib/Transforms/MyPass", and inside I have the code of the pass (which is just a

Yes, total number of PTX registers that will be emitted is exactly what I need. It's hard to figure out this in LLVM IR level. 2013/8/7 Justin Holewinski <justin.holewinski at gmail.com> > Is there any way you could approximate the register/instruction usage and > perform live-range analysis in a higher-level LLVM IR pass? I'm not sure > how useful NVPTXRegisterInfo

If you're running a MachineFunctionPass, then the code has already been lowered to machine instructions and modifying the original IR will most likely not do what you want. You should only be using the IR as an immutable object for reference. If you want to change the IR, I would suggest using a FunctionPass instead of a MachineFunctionPass. Unless you need codegen data. At the

I want to create share memory in my MachineFunctionPass, and insert load/store instruction for it. The way to create share memory is to add global variables which are in share memory address space (not sure if it is the only way). Therefore, I should add global variables in fixed size in doInitialization, and record its real size in other place like MachineModuleInfo. Then modify or query its real

Hello everyone, I have written several complex passes till now, but I cannot write a MachineFunctionPass pass. It just gives me segfault. Hence I reduced the pass to the following form : using namespace llvm; namespace { class CFGexplorator : public MachineFunctionPass { public: static char ID; // Pass identification, replacement for typeid CFGexplorator() : MachineFunctionPass(ID)