tools/jprof/intcnt.cpp

   1 /* ***** BEGIN LICENSE BLOCK *****
   2  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   3  *
   4  * The contents of this file are subject to the Mozilla Public License Version
   5  * 1.1 (the "License"); you may not use this file except in compliance with
   6  * the License. You may obtain a copy of the License at
   7  * http://www.mozilla.org/MPL/
   8  *
   9  * Software distributed under the License is distributed on an "AS IS" basis,
  10  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  11  * for the specific language governing rights and limitations under the
  12  * License.
  13  *
  14  * The Original Code is mozilla.org code.
  15  *
  16  * The Initial Developer of the Original Code is Netscape Communications Corp.
  17  * Portions created by the Initial Developer are Copyright (C) 1998
  18  * the Initial Developer. All Rights Reserved.
  19  *
  20  * Contributor(s):
  21  *
  22  * Alternatively, the contents of this file may be used under the terms of
  23  * either the GNU General Public License Version 2 or later (the "GPL"), or
  24  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  25  * in which case the provisions of the GPL or the LGPL are applicable instead
  26  * of those above. If you wish to allow use of your version of this file only
  27  * under the terms of either the GPL or the LGPL, and not to allow others to
  28  * use your version of this file under the terms of the MPL, indicate your
  29  * decision by deleting the provisions above and replace them with the notice
  30  * and other provisions required by the GPL or the LGPL. If you do not delete
  31  * the provisions above, a recipient may use your version of this file under
  32  * the terms of any one of the MPL, the GPL or the LGPL.
  33  *
  34  * ***** END LICENSE BLOCK ***** */
  35
  36 #include "intcnt.h"
  37
  38 IntCount::IntCount() : numInts(0), iPair(0) { }
  39 IntCount::~IntCount() { delete [] iPair;}
  40 int IntCount::getSize() {return numInts;}
  41 int IntCount::getCount(int pos) {return iPair[pos].cnt;}
  42 int IntCount::getIndex(int pos) {return iPair[pos].idx;}
  43
  44 int IntCount::countAdd(int index, int increment)
  45 {
  46     if(numInts) {
  47         // Do a binary search to find the element
  48         int divPoint = 0;
  49
  50         if(index>iPair[numInts-1].idx) {
  51             divPoint = numInts;
  52         } else if(index<iPair[0].idx) {
  53             divPoint = 0;
  54         } else {
  55             int low=0, high=numInts-1;
  56             int mid = (low+high)/2;
  57             while(1) {
  58                 mid = (low+high)/2;
  59
  60                 if(index<iPair[mid].idx) {
  61                     high = mid;
  62                 } else if(index>iPair[mid].idx) {
  63                     if(mid<numInts-1 && index<iPair[mid+1].idx) {
  64                         divPoint = mid+1;
  65                         break;
  66                     } else {
  67                         low = mid+1;
  68                     }
  69                 } else if(index==iPair[mid].idx) {
  70                     return iPair[mid].cnt += increment;
  71                 }
  72             }
  73         }
  74
  75         int i;
  76         IntPair *tpair = new IntPair[numInts+1];
  77         for(i=0; i<divPoint; i++) tpair[i] = iPair[i];
  78         for(i=divPoint; i<numInts; i++) tpair[i+1] = iPair[i];
  79         ++numInts;
  80         delete [] iPair;
  81         iPair = tpair;
  82         iPair[divPoint].idx = index;
  83         iPair[divPoint].cnt = increment;
  84         return increment;
  85     } else {
  86         iPair = new IntPair[1];
  87         numInts = 1;
  88         iPair[0].idx = index;
  89         return iPair[0].cnt = increment;
  90     }
  91 }