Lines Matching full:oldest

1044  *  oldest to accommodate. Else return none. */
1048 	int i, oldest;
1054 	/* remove oldest timestamp, and insert it at t with 0 qps */
1055 	oldest = 0;
1057 		if(d->timestamp[i] < d->timestamp[oldest])
1058 			oldest = i;
1060 	d->timestamp[oldest] = t;
1061 	d->qps[oldest] = 0;
1062 	return &(d->qps[oldest]);
1065 /** find the second and return its rate counter, if none, remove oldest to