accessible/src/msaa/CAccessibleValue.cpp

   1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
   2 /* vim:expandtab:shiftwidth=2:tabstop=2:
   3  */
   4 /* ***** BEGIN LICENSE BLOCK *****
   5  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   6  *
   7  * The contents of this file are subject to the Mozilla Public License Version
   8  * 1.1 (the "License"); you may not use this file except in compliance with
   9  * the License. You may obtain a copy of the License at
  10  * http://www.mozilla.org/MPL/
  11  *
  12  * Software distributed under the License is distributed on an "AS IS" basis,
  13  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  14  * for the specific language governing rights and limitations under the
  15  * License.
  16  *
  17  * The Original Code is mozilla.org code.
  18  *
  19  * The Initial Developer of the Original Code is
  20  * Mozilla Foundation.
  21  * Portions created by the Initial Developer are Copyright (C) 2007
  22  * the Initial Developer. All Rights Reserved.
  23  *
  24  * Contributor(s):
  25  *   Alexander Surkov <surkov.alexander@gmail.com> (original author)
  26  *
  27  * Alternatively, the contents of this file may be used under the terms of
  28  * either the GNU General Public License Version 2 or later (the "GPL"), or
  29  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  30  * in which case the provisions of the GPL or the LGPL are applicable instead
  31  * of those above. If you wish to allow use of your version of this file only
  32  * under the terms of either the GPL or the LGPL, and not to allow others to
  33  * use your version of this file under the terms of the MPL, indicate your
  34  * decision by deleting the provisions above and replace them with the notice
  35  * and other provisions required by the GPL or the LGPL. If you do not delete
  36  * the provisions above, a recipient may use your version of this file under
  37  * the terms of any one of the MPL, the GPL or the LGPL.
  38  *
  39  * ***** END LICENSE BLOCK ***** */
  40
  41 #include "CAccessibleValue.h"
  42
  43 #include "AccessibleValue_i.c"
  44
  45 #include "nsIAccessibleValue.h"
  46
  47 #include "nsCOMPtr.h"
  48
  49 #include "nsAccessNodeWrap.h"
  50
  51 // IUnknown
  52
  53 STDMETHODIMP
  54 CAccessibleValue::QueryInterface(REFIID iid, void** ppv)
  55 {
  56   *ppv = NULL;
  57
  58   if (IID_IAccessibleValue == iid) {
  59     nsCOMPtr<nsIAccessibleValue> valueAcc(do_QueryInterface(this));
  60     if (!valueAcc)
  61       return E_NOINTERFACE;
  62
  63     *ppv = static_cast<IAccessibleValue*>(this);
  64     (reinterpret_cast<IUnknown*>(*ppv))->AddRef();
  65     return S_OK;
  66   }
  67
  68   return E_NOINTERFACE;
  69 }
  70
  71 // IAccessibleValue
  72
  73 STDMETHODIMP
  74 CAccessibleValue::get_currentValue(VARIANT *aCurrentValue)
  75 {
  76 __try {
  77   VariantInit(aCurrentValue);
  78
  79   nsCOMPtr<nsIAccessibleValue> valueAcc(do_QueryInterface(this));
  80   if (!valueAcc)
  81     return E_FAIL;
  82
  83   double currentValue = 0;
  84   nsresult rv = valueAcc->GetCurrentValue(&currentValue);
  85   if (NS_FAILED(rv))
  86     return GetHRESULT(rv);
  87
  88   aCurrentValue->vt = VT_R8;
  89   aCurrentValue->dblVal = currentValue;
  90   return S_OK;
  91
  92 } __except(nsAccessNodeWrap::FilterA11yExceptions(::GetExceptionCode(), GetExceptionInformation())) { }
  93   return E_FAIL;
  94 }
  95
  96 STDMETHODIMP
  97 CAccessibleValue::setCurrentValue(VARIANT aValue)
  98 {
  99 __try {
 100   nsCOMPtr<nsIAccessibleValue> valueAcc(do_QueryInterface(this));
 101   if (!valueAcc)
 102     return E_FAIL;
 103
 104   if (aValue.vt != VT_R8)
 105     return E_INVALIDARG;
 106
 107   nsresult rv = valueAcc->SetCurrentValue(aValue.dblVal);
 108   return GetHRESULT(rv);
 109
 110 } __except(nsAccessNodeWrap::FilterA11yExceptions(::GetExceptionCode(), GetExceptionInformation())) { }
 111   return E_FAIL;
 112 }
 113
 114 STDMETHODIMP
 115 CAccessibleValue::get_maximumValue(VARIANT *aMaximumValue)
 116 {
 117 __try {
 118   VariantInit(aMaximumValue);
 119
 120   nsCOMPtr<nsIAccessibleValue> valueAcc(do_QueryInterface(this));
 121   if (!valueAcc)
 122     return E_FAIL;
 123
 124   double maximumValue = 0;
 125   nsresult rv = valueAcc->GetMaximumValue(&maximumValue);
 126   if (NS_FAILED(rv))
 127     return GetHRESULT(rv);
 128
 129   aMaximumValue->vt = VT_R8;
 130   aMaximumValue->dblVal = maximumValue;
 131   return S_OK;
 132
 133 } __except(nsAccessNodeWrap::FilterA11yExceptions(::GetExceptionCode(), GetExceptionInformation())) { }
 134   return E_FAIL;
 135 }
 136
 137 STDMETHODIMP
 138 CAccessibleValue::get_minimumValue(VARIANT *aMinimumValue)
 139 {
 140 __try {
 141   VariantInit(aMinimumValue);
 142
 143   nsCOMPtr<nsIAccessibleValue> valueAcc(do_QueryInterface(this));
 144   if (!valueAcc)
 145     return E_FAIL;
 146
 147   double minimumValue = 0;
 148   nsresult rv = valueAcc->GetMinimumValue(&minimumValue);
 149   if (NS_FAILED(rv))
 150     return GetHRESULT(rv);
 151
 152   aMinimumValue->vt = VT_R8;
 153   aMinimumValue->dblVal = minimumValue;
 154   return S_OK;
 155
 156 } __except(nsAccessNodeWrap::FilterA11yExceptions(::GetExceptionCode(), GetExceptionInformation())) { }
 157   return E_FAIL;
 158 }
 159