/external/llvm/lib/Target/ARM/ |
H A D | ARMISelDAGToDAG.cpp | 357 SDValue N1 = N->getOperand(1); local 359 if (!isOpcWithIntImmediate(N1.getNode(), ISD::AND, And_imm)) { 361 std::swap(N0, N1); 384 SDValue Srl = N1.getOperand(0); 408 N1 = CurDAG->getNode(ISD::AND, N1.getDebugLoc(), MVT::i32, 410 N1 = CurDAG->getNode(ISD::SHL, N1.getDebugLoc(), MVT::i32, 411 N1, CurDAG->getConstant(TZ, MVT::i32)); 412 CurDAG->UpdateNodeOperands(N, N0, N1); 1041 SDValue N1 = N.getOperand(1); local 2704 SDValue N0 = N->getOperand(0), N1 = N->getOperand(1); local 2823 SDValue N1 = N->getOperand(1); local [all...] |
/external/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 1890 // 0 <= i <= N1 and some 0 <= j <= N2, where N1 and N2 are the (normalized) 1901 // a1*0 - a2*N2 <= c2 - c1 <= a1*N1 - a2*0 1902 // -a2*N2 <= c2 - c1 <= a1*N1 1905 // a1*0 - a2*0 <= c2 - c1 <= a1*N1 - a2*N2 1906 // 0 <= c2 - c1 <= a1*N1 - a2*N2 1909 // a1*N1 - a2*N2 <= c2 - c1 <= a1*0 - a2*0 1910 // a1*N1 - a2*N2 <= c2 - c1 <= 0 1913 // a1*N1 - a2*0 <= c2 - c1 <= a1*0 - a2*N2 1914 // a1*N1 < 1930 const SCEV *N1 = collectUpperBound(Loop1, A1->getType()); local [all...] |
/external/llvm/lib/Target/X86/ |
H A D | X86ISelLowering.cpp | 7254 SDValue N1 = Op.getOperand(1); local 7272 if (N1.getValueType() != MVT::i32) 7273 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1); 7276 return DAG.getNode(Opc, dl, VT, N0, N1, N2); 7290 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1); 7291 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2); 7308 SDValue N1 = Op.getOperand(1); local 7324 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1, 15877 SDValue N1 = N->getOperand(1); local 16055 SDValue N1 = N->getOperand(1); local 16176 SDValue N1 = Narrow->getOperand(1); local 16248 SDValue N1 = N->getOperand(1); local 16282 SDValue N1 = N->getOperand(1); local 16312 SDValue N1 = N->getOperand(1); local 16456 SDValue N1 = N->getOperand(1); local 16506 SDValue N1 = N->getOperand(1); local 17194 SDValue N1 = N->getOperand(1); local 17721 SDValue N1 = Op.getOperand(1); local [all...] |
/external/llvm/utils/TableGen/ |
H A D | CodeGenDAGPatterns.cpp | 2018 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[i+1]; local 2019 assert(N1->getNumTypes() == 1 && N2->getNumTypes() == 1 && 2022 MadeChange |= N1->UpdateNodeType(0, N2->getExtType(0), *this); 2023 MadeChange |= N2->UpdateNodeType(0, N1->getExtType(0), *this); 2439 const TreePatternNode *N1 = N->getChild(1); local 2440 if (N1->isLeaf()) 2442 if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf()) 2445 const SDNodeInfo &OpInfo = CDP.getSDNodeInfo(N1->getOperator());
|
/external/ceres-solver/internal/ceres/ |
H A D | solver_impl_test.cc | 60 template <int kNumResiduals, int N0, int N1, int N2> 62 SizedCostFunction<kNumResiduals, N0, N1, N2> {
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | InstrEmitter.cpp | 514 SDValue N1 = Node->getOperand(1); 552 AddOperand(MIB, N1, 0, 0, VRBaseMap, /*IsDebug=*/false,
|
H A D | LegalizeDAG.cpp | 91 SDValue N1, SDValue N2, 185 SDValue N1, SDValue N2, 194 return DAG.getVectorShuffle(NVT, dl, N1, N2, &Mask[0]); 208 return DAG.getVectorShuffle(NVT, dl, N1, N2, &NewMask[0]); 184 ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl, SDValue N1, SDValue N2, ArrayRef<int> Mask) const argument
|
H A D | SelectionDAGBuilder.cpp | 1074 SDValue N1 = NodeMap[V]; local 1075 assert(N1.getNode() && "visit didn't populate the NodeMap!"); 1076 return N1;
|
/external/ceres-solver/docs/ |
H A D | modeling.tex | 55 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0, int N5 = 0> 158 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0, int N5 = 0> 160 : public SizedCostFunction<M, N0, N1, N2, N3, N4, N5> {
|
/external/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGNodes.h | 1128 ShuffleVectorSDNode(EVT VT, DebugLoc dl, SDValue N1, SDValue N2, argument 1131 InitOperands(Ops, N1, N2);
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.Tree.pas | 4136 I, N1, N2: Integer; 4150 N1 := Adaptor.GetChildCount(T1); 4152 if (N1 <> N2) then 4154 for I := 0 to N1 - 1 do 4190 I, N1, N2: Integer; 4212 N1 := FAdaptor.GetChildCount(T1); 4214 if (N1 <> N2) then 4217 for I := 0 to N1 - 1 do
|
/external/llvm/include/llvm/Target/ |
H A D | TargetLowering.h | 1836 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1,
|
/external/chromium/third_party/libjingle/source/talk/session/phone/testdata/ |
H A D | video.rtpdump | 1057 E��{?�{�+�q�/���͏���K����Ǣx�'��v
{vO��5��-�L.�N1��B�I����A���)$� ���������I�1�# ��߿�zs���n�'��߳��#���_/o � � ���>%n�s��.�� f ��r �!�b�+��k�q����$;�O��|w��g�¸�x�Yش6)U��|���O�#J7�ؘ�F|o����N�k�Y'��A+˯��X�x��ي&�y���h�Zg��_��D�{��|G2��r�;\�F[�z�`ω�4;B>X��r��&��J?��]��N�}���#��ӐA��b&Yo��/��8�����������"���� ���>&n�~���.�� f ���r �!�8b>'{���ذ��'b�V'��;V'�v/�=ʼ����?��n ��b�,fO�X;B�{���I�}��9rc�g�w��3Emf��cZ��/{��-b����;h �i�I�9�1?z�ۿe�U�U������c��+�ߦ�E`�>K>�OoO�xm���{+��`�_�Fm�cY,#�Q����?H���'�o�K�"�E7����O!���>��%��_�ϊ��Q�Z�#�hZ�� ���������9�shvU��N_̧�;O�Qt�t"{�L�Q��^���ou4w����É� O3\�N���f��C�{V_c�2ѩhm;��D�%��Nz���_��A�g�^���L�It#C@�Z(�!���J#�����~��ߧ(ł�|
|