Revision: 6706
Author: [email protected]
Date: Wed Feb  9 07:58:55 2011
Log: Make VS2005 project files compile without errors: changelist http://codereview.chromium.org/6286135/.
http://code.google.com/p/v8/source/detail?r=6706

Modified:
 /branches/bleeding_edge/src/bignum.cc
 /branches/bleeding_edge/src/profile-generator.cc
 /branches/bleeding_edge/tools/visual_studio/common.vsprops

=======================================
--- /branches/bleeding_edge/src/bignum.cc       Tue Dec  7 03:01:02 2010
+++ /branches/bleeding_edge/src/bignum.cc       Wed Feb  9 07:58:55 2011
@@ -67,7 +67,7 @@
   int needed_bigits = kUInt64Size / kBigitSize + 1;
   EnsureCapacity(needed_bigits);
   for (int i = 0; i < needed_bigits; ++i) {
-    bigits_[i] = value & kBigitMask;
+    bigits_[i] = static_cast<Chunk>(value & kBigitMask);
     value = value >> kBigitSize;
   }
   used_digits_ = needed_bigits;
@@ -266,7 +266,7 @@
   }
   while (carry != 0) {
     EnsureCapacity(used_digits_ + 1);
-    bigits_[used_digits_] = carry & kBigitMask;
+    bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask);
     used_digits_++;
     carry >>= kBigitSize;
   }
@@ -287,13 +287,13 @@
     uint64_t product_low = low * bigits_[i];
     uint64_t product_high = high * bigits_[i];
     uint64_t tmp = (carry & kBigitMask) + product_low;
-    bigits_[i] = tmp & kBigitMask;
+    bigits_[i] = static_cast<Chunk>(tmp & kBigitMask);
     carry = (carry >> kBigitSize) + (tmp >> kBigitSize) +
         (product_high << (32 - kBigitSize));
   }
   while (carry != 0) {
     EnsureCapacity(used_digits_ + 1);
-    bigits_[used_digits_] = carry & kBigitMask;
+    bigits_[used_digits_] = static_cast<Chunk>(carry & kBigitMask);
     used_digits_++;
     carry >>= kBigitSize;
   }
@@ -748,7 +748,8 @@
   for (int i = 0; i < other.used_digits_; ++i) {
DoubleChunk product = static_cast<DoubleChunk>(factor) * other.bigits_[i];
     DoubleChunk remove = borrow + product;
-    Chunk difference = bigits_[i + exponent_diff] - (remove & kBigitMask);
+    Chunk difference =
+ bigits_[i + exponent_diff] - static_cast<Chunk>(remove & kBigitMask);
     bigits_[i + exponent_diff] = difference & kBigitMask;
     borrow = static_cast<Chunk>((difference >> (kChunkSize - 1)) +
                                 (remove >> kBigitSize));
=======================================
--- /branches/bleeding_edge/src/profile-generator.cc Tue Jan 11 04:38:19 2011 +++ /branches/bleeding_edge/src/profile-generator.cc Wed Feb 9 07:58:55 2011
@@ -2285,7 +2285,7 @@

 // The algorithm is based on the article:
 // K. Cooper, T. Harvey and K. Kennedy "A Simple, Fast Dominance Algorithm"
-// Softw. Pract. Exper. 4 (2001), pp. 1–10.
+// Softw. Pract. Exper. 4 (2001), pp. 1-10.
 bool HeapSnapshotGenerator::BuildDominatorTree(
     const Vector<HeapEntry*>& entries,
     Vector<HeapEntry*>* dominators) {
=======================================
--- /branches/bleeding_edge/tools/visual_studio/common.vsprops Tue Dec 7 03:01:02 2010 +++ /branches/bleeding_edge/tools/visual_studio/common.vsprops Wed Feb 9 07:58:55 2011
@@ -16,7 +16,7 @@
                WarnAsError="true"
                Detect64BitPortabilityProblems="false"
                DebugInformationFormat="3"
-               DisableSpecificWarnings="4355;4800"
+               DisableSpecificWarnings="4351;4355;4800"
                EnableFunctionLevelLinking="true"
        />
        <Tool

--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev

Reply via email to