Function SlowLog_Add

src/slow_log/slow_log.c:147–221

}

void SlowLog_Add
(
	SlowLog *slowlog,
	const char *cmd,
	const char *query,
	double latency,
	time_t *t
) {
	ASSERT(latency >= 0);
	ASSERT(cmd     != NULL);
	ASSERT(query   != NULL);
	ASSERT(slowlog != NULL);

	int res;
	UNUSED(res);
	char *key;
	time_t _time;
	SlowLogItem *existing_item;
	int t_id = ThreadPools_GetThreadID();
	rax *lookup = slowlog->lookup[t_id];
	heap_t *heap = slowlog->min_heap[t_id];
	pthread_mutex_t *lock = slowlog->locks + t_id;

	// initialise time
	(t) ? _time = *t : time(&_time);

	if(pthread_mutex_lock(lock) != 0) {
		// failed to lock, skip logging
		return;
	}

	{
		// in critical section
		bool exists = _SlowLog_Contains(slowlog, t_id, cmd, query, &key,
				&existing_item);
		size_t key_len = strlen(key);

		if(exists) {
			// a similar item already exists
			// see if we need to update its latency
			if(existing_item->latency < latency) {
				existing_item->time = _time;
				existing_item->latency = latency;
			}
			goto cleanup;
		}

		// similar item does not exist in the log
		// check if there's enough room to store item
		int introduce_item = 0;
		if(Heap_count(heap) < SLOW_LOG_SIZE) {
			introduce_item = 1;
		} else {
			// not enough room, see if item should be tracked
			SlowLogItem *top = Heap_peek(heap);
			if(top->latency < latency) {
				top = Heap_poll(heap);
				_SlowLog_RemoveItemFromLookup(slowlog, t_id, top);