| /external/flatbuffers/src/ |
| idl_parser.cpp | 11 * distributed under the License is distributed on an "AS IS" BASIS,
91 // Left-shifting a 64-bit value by 64 bits or more is undefined
377 // First, see if it is a type keyword from the table of types:
446 // If not, it is a user-defined identifier:
495 // Check if a given token is next.
496 bool Parser::Is(int t) {
511 while (Is('.')) {
722 // If this field is a union, and it has a manually assigned id,
768 if (Is(kTokenStringConstant))
[all...] |
| /external/vixl/src/aarch32/ |
| instructions-aarch32.h | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS CONTRIBUTORS "AS IS" AND
132 bool Is(CPURegister ref) const { return GetReg() == ref.GetReg(); }
143 bool Is(Register ref) const { return GetCode() == ref.GetCode(); }
260 kDataTypeValueNone = 0x001, // value used when dt is ignored.
304 bool Is(DataTypeValue value) const { return value_ == value; }
305 bool Is(DataTypeType type) const { return GetType() == type; }
309 bool Is(DataTypeType type, uint32_t size) const {
313 return Is(type, size) || Is(kDataTypeValueNone)
[all...] |
| macro-assembler-aarch32.cc | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS CONTRIBUTORS "AS IS" AND
73 // This is a run-time check because the order of destruction of objects in
74 // the _same_ scope is implementation-defined, and is likely to change in
225 // This is typically the case for cbz and cbnz (other forward branches
226 // have a 32 bit variant which is always used).
262 // This checkpoint is before some already in the near list. That means
366 // The label is pushed at the end of the list. The list remains sorted as
378 // The labels are sorted. As soon as a veneer is not needed, we can stop
[all...] |
| /external/v8/src/compiler/ |
| js-typed-lowering.cc | 2 // Use of this source code is governed by a BSD-style license that can be
106 // a sequential or external string if the right hand side is the
126 // statically that one side is already a Receiver, insert a
129 if (!left_type()->Is(Type::Receiver())) {
132 if (!right_type()->Is(Type::Receiver())) {
141 // statically that one side is already a String, insert a
144 if (!left_type()->Is(Type::String())) {
150 if (!right_type()->Is(Type::String())) {
159 // statically that one side is already an InternalizedString, insert a
162 if (!left_type()->Is(Type::UniqueName()))
[all...] |
| value-numbering-reducer.cc | 2 // Use of this source code is governed by a BSD-style license that can be
112 // do is return Replace(node2) instead.
116 // No collision, {node} is fine.
168 if (!replacement_type->Is(node_type)) {
174 if (node_type->Is(replacement_type)) {
|
| node-matchers.h | 2 // Use of this source code is governed by a BSD-style license that can be
40 bool Is##Opcode() const { return opcode() == IrOpcode::k##Opcode; }
117 bool Is(const T& value) const {
155 bool Is(const T& value) const {
162 return this->Is(0.0) && std::signbit(this->Value());
166 bool IsZero() const { return this->Is(0.0) && !std::signbit(this->Value()); }
194 bool Is(Handle<HeapObject> const& value) const {
205 bool Is(const ExternalReference& value) const {
648 // base is already part of the match, then the (1 << N + 1) scale factor
|
| /external/v8/src/ast/ |
| ast-types.cc | 2 // Use of this source code is governed by a BSD-style license that can be
16 // NOTE: If code is marked as being a "shortcut", this means that removing
133 // Take the representation from the first element, which is always
370 DCHECK(AstBitsetType::Is(boundaries[i].internal, boundaries[i].external));
400 // If the range does not touch 0, the bound is empty.
416 DCHECK(Is(AST_SEMANTIC(bits), kNumber));
420 if (Is(AST_SEMANTIC(mins[i].internal), bits)) {
430 DCHECK(Is(AST_SEMANTIC(bits), kNumber));
433 if (AstBitsetType::Is(AST_SEMANTIC(mins[BoundariesSize() - 1].internal),
438 if (Is(AST_SEMANTIC(mins[i].internal), bits))
[all...] |
| ast-types.h | 2 // Use of this source code is governed by a BSD-style license that can be
18 // A simple type system for compiler-internal use. It is based entirely on
56 // There is no subtyping relation between Array, Function, or Context types
61 // TODO(rossberg): the latter is not currently true for proxies, because of fix,
99 // itself is also included in the range. A range never contains NaN or -0.
101 // If a value v happens to be an integer n, then Constant(v) is considered a
103 // In order to avoid large unions, however, it is usually a good idea to use
111 // T1->Is(T2) -- tests whether T1 is included in T2 (i.e., T1 <= T2)
114 // Typically, the former is to be used to select representations (e.g., vi
[all...] |
| /art/compiler/utils/arm/ |
| assembler_arm_vixl.cc | 11 * distributed under the License is distributed on an "AS IS" BASIS,
245 // Instead, save R5 on the stack (or R6 if R5 is already used by
278 CHECK(tmp_reg.Is(r5) || tmp_reg.Is(r6)) << tmp_reg;
291 CHECK(!base.Is(ip));
303 vixl32::Register temp = (dest.Is(base)) ? temps.Acquire() : dest;
307 ___ Add(dest, dest, (dest.Is(base)) ? temp : base);
420 if (!rd.Is(rn)) {
|
| /external/skia/src/core/ |
| SkRecordPattern.h | 4 * Use of this source code is governed by a BSD-style license that can be
21 class Is {
23 Is() : fPtr(nullptr) {}
70 // Abstracts away whether the paint is always part of the command or optional.
97 // Greedy is a special matcher that greedily matches Matcher 0 or more times. Stores nothing.
106 // This is the main entry point to pattern matching, and so provides a couple of extra API bits:
129 // If there is no such span, return false. If there is, return true and set [*begin, *end).
158 // If first is a Greedy, walk i until it doesn't match.
|
| /external/v8/src/runtime/ |
| runtime-utils.h | 2 // Use of this source code is governed by a BSD-style license that can be
16 // it in a variable with the given name. If the object is not of the
19 CHECK(args[index]->Is##Type()); \
23 CHECK(args[index]->Is##Type()); \
31 // the given name. If the object is not a boolean we crash safely.
37 // with the given name. If the argument is not a Smi we crash safely.
43 // the given name. If the argument is not a number (as opposed to
50 // the given name. If the argument is not a size_t we crash safely.
59 // object is not a Number we crash safely.
65 // variable with the given name. If the argument is not a Smi we crash safely
[all...] |
| /hardware/libhardware/tests/input/evdev/ |
| InputMocks.h | 11 * distributed under the License is distributed on an "AS IS" BASIS,
68 template<typename I, typename... Is>
69 void addKeys(I key, Is... keys) {
|
| /prebuilts/go/darwin-x86/src/unicode/ |
| graphic.go | 2 // Use of this source code is governed by a BSD-style
18 pLo = pLl | pLu // a letter that is neither upper nor lower case.
28 // ASCII space, U+0020, is handled separately.
33 // IsGraphic reports whether the rune is defined as a Graphic by Unicode.
45 // IsPrint reports whether the rune is defined as printable by Go. Such
48 // character. This categorization is the same as IsGraphic except that the
49 // only spacing character is ASCII space, U+0020.
57 // IsOneOf reports whether the rune is a member of one of the ranges.
61 if Is(inside, r) {
68 // In reports whether the rune is a member of one of the ranges
[all...] |
| /prebuilts/go/linux-x86/src/unicode/ |
| graphic.go | 2 // Use of this source code is governed by a BSD-style
18 pLo = pLl | pLu // a letter that is neither upper nor lower case.
28 // ASCII space, U+0020, is handled separately.
33 // IsGraphic reports whether the rune is defined as a Graphic by Unicode.
45 // IsPrint reports whether the rune is defined as printable by Go. Such
48 // character. This categorization is the same as IsGraphic except that the
49 // only spacing character is ASCII space, U+0020.
57 // IsOneOf reports whether the rune is a member of one of the ranges.
61 if Is(inside, r) {
68 // In reports whether the rune is a member of one of the ranges
[all...] |
| /external/arm-neon-tests/ |
| Init.s | 22 I_Bit EQU 0x80 ; when I bit is set, IRQ is disabled
23 F_Bit EQU 0x40 ; when F bit is set, FIQ is disabled
34 TST r0, #0x1 ; Is the MMU enabled?
85 ANDS r4, r4, r1, LSR #3 ; R4 is the max number on the way size (right aligned)
86 CLZ r5, r4 ; R5 is the bit position of the way size increment
88 ANDS r7, r7, r1, LSR #13 ; R7 is the max number of the index size (right aligned)
122 ; We are setting to outer-noncachable [4:3] is zero
144 ; r1 is loop counte
[all...] |
| /external/v8/src/parsing/ |
| func-name-inferrer.cc | 2 // Use of this source code is governed by a BSD-style license that can be
26 // Enclosing name is a name of a constructor function. To check
27 // that it is really a constructor, we check that it is not empty
29 if (!name->IsEmpty() && unibrow::Uppercase::Is(name->FirstCharacter())) {
|
| /frameworks/support/design/tests/src/android/support/design/widget/ |
| BottomSheetBehaviorInitialStateTest.java | 11 * distributed under the License is distributed on an "AS IS" BASIS,
20 import static org.hamcrest.core.Is.is;
49 assertThat(activity.mBehavior.getState(), is(BottomSheetBehavior.STATE_EXPANDED)); method
50 assertThat(activity.mBottomSheet.getTop(), is(0));
62 assertThat(activity.mBehavior.getState(), is(BottomSheetBehavior.STATE_HIDDEN)); method
63 assertThat(activity.mBottomSheet.getTop(), is(activity.mCoordinatorLayout.getHeight()));
|
| /frameworks/support/transition/tests/src/android/support/transition/ |
| ChangeScrollTest.java | 11 * distributed under the License is distributed on an "AS IS" BASIS,
22 import static org.hamcrest.core.Is.is;
61 assertThat(scrollX, is(both(greaterThan(0)).and(lessThan(150))));
62 assertThat(scrollY, is(both(greaterThan(0)).and(lessThan(300))));
|
| AutoTransitionTest.java | 11 * distributed under the License is distributed on an "AS IS" BASIS,
19 import static org.hamcrest.core.Is.is;
59 assertThat(mView1.getY(), is(100.f));
60 assertThat(mView0.getVisibility(), is(View.VISIBLE));
77 listener.await(), is(true));
78 assertThat(mView1.getY(), is(0.f));
79 assertThat(mView0.getVisibility(), is(View.GONE)); method
91 listener.await(), is(true))
93 assertThat(mView0.getVisibility(), is(View.VISIBLE)); method
[all...] |
| /external/clang/lib/CodeGen/ |
| EHScopeStack.h | 5 // This file is distributed under the University of Illinois Open Source
11 // CodeGen to emit cleanups. The implementation is in CGCleanup.cpp and other
32 /// label which hasn't been emitted yet. The goto is optimistically
34 /// occurs in a scope with non-trivial cleanups) a fixup is added to
35 /// the innermost cleanup. When a (normal) cleanup is popped, any
39 /// into a switch if this fixup is resolved into the current scope.
79 /// Denotes a cleanup that should run when a scope is exited using exceptional
83 /// Denotes a cleanup that should run when a scope is exited using normal
105 /// A saved depth on the scope stack. This is necessary because
122 /// Returns false if I is invalid
[all...] |
| /external/hamcrest/hamcrest-core/src/main/java/org/hamcrest/ |
| CoreMatchers.java | 98 * <pre>assertThat(cheese, is(equalTo(smelly)))</pre>
102 public static <T> org.hamcrest.Matcher<T> is(org.hamcrest.Matcher<T> matcher) { method in class:CoreMatchers
103 return org.hamcrest.core.Is.is(matcher);
107 * A shortcut to the frequently used <code>is(equalTo(x))</code>.
109 * <pre>assertThat(cheese, is(smelly))</pre>
111 * <pre>assertThat(cheese, is(equalTo(smelly)))</pre>
113 public static <T> org.hamcrest.Matcher<T> is(T value) { method in class:CoreMatchers
114 return org.hamcrest.core.Is.is(value)
130 public static void is(java.lang.Class<?> type) { method in class:CoreMatchers
[all...] |
| /external/v8/src/crankshaft/arm64/ |
| delayed-masm-arm64.h | 2 // Use of this source code is governed by a BSD-style license that can be
47 return reg.Is(scratch_register_);
78 // StoreConstant can only be used if the scratch register is not acquired.
109 // Reset the saved value (i.e. the value of ScratchRegister is no longer
126 // generated. Then with the next instruction, if the instruction is
148 // Value held into the ScratchRegister if the saved_value_ is not 0.
|
| /external/v8/src/crankshaft/ |
| hydrogen-types.h | 2 // Use of this source code is governed by a BSD-style license that can be
61 bool Is##Name() const WARN_UNUSED_RESULT { \
|
| typing.cc | 2 // Use of this source code is governed by a BSD-style license that can be
68 // The receiver is a parameter with index -1.
168 // TODO(rossberg): is it worth having a non-termination effect?
173 // TODO(rossberg): is it worth having a non-termination effect?
183 // TODO(rossberg): is it worth having a non-termination effect?
481 // TODO(rossberg): is it worth having a non-termination effect?
674 if (!upper->Is(AstType::Signed32())) upper = AstType::Signed32();
691 // is no 'positive Smi' type for the lower bound, we use the smallest
703 : l.lower->Is(AstType::String()) || r.lower->Is(AstType::String()
[all...] |
| /external/vixl/src/aarch64/ |
| operands-aarch64.cc | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS CONTRIBUTORS "AS IS" AND
326 bool Operand::IsImmediate() const { return reg_.Is(NoReg); }
469 return (addrmode_ == Offset) && regoffset_.Is(NoReg);
474 return (addrmode_ == Offset) && !regoffset_.Is(NoReg);
494 // Support for Q registers is not implemented yet.
514 return GetCPURegister().Is(other.GetCPURegister());
|
