HomeSort by relevance Sort by last modified time
    Searched refs:Code (Results 201 - 225 of 1922) sorted by null

1 2 3 4 5 6 7 891011>>

  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
403 /// condition code in op #4, a CondCodeSDNode.
409 /// operands to compare (ops #0, and #1) and the condition code to compare
614 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
381 /// condition code in op #4, a CondCodeSDNode.
387 /// operands to compare (ops #0, and #1) and the condition code to compare
582 /// that the condition is represented as condition code, and two nodes to
685 /// applied. The pointer it returns points to an executable block of code.
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
402 /// condition code in op #4, a CondCodeSDNode.
408 /// operands to compare (ops #0, and #1) and the condition code to compare
613 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
402 /// condition code in op #4, a CondCodeSDNode.
408 /// operands to compare (ops #0, and #1) and the condition code to compare
613 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
403 /// condition code in op #4, a CondCodeSDNode.
409 /// operands to compare (ops #0, and #1) and the condition code to compare
614 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
403 /// condition code in op #4, a CondCodeSDNode.
409 /// operands to compare (ops #0, and #1) and the condition code to compare
614 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
403 /// condition code in op #4, a CondCodeSDNode.
409 /// operands to compare (ops #0, and #1) and the condition code to compare
614 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/
ISDOpcodes.h 79 /// typically the offset is not known until after code generation of the
195 /// code generator that want to think about a single node with multiple
403 /// condition code in op #4, a CondCodeSDNode.
409 /// operands to compare (ops #0, and #1) and the condition code to compare
614 /// that the condition is represented as condition code, and two nodes to
    [all...]
  /external/v8/src/ic/
ic.h 2 // Use of this source code is governed by a BSD-style license that can be
22 // Alias the inline cache state type to make the IC code more readable.
25 // The IC code is either invoked with no extra frames on the stack
65 static bool ICUseVector(Code::Kind kind) {
66 return kind == Code::LOAD_IC || kind == Code::LOAD_GLOBAL_IC ||
67 kind == Code::KEYED_LOAD_IC || kind == Code::STORE_IC ||
68 kind == Code::KEYED_STORE_IC;
78 static bool ShouldPushPopSlotAndVector(Code::Kind kind)
    [all...]
  /external/v8/src/
type-info.cc 2 // Use of this source code is governed by a BSD-style license that can be
9 #include "src/code-stubs.h"
18 Handle<Code> code,
22 BuildDictionary(code);
246 Handle<Code> code = Handle<Code>::cast(info); local
248 Map* raw_map = code->FindFirstMap();
251 if (code->is_compare_ic_stub())
    [all...]
type-info.h 2 // Use of this source code is governed by a BSD-style license that can be
25 TypeFeedbackOracle(Isolate* isolate, Zone* zone, Handle<Code> code,
105 void BuildDictionary(Handle<Code> code);
106 void GetRelocInfos(Handle<Code> code, ZoneList<RelocInfo>* infos);
107 void CreateDictionary(Handle<Code> code, ZoneList<RelocInfo>* infos);
109 Code* old_code
    [all...]
code-stubs.h 2 // Use of this source code is governed by a BSD-style license that can be
31 // List of code stubs used on all platforms.
98 // List of code stubs only used on ARM 32 bits platforms.
106 // List of code stubs only used on ARM 64 bits platforms.
117 // List of code stubs only used on PPC platforms.
127 // List of code stubs only used on MIPS platforms.
142 // List of code stubs only used on S390 platforms.
152 // Combined list of code stubs.
176 // Retrieve the code for the stub. Generate the code if needed
    [all...]
  /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/
SoapFault12.java 43 public Node Code;
64 this.faultcode = Code.getElement(SoapEnvelope.ENV2003, "Value").getText(0);
76 if (name.equals("Code")) {
77 this.Code = new Node();
78 this.Code.parse(parser);
106 //this.Code.write(xw);
108 xw.startTag(SoapEnvelope.ENV2003, "Code");
109 this.Code.write(xw);
110 xw.endTag(SoapEnvelope.ENV2003, "Code");
144 String code = Code.getElement(SoapEnvelope.ENV2003, "Value").getText(0) local
    [all...]
  /external/llvm/lib/TableGen/
StringMatcher.cpp 40 /// code to verify that CharNo and later are the same.
42 /// \return - True if control can leave the emitted code fragment.
50 // matching code.
54 // If the to-execute code has \n's in it, indent each subsequent line.
55 StringRef Code = Matches[0]->second;
57 std::pair<StringRef, StringRef> Split = Code.split('\n');
60 Code = Split.second;
61 while (!Code.empty()) {
62 Split = Code.split('\n');
64 Code = Split.second
    [all...]
  /external/swiftshader/third_party/LLVM/utils/TableGen/
StringMatcher.cpp 40 /// code to verify that CharNo and later are the same.
42 /// \return - True if control can leave the emitted code fragment.
50 // matching code.
54 // If the to-execute code has \n's in it, indent each subsequent line.
55 StringRef Code = Matches[0]->second;
57 std::pair<StringRef, StringRef> Split = Code.split('\n');
60 Code = Split.second;
61 while (!Code.empty()) {
62 Split = Code.split('\n');
64 Code = Split.second
    [all...]
  /external/tensorflow/tensorflow/examples/android/jni/object_tracking/
integral_image.h 26 typedef uint8_t Code;
148 // Returns the 2bit code associated with this region, which represents
150 inline Code GetCode(const BoundingBox& bounding_box) const {
155 inline Code GetCode(const int x1, const int y1,
172 const Code final_code = (vertical_code << 1) | horizontal_code;
174 SCHECK(InRange(final_code, static_cast<Code>(0), static_cast<Code>(3)),
175 "Invalid code! %d", final_code);
  /external/v8/src/builtins/
builtins-call.cc 2 // Use of this source code is governed by a BSD-style license that can be
14 Handle<Code> Builtins::CallFunction(ConvertReceiverMode mode,
39 return Handle<Code>::null();
42 Handle<Code> Builtins::Call(ConvertReceiverMode mode,
67 return Handle<Code>::null();
70 Handle<Code> Builtins::CallBoundFunction(TailCallMode tail_call_mode) {
78 return Handle<Code>::null();
  /external/v8/src/snapshot/
startup-serializer.cc 2 // Use of this source code is governed by a BSD-style license that can be
34 Code* code = Code::cast(obj); local
35 // If the function code is compiled (either as native code or bytecode),
38 if (code->kind() == Code::FUNCTION ||
40 code->is_interpreter_trampoline_builtin())) {
47 Code* code = Code::cast(obj) local
    [all...]
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/cfi/
cfi-common-6.d 9 Code alignment factor: .*
28 Code alignment factor: .*
52 Code alignment factor: .*
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/i386/ilp32/cfi/
cfi-common-6.d 9 Code alignment factor: .*
28 Code alignment factor: .*
52 Code alignment factor: .*
  /external/annotation-tools/asmx/test/perf/org/objectweb/asm/
SERPPerfTest.java 9 * 1. Redistributions of source code must retain the above copyright
34 import serp.bytecode.Code;
67 Code code = methods[i].getCode(false); local
68 if (code != null) {
69 while (code.hasNext()) {
70 code.next();
73 code.calculateMaxStack();
74 code.calculateMaxLocals();
98 Code code = m.getCode(false) local
    [all...]
  /external/llvm/lib/DebugInfo/DWARF/
DWARFAbbreviationDeclaration.cpp 18 Code = 0;
31 Code = Data.getULEB128(OffsetPtr);
32 if (Code == 0) {
  /external/lzma/CS/7zip/Compress/RangeCoder/
RangeCoderBit.cs 92 if (rangeDecoder.Code < newBound)
98 rangeDecoder.Code = (rangeDecoder.Code << 8) | (byte)rangeDecoder.Stream.ReadByte();
106 rangeDecoder.Code -= newBound;
110 rangeDecoder.Code = (rangeDecoder.Code << 8) | (byte)rangeDecoder.Stream.ReadByte();
  /toolchain/binutils/binutils-2.27/ld/testsuite/ld-elf/
eh5.d 14 Code alignment factor: .*
33 Code alignment factor: .*
57 Code alignment factor: .*
78 Code alignment factor: .*
93 Code alignment factor: .*
115 Code alignment factor: .*
  /art/compiler/dex/
inline_method_analyser.h 27 * NOTE: This code is part of the quick compiler. It lives in the runtime
98 * Analyse method code to determine if the method is a candidate for inlining.
106 static constexpr bool IsInstructionIGet(Instruction::Code opcode) {
110 static constexpr bool IsInstructionIPut(Instruction::Code opcode) {
114 static constexpr uint16_t IGetVariant(Instruction::Code opcode) {
118 static constexpr uint16_t IPutVariant(Instruction::Code opcode) {

Completed in 1125 milliseconds

1 2 3 4 5 6 7 891011>>