| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDILPeepholeOptimizer.cpp | 60 // safeNestedForEachFunction. I push atomic conversions to a vector and handle
65 // and evaluated after the __amdil_image* functions are evaluated
89 // On 7XX and 8XX operations, we do not have 24 bit signed operations. So in
91 // and then expand.
95 // specified then the result of get_local_size is known at compile time and
104 // code. This checks for this scenario and fixes it if possible.
109 // doesn't occur and we need to know the value of kernel defined
229 // another pointer we need to take the conservative approach and place all
330 // call instruction to a vector and process
404 } else if (base->getOpcode() == Instruction::And) {
[all...] |
| /external/v8/src/ic/mips/ |
| ic-mips.cc | 41 // The two scratch registers need to be different from elements, name and
44 // is not a global object and does not have interceptors.
52 // scratch1: Used as temporary and to hold the capacity of the property
69 __ And(at, scratch1,
73 // Get the value at the masked, scaled index and return.
86 // The two scratch registers need to be different from elements, name and
89 // is not a global object and does not have interceptors.
97 // scratch1: Used as temporary and to hold the capacity of the property
118 __ And(at, scratch1, Operand(kTypeAndReadOnlyMask));
121 // Store the value at the masked, scaled index and return
[all...] |
| /external/v8/src/ic/mips64/ |
| ic-mips64.cc | 41 // The two scratch registers need to be different from elements, name and
44 // is not a global object and does not have interceptors.
52 // scratch1: Used as temporary and to hold the capacity of the property
69 __ And(at, scratch1,
73 // Get the value at the masked, scaled index and return.
86 // The two scratch registers need to be different from elements, name and
89 // is not a global object and does not have interceptors.
97 // scratch1: Used as temporary and to hold the capacity of the property
117 __ And(at, scratch1, Operand(Smi::FromInt(kTypeAndReadOnlyMask)));
120 // Store the value at the masked, scaled index and return
[all...] |
| /external/guava/guava/src/com/google/common/base/ |
| CharMatcher.java | 13 * See the License for the specific language governing permissions and
34 * Implementations are strongly encouraged to be side-effect-free and immutable.
41 * characters are encoded into a {@code String} using surrogate pairs, and a {@code CharMatcher}
219 * SPACE_SEPARATOR, LINE_SEPARATOR, PARAGRAPH_SEPARATOR, CONTROL, FORMAT, SURROGATE, and
313 @Override public CharMatcher and(CharMatcher other) {
395 @Override public CharMatcher and(CharMatcher other) {
425 @Override public CharMatcher and(CharMatcher other) { method
457 @Override public CharMatcher and(CharMatcher other) { method in class:CharMatcher
458 return other.matches(match) ? super.and(other) : other;
493 // TODO(user): is it potentially worth just going ahead and building a precomputed matcher
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/base/super/com/google/common/base/ |
| CharMatcher.java | 13 * See the License for the specific language governing permissions and
32 * Implementations are strongly encouraged to be side-effect-free and immutable.
39 * characters are encoded into a {@code String} using surrogate pairs, and a {@code CharMatcher}
217 * SPACE_SEPARATOR, LINE_SEPARATOR, PARAGRAPH_SEPARATOR, CONTROL, FORMAT, SURROGATE, and
311 @Override public CharMatcher and(CharMatcher other) {
393 @Override public CharMatcher and(CharMatcher other) {
423 @Override public CharMatcher and(CharMatcher other) { method
449 @Override public CharMatcher and(CharMatcher other) { method in class:CharMatcher
450 return other.matches(match) ? super.and(other) : other;
478 // TODO(user): is it potentially worth just going ahead and building a precomputed matcher
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSelect.cpp | 85 case Instruction::And:
112 case Instruction::And:
119 /// Here we have (select c, TI, FI), and we know that TI and FI
120 /// have the same opcode and only one use each. Try to simplify this.
131 // type if the vector width remains the same (and matches the condition).
227 // between 0, 1 and -1.
262 // between 0, 1 and -1.
286 /// (select (icmp eq (and X, C1), 0), Y, (or Y, C2))
288 /// (or (shl (and X, C1), C3), y
[all...] |
| InstCombineSimplifyDemanded.cpp | 28 /// constant and return true.
70 /// true if it made any change and false otherwise.
86 /// downstream. Consequently, depending on the mask and V, it may be possible
88 /// function does the replacement and returns true. In all other cases, it
89 /// returns false after analyzing the expression and setting KnownOne and known
93 /// the expression. KnownOne and KnownZero always follow the invariant that
94 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
95 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
97 /// and KnownOne must all be the same
[all...] |
| InstCombineAndOrXor.cpp | 10 // This file implements the visitAnd, visitOr, and visitXor functions.
62 // Not expecting FCMP_FALSE and FCMP_TRUE;
67 /// This is the complement of getICmpCode, which turns an opcode and two
79 /// This is the complement of getFCmpCode, which turns an opcode and two
115 if (Op != Instruction::And && Op != Instruction::Or &&
146 if (Op == Instruction::And)
158 /// the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
173 Value *And = Builder->CreateAnd(X, AndRHS);
174 And->takeName(Op);
175 return BinaryOperator::CreateXor(And, Together)
[all...] |
| InstCombineCasts.cpp | 88 // Get the type really allocated and the type casted to.
145 // If the allocation has multiple real uses, insert a cast and change all
177 case Instruction::And:
232 /// simply extracts arguments and returns what that function returns.
264 /// generated and is interesting to optimize out.
269 // Noop casts and casts of constants should be eliminated trivially.
321 /// instead of its larger type, and arrive with the same value.
327 /// makes sense if x and y can be efficiently truncated.
329 /// This function works on both vectors and scalars.
357 case Instruction::And
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 39 SymbolRef, ///< References to labels and assigned expressions.
411 And, ///< Bitwise and.
418 LAnd, ///< Logical and.
454 return create(And, LHS, RHS, Ctx);
549 /// MCExprs are bump pointer allocated and not destructed.
|
| /external/v8/test/mjsunit/ |
| parse-int-float.js | 2 // Redistribution and use in source and binary forms, with or without
7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
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
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
118 // And finally, check that the Harmony additions to the Numbe
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-crbug-125148.js | 2 // Redistribution and use in source and binary forms, with or without
7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
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
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
70 // And once more for setters..
[all...] |
| /external/v8/test/webkit/ |
| dfg-constant-fold-misprediction.js | 4 // Redistribution and use in source and binary forms, with or without
8 // notice, this list of conditions and the following disclaimer.
10 // notice, this list of conditions and the following disclaimer in the
11 // documentation and/or other materials provided with the distribution.
13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
41 // fold that Int32ToDouble. And hence we will have an infinite loop. The correct fi
[all...] |
| /external/v8/src/mips/ |
| macro-assembler-mips.cc | 142 // Push and pop all registers that can hold pointers.
206 // Clobbers object, dst, value, and ra, if (ra_status == kRAHasBeenSaved)
236 And(t8, dst, Operand((1 << kPointerSizeLog2) - 1));
262 // Clobbers object, dst, map, and ra, if (ra_status == kRAHasBeenSaved)
292 // only set during incremental collection, and then it's also guaranteed that
304 And(at, dst, Operand((1 << kPointerSizeLog2) - 1));
336 // Clobbers object, address, value, and ra, if (ra_status == kRAHasBeenSaved)
363 // catch stores of smis and stores into the young generation.
433 // catch stores of Smis and stores into young gen.
444 // Save caller-saved registers. js_function and code_entry are in th
[all...] |
| /external/v8/src/crankshaft/mips64/ |
| lithium-codegen-mips64.cc | 173 // It's saved in the stack and kept live in cp.
189 // Update the write barrier. This clobbers a3 and a0.
291 // Second-level deopt table entries are contiguous and small, so instead
293 // address and add an immediate offset.
927 // (which gets simplified to an 'and') and subtraction) should be faster, and
928 // this is exactly what GCC and clang emit. Nevertheless, benchmarks seem to
939 __ And(dividend, dividend, Operand(mask));
949 __ And(dividend, dividend, Operand(mask))
[all...] |
| /external/v8/src/crankshaft/mips/ |
| lithium-codegen-mips.cc | 2 // Redistribution and use in source and binary forms, with or without
7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
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
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
197 // It's saved in the stack and kept live in cp
[all...] |
| /external/v8/src/mips64/ |
| macro-assembler-mips64.cc | 145 // Push and pop all registers that can hold pointers.
209 // Clobbers object, dst, value, and ra, if (ra_status == kRAHasBeenSaved)
239 And(t8, dst, Operand((1 << kPointerSizeLog2) - 1));
265 // Clobbers object, dst, map, and ra, if (ra_status == kRAHasBeenSaved)
295 // only set during incremental collection, and then it's also guaranteed that
307 And(at, dst, Operand((1 << kPointerSizeLog2) - 1));
339 // Clobbers object, address, value, and ra, if (ra_status == kRAHasBeenSaved)
366 // catch stores of smis and stores into the young generation.
436 // catch stores of Smis and stores into young gen.
447 // Save caller-saved registers. js_function and code_entry are in th
[all...] |
| /device/linaro/hikey/l-loader/ |
| gen_loader.py | 79 # get lba of both primary partition table and secondary partition table
131 if (self.idx == 0) and (self.stage == 1):
152 if (self.idx == 0) and (self.stage == 1):
174 return data > 0 and hex(data) or hex(data & 0xffffffff)
253 if (stage1 == 1) and (stage2 == 1):
255 print 'And there are primary partition table, secondary partition table and FIP in stage2.'
257 elif (stage1 == 0) and (stage2 == 0):
|
| /external/clang/include/clang/AST/ |
| StmtVisitor.h | 10 // This file defines the StmtVisitor and ConstStmtVisitor interfaces.
130 BINOP_FALLBACK(And) BINOP_FALLBACK(Xor) BINOP_FALLBACK(Or)
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZTargetTransformInfo.cpp | 13 // independent and default TTI implementations handle the rest.
138 case Instruction::And:
140 // Any 32-bit AND operation can by implemented via nilf.
149 // Some 64-bit AND operations can be implemented via risbg.
|
| /external/llvm/lib/Target/XCore/ |
| XCoreLowerThreadLocal.cpp | 101 case Instruction::And:
186 // Skip globals that we can't lower and leave it for the backend to error.
|
| /external/v8/src/ic/arm64/ |
| stub-cache-arm64.cc | 24 // 'receiver', 'name' and 'offset' registers are preserved on miss.
100 // Make sure extra and extra2 registers are valid.
106 // If vector-based ics are in use, ensure that scratch, extra, extra2 and
107 // extra3 don't conflict with the vector and slot registers, which need
145 __ And(scratch, scratch, kSecondaryTableSize - 1);
151 // Cache miss: Fall-through and let caller handle the miss by
|
| /external/valgrind/exp-bbv/tests/ppc32-linux/ |
| ll.S | 8 # And to avoid reading from /proc
51 # the hack loading BSS_BEGIN and DATA_BEGIN
147 bl write_stdout # and print the logo
230 lis 20,('l'<<8)+'o' # find 'lock ' and grab up to M
244 lis 20,('c'<<8)+'p' # find 'cpu\t: ' and grab up to \n
280 lis 20,('m'<<8)+'i' # find 'mips' and grab up to \n
311 sc # and exit
356 stbu 13,1(14) # ! if not store and continue
424 # and let write_stdout
487 bl strcat # and strcat i
[all...] |
| /external/v8/src/regexp/mips/ |
| regexp-macro-assembler-mips.cc | 32 * - fp : Frame pointer. Used to access arguments, local variables and
75 * code and the remaining arguments are passed in registers, e.g. by calling the
114 // raised, and we will exit right away.
118 __ bind(&start_label_); // And then continue from here.
162 // Pop Code* offset from backtrack stack, add Code* and jump to location.
440 __ And(a0, current_character(), Operand(mask));
449 __ And(a0, current_character(), Operand(mask));
462 __ And(a0, a0, Operand(mask));
492 __ And(a1, current_character(), Operand(kTableSize - 1));
511 // One byte space characters are '\t'..'\r', ' ' and \u00a0
[all...] |
| /external/v8/src/regexp/mips64/ |
| regexp-macro-assembler-mips64.cc | 32 * - fp : Frame pointer. Used to access arguments, local variables and
109 * code and the remaining arguments are passed in registers, e.g. by calling the
150 // raised, and we will exit right away.
154 __ bind(&start_label_); // And then continue from here.
198 // Pop Code* offset from backtrack stack, add Code* and jump to location.
424 // Compute pointers to match string and capture string.
470 __ And(a0, current_character(), Operand(mask));
479 __ And(a0, current_character(), Operand(mask));
492 __ And(a0, a0, Operand(mask));
522 __ And(a1, current_character(), Operand(kTableSize - 1))
[all...] |
