Displaying 20 results from an estimated 10000 matches similar to: "[LLVMdev] Reverse Optimization?"
2003 Nov 29
0
[LLVMdev] Reverse Optimization?
I was sitting around thinking about making web applications, especially
PHP based ones, perform better. While PHP has come a long way since its
initial releases, it could still benefit from LLVM style "whole program"
optimization. So, I had this radical idea. What if we built a PHP
front end for LLVM so PHP programs could be LLVMized. What if we also
built a i386 ELF front end so that
2003 Nov 09
0
[LLVMdev] LLVM namespac'ification
Yes, pretty much. There are a few things that will go in the std
namespace because its the
way it is and a more natural fit. The other two namespaces already in
use (cl and DOT) will
be placed under the llvm namespace. The goal is to get everything that
is currently at top
level and put it in llvm. This means that in your programs, you
wouldn't use:
cl::XYZ
anymore but:
llvm::cl::XYZ.
Or,
2003 Dec 14
0
[LLVMdev] An assembly level interface for LLVM
Oops .. pardon my last incomplete posting, pushed Ctrl-Enter by
accident! As I was saying ..
Rahul's idea is interesting and would make some aspects of LLVM
programming easier, but I wouldn't use it in my source language for the
following reasons:
1. Of necessity the "snippet parser" would need to be based on the same
language/grammar as AsmParser. Allowing parsing and
2006 Jun 04
5
Manipulating form inputs?
I have created a scaffold Admin/Radicals for doing CRUD. However, I''m
not sure exactly where the scaffold uses the save() method. For a new
entry, it creates form "radical" referencing method create(). The code
for create() is as follows:
def create
@radical = Radical.new(params[:radical])
if @radical.save
flash[:notice] = ''Radical was
2004 Mar 26
0
[LLVMdev] Extending LLVM
I would also find this extension framework useful.
Particularly, I would like to add intrinsics (without
checking them into the LLVM source), and an "opaque"
instruction which does not write to memory (and hence can
be DCEliminated). Just a thought...
Rahul
---- Original message ----
>Date: Fri, 26 Mar 2004 14:41:17 -0800
>From: Reid Spencer <reid at x10sys.com>
2006 Sep 27
3
Icon or CJK fonts in MENU TITLE, is that possible in the future ?
First I would like to say thank you to HPA for providing some really nice features in recently syslinux version.
About new functions, actually I have another radical idea, since we are in Asia, most of the users here they would like to see some local fonts for the syslinux/pxelinux menu. I am wondering is that possible, in the future, the syslinux/pxelinux menu can support CJK fonts or icon ?
2003 Sep 25
0
FW: [LLVMdev] basic block tracing
Rahul,
Were you talking about tracing in the sense of "profiling" (which Anand
did), or tracing of values as they are computed for debugging generated
code (which I did)?
For tracing of values for debugging, the answer is yes: we insert code
in each BB and print out the values computed in that BB that are live at
the end of the BB (so we don't print out temporaries computed and
2005 Sep 11
1
Possibility of merging rsync and tar
Hey rsync people,
Here's a really radical idea and a possible future direction for the
rsync project to explore.
It occurs to me that tar and rsync are closely related in their
purposes. "tar -c (blah) | tar -x" can be used to copy files; rsync's
setup with a sender process and a receiver process is strikingly
similar.
The only major conceptual difference is that the rsync
2003 Nov 03
4
[LLVMdev] large linking time
Hello,
I have observed that the LLVM build takes pretty long time
to link executables (i.e. tools). Is that a normal behavior?
Thanks,
Rahul
2015 Sep 20
0
move firmware-specific code into a directory
>>>
Hm... Maybe I'm biased by the Linux source code organization, but
I'd rather see things like this:
1) Keep the code in core and com32 as generic as possible and just
call some functions that have a BIOS and an EFI implementation.
Like com32/modules/reboot.c would call a function that is implemented
both in arch/{bios,efi}/lib/reboot.c, and the Makefiles link as
2019 Jan 10
0
mixed versions, mixed UIDs
On Thu, 10 Jan 2019 09:29:19 -0500
Steve Hideg via samba <samba at lists.samba.org> wrote:
> Hello,
>
> I've inherited a set of servers running Red Hat Enterprise Linux
> Server release 5.9. They have some variant of samba 3.3 on them (e.g.
> Version 3.3.8-0.52.el5_5.2). These servers are using Samba and
> Winbind as a way to bind to our Active Directory environment
2018 Jun 19
2
Using lnt to run SPEC tests: possible or not?
It appears that lnt has the capability to run the
SPEC2000/2006/2017(maybe) tests from looking at the options and from
poking around in the mailing list archives. Or does it? I experimented
a bit and cannot get it to work right. However, it isn't really
documented anywhere so maybe I didn't set it up properly. Plus there's
all the mention of llvmgcc...
So is anyone doing
2007 Jan 22
5
Final Xen SMF fast-track
This fast-track covers the SMF-related changes for dom0. This is a final draft,
so any comments by the end of the week please...
Man pages are attached.
thanks
john
SMF services for Xen
1. Introduction
This case introduces the SMF services used by a Solaris-based domain 0 when
running on Xen, or a Xen-compatible hypervisor. All of these services only
run on domain 0 when booted
2004 Feb 23
2
[LLVMdev] linking time
Hi LLVMdev,
The stuff I am working on requires linking 9-10 LLVM
libraries, along with a few libs of my own. The linker is
taking a long time to do that, about 6 mins (on a P4 with
512 MB mem). I tried the latest (2.14) release of binutils,
but that didn't help. Is anyone aware of any solution to this?
Thanks,
Rahul
2011 Jan 25
1
[LLVMdev] LLVM grammar for ANTLR
Hi Sam,
Thanks for your reply.
I am implementing my research
(http://www.it.usyd.edu.au/~suri/Detecting%20Buffer%20Over.pdf), a
translation of LLVM to a simple non-deterministic language to detect
buffer overflows. It involves
(1) printing a control flow graph of basic blocks of a function (easily done)
(2) translating each llvm statement to a corresponding data flow
language (needs ASTs to
2006 Jun 04
5
Creating pulldowns using loops
Creating looped pulldowns in PHP is simple so I can''t figure out why it
seems to elude me in RoR. I want to create a simple pulldown list with
the options and values "1" through "14."
I have been trying to accomplish this with the .upto method like so:
--START RHTML CODE--
<% options_array = [
1.upto(14) {|i| print "[" i "," i "]"}
2015 Mar 06
2
R with Array Hashes
Hi,
I wanted to share with the mailing list members here details about the
project I've been working on:
https://github.com/jeffreyhorner/R-Array-Hash
This is a re-implementation of R's hashed environments, the global
variable cache, the global string cache and symbol table with
cache-conscious array hash tables. The results are quite encouraging.
However, the implementation is a big
2019 Jan 10
1
mixed versions, mixed UIDs
Okay, so I've now read 'man idmap_rid'.
It states that the use of the base_rid parameter is deprecated, so does
that change ID formula to this?
ID = RID + LOW_RANGE_ID
Assuming that the default value for the now-deprecated base_rid is 0.
Following the example on the man page, I am going to try this:
idmap config * : backend = tdb
idmap config * :range = 1000000-1999999
idmap
2015 Jul 18
3
[LLVMdev] [RFC] Developer Policy for LLVM C API
On Fri, Jul 17, 2015 at 3:41 PM, Eric Christopher <echristo at gmail.com>
wrote:
> Hi Juergen,
>
> I've actually got another, perhaps more radical, plan. Let's just get rid
> of the C API or move it to another project. This simplifies a lot of the
> plans here where people have too many different ideas of how the C API
> should work.
>
> At this point the
2008 May 19
2
Help on nested FOR loops
I am new to more radical programming in R. I am trying to write a nested 'for' loop to produce output that takes subscripts like:
for i taking values 1,2,3,4,5 and
j taking values 1,2,3
I want to output for a computation using the combination values of i and j a value x like this;
i j x
1 1 x11
1 2 x12
1 3 x13
2 1 x21
2 2 x22
2 3 x23
3 1 x31
3 2 x32