| /external/jemalloc_new/ |
| D | .travis.yml | 6 - os: linux
7 … env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
8 - os: osx
9 … env: CC=gcc CXX=g++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
10 - os: linux
11 … CC=clang CXX=clang++ COMPILER_FLAGS="" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-bounds"
12 - os: linux
13 …env: CC=gcc CXX=g++ COMPILER_FLAGS="-m32" CONFIGURE_FLAGS="" EXTRA_CFLAGS="-Werror -Wno-array-boun…
17 - gcc-multilib
18 - os: linux
[all …]
|
| /external/skia/include/core/ |
| D | SkFont.h | 4 * Use of this source code is governed by a BSD-style license that can be
74 @param skewX additional shear on x-axis relative to y-axis
109 /** Returns true if glyphs may be drawn at sub-pixel offsets.
111 @return true if glyphs may be drawn at sub-pixel offsets.
150 /** Requests, but does not require, that glyphs respect sub-pixel positioning.
152 @param subpixel setting for sub-pixel positioning
206 @return non-null SkTypeface
219 /** Returns text scale on x-axis.
226 /** Returns text skew on x-axis.
229 @return additional shear on x-axis relative to y-axis
[all …]
|
| D | SkTextBlob.h | 4 * Use of this source code is governed by a BSD-style license that can be
48 determine glyph bounds, and unions all bounds. Returned bounds may be
49 larger than the bounds of all glyphs in runs.
53 const SkRect& bounds() const { return fBounds; } in bounds() function
55 /** Returns a non-zero value unique among all text blobs.
61 /** Returns the number of intervals that intersect bounds.
62 bounds describes a pair of lines parallel to the text advance.
66 Pass nullptr for intervals to determine the size of the interval array.
70 @param bounds lower and upper line parallel to the advance
75 int getIntercepts(const SkScalar bounds[2], SkScalar intervals[],
[all …]
|
| D | SkPath.h | 4 * Use of this source code is governed by a BSD-style license that can be
38 // WIP -- define this locally, and fix call-sites to use SkPathBuilder (skbug.com/9000)
56 Internally, SkPath lazily computes metrics likes bounds and convexity. Call
93 static SkPath RRect(const SkRect& bounds, SkScalar rx, SkScalar ry,
121 the returned result share pointer values. The underlying verb array, SkPoint array
149 this->reset(); in detach()
155 shares pointer values. The underlying verb array, SkPoint array and weights
162 @param path verb array, SkPoint array, weights, and SkPath::FillType to copy
169 /** Compares a and b; returns true if SkPath::FillType, verb array, SkPoint array, and weights
178 /** Compares a and b; returns true if SkPath::FillType, verb array, SkPoint array, and weights
[all …]
|
| D | SkRegion.h | 4 * Use of this source code is governed by a BSD-style license that can be
25 efficiently storing a single integer rectangle, or a run length encoded array
34 /** Constructs an empty SkRegion. SkRegion is set to empty bounds
45 the returned result share pointer values. The underlying SkRect array is
59 /** Constructs a rectangular SkRegion matching the bounds of rect.
61 @param rect bounds of constructed SkRegion
76 the returned result share pointer values. The underlying SkRect array is
109 /** Sets SkRegion to src, and returns true if src bounds is not empty.
111 SkRegion and src share pointer values. The underlying SkRect array is
123 return !this->isEmpty(); in set()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/smart_ptr/doc/smart_ptr/ |
| D | make_shared.adoc | 14 :toc-title:
37 user-supplied allocator, allowing finer control.
44 allocation of array objects. One criticism of class template `shared_array`
46 allocation. When `shared_ptr` was enhanced to support array types, additional
47 overloads of `allocate_shared` and `make_shared` were provided for array
58 `// T is not an array`
64 `// T is an array of unknown bounds`
70 `// T is an array of known bounds`
76 `// T is an array of unknown bounds`
82 `// T is an array of known bounds`
[all …]
|
| D | allocate_unique.adoc | 13 :toc-title:
44 `// T is not an array`
49 `// T is not an array`
54 `// T is an array of unknown bounds`
59 `// T is an array of known bounds`
64 `// T is an array of unknown bounds`
69 `// T is an array of known bounds`
74 `// T is not an array`
79 `// T is an array of unknown bounds`
84 `// T is an array of known bounds`
[all …]
|
| D | make_local_shared.adoc | 13 :toc-title:
30 `// T is not an array`
36 `// T is an array of unknown bounds`
42 `// T is an array of known bounds`
48 `// T is an array of unknown bounds`
56 `// T is an array of known bounds`
63 `// T is not an array of known bounds`
69 `// T is an array of unknown bounds`
|
| D | make_unique.adoc | 14 :toc-title:
32 default-initialization, when users do not need or want to incur the expense
33 of value-initialization. The {cpp} standard does not yet provide this
43 `// T is not an array`
47 `// T is not an array`
51 `// T is an array of unknown bounds`
55 `// T is not an array`
59 `// T is an array of unknown bounds`
74 Constraints:: `T` is not an array.
85 Constraints:: `T` is not an array.
[all …]
|
| /external/clang/test/Analysis/ |
| D | out-of-bounds.c | 1 // RUN: %clang_cc1 -Wno-array-bounds -analyze -analyzer-checker=core,alpha.security.ArrayBoundV2 -v…
3 // Tests doing an out-of-bounds access after the end of an array using:
4 // - constant integer index
5 // - constant integer size for buffer
8 buf[100] = 1; // expected-warning{{Out of bound memory access}} in test1()
13 buf[99] = 1; // no-warning in test1_ok()
18 return mystr[-1]; // expected-warning{{Out of bound memory access}} in test1_strings_underrun()
23 return mystr[1000]; // expected-warning{{Out of bound memory access}} in test1_strings_overrun()
28 return mystr[5]; // no-warning in test1_strings_ok()
31 // Tests doing an out-of-bounds access after the end of an array using:
[all …]
|
| /external/cronet/third_party/libc++/src/test/libcxx/containers/views/mdspan/layout_stride/ |
| D | assert.index_operator.pass.cpp | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // REQUIRES: has-unix-headers
11 // UNSUPPORTED: !libcpp-hardening-mode=debug
12 // XFAIL: availability-verbose_abort-missing
20 // - sizeof...(Indices) == extents_type::rank() is true,
21 // - (is_convertible_v<Indices, index_type> && ...) is true, and
22 // - (is_nothrow_constructible_v<index_type, Indices> && ...) is true.
24 // Preconditions: extents_type::index-cast(i) is a multidimensional index in extents_ ([mdspan.over…
[all …]
|
| /external/chromium-trace/catapult/common/py_vulcanize/third_party/rjsmin/bench/ |
| D | markermanager.js | 19 * a large area, and as long as only 100-200 are visible in any given viewport,
31 * http://www.apache.org/licenses/LICENSE-2.0
62 …* @event changed (Parameters: shown bounds, shown markers) Notify listeners when the state of what…
117 // The padding in pixels beyond the viewport, where we will pre-load markers.
118 me.swPadding_ = new google.maps.Size(-padding, padding);
119 me.nePadding_ = new google.maps.Size(padding, -padding);
147 me.shownMarkers_--;
220 * Used for expanding a bounds to include an extra padding
221 * of pixels surrounding the bounds.
241 * Designed for batch-processing thousands of markers.
[all …]
|
| /external/llvm/test/Transforms/IRCE/ |
| D | only-upper-check.ll | 1 ; RUN: opt -irce -irce-print-range-checks -irce-print-changed-loops %s -S 2>&1 | FileCheck %s
4 ; CHECK-NEXT:InductiveRangeCheck:
5 ; CHECK-NEXT: Kind: RANGE_CHECK_UPPER
6 ; CHECK-NEXT: Offset: %offset Scale: 1 Length: %len = load i32, i32* %a_len_ptr, !range !0
7 ; CHECK-NEXT: CheckUse: br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1 Operand: 0
8 ; CHECK-NEXT: irce: in function incrementing: constrained Loop at depth 1 containing: %loop<header>…
17 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
19 %array.idx = add i32 %idx, %offset
20 %abc = icmp slt i32 %array.idx, %len
21 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
[all …]
|
| D | unhandled.ll | 1 ; RUN: opt -irce-print-changed-loops -irce -S < %s 2>&1 | FileCheck %s
8 ; CHECK-NOT: constrained Loop at depth
15 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
18 %array.idx = add i32 %idx.mul, %offset
19 %abc.high = icmp slt i32 %array.idx, %len
20 %abc.low = icmp sge i32 %array.idx, 0
22 br i1 %abc, label %in.bounds, label %out.of.bounds
24 in.bounds:
25 %addr = getelementptr i32, i32* %arr, i32 %array.idx
30 out.of.bounds:
|
| D | single-access-with-preloop.ll | 1 ; RUN: opt -irce -S < %s | FileCheck %s
10 %idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds ]
12 %array.idx = add i32 %idx, %offset
13 %abc.high = icmp slt i32 %array.idx, %len
14 %abc.low = icmp sge i32 %array.idx, 0
16 br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
18 in.bounds:
19 %addr = getelementptr i32, i32* %arr, i32 %array.idx
24 out.of.bounds:
31 ; CHECK-LABEL: loop.preheader:
[all …]
|
| /external/cronet/third_party/protobuf/objectivec/ |
| D | GPBArray.m | 1 // Protocol Buffers - Google's data interchange format
3 // https://developers.google.com/protocol-buffers/
37 // protos can turn on -Wdirect-ivar-access without issues.
39 #pragma clang diagnostic ignored "-Wdirect-ivar-access"
50 //%PDDM-DEFINE VALIDATE_RANGE(INDEX, COUNT)
53 //% format:@"Index (%lu) beyond bounds (%lu)",
56 //%PDDM-DEFINE MAYBE_GROW_TO_SET_COUNT(NEW_COUNT)
61 //%PDDM-DEFINE SET_COUNT_AND_MAYBE_SHRINK(NEW_COUNT)
71 //%PDDM-DEFINE ARRAY_INTERFACE_SIMPLE(NAME, TYPE, FORMAT)
72 //%#pragma mark - NAME
[all …]
|
| /external/protobuf/objectivec/ |
| D | GPBArray.m | 1 // Protocol Buffers - Google's data interchange format
3 // https://developers.google.com/protocol-buffers/
37 // protos can turn on -Wdirect-ivar-access without issues.
39 #pragma clang diagnostic ignored "-Wdirect-ivar-access"
50 //%PDDM-DEFINE VALIDATE_RANGE(INDEX, COUNT)
53 //% format:@"Index (%lu) beyond bounds (%lu)",
56 //%PDDM-DEFINE MAYBE_GROW_TO_SET_COUNT(NEW_COUNT)
61 //%PDDM-DEFINE SET_COUNT_AND_MAYBE_SHRINK(NEW_COUNT)
71 //%PDDM-DEFINE ARRAY_INTERFACE_SIMPLE(NAME, TYPE, FORMAT)
72 //%#pragma mark - NAME
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/ |
| D | UTF16Test.java | 6 * Copyright (C) 1996-2014, International Business Machines Corporation and *
53 char array[] = new char[UCharacter.MAX_VALUE >> 2]; in TestAppend() local
58 strbuff.getChars(0, strsize, array, 0); in TestAppend()
62 arraysize = UTF16.append(array, arraysize, i); in TestAppend()
64 String arraystr = new String(array, 0, arraysize); in TestAppend()
66 errln("FAIL Comparing char array append and string append " + in TestAppend()
73 strsize --; in TestAppend()
83 // coverage for new 1.5 - cover only so no real test in TestAppend()
92 * Testing UTF16 class methods bounds
101 char array[] = str.toCharArray(); in TestBounds() local
[all …]
|
| /external/icu/icu4j/main/core/src/test/java/com/ibm/icu/dev/test/lang/ |
| D | UTF16Test.java | 5 * Copyright (C) 1996-2014, International Business Machines Corporation and *
50 char array[] = new char[UCharacter.MAX_VALUE >> 2]; in TestAppend() local
55 strbuff.getChars(0, strsize, array, 0); in TestAppend()
59 arraysize = UTF16.append(array, arraysize, i); in TestAppend()
61 String arraystr = new String(array, 0, arraysize); in TestAppend()
63 errln("FAIL Comparing char array append and string append " + in TestAppend()
70 strsize --; in TestAppend()
80 // coverage for new 1.5 - cover only so no real test in TestAppend()
89 * Testing UTF16 class methods bounds
98 char array[] = str.toCharArray(); in TestBounds() local
[all …]
|
| /external/skia/tests/ |
| D | TextBlobTest.cpp | 4 * Use of this source code is governed by a BSD-style license that can be
126 // This unit test verifies blob bounds computation.
131 // Explicit bounds. in TestBounds()
141 REPORTER_ASSERT(reporter, blob->bounds() == r1); in TestBounds()
148 REPORTER_ASSERT(reporter, blob->bounds() == r1); in TestBounds()
155 REPORTER_ASSERT(reporter, blob->bounds() == r1); in TestBounds()
168 REPORTER_ASSERT(reporter, blob->bounds() == SkRect::MakeXYWH(0, 5, 65, 65)); in TestBounds()
176 // Implicit bounds in TestBounds()
179 // Exercise the empty bounds path, and ensure that RunRecord-aligned pos buffers in TestBounds()
192 REPORTER_ASSERT(reporter, blob->bounds().isEmpty()); in TestBounds()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/ |
| D | MultivariateFunctionMappingAdapter.java | 9 * http://www.apache.org/licenses/LICENSE-2.0
32 * This adapter can be used to wrap functions subject to simple bounds on
34 * support simple bounds.
39 * with argument array {@code point}, the elements array will fulfill requirement
44 * care the bounds are fulfilled. The adapter {@link #value(double[])} method will
60 * This adapter is only a poor man solution to simple bounds optimization constraints
64 * A better solution is to use an optimizer that directly supports simple bounds like
69 * One caveat of this poor-man's solution is that behavior near the bounds may be
70 * numerically unstable as bounds are mapped from infinite values.
89 * @param lower lower bounds for each element of the input parameters array
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/optimization/direct/ |
| D | MultivariateFunctionMappingAdapter.java | 9 * http://www.apache.org/licenses/LICENSE-2.0
33 * This adapter can be used to wrap functions subject to simple bounds on
35 * support simple bounds.
40 * with argument array {@code point}, the elements array will fulfill requirement
45 * care the bounds are fulfilled. The adapter {@link #value(double[])} method will
61 * This adapter is only a poor man solution to simple bounds optimization constraints
64 * an optimizer that directly supports simple bounds like {@link CMAESOptimizer} or
66 * the bounds may be numerically unstable as bounds are mapped from infinite values.
89 * @param lower lower bounds for each element of the input parameters array
92 * @param upper upper bounds for each element of the input parameters array
[all …]
|
| /external/apache-commons-lang/src/main/java/org/apache/commons/lang3/reflect/ |
| D | TypeUtils.java | 9 * http://www.apache.org/licenses/LICENSE-2.0
19 import java.lang.reflect.Array;
60 * @param componentType of this array type
200 * Specify lower bounds of the wildcard type to build.
201 * @param bounds to set
204 public WildcardTypeBuilder withLowerBounds(final Type... bounds) { in withLowerBounds() argument
205 this.lowerBounds = bounds; in withLowerBounds()
210 * Specify upper bounds of the wildcard type to build.
211 * @param bounds to set
214 public WildcardTypeBuilder withUpperBounds(final Type... bounds) { in withUpperBounds() argument
[all …]
|
| /external/cronet/third_party/libc++/src/test/std/containers/sequences/array/array.tuple/ |
| D | get.verify.cpp | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // <array>
11 // template <size_t I, class T, size_t N> T& get(array<T, N>& a);
13 // Prevent -Warray-bounds from issuing a diagnostic when testing with clang verify.
14 // ADDITIONAL_COMPILE_FLAGS: -Wno-array-bounds
16 #include <array>
21 typedef std::array<T, 3> C; in f()
23 std::get<3>(c) = 5.5; // expected-note {{requested here}} in f()
[all …]
|
| /external/libcxx/test/std/containers/sequences/array/array.tuple/ |
| D | tuple_element.fail.cpp | 1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
10 // <array>
12 // tuple_element<I, array<T, N> >::type
14 // Prevent -Warray-bounds from issuing a diagnostic when testing with clang verify.
16 #pragma clang diagnostic ignored "-Warray-bounds"
19 #include <array>
23 // std::array is explicitly allowed to be initialized with A a = { init-list };.
31 typedef std::array<T, 3> C; in main()
32 std::tuple_element<3, C> foo; // expected-note {{requested here}} in main()
[all …]
|