From lattner at cs.uiuc.edu Mon Aug 2 03:26:07 2004
From: lattner at cs.uiuc.edu (Chris Lattner)
Date: Mon, 2 Aug 2004 03:26:07 -0500
Subject: [llvm-commits] CVS: llvm-www/Features.html
Message-ID: <200408020826.DAA16955@apoc.cs.uiuc.edu>
Changes in directory llvm-www:
Features.html updated: 1.8 -> 1.9
---
Log message:
Close some li tags
---
Diffs of the changes: (+2 -2)
Index: llvm-www/Features.html
diff -u llvm-www/Features.html:1.8 llvm-www/Features.html:1.9
--- llvm-www/Features.html:1.8 Mon Jul 19 11:03:21 2004
+++ llvm-www/Features.html Mon Aug 2 03:25:57 2004
@@ -13,11 +13,11 @@
A stable implementation of the LLVM instruction set, which serves
as both the online and offline code representation, together with assembly
- (ASCII) and bytecode (binary) readers and writers, and a verifier.
+ (ASCII) and bytecode (binary) readers and writers, and a verifier.
A powerful pass-management system that automatically sequences passes
(including analysis, transformation, and code-generation passes) based on
- their dependences, and pipelines them for efficiency.
+ their dependences, and pipelines them for efficiency.
A wide range of global scalar optimizations.
From lattner at cs.uiuc.edu Mon Aug 2 05:10:18 2004
From: lattner at cs.uiuc.edu (Chris Lattner)
Date: Mon, 2 Aug 2004 05:10:18 -0500
Subject: [llvm-commits] CVS: llvm/tools/gccld/GenerateCode.cpp
Message-ID: <200408021010.FAA16378@zion.cs.uiuc.edu>
Changes in directory llvm/tools/gccld:
GenerateCode.cpp updated: 1.30 -> 1.31
---
Log message:
This pass has proven its metal, remove -disable option.
---
Diffs of the changes: (+1 -5)
Index: llvm/tools/gccld/GenerateCode.cpp
diff -u llvm/tools/gccld/GenerateCode.cpp:1.30 llvm/tools/gccld/GenerateCode.cpp:1.31
--- llvm/tools/gccld/GenerateCode.cpp:1.30 Tue Jul 27 03:13:15 2004
+++ llvm/tools/gccld/GenerateCode.cpp Mon Aug 2 05:10:08 2004
@@ -38,9 +38,6 @@
cl::opt
DisableOptimizations("disable-opt",
cl::desc("Do not run any optimization passes"));
- cl::opt
- DisableGlobalsModRef("disable-globalsmodref", cl::Hidden,
- cl::desc("Turn on the more aggressive alias analysis"));
}
/// CopyEnv - This function takes an array of environment variables and makes a
@@ -200,8 +197,7 @@
addPass(Passes, createScalarReplAggregatesPass()); // Break up allocas
// Run a few AA driven optimizations here and now, to cleanup the code.
- if (!DisableGlobalsModRef)
- addPass(Passes, createGlobalsModRefPass()); // IP alias analysis
+ addPass(Passes, createGlobalsModRefPass()); // IP alias analysis
addPass(Passes, createLICMPass()); // Hoist loop invariants
addPass(Passes, createLoadValueNumberingPass()); // GVN for load instrs
From brukman at cs.uiuc.edu Mon Aug 2 08:59:21 2004
From: brukman at cs.uiuc.edu (Misha Brukman)
Date: Mon, 2 Aug 2004 08:59:21 -0500
Subject: [llvm-commits]
CVS: llvm/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp
Message-ID: <200408021359.IAA10491@zion.cs.uiuc.edu>
Changes in directory llvm/lib/CodeGen/ModuloScheduling:
ModuloScheduling.cpp updated: 1.21 -> 1.22
---
Log message:
* ceil() requires #include for compilation
* Alphabetize #includes
* Fix some lines to fit within 80 cols
---
Diffs of the changes: (+4 -3)
Index: llvm/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp
diff -u llvm/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp:1.21 llvm/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp:1.22
--- llvm/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp:1.21 Fri Jul 30 18:36:10 2004
+++ llvm/lib/CodeGen/ModuloScheduling/ModuloScheduling.cpp Mon Aug 2 08:59:10 2004
@@ -9,6 +9,7 @@
//
// This ModuloScheduling pass is based on the Swing Modulo Scheduling
// algorithm.
+//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "ModuloSched"
@@ -26,13 +27,13 @@
#include "Support/Debug.h"
#include "Support/GraphWriter.h"
#include "Support/StringExtras.h"
-#include
-#include
+#include
#include
#include
+#include
+#include
#include "../../Target/SparcV9/SparcV9Internals.h"
#include "../../Target/SparcV9/SparcV9RegisterInfo.h"
-
using namespace llvm;
/// Create ModuloSchedulingPass
From brukman at cs.uiuc.edu Mon Aug 2 09:02:31 2004
From: brukman at cs.uiuc.edu (Misha Brukman)
Date: Mon, 2 Aug 2004 09:02:31 -0500
Subject: [llvm-commits]
CVS: llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp
Message-ID: <200408021402.JAA11230@zion.cs.uiuc.edu>
Changes in directory llvm/lib/CodeGen/ModuloScheduling:
MSchedGraph.cpp updated: 1.5 -> 1.6
---
Log message:
Add #include and abort() to silence a warning
---
Diffs of the changes: (+6 -5)
Index: llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp
diff -u llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp:1.5 llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp:1.6
--- llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp:1.5 Fri Jul 30 18:36:10 2004
+++ llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.cpp Mon Aug 2 09:02:21 2004
@@ -1,4 +1,4 @@
-//===-- MSchedGraph.cpp - Scheduling Graph ------------------------*- C++ -*-===//
+//===-- MSchedGraph.cpp - Scheduling Graph ----------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
@@ -17,6 +17,7 @@
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "Support/Debug.h"
+#include
using namespace llvm;
MSchedGraphNode::MSchedGraphNode(const MachineInstr* inst,
@@ -35,13 +36,13 @@
MSchedGraphEdge MSchedGraphNode::getInEdge(MSchedGraphNode *pred) {
//Loop over all the successors of our predecessor
//return the edge the corresponds to this in edge
- for(MSchedGraphNode::succ_iterator I = pred->succ_begin(), E = pred->succ_end();
- I != E; ++I) {
- if(*I == this)
+ for (MSchedGraphNode::succ_iterator I = pred->succ_begin(),
+ E = pred->succ_end(); I != E; ++I) {
+ if (*I == this)
return I.getEdge();
}
assert(0 && "Should have found edge between this node and its predecessor!");
-
+ abort();
}
unsigned MSchedGraphNode::getInEdgeNum(MSchedGraphNode *pred) {
From criswell at cs.uiuc.edu Mon Aug 2 10:12:40 2004
From: criswell at cs.uiuc.edu (John Criswell)
Date: Mon, 2 Aug 2004 10:12:40 -0500
Subject: [llvm-commits] CVS: llvm/test/QMTest/expectations.darwin.qmr
expectations.linux.qmr expectations.sunos.qmr
expectations.unknown.qmr
Message-ID: <200408021512.KAA15324@choi.cs.uiuc.edu>
Changes in directory llvm/test/QMTest:
expectations.darwin.qmr updated: 1.4 -> 1.5
expectations.linux.qmr updated: 1.11 -> 1.12
expectations.sunos.qmr updated: 1.11 -> 1.12
expectations.unknown.qmr updated: 1.6 -> 1.7
---
Log message:
Set Regression.Transforms.IndVarsSimplify.subtract to XFAIL.
Set Regression.CodeGen.Generic.2004-04-09-SameValueCoalescing to PASS.
---
Diffs of the changes: (+4 -4)
Index: llvm/test/QMTest/expectations.darwin.qmr
diff -u llvm/test/QMTest/expectations.darwin.qmr:1.4 llvm/test/QMTest/expectations.darwin.qmr:1.5
--- llvm/test/QMTest/expectations.darwin.qmr:1.4 Fri Jul 16 09:20:20 2004
+++ llvm/test/QMTest/expectations.darwin.qmr Mon Aug 2 10:12:29 2004
@@ -3,13 +3,13 @@
qoq}q(U
_Result__kindqUtestqU_Result__outcomeqUPASSqU_Result__annotationsq}U_Result__idq U0Regression.Assembler.2002-08-16-ConstExprInlinedq
U_Result__contextq(cqm.test.context
Context
-qo}q
(U_Context__propertiesq}U_Context__temporariesq}ubub.(hoq}q(hhhhh}h U(Regression.Transforms.PruneEH.simpletestqh(ho}q(h}h}ubub.(hoq}q(hhhhh}h U/Regression.CBackend.2002-08-19-HardConstantExprqh(ho}q(h}h}ubub.(hoq}q(hhhhh}h URegression.Jello.test-shiftqh(ho}q(h}h}ubub.(hoq}q(hhhhh}h U9Regression.Transforms.Mem2Reg.2003-10-05-DeadPHIInsertionqh(ho}q(h}h}ubub.(hoq }q!(hhhUFAILq"h}h U.Regression.Transforms.CorrelatedExprs.looptestq#h(ho}q$(h}h}ubub.(hoq%}q&(hhhhh}h U-Regression.Linker.2003-08-23-GlobalVarLinkingq'h(ho}q((h}h}ubub.(hoq)}q*(hhhhh}h U?Regression.Transforms.Inline.2003-09-22-PHINodesInExceptionDestq+h(ho}q,(h}h}ubub.(hoq-}q.(hhhh"h}h U,Regression.CFrontend.2003-02-12-NonlocalGotoq/h(ho}q0(h}h}ubub.(hoq1}q2(hhhhh}h U2Regression.Transforms.FunctionResolve.retmismatch1q3h(ho}q4(h}h}ubub.(hoq5}q6(hhhhh}h U2Regression.Assembler.2002-01-24-ValueRefine!
AbsTypeq7h(ho}q8(h}h}ubub.(hoq9}q:(hhhhh}h U8Regression.Transforms.ADCE.2003-01-22-PredecessorProblemq;h(ho}q<(h}h}ubub.(hoq=}q>(hhhhh}h U=Regression.Transforms.LevelRaise.2002-10-08-VarArgCallInfLoopq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U5Regression.CFrontend.2003-07-22-ArrayAccessTypeSafetyqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhhh}h U)Regression.Transforms.Reassociate.subtestqWh(ho}qX(h}h}ubub.(hoqY}qZ(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprq[h(ho}q\(h}h}ubub.(hoq]}q^(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-AgressiveSub!
Moveq_h(ho}q`(h}h}ubub.(hoqa}qb(hhhhh}h UARegression.Transfo
rms.CorrelatedExprs.2002-10-07-DominatorProblemqch(ho}qd(h}h}ubub.(hoqe}qf(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqgh(ho}qh(h}h}ubub.(hoqi}qj(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqkh(ho}ql(h}h}ubub.(hoqm}qn(hhhhh}h U-Regression.CFrontend.2002-02-18-64bitConstantqoh(ho}qp(h}h}ubub.(hoqq}qr(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qsh(ho}qt(h}h}ubub.(hoqu}qv(hhhhh}h U(Regression.Reoptimizer.BinInterface.testqwh(ho}qx(h}h}ubub.(hoqy}qz(hhhhh}h URegression.Transforms.CorrelatedExprs.2002-10-08-DominatorTestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h URegression.Linker!
.testlink2q?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U(Regression.Transforms.GCSE.RLE-Eliminateq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U4Regression.C++Frontend.2003-09-30-NestedFunctionDeclq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U=Regression.Transforms.CorrelatedExprs.2002-09-23-PHIUpdateBugq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U7Regression.Transforms.LowerSwitch.2003-05-01-PHIProblemq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U2Regression.Transforms.ADCE.2003-09-15-InfLoopCrashq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U*Regression.Transforms.DSAnalysis.recursionq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U)Regression.Jello.2003-01-15-AlignmentTestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhUFAILq?h}h UFeature.mc.simplecalltestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U*Regression.CFrontend.2002-04-07-SwitchStmtq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U!Regression.Jello.2003-01-10-FUCOMq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U(Reg!
ression.CFrontend.2003-08-21-StmtExprq?h(ho}q?(h}h}ubub.(hoq?}q?(
hhhUPASSq?h}h U*Regression.Transforms.ScalarRepl.basictestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhh"h}h U6Regression.Transforms.LevelRaise.2002-02-11-ArrayShapeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U1Regression.Assembler.2003-03-03-DuplicateConstantq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U.Regression.Transforms.ModuloSched.arith-simpleq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U%Regression.Transforms.InstCombine.andq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U)Regression.Other.2002-08-02-DomSetProblemq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U6Regression.Assembler.2002-07-25-ParserAssertionFailureq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U6Regression.Transforms.LevelRaise.2002-03-20-BadCodegenq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U%Regression.Transforms.ADCE.basictest1q?h(ho}q?(h}h}ubub.(hoq?}q?(hhhUFAILq?h}h UFeature.mc.recursivetypeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U$Regression.Transforms.InstCombine.orq?h(ho!
}q?(h}h}ubub.(hoq?}q?(hhhhh}h U Regression.Verifier.AmbiguousPhiq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U'Regression.Analysis.DSGraph.constantizeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U6Regression.Transforms.GlobalDCE.2002-08-17-FunctionDGEq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U4Regression.Transforms.SimplifyCFG.2002-06-24-PHINodeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U(Regression.Linker.2003-05-15-TypeProblemq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U#Regression.Transforms.SCCP.sccptestq?h(ho}q?(h}h}ubub.(hor--------- \ No newline at end of file
+qo}q
(U_Context__propertiesq}U_Context__temporariesq}ubub.(hoq}q(hhhhh}h U(Regression.Transforms.PruneEH.simpletestqh(ho}q(h}h}ubub.(hoq}q(hhhhh}h U/Regression.CBackend.2002-08-19-HardConstantExprqh(ho}q(h}h}ubub.(hoq}q(hhhhh}h URegression.Jello.test-shiftqh(ho}q(h}h}ubub.(hoq}q(hhhUFAILqh}h U.Regression.Transforms.CorrelatedExprs.looptestqh(ho}q (h}h}ubub.(hoq!}q"(hhhhh}h U-Regression.Linker.2003-08-23-GlobalVarLinkingq#h(ho}q$(h}h}ubub.(hoq%}q&(hhhhh}h U?Regression.Transforms.Inline.2003-09-22-PHINodesInExceptionDestq'h(ho}q((h}h}ubub.(hoq)}q*(hhhhh}h U,Regression.CFrontend.2003-02-12-NonlocalGotoq+h(ho}q,(h}h}ubub.(hoq-}q.(hhhhh}h U2Regression.Transforms.FunctionResolve.retmismatch1q/h(ho}q0(h}h}ubub.(hoq1}q2(hhhhh}h U>Regression.Transforms.LevelRaise.2002-05-02-BadCastEliminationq3h(ho}q4(h}h}ubub.(hoq5}q6(hhhhh}h U8Regression.Transforms.ADCE.2003-01-22-!
PredecessorProblemq7h(ho}q8(h}h}ubub.(hoq9}q:(hhhhh}h U=Regression.Transforms.LevelRaise.2002-10-08-VarArgCallInfLoopq;h(ho}q<(h}h}ubub.(hoq=}q>(hhhhh}h U5Regression.CFrontend.2003-07-22-ArrayAccessTypeSafetyq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U1Regression.CFrontend.2002-03-12-StructInitializerqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U"Regression.Jello.2003-06-05-PHIBugqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhUPASSqWh}h U$Regression.BugPoint.misopt-basictestqXh(ho}qY(h}h}ubub.(hoqZ}q[(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemq\h(ho}q](h}h}ubub.(hoq^}q_(hhhhh}h U)Regression.Transforms.Reassociate.subtestq`h(ho}qa(h}h}!
ubub.(hoqb}qc(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExp
rqdh(ho}qe(h}h}ubub.(hoqf}qg(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-AgressiveSubMoveqhh(ho}qi(h}h}ubub.(hoqj}qk(hhhhh}h UARegression.Transforms.CorrelatedExprs.2002-10-07-DominatorProblemqlh(ho}qm(h}h}ubub.(hoqn}qo(hhhhh}h U>Regression.Transforms.InstCombine.2003-06-22-ConstantExprCrashqph(ho}qq(h}h}ubub.(hoqr}qs(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqth(ho}qu(h}h}ubub.(hoqv}qw(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqxh(ho}qy(h}h}ubub.(hoqz}q{(hhhhh}h U$Regression.Jello.2003-01-04-LoopTestq|h(ho}q}(h}h}ubub.(hoq~}q(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2q?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U)Regression.CFrontend.2002-07-14-MiscTestsq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U-Regression.C++Frontend.2003-08-28-SaveExprBugqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U"Regression.Jello.2003-06-05-PHIBugqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhhh}h U)Regression.Transforms.Reassociate.subtestqWh(ho}qX(h}h}ubub.(hoqY}qZ(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprq[h(ho}q\(h}h}ubub.(hoq]}q^(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-AgressiveSubMoveq_h(ho}q`(h}h}ubub.(!
hoqa}qb(hhhhh}h UARegression.Transforms.CorrelatedExprs.2002-10-
07-DominatorProblemqch(ho}qd(h}h}ubub.(hoqe}qf(hhhhh}h U>Regression.Transforms.InstCombine.2003-06-22-ConstantExprCrashqgh(ho}qh(h}h}ubub.(hoqi}qj(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqkh(ho}ql(h}h}ubub.(hoqm}qn(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqoh(ho}qp(h}h}ubub.(hoqq}qr(hhhhh}h U$Regression.Jello.2003-01-04-LoopTestqsh(ho}qt(h}h}ubub.(hoqu}qv(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qwh(ho}qx(h}h}ubub.(hoqy}qz(hhhhh}h U)Regression.CFrontend.2002-07-14-MiscTestsq{h(ho}q|(h}h}ubub.(hoq}}q~(hhhhh}h U(hhhhh}h U5Regression.CFrontend.2003-07-22-ArrayAccessTypeSafetyq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U)Regression.Transforms.Reassociate.subtestqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprqWh(ho}qX(h}h}ubub.(hoqY}qZ(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-AgressiveSubMoveq[h(ho}q\(h}h}ubub.(hoq]}q^(hhhhh}h UARegression.Transforms.CorrelatedExprs.2002-10-!
07-DominatorProblemq_h(ho}q`(h}h}ubub.(hoqa}qb(hhhhh}h U3Reg
ression.Transforms.PiNodeInserter.substitutetestqch(ho}qd(h}h}ubub.(hoqe}qf(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqgh(ho}qh(h}h}ubub.(hoqi}qj(hhhhh}h U-Regression.CFrontend.2002-02-18-64bitConstantqkh(ho}ql(h}h}ubub.(hoqm}qn(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qoh(ho}qp(h}h}ubub.(hoqq}qr(hhhhh}h U(Regression.Reoptimizer.BinInterface.testqsh(ho}qt(h}h}ubub.(hoqu}qv(hhhhh}h U(hhhhh}h U=Regression.Transforms.LevelRaise.2002-10-08-VarArgCallInfLoopq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U5Regression.CFrontend.2003-07-22-ArrayAccessTypeSafetyqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhhh}h U)Regression.Transforms.Reassociate.subtestqWh(ho}qX(h}h}ubub.(hoqY}qZ(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprq[h(ho}q\(h}h}ubub.(hoq]}q^(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-Ag!
ressiveSubMoveq_h(ho}q`(h}h}ubub.(hoqa}qb(hhhhh}h UARegressi
on.Transforms.CorrelatedExprs.2002-10-07-DominatorProblemqch(ho}qd(h}h}ubub.(hoqe}qf(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqgh(ho}qh(h}h}ubub.(hoqi}qj(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqkh(ho}ql(h}h}ubub.(hoqm}qn(hhhhh}h U-Regression.CFrontend.2002-02-18-64bitConstantqoh(ho}qp(h}h}ubub.(hoqq}qr(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qsh(ho}qt(h}h}ubub.(hoqu}qv(hhhhh}h U(Regression.Reoptimizer.BinInterface.testqwh(ho}qx(h}h}ubub.(hoqy}qz(hhhhh}h U(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U-Regression.C++Frontend.2003-08-28-SaveExprBugqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U"Regression.Jello.2003-06-05-PHIBugqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhhh}h U)Regression.Transforms.Reassociate.subtestqWh(ho}qX(h}h}ubub.(hoqY}qZ(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprq[h(ho}q\(h}h}ubub.(hoq]}q^(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-AgressiveSubMoveq_h(ho}q`(h}h}ubub.(hoqa}qb(hhhhh}h!
UARegression.Transforms.CorrelatedExprs.2002-10-07-DominatorProblemqc
h(ho}qd(h}h}ubub.(hoqe}qf(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqgh(ho}qh(h}h}ubub.(hoqi}qj(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqkh(ho}ql(h}h}ubub.(hoqm}qn(hhhhh}h U$Regression.Jello.2003-01-04-LoopTestqoh(ho}qp(h}h}ubub.(hoqq}qr(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qsh(ho}qt(h}h}ubub.(hoqu}qv(hhhhh}h U)Regression.CFrontend.2002-07-14-MiscTestsqwh(ho}qx(h}h}ubub.(hoqy}qz(hhhhh}h URegression.Transforms.LevelRaise.2002-05-02-BadCastEliminationq3h(ho}q4(h}h}ubub.(hoq5}q6(hhhhh}h U8Regression.Transforms.ADCE.2003-01-22-!
PredecessorProblemq7h(ho}q8(h}h}ubub.(hoq9}q:(hhhhh}h U=Regression.Transforms.LevelRaise.2002-10-08-VarArgCallInfLoopq;h(ho}q<(h}h}ubub.(hoq=}q>(hhhhh}h U Regression.Reoptimizer.ticm.ticmq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U"Regression.Jello.2003-06-05-PHIBugqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhUPASSqSh}h U$Regression.BugPoint.misopt-basictestqTh(ho}qU(h}h}ubub.(hoqV}qW(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqXh(ho}qY(h}h}ubub.(hoqZ}q[(hhhhh}h U)Regression.Transforms.Reassociate.subtestq\h(ho}q](h}h}ubub.(hoq^}q_(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprq`h(ho}qa(h}h}ubub.(hoqb}qc(hhhhh}h U!
=Regression.Transforms.Reassociate.2002-05-15-AgressiveSubMoveqdh(ho
}qe(h}h}ubub.(hoqf}qg(hhhhh}h UARegression.Transforms.CorrelatedExprs.2002-10-07-DominatorProblemqhh(ho}qi(h}h}ubub.(hoqj}qk(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqlh(ho}qm(h}h}ubub.(hoqn}qo(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqph(ho}qq(h}h}ubub.(hoqr}qs(hhhhh}h U$Regression.Jello.2003-01-04-LoopTestqth(ho}qu(h}h}ubub.(hoqv}qw(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qxh(ho}qy(h}h}ubub.(hoqz}q{(hhhhh}h U)Regression.CFrontend.2002-07-14-MiscTestsq|h(ho}q}(h}h}ubub.(hoq~}q(hhhhh}h U(hhhhh}h U=Regression.Transforms.LevelRaise.2002-10-08-VarArgCallInfLoopq?h(ho}q@(h}h}ubub.(hoqA}qB(hhhhh}h U Regression.Reoptimizer.ticm.ticmqCh(ho}qD(h}h}ubub.(hoqE}qF(hhhhh}h U8Regression.C++Frontend.2003-09-29-ArgumentNumberMismatchqGh(ho}qH(h}h}ubub.(hoqI}qJ(hhhhh}h U+Regression.CFrontend.2002-09-19-StarInLabelqKh(ho}qL(h}h}ubub.(hoqM}qN(hhhhh}h U.Regression.CFrontend.2003-08-23-LocalUnionTestqOh(ho}qP(h}h}ubub.(hoqQ}qR(hhhhh}h U/Regression.Linker.2003-04-26-NullPtrLinkProblemqSh(ho}qT(h}h}ubub.(hoqU}qV(hhhhh}h U)Regression.Transforms.Reassociate.subtestqWh(ho}qX(h}h}ubub.(hoqY}qZ(hhhhh}h U)Regression.Linker.2002-08-20-ConstantExprq[h(ho}q\(h}h}ubub.(hoq]}q^(hhhhh}h U=Regression.Transforms.Reassociate.2002-05-15-AgressiveSubMoveq_h(ho}q`(h}h!
}ubub.(hoqa}qb(hhhhh}h UARegression.Transforms.CorrelatedExprs.2
002-10-07-DominatorProblemqch(ho}qd(h}h}ubub.(hoqe}qf(hhhhh}h U3Regression.Transforms.PiNodeInserter.substitutetestqgh(ho}qh(h}h}ubub.(hoqi}qj(hhhhh}h U4Regression.Transforms.SCCP.2003-08-26-InvokeHandlingqkh(ho}ql(h}h}ubub.(hoqm}qn(hhhhh}h U-Regression.CFrontend.2002-02-18-64bitConstantqoh(ho}qp(h}h}ubub.(hoqq}qr(hhhhh}h U1Regression.Assembler.2002-04-04-PureVirtMethCall2qsh(ho}qt(h}h}ubub.(hoqu}qv(hhhhh}h U(Regression.Reoptimizer.BinInterface.testqwh(ho}qx(h}h}ubub.(hoqy}qz(hhhhh}h URegression.Transforms.CorrelatedExprs.2002-10-08-DominatorTestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h URegression.Linker.testlink2q?h(ho}q?!
(h}h}ubub.(hoq?}q?(hhhhh}h U(Regression.Transforms.GCSE.RLE-Eliminateq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U4Regression.C++Frontend.2003-09-30-NestedFunctionDeclq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U=Regression.Transforms.CorrelatedExprs.2002-09-23-PHIUpdateBugq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U7Regression.Transforms.LowerSwitch.2003-05-01-PHIProblemq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U2Regression.Transforms.ADCE.2003-09-15-InfLoopCrashq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U*Regression.Transforms.DSAnalysis.recursionq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U)Regression.Jello.2003-01-15-AlignmentTestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhUFAILq?h}h UFeature.mc.simplecalltestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U*Regression.CFrontend.2002-04-07-SwitchStmtq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U!Regression.Jello.2003-01-10-FUCOMq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U(Regression.CFrontend.200!
3-08-21-StmtExprq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhUPASSq?h}h U*
Regression.Transforms.ScalarRepl.basictestq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhh"h}h U6Regression.Transforms.LevelRaise.2002-02-11-ArrayShapeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U1Regression.Assembler.2003-03-03-DuplicateConstantq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U.Regression.Transforms.ModuloSched.arith-simpleq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U%Regression.Transforms.InstCombine.andq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U)Regression.Other.2002-08-02-DomSetProblemq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U6Regression.Assembler.2002-07-25-ParserAssertionFailureq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U6Regression.Transforms.LevelRaise.2002-03-20-BadCodegenq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U%Regression.Transforms.ADCE.basictest1q?h(ho}q?(h}h}ubub.(hoq?}q?(hhhUFAILq?h}h UFeature.mc.recursivetypeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U$Regression.Transforms.InstCombine.orq?h(ho}q?(h}h}ubub.(hoq?!
}q?(hhhhh}h U Regression.Verifier.AmbiguousPhiq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U'Regression.Analysis.DSGraph.constantizeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U6Regression.Transforms.GlobalDCE.2002-08-17-FunctionDGEq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U4Regression.Transforms.SimplifyCFG.2002-06-24-PHINodeq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U(Regression.Linker.2003-05-15-TypeProblemq?h(ho}q?(h}h}ubub.(hoq?}q?(hhhhh}h U#Regression.Transforms.SCCP.sccptestq?h(ho}q?(h}h}ubub.(hor+++++++++ \ No newline at end of file
From lattner at cs.uiuc.edu Mon Aug 2 15:16:31 2004
From: lattner at cs.uiuc.edu (Chris Lattner)
Date: Mon, 2 Aug 2004 15:16:31 -0500
Subject: [llvm-commits] CVS: llvm/lib/Analysis/DataStructure/Local.cpp
Message-ID: <200408022016.PAA18486@apoc.cs.uiuc.edu>
Changes in directory llvm/lib/Analysis/DataStructure:
Local.cpp updated: 1.109 -> 1.110
---
Log message:
Hide this option
---
Diffs of the changes: (+1 -1)
Index: llvm/lib/Analysis/DataStructure/Local.cpp
diff -u llvm/lib/Analysis/DataStructure/Local.cpp:1.109 llvm/lib/Analysis/DataStructure/Local.cpp:1.110
--- llvm/lib/Analysis/DataStructure/Local.cpp:1.109 Wed Jul 21 15:50:33 2004
+++ llvm/lib/Analysis/DataStructure/Local.cpp Mon Aug 2 15:16:21 2004
@@ -36,7 +36,7 @@
X("datastructure", "Local Data Structure Analysis");
static cl::opt
-TrackIntegersAsPointers("dsa-track-integers",
+TrackIntegersAsPointers("dsa-track-integers", cl::Hidden,
cl::desc("If this is set, track integers as potential pointers"));
namespace llvm {
From lattner at cs.uiuc.edu Mon Aug 2 15:28:54 2004
From: lattner at cs.uiuc.edu (Chris Lattner)
Date: Mon, 2 Aug 2004 15:28:54 -0500
Subject: [llvm-commits] CVS: llvm/docs/ReleaseNotes.html
Message-ID: <200408022028.PAA18527@apoc.cs.uiuc.edu>
Changes in directory llvm/docs:
ReleaseNotes.html updated: 1.221 -> 1.222
---
Log message:
Substantially hack on and clean up the release notes
---
Diffs of the changes: (+55 -68)
Index: llvm/docs/ReleaseNotes.html
diff -u llvm/docs/ReleaseNotes.html:1.221 llvm/docs/ReleaseNotes.html:1.222
--- llvm/docs/ReleaseNotes.html:1.221 Sun Jul 25 17:15:33 2004
+++ llvm/docs/ReleaseNotes.html Mon Aug 2 15:28:44 2004
@@ -71,15 +71,14 @@
This is the fourth public release of the LLVM compiler infrastructure. This
release primarily improves the performance of the
-code produced by all aspects of the LLVM compiler and adds many new features, and fixes a few
-bugs as well.
+code produced by all aspects of the LLVM compiler, adds many new features, fixes a few
+bugs, and speeds up the compiler.
At this time, LLVM is known to correctly compile and run all C & C++
-SPEC CPU2000 benchmarks, the Olden benchmarks, and the Ptrdist benchmarks. It
-has also been used to compile many other programs. LLVM now also works
-with a broad variety of C++ programs, though it has still received less testing
-than the C front-end.
+SPEC CPU95 & 2000 benchmarks, the Olden benchmarks, and the Ptrdist
+benchmarks, and many other programs. LLVM now also works
+with a broad variety of C++ programs.
@@ -97,8 +96,8 @@
Bugpoint can now narrow down code-generation bugs to a loop nest, where
before it could only narrow them down to a function being miscompiled.
Bugpoint can now debug arbitrary
-modes of llc and lli, by passing them command line flags (e.g.,
--regalloc=linearscan, -enable-correct-eh-support, etc.)
+modes of llc and lli, by passing them command line flags (e.g.
+-regalloc=linearscan).
The Control Flow Graph in the native code generators is no longer
constrained to be the same as the CFG for the LLVM input code.
The LLVM induction variable analysis routines have been rewritten.
@@ -108,8 +107,9 @@
LLVM now has first-class support for Accurate Garbage Collection, enabling the use
of aggressive copying and generational collectors.
-LLVM now includes an implementation of Andersen's interprocedural alias
-analysis algorithm.
+LLVM now includes a simple implementation of Andersen's interprocedural alias
+analysis algorithm.
Bugpoint can extract individual
basic blocks to track down reduce miscompilation testcases.
LLVM and the C front-end now work under Win32 using the
@@ -117,29 +117,35 @@
This includes the JIT compiler.
The LLVM code generator is now being documented.
-There is a new tool, llvm-bcanalyzer. This tool can compute basic
-statistics and bytecode density statistics on a module or function basis and
-also dump out bytecode in a textual format that is lower level than assembly
-(values are not resolved from slot numbers). It should only be of interest to
-(a) those who are working to improve the bytecode format and (b) those who
-really want to understand or document the details of the bytecode format.
-The LLVM Bytecode file format is now
+LLVM includes a new tool, llvm-bcanalyzer, This tool
+can compute various statistics and dump information about LLVM bytecode
+encoding.
+The LLVM bytecode file format is now
documented.
LLVM now provides an llvm.isunordered intrinsic for efficient
implementation of unordered floating point comparisons.
The llvmgcc front-end now supports the GCC builtins for ISO C99 floating
point comparison macros (e.g., __builtin_islessequal).
-Now that there are more source files than can fit on a 32Kbyte command
-line (Linux's limit), there's a new utility for searching the sources. The
-llvmgrep tool in the utils directory combines an egrep and a find without
-passing filenames through the command line. This improves performance
-slightly. Simply run llvmgrep like you might egrep but leave off the file
-names.
-We now generate HTML documentation and man pages for the tools from a single
-source (perl-style POD files).
+We now generate HTML documentation and man pages
+for the tools from a single source (perl-style POD files).
The LLVM code generator can now dynamically load targets from shared
objects.
+LLVM now includes a "skeleton" target, which makes it easier to get
+started porting LLVM to new architectures.
+The linear scan register allocator is now enabled by default in the
+target-independent code generator.
+LLVM now includes a dead store elimination pass.
+Bugpoint can now debug miscompilations that lead to the program going
+into an infinite loop.
+LLVM now provides interfaces to support ML-style pattern matching on the
+LLVM IR.
+LLVM now includes a context-sensitive mod/ref analysis
+for global variables, which is now enabled by default in gccld.
+LLVM can now autogenerate assembly printers for code generators from the
+tablegen description of the target (before they were hand coded).
@@ -161,6 +167,10 @@
with 64-bit pointers.
Bugpoint doesn't support
uses of external fns by immediate constant exprs
+Can't add function passes that
+depend on immutable passes to the FunctionPassManager.
+Archive file reader doesn't
+understand abbreviated names in headers
@@ -189,6 +199,10 @@
Bytecode Enhancements
Needed
[loopsimplify] Loop simplify is really slow on 252.eon
+[code-cleanup] SymbolTable
+ class cleanup, Type should not derive from Value, eliminate
+ ConstantPointerRef class.
+The memory footprint of the LLVM IR has been reduced substantially.
@@ -231,7 +245,7 @@
The -inline pass no longer misses obvious inlining opportunities just
because the callee eventually calls into an external function.
-The -simplifycfg pass can now "if convert" simple statements into the new
+The -simplifycfg pass can now "if convert" simple statements into the
select instruction.
The -loopsimplify pass can now break The link-time optimizer now runs the -prune-eh pass (to remove unused
exception handlers).
+The link-time optimizer now runs dead store elimination and uses a simple
+interprocedural alias analysis.
+
The -simplifycfg pass can now eliminate simple correlated branches (such as
"if (A < B && A < B)", and can turn short-circuiting
operators into the strict versions when useful (such as "if (A < B || A
@@ -254,16 +271,14 @@
propagation of function calls. It currently supports a few math library
functions like sqrt/sin/cos/etc.
-The C backend now emits Syntactic
+The C backend now emits syntactic
loops in the code to help C compilers whose optimizers do not recognize
loops formed from gotos (like GCC).
-Fixed: [sparcv9] null
-often spilled to constant pool.
+The SparcV9 backend no longers spills the null constant to the constant
+pool.
-Fixed: [code-cleanup] SymbolTable
- class cleanup, Type should not derive from Value, eliminate
- ConstantPointerRef class. All three changes have been made.
@@ -274,7 +289,7 @@
-
Bugs in the LLVM Core:
+
Bugs fixed in the LLVM Core:
- [loopsimplify] Loop simplify
@@ -283,8 +298,6 @@
breaks SSA form
- [X86] JIT miscompiles unsigned short
to floating point cast
-- [jit] abort, don't warn, when
-missing external functions encountered
- [vmcore] Linker causes erroneous
asssertion
- [adce] Crash handling unreachable
@@ -293,13 +306,8 @@
of the same name, both having constant pools
- [livevar] Live variables missed
physical register use of aliased definition
-- Verifier misses malformed switch
-instruction
-- [asmwriter] Asm writer aborts if
-an instruction is not embedded into a function
- [X86] stackifier crash on floating
point setcc X, X
-- Can't add LICM to FunctionPassManager
Bugs in the C/C++ front-end:
@@ -354,22 +362,6 @@
-
-
-In this release, the following portability problems were fixed:
-
-
-
-
@@ -688,13 +681,7 @@
- - Optimized (Release) versions of LLVM built with GCC 3.3.2 or 3.3.3 will
- produce an llc tool that always enters an infinite loop due to what
- appears to be an optimization bug (-O2 and -O3) in those versions of GCC.
- This problem does not happen in GCC 3.3.1 nor GCC 3.4.0 nor does it happen if
- you build a Debug version of LLVM. You are cautioned not to use GCC 3.3.2 or
- GCC 3.3.3 to build Optimized versions of LLVM. It is unclear whether this problem
- affects other backends but it is unlikely.
+ - none yet
@@ -770,7 +757,7 @@
src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" />
The LLVM Compiler Infrastructure
- Last modified: $Date: 2004/07/25 22:15:33 $
+ Last modified: $Date: 2004/08/02 20:28:44 $