Home | History | Annotate | Download | only in src
      1 // Copyright 2011 the V8 project authors. All rights reserved.
      2 // Redistribution and use in source and binary forms, with or without
      3 // modification, are permitted provided that the following conditions are
      4 // met:
      5 //
      6 //     * Redistributions of source code must retain the above copyright
      7 //       notice, this list of conditions and the following disclaimer.
      8 //     * Redistributions in binary form must reproduce the above
      9 //       copyright notice, this list of conditions and the following
     10 //       disclaimer in the documentation and/or other materials provided
     11 //       with the distribution.
     12 //     * Neither the name of Google Inc. nor the names of its
     13 //       contributors may be used to endorse or promote products derived
     14 //       from this software without specific prior written permission.
     15 //
     16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
     17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
     18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
     19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
     20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
     21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
     22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
     26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     27 
     28 #include <stdarg.h>
     29 #include "../include/v8stdint.h"
     30 #include "checks.h"
     31 #include "platform.h"
     32 #include "utils.h"
     33 
     34 namespace v8 {
     35 namespace internal {
     36 
     37 
     38 SimpleStringBuilder::SimpleStringBuilder(int size) {
     39   buffer_ = Vector<char>::New(size);
     40   position_ = 0;
     41 }
     42 
     43 
     44 void SimpleStringBuilder::AddString(const char* s) {
     45   AddSubstring(s, StrLength(s));
     46 }
     47 
     48 
     49 void SimpleStringBuilder::AddSubstring(const char* s, int n) {
     50   ASSERT(!is_finalized() && position_ + n <= buffer_.length());
     51   ASSERT(static_cast<size_t>(n) <= strlen(s));
     52   OS::MemCopy(&buffer_[position_], s, n * kCharSize);
     53   position_ += n;
     54 }
     55 
     56 
     57 void SimpleStringBuilder::AddPadding(char c, int count) {
     58   for (int i = 0; i < count; i++) {
     59     AddCharacter(c);
     60   }
     61 }
     62 
     63 
     64 void SimpleStringBuilder::AddDecimalInteger(int32_t value) {
     65   uint32_t number = static_cast<uint32_t>(value);
     66   if (value < 0) {
     67     AddCharacter('-');
     68     number = static_cast<uint32_t>(-value);
     69   }
     70   int digits = 1;
     71   for (uint32_t factor = 10; digits < 10; digits++, factor *= 10) {
     72     if (factor > number) break;
     73   }
     74   position_ += digits;
     75   for (int i = 1; i <= digits; i++) {
     76     buffer_[position_ - i] = '0' + static_cast<char>(number % 10);
     77     number /= 10;
     78   }
     79 }
     80 
     81 
     82 char* SimpleStringBuilder::Finalize() {
     83   ASSERT(!is_finalized() && position_ <= buffer_.length());
     84   // If there is no space for null termination, overwrite last character.
     85   if (position_ == buffer_.length()) {
     86     position_--;
     87     // Print ellipsis.
     88     for (int i = 3; i > 0 && position_ > i; --i) buffer_[position_ - i] = '.';
     89   }
     90   buffer_[position_] = '\0';
     91   // Make sure nobody managed to add a 0-character to the
     92   // buffer while building the string.
     93   ASSERT(strlen(buffer_.start()) == static_cast<size_t>(position_));
     94   position_ = -1;
     95   ASSERT(is_finalized());
     96   return buffer_.start();
     97 }
     98 
     99 
    100 const DivMagicNumbers DivMagicNumberFor(int32_t divisor) {
    101   switch (divisor) {
    102     case 3:    return DivMagicNumberFor3;
    103     case 5:    return DivMagicNumberFor5;
    104     case 7:    return DivMagicNumberFor7;
    105     case 9:    return DivMagicNumberFor9;
    106     case 11:   return DivMagicNumberFor11;
    107     case 25:   return DivMagicNumberFor25;
    108     case 125:  return DivMagicNumberFor125;
    109     case 625:  return DivMagicNumberFor625;
    110     default:   return InvalidDivMagicNumber;
    111   }
    112 }
    113 
    114 } }  // namespace v8::internal
    115