similar to: xen dire-map area

Hello all, I found that the alignment for stack value has no limitation, but for global value, it has a limitation. Here is an example: #include <stdio.h> #include <stdlib.h> char x[4000] __attribute__((aligned(4096))); int main (int argc, char ** argv) { char y[4000] __attribute__((aligned(4096))); printf("x is %p\n", x); printf("y is %p\n", y); return

Hello all, I notice in previous gsocs of LLVM , there is no projects about language bindings for LLVM. Does that mean it has lower priority than other projects? Current python bindings for LLVM in the trunk are far from complemte. So I would like to improve python bindings for LLVM this summer if possible. My work will be based on llvm-py project ( http://code.google.com/p/llvm-py/). I obtained

> Please look at the thread "Python bindings in tree" starting on 2012-03-16. > There are at least four Python binding projects currently running. (None of > them in GSoC) > > I think it's a great idea to improve llvm-py, but I'd also suggest to first > look at the other bindig projects. > > http://lists.cs.uiuc.edu/pipermail/llvmdev/2012-March/thread.html

Hi I need to store about 250.000.000 files. Files are less than 4k. On a ext4 (fedora 14) the system crawl at 10.000.000 in the same directory. I tried to create hash directories, two level of 4096 dir = 16.000.000 but I had to stop the script to create these dir after hours and "rm -rf" would have taken days ! mkfs was my friend I tried two levels, first of 4096 dir, second of 64

With Debug mode, it shows the assert error: Assertion failed: (I != BlockLiveness.end() && "Predecessor not found"), function calculateLocalLiveness, file lib/CodeGen/StackColoring.cpp, line 782. 1. <eof> parser at end of file 2. Code generation 3. Running pass 'Function Pass Manager' on module 'busybox/archival/libarchive/decompress_bunzip2.c'. 4. Running

Dear LLVM developers: Here is my another proposal of LLVM. Any suggestion would be welcome! * ** * *** Integrate Baggy Bounds Checking into SAFECode*** * * *Abstract:** * Baggy Bounds Checking (BBC) is an efficient bounds checking technique that pad and align objects to powers of two and enable allocation bounds. It uses a contiguous array as bounds table to enable

Hello all, I have written a pass, which replaces condition branchinst using indirectBr to obfuscate program. The origin IR is as the following: br i1 %1, label %2, label %3 And the transformed IR is as the follwoing: %4 = select i1 %1, i8* blockaddress(@func, %2), i8* blockaddress(@func, %3) indirectbr i8* %4, [label %2, label %3] The pass's core function is as the

U-boot for the arndale board splits the memory in 8 contiguous banks and rewrites the memory node. So most of the memory is lost. As the frametable is only able to handle contiguous memory, use the first contiguous banks and warn if some of the memory banks are not used. Signed-off-by: Julien Grall <julien.grall@linaro.org> --- xen/arch/arm/setup.c | 23 +++++++++++++++++------ 1 file

On Aug 14, 2007, at 4:35 AM, Gordon Henriksen wrote: > On Aug 14, 2007, at 06:24, Gordon Henriksen wrote: > >> The two major problems I had really boil down to identifying GC >> points in machine code and statically identifying live roots at >> those GC points, both problems common to many collection >> techniques. Looking at the problem from that perspective

On Aug 14, 2012, at 7:31 AM, Baozeng wrote: > Hello all, > I found that the alignment for stack value has no limitation, but for global value, it has a limitation. > > Here is an example: > > #include <stdio.h> > #include <stdlib.h> > > char x[4000] __attribute__((aligned(4096))); > > int > main (int argc, char ** argv) { > char y[4000]

Hi I'm using a GC that's pretty similar to the OCaml one. It records stack locations using llvm.gcroot, and dumps out a frametable describing the live stack offsets so that the GC runtime can walk them as required. I'm on 2.3, not svn head. I'm having some trouble with pointers being cached in registers across function calls (at least x86 backend, haven't tried others yet).

On 8/14/12 12:19 PM, John McCall wrote: > On Aug 14, 2012, at 7:31 AM, Baozeng wrote: >> Hello all, >> I found that the alignment for stack value has no limitation, but for global value, it has a limitation. Baozen, with what version of LLVM did you do the following test? Was it LLVM mainline? >> >> Here is an example: >> >> #include <stdio.h>

On Thu, Oct 20, 2011 at 2:37 AM, Shea Levy <shea at shealevy.com> wrote: >. The > (probably impossible) end-goals to this project would be a) that every > program which passes its checks would be as safe to run in kernel mode > with full memory access as it would be in user mode That would be a very useful thing to have for embedded systems. Some such as uCLinux run ports of

On Aug 19, 2007, at 20:43, Chris Lattner wrote: > On Aug 14, 2007, at 4:35 AM, Gordon Henriksen wrote: > >> On Aug 14, 2007, at 06:24, Gordon Henriksen wrote: >> >>> The two major problems I had really boil down to identifying GC >>> points in machine code and statically identifying live roots at >>> those GC points, both problems common to many

Hello all, Here is my GSoC 2012 proposal: Python bindings for LLVM. Any feedback are welcome! *Title: Python bindings for LLVM* *Abstract: * llvm-py provides Python bindings for LLVM. The latest llvm-py supports bindings with Python 2.x version for LLVM 2.x. This project is to improve llvm-py to make it compatible with both Python 2.x and Python 3 for LLVM 3. *Motivation* LLVM is used as a

Abstraction ---------------------------------- This projects will enhance the ‘Baggy Bounds with Accurate Checking’ [1] work. I will provide more efficient runtime checks in BBAC framework by adding more informations to the memory object’s padding area. A new padding area scheme will be designed to make these informations compact and efficient to fetch. I will create some new runtime checks on

Hi, all Page offline can be used by many purpose, like memory offline, memory power management, proactive action when multiple CE error happen to one page etc. In virtualization environment without guest offline support, we think offline a page usually means replace the old page with a new one transparently to guest. Currently we are trying to add page offline support in Xen environment .

On Mon, 13 Aug 2007, Gordon Henriksen wrote: >> The table is a contract between the specific codegen you're using and the >> GC runtime you're using. This contract is specific to the current ocaml >> code generator. > > Ocaml is compiled statically; this isn't an ephemeral link from JIT to > runtime as might be the case for a Java or Perl program.

On Aug 14, 2007, at 00:23, Chris Lattner wrote: > On Mon, 13 Aug 2007, Gordon Henriksen wrote: > >> Changing these structures breaks binary compatibility (including C >> interop). > > If that is so, and if there is no way around this, then it makes > sense to develop some compatibility mode. How does native C code > generate these tables? I might've

On 10/19/11 11:58 PM, Eli Friedman wrote: > On Wed, Oct 19, 2011 at 8:20 PM, Shea Levy<shea at shealevy.com> wrote: >> 2. Are target-specific behaviors documented for each supported target? > When anything has target-specific behavior, that fact should be > documented. Beyond that, if you have a question about what some > construct is supposed to do, please ask. What I