1772   m_keyInfo(),  in NdbQueryImpl()
1904   const int error = getRoot().prepareKeyInfo(m_keyInfo, paramValues);  in assignParameters()
1981   int startPos = m_keyInfo.getSize();  in setBound()
2028           insert_bound(m_keyInfo, key_record, key_record->key_indexes[j],  in setBound()
2051             insert_bound(m_keyInfo, key_record, key_record->key_indexes[j],  in setBound()
2063             insert_bound(m_keyInfo, key_record, key_record->key_indexes[j],  in setBound()
2078     m_keyInfo.append(NdbIndexScanOperation::BoundLE);  in setBound()
2079     m_keyInfo.append(ah.m_value);  in setBound()
2082   Uint32 length = m_keyInfo.getSize()-startPos;  in setBound()
2083   if (unlikely(m_keyInfo.isMemoryExhausted())) {  in setBound()
2088     m_keyInfo.put(startPos, m_keyInfo.get(startPos) | (length << 16) | (bound->range_no << 4));  in setBound()
2093   for (Uint32 i = startPos; i < m_keyInfo.getSize(); i++) {  in setBound()
2095     sprintf(buf, "%.8x", m_keyInfo.get(i));  in setBound()
2768   if (unlikely(m_attrInfo.isMemoryExhausted() || m_keyInfo.isMemoryExhausted())) {  in prepareSend()
2774                m_keyInfo.getSize()  > ScanTabReq::MaxTotalAttrInfo)) {  in prepareSend()
3092     LinearSectionIterator keyInfoIter(m_keyInfo.addr(), m_keyInfo.getSize());  in doSend()
3101     if (m_keyInfo.getSize() > 0)  in doSend()
3104       secs[2].sz= m_keyInfo.getSize();  in doSend()
3178     secs[TcKeyReq::KeyInfoSectionNum].p= m_keyInfo.addr();  in doSend()
3179     secs[TcKeyReq::KeyInfoSectionNum].sz= m_keyInfo.getSize();  in doSend()
3204   m_keyInfo.releaseExtend();  in doSend()
3408       .checkPrunable(m_keyInfo, m_shortestBound, prunable, m_pruneHashVal);  in isPrunable()