Pass CFX_*StringCs to FX_HashCode_GETA and _GETW hash functions.

xfa/fxfa/parser/xfa_script_resolveprocessor.cpp

 // Copyright 2014 PDFium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
 
 #include "xfa/fxfa/parser/xfa_script_resolveprocessor.h"
 
 #include "core/fxcrt/include/fx_ext.h"
 #include "xfa/fxfa/fm2js/xfa_fm2jsapi.h"
@@ skipping 104 matching lines @@
   CFX_WideString wsName = rnd.m_wsName;
   CFX_WideString wsCondition = rnd.m_wsCondition;
   int32_t iNameLen = wsName.GetLength();
   if (iNameLen == 1) {
     nodes.Add(rnd.m_CurNode);
     return 1;
   }
   if (rnd.m_nLevel > 0) {
     return -1;
   }
-  uint32_t dwNameHash =
-      FX_HashCode_String_GetW(wsName.c_str() + 1, iNameLen - 1);
+  uint32_t dwNameHash = FX_HashCode_GetW(
+      CFX_WideStringC(wsName.c_str() + 1, iNameLen - 1), false);
   if (dwNameHash == XFA_HASHCODE_Xfa) {
     nodes.Add(rnd.m_pSC->GetDocument()->GetRoot());
   } else {
     CXFA_Object* pObjNode = rnd.m_pSC->GetDocument()->GetXFAObject(dwNameHash);
     if (pObjNode) {
       rnd.m_Nodes.Add(pObjNode);
     }
   }
   if (rnd.m_Nodes.GetSize() > 0) {
     XFA_ResolveNode_FilterCondition(rnd, wsCondition);
   }
   return rnd.m_Nodes.GetSize();
 }
 int32_t CXFA_ResolveProcessor::XFA_ResolveNodes_Excalmatory(
     CXFA_ResolveNodesData& rnd) {
   if (rnd.m_nLevel > 0) {
     return 0;
   }
   CXFA_Node* datasets =
       ToNode(rnd.m_pSC->GetDocument()->GetXFAObject(XFA_HASHCODE_Datasets));
   if (!datasets) {
     return 0;
   }
   CXFA_ResolveNodesData rndFind;
   rndFind.m_pSC = rnd.m_pSC;
   rndFind.m_CurNode = datasets;
   rndFind.m_wsName = rnd.m_wsName.Right(rnd.m_wsName.GetLength() - 1);
-  rndFind.m_uHashName = FX_HashCode_String_GetW(rndFind.m_wsName.c_str(),
-                                                rndFind.m_wsName.GetLength());
+  rndFind.m_uHashName = FX_HashCode_GetW(rndFind.m_wsName.AsStringC(), false);
   rndFind.m_nLevel = rnd.m_nLevel + 1;
   rndFind.m_dwStyles = XFA_RESOLVENODE_Children;
   rndFind.m_wsCondition = rnd.m_wsCondition;
   XFA_ResolveNodes(rndFind);
   if (rndFind.m_Nodes.GetSize() > 0) {
     rnd.m_Nodes.Append(rndFind.m_Nodes);
     rndFind.m_Nodes.RemoveAll();
   }
   return rnd.m_Nodes.GetSize();
 }
 int32_t CXFA_ResolveProcessor::XFA_ResolveNodes_NumberSign(
     CXFA_ResolveNodesData& rnd) {
   CFX_WideString wsName = rnd.m_wsName.Right(rnd.m_wsName.GetLength() - 1);
   CFX_WideString wsCondition = rnd.m_wsCondition;
   CXFA_Node* curNode = ToNode(rnd.m_CurNode);
   if (XFA_ResolveNodes_ForAttributeRs(curNode, rnd, wsName.AsStringC())) {
     return 1;
   }
   CXFA_ResolveNodesData rndFind;
   rndFind.m_pSC = rnd.m_pSC;
   rndFind.m_nLevel = rnd.m_nLevel + 1;
   rndFind.m_dwStyles = rnd.m_dwStyles;
   rndFind.m_dwStyles |= XFA_RESOLVENODE_TagName;
   rndFind.m_dwStyles &= ~XFA_RESOLVENODE_Attributes;
   rndFind.m_wsName = wsName;
-  rndFind.m_uHashName = FX_HashCode_String_GetW(rndFind.m_wsName.c_str(),
-                                                rndFind.m_wsName.GetLength());
+  rndFind.m_uHashName = FX_HashCode_GetW(rndFind.m_wsName.AsStringC(), false);
   rndFind.m_wsCondition = wsCondition;
   rndFind.m_CurNode = curNode;
   XFA_ResolveNodes_Normal(rndFind);
   if (rndFind.m_Nodes.GetSize() > 0) {
     if (wsCondition.GetLength() == 0 && rndFind.m_Nodes.Find(curNode) >= 0) {
       rnd.m_Nodes.Add(curNode);
     } else {
       rnd.m_Nodes.Append(rndFind.m_Nodes);
       rndFind.m_Nodes.RemoveAll();
     }
@@ skipping 417 matching lines @@
   }
   if (stack.GetSize() > 0) {
     return -1;
   }
   wsName.ReleaseBuffer(nNameCount);
   wsName.TrimLeft();
   wsName.TrimRight();
   wsCondition.ReleaseBuffer(nConditionCount);
   wsCondition.TrimLeft();
   wsCondition.TrimRight();
-  rnd.m_uHashName = FX_HashCode_String_GetW(wsName.c_str(), wsName.GetLength());
+  rnd.m_uHashName = FX_HashCode_GetW(wsName.AsStringC(), false);
   return nStart;
 }
 void CXFA_ResolveProcessor::XFA_ResolveNode_ConditionArray(
     int32_t iCurIndex,
     CFX_WideString wsCondition,
     int32_t iFoundCount,
     CXFA_ResolveNodesData& rnd) {
   CXFA_NodeArray& findNodes = (CXFA_NodeArray&)rnd.m_Nodes;
   int32_t iLen = wsCondition.GetLength();
   FX_BOOL bRelative = FALSE;
@@ skipping 188 matching lines @@
   if (m_pNodeHelper->XFA_CreateNode_ForCondition(wsNextCondition)) {
     if (m_pNodeHelper->m_eLastCreateType == XFA_ELEMENT_DataGroup) {
       iIndex = 0;
     } else {
       iIndex = iCount - 1;
     }
   } else {
     iIndex = iCount - 1;
   }
 }