HomeSort by: relevance | last modified time | path
    Searched defs:irhs (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/src/
gmock-matchers.cc 156 size_t irhs = left_[ilhs]; local
157 if (irhs == kUnused) continue;
158 result.push_back(ElementMatcherPair(ilhs, irhs));
183 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
184 if ((*seen)[irhs]) continue;
185 if (!graph_->HasEdge(ilhs, irhs)) continue;
186 // There's an available edge from ilhs to irhs.
187 (*seen)[irhs] = 1
    [all...]
  /src/external/gpl3/gcc/dist/libdecnumber/
decNumber.c 4876 Int ilhs, irhs, iacc; /* item counts in the arrays */ local
4948 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */
4949 iacc=ilhs+irhs;
4956 needbytes=irhs*sizeof(uInt);
  /src/external/gpl3/gcc.old/dist/libdecnumber/
decNumber.c 4876 Int ilhs, irhs, iacc; /* item counts in the arrays */ local
4948 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */
4949 iacc=ilhs+irhs;
4956 needbytes=irhs*sizeof(uInt);
  /src/external/gpl3/gdb/dist/libdecnumber/
decNumber.c 4876 Int ilhs, irhs, iacc; /* item counts in the arrays */ local
4948 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */
4949 iacc=ilhs+irhs;
4956 needbytes=irhs*sizeof(uInt);
  /src/external/gpl3/gdb.old/dist/libdecnumber/
decNumber.c 4876 Int ilhs, irhs, iacc; /* item counts in the arrays */ local
4948 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */
4949 iacc=ilhs+irhs;
4956 needbytes=irhs*sizeof(uInt);

Completed in 81 milliseconds