tools/jprof/intcnt.cpp
author Aki Sasaki <asasaki@mozilla.com>
Thu, 15 Feb 2018 18:14:26 -0800
changeset 405423 42a3b4c113542cee47b388879e27163091eed356
parent 129329 931e85b3d576d5971e7c02896dade6ce9a57fc44
child 448947 6f3709b3878117466168c40affa7bca0b60cf75b
permissions -rw-r--r--
bug 1438735 - balrog scriptworker push and schedule support. r=bhearsum - add balrog submit-toplevel - this replaces the final portion of the updates builder. - rename balrog transform to balrog_submit, because it's for balrog locale submission - make this default to the 'promote' phase. balrog and beetmover currently take the current phase, which isn't always the wanted behavior. - rename balrog publish to balrog schedule - add balrog secondary push and secondary scheduling, for RCs - remove the release_updates transforms - make the task.py balrog transforms smarter - get rid of the release_balrog_publishing transforms; ad a generic worker_type transform - add BALROG_ACTIONS to scriptworker.py - add get_balrog_action_scope() - remove the unused balrog channel scopes MozReview-Commit-ID: 369ACiOAd5F

/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#include "intcnt.h"

IntCount::IntCount() : numInts(0), iPair(nullptr) { }
IntCount::~IntCount() { delete [] iPair;}
int IntCount::getSize() {return numInts;}
int IntCount::getCount(int pos) {return iPair[pos].cnt;}
int IntCount::getIndex(int pos) {return iPair[pos].idx;}

void IntCount::clear()
{
    delete[] iPair;
    iPair = new IntPair[0];
    numInts = 0;
}

int IntCount::countAdd(int index, int increment)
{
  if(numInts) {
    // Do a binary search to find the element
    int divPoint = 0;

    if(index>iPair[numInts-1].idx) {
	    divPoint = numInts;
    } else if(index<iPair[0].idx) {
	    divPoint = 0;
    } else {
	    int low=0, high=numInts-1;
	    int mid = (low+high)/2;
	    while(1) {
        mid = (low+high)/2;

        if(index<iPair[mid].idx) {
          high = mid;
        } else if(index>iPair[mid].idx) {
          if(mid<numInts-1 && index<iPair[mid+1].idx) {
            divPoint = mid+1;
            break;
          } else {
            low = mid+1;
          }
        } else if(index==iPair[mid].idx) {
          return iPair[mid].cnt += increment;
        }
	    }
    }

    int i;
    IntPair *tpair = new IntPair[numInts+1];
    for(i=0; i<divPoint; i++) {
      tpair[i] = iPair[i];
    }
    for(i=divPoint; i<numInts; i++) {
      tpair[i+1] = iPair[i];
    }
    ++numInts;
    delete [] iPair;
    iPair = tpair;
    iPair[divPoint].idx = index;
    iPair[divPoint].cnt = increment;
    return increment;
  } else {
    iPair = new IntPair[1];
    numInts = 1;
    iPair[0].idx = index;
    return iPair[0].cnt = increment;
  }
}