R.M. Stallman, "Using and Porting GNU CC," Free Software Foundation, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....using data diversity. In order to generate programs automatically with error detection capability using these techniques, we have implemented a software tool, illustrated in Fig.1.1. Before compilation, our preprocessor can add data diversity to C source code. We compile the source code by gcc [Stallman 98] and generate the assembly code. We modified the compiler to reallocate registers and variables for error detection. Our postprocessor adds the additional instructions for EDDI and CFCSS (each can be enabled 5 independently) to the assembly code. We compile the resultant code by an assembler and ....

.... a m, m = 1, 2, n res , l = 1, 4) x jl 0 , 1 , j = 1, 2, n ,l =1 , 5) x iq q=1 i:master instruction x jq j: shadow instruction 0,l = 1, 1 4.3 Results 4.3. 1 Fault Injection Simulation Experiment The benchmark programs are compiled by gcc [Stallman 98] with level 2 optimization option (O2) Most compiler optimization techniques that do not involve a space speed tradeoff (such as loop unrolling and function inlining) are performed in level 2 optimization. The compiler was modified to allocate registers for master and shadow instructions. First, ....

Stallman, R. "Using and Porting GNU CC," Free Software Foundation, 1998.

....file (e.g. in a binary translator s frontend) A key technique in a retargetable system is the representation of the semantics of the machine s instructions for analysis purposes. In many cases, a register transfer notation is used, such as that used by the optimizer VPO [2] GNU s gcc suite [23] and the binary translation framework UQBT [8, 7] Our current work on retargetable binary translation [8, 7] has shown that the machine dependent aspects of CISC and RISC machines can be specified in a variety of languages so that an intermediate representation of such instructions in the form ....

R. Stallman. Using and Porting GNU CC, version 2.5 edition, Oct. 1993.

....representation, whereas C language constructs define integer modulo arithmetic. The traditional approach taken by compilers to deal with this mismatch between DSP data types and C language constructs is based on using intrinsics [15 16] and or C language extensions [17 18] Intrinsics allow a programmer to explicitly specify certain instructions in the architecture which can not be easily described in a high level language such as C. The use of intrinsics and C language extensions suffers from disadvantages such as non portable ....

R. Stallman, "Using and porting GNU CC," Free Software Foundation, version 2.7.2.1, June 1996.

....8K 4 way set associative L1 cache with 16 byte blocks, and a miss penalty to main memory of 100 cycles. The power estimation framework has been shown to provide accuracy within 6.5 of the hardware it models. The benchmarks were taken from the SPEC2000 bench mark suite, and compiled with GCC [20] version 2.95.3 for the Hitachi SH architecture. The optimization flags during compilation were the default flags specified for compiling each benchmark from the SPEC suite. Table I provides a Figure 7: Effect of PAU Table size on energy savings summary of the benchmarks used, and number of ....

R. M. Stallman. Using and Porting GNU CC, 1995.

....one specification and use it for various applications such as simulation, assembler and disassembler generation and compiler back end generation. Today, there are a class of special purpose machine description languages which are developed keeping in mind a particular application. GCC s . md format[7] is such a language developed for the purpose of compiler back end generation. nML[2] is an extensible formalism developed for specifying the processor at higher level of abstraction. nML formalism models the instruction set architecture of a machine but does not provide any control flow ....

R. M. Stallman. Using and Porting GNU CC.

.... infrastructure software include: UNIX POSIX operating systems, e.g. Linux, FreeBSD, and NetBSD [BSD4.4] Web servers, e.g. Apache and JAWS [JAWS99] Distribution middleware, e.g. ACE [ACE01] TAO [TAO98] MICO [Puder99] omniORB, and JacORB [Brose99] Compilers, e.g. GNU C C [Stallman] . Editors, e.g. GNU emacs . Language processing tools, e.g. Perl, GAWK, Flex, and Bison . System network support tools, e.g. Samba, Sendmail, and Bind. These open source projects are distributed under a variety of licensing schemes 1 and business models. In general, however, they all ....

Stallman, R.M., "Using and Porting GNU CC," Free Software Foundation, 2001.

....directly on the control dependence subgraph augmented with explicit control flow information where required. Using data flow sets, we add data dependence edges to get the data dependence subgraph and the PDG. We have incorporated our PDG construction algorithm into the GNU C compiler gcc 2 [18], where we construct the PDG during the parse phase of compilation. In this implementation, we use the PDG as our only intermediate representation of the program. There are several advantages to our approach. For many programs, our approach may result in substantial savings in the time and memory ....

R. M. Stallman, "Using and porting GNU CC," Free Software Foundation, Inc., Cambridge MA, pp. 73-77, February 1990.

....results. We selected several C compilers that generate code for the MIPS architecture (a DECStation Model 5000 125) These included the native compiler supplied by DEC, two versions of Fraser and Hanson s lcc [Fraser and Hanson 1991; Fraser and Hanson 1995] compiler, several versions of GNU s gcc [Stallman 1992], and a previous version of our own C compiler that used a hand coded calling sequence generator. Although we feel that this technique is extremely valuable throughout the compiler development cycle, we believe that it would be fairest to evaluate its effectiveness in finding errors in young ....

Stallman, R. M. (1992). Using and Porting GNU CC (Version 2.0). Free Software Foundation, Inc.

....menu interface, or from the command line. Second, programmers can invoke many Aristotle tools from applications programs, by linking their programs with libraries that contain the tools as callable subroutines. We have implemented Aristotle s C parser using the front end of the GNU C compiler 1 [24]. We have also implemented a set of program analysis tools that perform further analysis, and support the development of additional tools. For example, our instrumented code generator creates an instrumented version of a program that, when executed with input data, provides execution trace ....

R. M. Stallman, "Using and porting `GNU CC," Free Software Foundation, Inc., Cambridge MA, February 1990, pp. 73-77.

....source language that the parallelising compiler is able to accept is a subset of the Pascal language. The tools used in creating this compiler are commonly used when creating compilers, in particular the compiler tools, Yet Another Compiler Compiler (YACC) Levi95] and GNU s 1 C compiler (gcc) [Stal93]. The following sub sections discuss the language and tools in more detail. 4.1.1 Language definition As discussed in Chapter 3, course grain parallelism is very well suited to a distributed environment. The work of Evans and Goscinski [Evan95b] discusses that blocks based at the procedural or ....

R. Stallman. "Using and porting GNU CC", Free Software Foundation, Cambridge, MA, June 1993.

....target architectures, and hopefully more than one source language. Secondly, the entire source code for the compiler, assembler and linker had to be available (for all architectures) so that modifications to their output could be made. Three different compilers were considered. The gcc compiler [33] was the obvious choice as it can generate code for most common architectures. However, modifying the compiler and its related tools was considered too difficult due to the complexity of the source code. The lcc compiler [15] was considered, due to its wide range of target architectures and its ....

Richard M. Stallman. Using and Porting GNU CC. 1995.

....ways of dispatching these service routines; Figure 1 shows the four most common. These are: subroutines called from an inner loop, a large switch statement, directly addressable labels, and function calls relying on tail call optimization. SimICS primarily uses addressable labels using GCC (Stallman 1992), but can also run using tail recursion. The process of implementing, and supporting, an industrial grade complete instruction set simulator is a significant task. An instruction set will typically require several hundred different service routines. The core interpreter of SimICS is therefore ....

Stallman, R. M. 1992. Using and Porting GNU CC, version 2.0 (15 February 1992). Free Software Foundation, Mass., USA.

....be executed parallely as determined by the parallelising compiler. As the output code from the parallelising compiler is of the high level C code, another compiler that converts C code to a low level assembly, needed for execution, is required. For this purpose the C compiler GCC (GNU C Compiler) [Stallman 1993] was used. 4 Experimental test program and results Many different test programs have been used throughout the development of the simple parallelising compiler. Most were created to check that certain fundamental elements of the compiler were operating correctly. For example, one test checked ....

R. Stallman. "Using and porting GNU CC", Free Software Foundation, A Simple Parallelising Compiler May 8, 1997 Page 23 Cambridge, Massachusetts, June 1993.

....of A wrong value loaded last use of A Figure 8. Overwriting of symbolic register by changing the predefined memory value. and A cannot be assigned the same memory home location as X. 6. Experimental Results An IP allocator for the x86 architecture has been built inside the Gnu C compiler [9]. The x86 architecture was chosen because it includes a large variety of register irregularities and because of its widespread use. The integer program generated by the IP allocator is sent to a CPLEX 6.0 integer program solver [4] The solver runs on a HP 9000 780 workstation with a 160MHz ....

R. Stallman. Using and Porting GNU CC.FreeSoftware Foundation, Inc., 1995.

....processor such as m4 [22] This is true, however the macro processor would interpret the machine description file at run time with a resulting loss of efficiency, whereas our approach compiled the machine description into executable code. An analogous approach is used in the project GNU C compiler [30]. 4 Tools for Operating on Trees Most of the system parts from the parser onwards, receive as input and produce as output a tree. Functions were needed that could copy, print and reverse trees or parts of them. A tool which provides this functionality is ast [14] The difference between the ast ....

Stallman RM (1992) Using and porting GNU CC. Free Software Foundation, 675 Mass Ave, Cambridge, MA, USA.

....is approximately 10,000 lines long, of which approximately 1,000 lines are CPU dependent (in total over all the CPUs) The assembly language postprocessor is an AWK script of approximately 4,000 lines long. As the sequential compiler that compiles the user program, we use GNU C compiler (GCC) [23] for our experiments. We currently rely on some extensions provided by GCC; therefore, although StackThreads MP in principle works with other sequential compilers obeying the calling standard, it at present works only with GCC. Nevertheless, the degree of departure from standard sequential ....

Richard M. Stallman. Using and Porting GNU CC, 1995.

....is approximately 10,000 lines long, of which approximately 1,000 lines are CPU dependent (in total over all the CPUs) The assembly language postprocessor is an AWK script of approximately 4,000 lines long. As the sequential compiler that compiles the user program, we use GNU C compiler (GCC) [19] for our experiments. We currently rely on some extensions provided by GCC; therefore, although StackThreads MP in principle works with other sequential compilers obeying the calling standard, it at present works only with GCC. Nevertheless, the degree of departure from standard sequential ....

Richard M. Stallman. Using and Porting GNU CC, 1995.

....systems. In a switching system prototyped, all components in logical model are implemented as objects in software, and concurrent processing and distributed processing are achieved very simply. The ACOOL compiler has been implemented, by rewriting the front end of the GNU C compiler [8]. It is freeware in accordance with the GNU GENERAL PUBLIC LICENCE of free software foundation inc. and can be obtained by anonymous FTP from: diamond.csl.ntt.jp (IP address: 163.138.62.6) or asagao.nijl.ac.jp (IP address: 192.244.21.112) Acknowledgements The author would like to ....

Stallman R. M., "Using and Porting GNU CC", Free Software Foundation Inc., 1992.

....target architectures, and hopefully more than one source language. Secondly, the entire source code for the compiler, assembler and linker had to be available (for all architectures) so that modifications to their output could be made. Three different compilers were considered. The gcc compiler [8] was the obvious choice as it can generate code for most common architectures. However, modifying the compiler and its related tools was considered too difficult due to the complexity of the source code. The lcc compiler [9] was considered, due to its wide range of target architectures and its ....

Richard M. Stallman. Using and Porting GNU CC. 1995.

....are used to check if the expression is in the range of possible case values. Instruction 1 can be avoided when the lowest case value is positive and relatively close to zero. The jump table can be padded with the addresses 6 These SPARC instructions are generated by the pcc [Johnson 1979] gcc [Stallman 1990], and vpcc [Benitez and Davidson 1988] compilers. Effectively Exploiting Indirect Jumps Delta 13 PROCEDURE BuildGraphFromRoot(rootnode,rootblock) rootnode = NewNode(NULL,rootblock,NULL) FOR each non overlapping value range VRANGE of the branch variable DO currentstates = related branch ....

Stallman, R. M. 1990. Using and Porting GNU CC (version 1.37.1). Cambridge, MA: Free Software Foundation, Inc.

No context found.

R.M. Stallman, "Using and Porting GNU CC," Free Software Foundation, 1995.

No context found.

Richard M. Stallman. Using and Porting GNU CC. November 1995. Available at: http://gcc.gnu.org/onlinedocs/gcc toc.html.

No context found.

R. Stallman, "Using and Porting GNU CC", Free Software Foundation, June 1996, version 2.7.2.1.

No context found.

R.M. Stallman. Using and Porting GNU CC, version 2.5 edition, October 1993.

No context found.

Stallman, Richard M. 1990. Using and porting GNU CC. Free Software Foundation, Inc.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC