Lines Matching refs:getChild
507 && pCol->getChild(0)->getTokenValue().equalsIgnoreAsciiCase(aFieldName) in impl_parseNodeToString_throw()
578 ::rtl::OUString sTableOrQueryName( getChild(0)->getTokenValue() ); in impl_parseTableNameNodeToString_throw()
700 const OSQLParseNode* pCol = m_aChildren[0]->getChild(m_aChildren[0]->count()-1); in impl_parseLikeNodeToString_throw()
701 …if ((SQL_ISRULE(pCol,column_val) && pCol->getChild(0)->getTokenValue().equalsIgnoreAsciiCase(aFiel… in impl_parseLikeNodeToString_throw()
711 pPart2->getChild(0)->impl_parseNodeToString_throw( rString, aNewParam ); in impl_parseLikeNodeToString_throw()
712 pPart2->getChild(1)->impl_parseNodeToString_throw( rString, aNewParam ); in impl_parseLikeNodeToString_throw()
713 pParaNode = pPart2->getChild(2); in impl_parseLikeNodeToString_throw()
714 pEscNode = pPart2->getChild(3); in impl_parseLikeNodeToString_throw()
749 OSL_ENSURE(pTableNode->getChild(0) && pTableNode->getChild(0)->isToken(),"Invalid parsenode!"); in getTableComponents()
750 _rCatalog <<= pTableNode->getChild(0)->getTokenValue(); in getTableComponents()
751 pTableNode = pTableNode->getChild(2); in getTableComponents()
757 _rCatalog <<= pTableNode->getChild(0)->getTokenValue(); in getTableComponents()
759 _rSchema = pTableNode->getChild(0)->getTokenValue(); in getTableComponents()
760 pTableNode = pTableNode->getChild(2); in getTableComponents()
765 _rTable = pTableNode->getChild(0)->getTokenValue(); in getTableComponents()
1476 OSQLParseNode* pChildNode = _pNode->getChild(i); in substituteParameterNames()
1480 delete pChildNode->replace(pChildNode->getChild(0),pNewNode); in substituteParameterNames()
1673 bResult = *getChild(i) == *rParseNode.getChild(i); in operator ==()
1762 … if (SQL_ISRULE(this,column_ref) && count() == 1 && getChild(0)->getTokenValue() == rColumnName) in replaceNodeValue()
1770 getChild(i)->replaceNodeValue(rTableAlias,rColumnName); in replaceNodeValue()
1817 OSQLParseNode* pLeft = pSearchCondition->getChild(1); in disjunctiveNormalForm()
1823 OSQLParseNode* pLeft = pSearchCondition->getChild(0); in disjunctiveNormalForm()
1826 OSQLParseNode* pRight = pSearchCondition->getChild(2); in disjunctiveNormalForm()
1832 OSQLParseNode* pLeft = pSearchCondition->getChild(0); in disjunctiveNormalForm()
1835 OSQLParseNode* pRight = pSearchCondition->getChild(2); in disjunctiveNormalForm()
1840 …if(pLeft->count() == 3 && SQL_ISRULE(pLeft,boolean_primary) && SQL_ISRULE(pLeft->getChild(1),searc… in disjunctiveNormalForm()
1843 OSQLParseNode* pOr = pLeft->getChild(1); in disjunctiveNormalForm()
1858 …ount() == 3 && SQL_ISRULE(pRight,boolean_primary) && SQL_ISRULE(pRight->getChild(1),search_conditi… in disjunctiveNormalForm()
1862 OSQLParseNode* pOr = pRight->getChild(1); in disjunctiveNormalForm()
1877 …pLeft,boolean_primary) && (!SQL_ISRULE(pLeft->getChild(1),search_condition) || !SQL_ISRULE(pLeft->… in disjunctiveNormalForm()
1879 …ight,boolean_primary) && (!SQL_ISRULE(pRight->getChild(1),search_condition) || !SQL_ISRULE(pRight-… in disjunctiveNormalForm()
1892 OSQLParseNode* pRight = pSearchCondition->getChild(1); in negateSearchCondition()
1898 OSQLParseNode* pLeft = pSearchCondition->getChild(0); in negateSearchCondition()
1899 OSQLParseNode* pRight = pSearchCondition->getChild(2); in negateSearchCondition()
1908 pLeft = pNewNode->getChild(0); in negateSearchCondition()
1909 pRight = pNewNode->getChild(2); in negateSearchCondition()
1918 OSQLParseNode* pLeft = pSearchCondition->getChild(0); in negateSearchCondition()
1919 OSQLParseNode* pRight = pSearchCondition->getChild(2); in negateSearchCondition()
1928 pLeft = pNewNode->getChild(0); in negateSearchCondition()
1929 pRight = pNewNode->getChild(2); in negateSearchCondition()
1951 OSQLParseNode* pComparison = pSearchCondition->getChild(1); in negateSearchCondition()
1986 pPart2 = pSearchCondition->getChild(1); in negateSearchCondition()
1993 OSQLParseNode* pNot = pPart2->getChild(nNotPos); in negateSearchCondition()
2004 OSQLParseNode* pNot = pSearchCondition->getChild( 1 )->getChild( 0 ); in negateSearchCondition()
2010 pSearchCondition->getChild( 1 )->replace(pNot, pNotNot); in negateSearchCondition()
2018 …mary) || (pSearchCondition->count() == 3 && SQL_ISPUNCTUATION(pSearchCondition->getChild(0),"(") && in eraseBraces()
2019 SQL_ISPUNCTUATION(pSearchCondition->getChild(2),")")))) in eraseBraces()
2021 OSQLParseNode* pRight = pSearchCondition->getChild(1); in eraseBraces()
2024 …if(!(SQL_ISRULE(pSearchCondition->getChild(1),boolean_term) || SQL_ISRULE(pSearchCondition->getChi… in eraseBraces()
2025 … SQL_ISRULE(pSearchCondition->getChild(1),boolean_term) || // and can always stand without () in eraseBraces()
2026 …(SQL_ISRULE(pSearchCondition->getChild(1),search_condition) && SQL_ISRULE(pSearchCondition->getPar… in eraseBraces()
2044 OSQLParseNode* pLeft = pSearchCondition->getChild(0); in absorptions()
2046 OSQLParseNode* pRight = pSearchCondition->getChild(2); in absorptions()
2054 && *pSearchCondition->getChild(0) == *pSearchCondition->getChild(2)) in absorptions()
2063 ( SQL_ISRULE(pSearchCondition->getChild(nPos = 0),boolean_primary) in absorptions()
2064 || SQL_ISRULE(pSearchCondition->getChild(nPos),search_condition) in absorptions()
2066 || ( SQL_ISRULE(pSearchCondition->getChild(nPos = 2),boolean_primary) in absorptions()
2067 || SQL_ISRULE(pSearchCondition->getChild(nPos),search_condition) in absorptions()
2072 OSQLParseNode* p2ndSearch = pSearchCondition->getChild(nPos); in absorptions()
2074 p2ndSearch = p2ndSearch->getChild(1); in absorptions()
2076 …if ( *p2ndSearch->getChild(0) == *pSearchCondition->getChild(2-nPos) ) // a and ( a or b) -> a or b in absorptions()
2082 …else if ( *p2ndSearch->getChild(2) == *pSearchCondition->getChild(2-nPos) ) // a and ( b or a) -> … in absorptions()
2108 …else if(SQL_ISRULE(pSearchCondition,search_condition) && SQL_ISRULE(pSearchCondition->getChild(2),… in absorptions()
2110 if(*pSearchCondition->getChild(2)->getChild(0) == *pSearchCondition->getChild(0)) in absorptions()
2115 else if(*pSearchCondition->getChild(2)->getChild(2) == *pSearchCondition->getChild(0)) in absorptions()
2122 …else if(SQL_ISRULE(pSearchCondition,search_condition) && SQL_ISRULE(pSearchCondition->getChild(0),… in absorptions()
2124 if(*pSearchCondition->getChild(0)->getChild(0) == *pSearchCondition->getChild(2)) in absorptions()
2129 else if(*pSearchCondition->getChild(0)->getChild(2) == *pSearchCondition->getChild(2)) in absorptions()
2148 OSQLParseNode* pLeft = pSearchCondition->getChild(0); in compress()
2151 OSQLParseNode* pRight = pSearchCondition->getChild(2); in compress()
2154 …mary) || (pSearchCondition->count() == 3 && SQL_ISPUNCTUATION(pSearchCondition->getChild(0),"(") && in compress()
2155 SQL_ISPUNCTUATION(pSearchCondition->getChild(2),")"))) in compress()
2157 OSQLParseNode* pRight = pSearchCondition->getChild(1); in compress()
2160 …if(!(SQL_ISRULE(pSearchCondition->getChild(1),boolean_term) || SQL_ISRULE(pSearchCondition->getChi… in compress()
2161 …(SQL_ISRULE(pSearchCondition->getChild(1),boolean_term) && SQL_ISRULE(pSearchCondition->getParent(… in compress()
2162 …(SQL_ISRULE(pSearchCondition->getChild(1),search_condition) && SQL_ISRULE(pSearchCondition->getPar… in compress()
2170 …condition) && SQL_ISRULE(pSearchCondition->getChild(0),boolean_term) && SQL_ISRULE(pSearchConditio… in compress()
2172 … if(*pSearchCondition->getChild(0)->getChild(0) == *pSearchCondition->getChild(2)->getChild(0)) in compress()
2174 OSQLParseNode* pLeft = pSearchCondition->getChild(0)->removeAt(2); in compress()
2175 OSQLParseNode* pRight = pSearchCondition->getChild(2)->removeAt(2); in compress()
2186 pNode = MakeANDNode(pSearchCondition->getChild(0)->removeAt((sal_uInt32)0),pNewRule); in compress()
2189 …else if(*pSearchCondition->getChild(0)->getChild(2) == *pSearchCondition->getChild(2)->getChild(0)) in compress()
2191 OSQLParseNode* pLeft = pSearchCondition->getChild(0)->removeAt((sal_uInt32)0); in compress()
2192 OSQLParseNode* pRight = pSearchCondition->getChild(2)->removeAt(2); in compress()
2203 pNode = MakeANDNode(pSearchCondition->getChild(0)->removeAt(1),pNewRule); in compress()
2206 …else if(*pSearchCondition->getChild(0)->getChild(0) == *pSearchCondition->getChild(2)->getChild(2)) in compress()
2208 OSQLParseNode* pLeft = pSearchCondition->getChild(0)->removeAt(2); in compress()
2209 OSQLParseNode* pRight = pSearchCondition->getChild(2)->removeAt((sal_uInt32)0); in compress()
2220 pNode = MakeANDNode(pSearchCondition->getChild(0)->removeAt((sal_uInt32)0),pNewRule); in compress()
2223 …else if(*pSearchCondition->getChild(0)->getChild(2) == *pSearchCondition->getChild(2)->getChild(2)) in compress()
2225 OSQLParseNode* pLeft = pSearchCondition->getChild(0)->removeAt((sal_uInt32)0); in compress()
2226 OSQLParseNode* pRight = pSearchCondition->getChild(2)->removeAt((sal_uInt32)0); in compress()
2237 pNode = MakeANDNode(pSearchCondition->getChild(0)->removeAt(1),pNewRule); in compress()
2764 if ( nCount == 2 || (nCount == 3 && !_pTableRef->getChild(0)->isToken()) || nCount == 5 ) in getTableRange()
2766 const OSQLParseNode* pNode = _pTableRef->getChild(nCount - (nCount == 2 ? 1 : 2)); in getTableRange()
2771 sTableRange = pNode->getChild(1)->getTokenValue(); in getTableRange()