de.huxhorn.lilith.logback.classic.SimpleNDCAdapter Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of de.huxhorn.lilith.logback.classic Show documentation

This file is part of Lilith. It contains an NDC implementation that can be used in conjunction with the lilith appenders to get NDC functionality in Logback.

There is a newer version: 8.3.0

Show newest version

/*
 * Lilith - a log event viewer.
 * Copyright (C) 2007-2011 Joern Huxhorn
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see .
 */

/*
 * Copyright 2007-2011 Joern Huxhorn
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package de.huxhorn.lilith.logback.classic;

import de.huxhorn.lilith.data.logging.Message;
import de.huxhorn.lilith.data.logging.MessageFormatter;

import java.util.LinkedList;
import java.util.List;

public class SimpleNDCAdapter
	implements NDCAdapter
{
	private ThreadLocal> threadLocalMessagePatterns =new ThreadLocal<>();
	private ThreadLocal> threadLocalMessageArguments =new ThreadLocal<>();

	public void push(String messagePattern, Object... arguments)
	{
		String[] processedArgs=null;
		if(arguments != null && arguments.length > 0)
		{
			MessageFormatter.ArgumentResult argumentResults = MessageFormatter.evaluateArguments(messagePattern, arguments);
			if(argumentResults != null)
			{
				processedArgs = argumentResults.getArguments();
			}
		}

		List messages = threadLocalMessagePatterns.get();
		List args = threadLocalMessageArguments.get();
		if(messages == null)
		{
			messages = new LinkedList<>();
			args = new LinkedList<>();
			threadLocalMessagePatterns.set(messages);
			threadLocalMessageArguments.set(args);
		}
		messages.add(messagePattern);
		args.add(processedArgs);
	}

	public void pop()
	{
		List messages = threadLocalMessagePatterns.get();
		if(messages == null)
		{
			return;
		}
		int count=messages.size();
		if(count == 0 || count == 1)
		{
			clear();
			return;
		}
		List args = threadLocalMessageArguments.get();
		messages.remove(count - 1);
		args.remove(count -1);
	}

	public int getDepth()
	{
		List messages = threadLocalMessagePatterns.get();
		if(messages == null)
		{
			return 0;
		}
		int count=messages.size();
		if(count == 0)
		{
			// should never happen
			clear();
		}
		return count;
	}

	public void setMaximumDepth(int maximumDepth)
	{
		int overflow = getDepth() - maximumDepth;
		for(int i = 0; i < overflow; i++)
		{
			pop();
		}
	}

	public boolean isEmpty()
	{
		return getDepth()==0;
	}

	public void clear()
	{
		threadLocalMessagePatterns.remove();
		threadLocalMessageArguments.remove();
	}

	public Message[] getContextStack()
	{
		List messages = threadLocalMessagePatterns.get();
		if(messages == null)
		{
			return NO_MESSAGES;
		}
		int count=messages.size();
		if(count == 0)
		{
			// should never happen
			clear();
			return NO_MESSAGES;
		}
		List args = threadLocalMessageArguments.get();

		Message[] result=new Message[count];
		for(int i=0;i