File: Length.cpp

package info (click to toggle)
chromium-browser 57.0.2987.98-1~deb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 2,637,852 kB
  • ctags: 2,544,394
  • sloc: cpp: 12,815,961; ansic: 3,676,222; python: 1,147,112; asm: 526,608; java: 523,212; xml: 286,794; perl: 92,654; sh: 86,408; objc: 73,271; makefile: 27,698; cs: 18,487; yacc: 13,031; tcl: 12,957; pascal: 4,875; ml: 4,716; lex: 3,904; sql: 3,862; ruby: 1,982; lisp: 1,508; php: 1,368; exp: 404; awk: 325; csh: 117; jsp: 39; sed: 37
file content (184 lines) | stat: -rw-r--r-- 5,677 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
/*
 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
 *           (C) 1999 Antti Koivisto (koivisto@kde.org)
 *           (C) 2001 Dirk Mueller ( mueller@kde.org )
 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights
 * reserved.
 * Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net)
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public License
 * along with this library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA.
 *
 */

#include "platform/Length.h"

#include "platform/CalculationValue.h"
#include "platform/animation/AnimationUtilities.h"

using namespace WTF;

namespace blink {

class CalculationValueHandleMap {
  USING_FAST_MALLOC(CalculationValueHandleMap);
  WTF_MAKE_NONCOPYABLE(CalculationValueHandleMap);

 public:
  CalculationValueHandleMap() : m_index(1) {}

  int insert(PassRefPtr<CalculationValue> calcValue) {
    ASSERT(m_index);
    // FIXME calc(): https://bugs.webkit.org/show_bug.cgi?id=80489
    // This monotonically increasing handle generation scheme is potentially
    // wasteful of the handle space. Consider reusing empty handles.
    while (m_map.contains(m_index))
      m_index++;

    m_map.set(m_index, std::move(calcValue));

    return m_index;
  }

  void remove(int index) {
    ASSERT(m_map.contains(index));
    m_map.remove(index);
  }

  CalculationValue& get(int index) {
    ASSERT(m_map.contains(index));
    return *m_map.get(index);
  }

  void decrementRef(int index) {
    ASSERT(m_map.contains(index));
    CalculationValue* value = m_map.get(index);
    if (value->hasOneRef()) {
      // Force the CalculationValue destructor early to avoid a potential
      // recursive call inside HashMap remove().
      m_map.set(index, nullptr);
      m_map.remove(index);
    } else {
      value->deref();
    }
  }

 private:
  int m_index;
  HashMap<int, RefPtr<CalculationValue>> m_map;
};

static CalculationValueHandleMap& calcHandles() {
  DEFINE_STATIC_LOCAL(CalculationValueHandleMap, handleMap, ());
  return handleMap;
}

Length::Length(PassRefPtr<CalculationValue> calc)
    : m_quirk(false), m_type(Calculated), m_isFloat(false) {
  m_intValue = calcHandles().insert(std::move(calc));
}

Length Length::blendMixedTypes(const Length& from,
                               double progress,
                               ValueRange range) const {
  ASSERT(from.isSpecified());
  ASSERT(isSpecified());
  PixelsAndPercent fromPixelsAndPercent = from.getPixelsAndPercent();
  PixelsAndPercent toPixelsAndPercent = getPixelsAndPercent();
  const float pixels = blink::blend(fromPixelsAndPercent.pixels,
                                    toPixelsAndPercent.pixels, progress);
  const float percent = blink::blend(fromPixelsAndPercent.percent,
                                     toPixelsAndPercent.percent, progress);
  return Length(
      CalculationValue::create(PixelsAndPercent(pixels, percent), range));
}

PixelsAndPercent Length::getPixelsAndPercent() const {
  switch (type()) {
    case Fixed:
      return PixelsAndPercent(value(), 0);
    case Percent:
      return PixelsAndPercent(0, value());
    case Calculated:
      return getCalculationValue().getPixelsAndPercent();
    default:
      ASSERT_NOT_REACHED();
      return PixelsAndPercent(0, 0);
  }
}

Length Length::subtractFromOneHundredPercent() const {
  PixelsAndPercent result = getPixelsAndPercent();
  result.pixels = -result.pixels;
  result.percent = 100 - result.percent;
  if (result.pixels && result.percent)
    return Length(CalculationValue::create(result, ValueRangeAll));
  if (result.percent)
    return Length(result.percent, Percent);
  return Length(result.pixels, Fixed);
}

Length Length::zoom(double factor) const {
  switch (type()) {
    case Fixed:
      return Length(getFloatValue() * factor, Fixed);
    case Calculated: {
      PixelsAndPercent result = getPixelsAndPercent();
      result.pixels *= factor;
      return Length(CalculationValue::create(
          result, getCalculationValue().getValueRange()));
    }
    default:
      return *this;
  }
}

CalculationValue& Length::getCalculationValue() const {
  ASSERT(isCalculated());
  return calcHandles().get(calculationHandle());
}

void Length::incrementCalculatedRef() const {
  ASSERT(isCalculated());
  getCalculationValue().ref();
}

void Length::decrementCalculatedRef() const {
  ASSERT(isCalculated());
  calcHandles().decrementRef(calculationHandle());
}

float Length::nonNanCalculatedValue(LayoutUnit maxValue) const {
  ASSERT(isCalculated());
  float result = getCalculationValue().evaluate(maxValue.toFloat());
  if (std::isnan(result))
    return 0;
  return result;
}

bool Length::isCalculatedEqual(const Length& o) const {
  return isCalculated() &&
         (&getCalculationValue() == &o.getCalculationValue() ||
          getCalculationValue() == o.getCalculationValue());
}

struct SameSizeAsLength {
  int32_t value;
  int32_t metaData;
};
static_assert(sizeof(Length) == sizeof(SameSizeAsLength),
              "length should stay small");

}  // namespace blink