B_TREE<_SM_PAGE_KEY,SMKM_STORE_MGR::SMKM_FRONTEND_ENTRY,4096,B_TREE_DUMMY_NODE_POOL,B_TREE_KEY_COMPARATOR<_SM_PAGE_KEY>>::BTreeNodeFree

void __fastcall B_TREE<_SM_PAGE_KEY,SMKM_STORE_MGR::SMKM_FRONTEND_ENTRY,4096,B_TREE_DUMMY_NODE_POOL,B_TREE_KEY_COMPARATOR<_SM_PAGE_KEY>>::BTreeNodeFree(
        __int64 a1,
        char *a2){
  char *v4; 
  char *v5; 
  char *v6; 
  char *v7; 
  char **v8; 
  if( !a2[3] )
  {
    v4 = a2 + 16;
    v5 = a2 + 16;
    v6 = &a2[16 * (unsigned __int16)*(_DWORD *)a2 + 16];
    if( a2 + 16 <= v6 )
    {
      v7 = a2 + 8;
      do
      {
        v8 = (char **)(v5 - 8);
        if( v5 <= v4 )
          v8 = (char **)v7;
        if( *v8 )
          B_TREE<_SM_PAGE_KEY,SMKM_STORE_MGR::SMKM_FRONTEND_ENTRY,4096,B_TREE_DUMMY_NODE_POOL,B_TREE_KEY_COMPARATOR<_SM_PAGE_KEY>>::BTreeNodeFree(
            a1,
            *v8);
        v5 += 16;
      }
      while( v5 <= v6 );
    }
  }
  ExFreePoolWithTag(a2, 0);
}

Referenced by: