*/
    protected CrawlerContext crawlerContext;

    /**
     * Flag indicating whether to wait on folder operations.
     */
    protected boolean noWaitOnFolder = false;

    /**
     * Increments the active thread count.
     */
    protected void startCrawling() {
        synchronized (crawlerContext.activeThreadCountLock) {
            crawlerContext.activeThreadCount++;
        }
    }

	startTime := time.Now()
	return func() {
		duration := time.Since(startTime)

		atomic.AddUint64(&o.operations[s], 1)
		o.latency[s].add(duration)
	}
}

// incTime will increment time on metric s with a specific duration.
func (o *osMetrics) incTime(s osMetric, d time.Duration) {
	atomic.AddUint64(&o.operations[s], 1)
	o.latency[s].add(d)
}

		duration := time.Since(startTime)

		atomic.AddUint64(&p.operations[s], 1)
		if s < scannerMetricLastRealtime {
			p.latency[s].addSize(duration, int64(sz))
		}
	}
}

// incTime will increment time on metric s with a specific duration.
// Use for s < scannerMetricLastRealtime
func (p *scannerMetrics) incTime(s scannerMetric, d time.Duration) {
	atomic.AddUint64(&p.operations[s], 1)

        assertNotNull(component1);
        assertNotNull(component2);

        // Should be same instance for singleton
        assertSame(component1, component2);
        // The first creation should increment the counter
        assertTrue("Instance count should be at least 1", SingletonTestComponent.getInstanceCount() >= 1);
    }

    /**
     * Test wrap method
     */
    public void test_wrap_basic() {

		return
	}
	switch {
	case target.Type == obj.TYPE_BRANCH:
		// JMP 4(PC)
		*targetAddr = obj.Addr{
			Type:   obj.TYPE_BRANCH,
			Offset: p.pc + 1 + target.Offset, // +1 because p.pc is incremented in append, below.
		}
	case target.Type == obj.TYPE_REG:
		// JMP R1
		*targetAddr = *target
	case target.Type == obj.TYPE_MEM && (target.Name == obj.NAME_EXTERN || target.Name == obj.NAME_STATIC):

## Bug Fixes and Other Changes

*   Java: Support for loading models exported using the SavedModel API (courtesy
    @EronWright).
*   Go: Added support for incremental graph execution.
*   Fix a bug in the WALS solver when single-threaded.
*   Added support for integer sparse feature values in
    `tf.contrib.layers.sparse_column_with_keys`.

 {
-  char c;
   char *s = s1;
 
   /* Find the end of S1.  */
-  do
-    c = *s1++;
-  while (c != '\0');
-
-  /* Make S1 point before next character, so we can increment
-     it while memory is read (wins on pipelined cpus).  */
-  s1 -= 2;
+  s1 += strlen (s1);
 
-  if (n >= 4)
-    {
-      size_t n4 = n >> 2;
-      do
-	{
-	  c = *s2++;
-	  *++s1 = c;

			}
		case <-p.mrfWorkerKillCh:
			return
		}
	}
}

// AddWorker adds a replication worker to the pool.
// An optional pointer to a tracker that will be atomically
// incremented when operations are running can be provided.
func (p *ReplicationPool) AddWorker(input <-chan ReplicationWorkerOperation, opTracker *int32) {
	for {
		select {
		case <-p.ctx.Done():
			return

*[SeedSize]byte) { // CTR_DRBG_Update, per Section 10.2.1.2. temp := make([]byte, SeedSize) c.c.XORKeyStream(temp, seed[:]) K := temp[:keySize] V := temp[keySize:] // Again, we pre-increment V, like in NewCounter. increment((*[aes.BlockSize]byte)(V)) cipher, err := aes.New(K) if err != nil { panic(err) } c.c = *aes.NewCTR(cipher, V) } func increment(v *[aes.BlockSize]byte) { hi := byteorder.BEUint64(v[:8]) lo := byteorder.BEUint64(v[8:]) lo, c := bits.Add64(lo, 1, 0) hi, _ = bits.Add64(hi, 0, c) byteorder.BEPutUint64(v[:8],...

						sseCfgSet.Add(string(configData))
					}
				}
				ss, ok := info.StatsSummary[s.DeploymentID]
				if !ok {
					ss = madmin.SRSiteSummary{}
				}
				// increment total number of replicated buckets
				if len(slc) == numSites {
					ss.ReplicatedBuckets++
				}
				ss.TotalBucketsCount++
				if tagCount > 0 {
					ss.TotalTagsCount++
				}