The version of Apache log4j used by SoundHelix.
Clone
HTTPS:
git clone https://vervis.peers.community/repos/aEp6o
SSH:
git clone USERNAME@vervis.peers.community:aEp6o
Branches
Tags
- 1.3alpha-7
- CHAINSAW_2_SANDBOX_MERGE
- CORE_VERSION
- LEVEL_REPLACES_PRIORITY
- PREALPHA_1_3_AS_OF_2004_05_12
- PRE_CHAINSAW_MODEL_CONVERSION
- PRE_UGLI_MOVE
- TAG_CHAINSAW2_MOVE
- log4j-1.2.17
- log4j-1.2.17-rc1
- v1.3alpha8
- v1.3alpha8-temp
- v1_2_1
- v1_2_10-recalled
- v1_2_11
- v1_2_11_rc1
- v1_2_11rc3
- v1_2_12
- v1_2_12_rc1
- v1_2_12_rc2
- v1_2_12_rc3
- v1_2_12_rc4
- v1_2_12_rc5
- v1_2_12_rc6
- v1_2_13
- v1_2_13_rc1
- v1_2_13_rc2
- v1_2_13_site_update
- v1_2_14
- v1_2_14_maven
- v1_2_14_rc1
- v1_2_14_site_update
- v1_2_15
- v1_2_15_rc1
- v1_2_15_rc2
- v1_2_15_rc3
- v1_2_15_rc4
- v1_2_15_rc5
- v1_2_15_rc6
- v1_2_16
- v1_2_16_rc1
- v1_2_16_rc2
- v1_2_17
- v1_2_17-rc1
- v1_2_17_rc1
- v1_2_17_rc2
- v1_2_17_rc3
- v1_2_2
- v1_2_3
- v1_2_4
- v1_2_6
- v1_2_7
- v1_2_9
- v1_2_alpha0
- v1_2_alpha7
- v1_2beta1
- v1_2final
- v1_3alpha_1
- v1_3alpha_6
- v_1_0
- v_1_0_1
- v_1_0_4
- v_1_1
- v_1_1_1
- v_1_1_2
- v_1_1_3
- v_1_1_b1
- v_1_1b2
- v_1_1b3
- v_1_1b5
- v_1_1b6
- v_1_1b7
- v_1_2beta3
ExpressionRule.java
/*
* Copyright 1999,2004 The Apache Software Foundation.
*
* 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 org.apache.log4j.rule;
import org.apache.log4j.spi.LoggingEvent;
import java.util.Stack;
import java.util.StringTokenizer;
/**
* A Rule class supporting both infix and postfix expressions, accepting any rule which
* is supported by the <code>RuleFactory</code>.
*
* NOTE: parsing is supported through the use of <code>StringTokenizer</code>, which
* implies two limitations:
* 1: all tokens in the expression must be separated by spaces, including parenthese
* 2: operands which contain spaces MUST be wrapped in single quotes.
* For example, the expression:
* msg == 'some msg'
* is a valid expression.
* 3: To group expressions, use parentheses.
* For example, the expression:
* level >= INFO || ( msg == 'some msg' || logger == 'test' )
* is a valid expression.
* See org.apache.log4j.rule.InFixToPostFix for a description of supported operators.
* See org.apache.log4j.spi.LoggingEventFieldResolver for field keywords.
*
* @author Scott Deboy <sdeboy@apache.org>
*/
public class ExpressionRule extends AbstractRule {
static final long serialVersionUID = 5809121703146893729L;
private static final InFixToPostFix convertor = new InFixToPostFix();
private static final PostFixExpressionCompiler compiler = new PostFixExpressionCompiler();
private final Rule rule;
private ExpressionRule(Rule rule) {
this.rule = rule;
}
public static Rule getRule(String expression) {
return getRule(expression, false);
}
public static Rule getRule(String expression, boolean isPostFix) {
if (!isPostFix) {
expression = convertor.convert(expression);
}
return new ExpressionRule(compiler.compileExpression(expression));
}
public boolean evaluate(LoggingEvent event) {
return rule.evaluate(event);
}
public String toString() {
return rule.toString();
}
/**
* Evaluate a boolean postfix expression.
*
*/
static class PostFixExpressionCompiler {
Rule compileExpression(String expression) {
RuleFactory factory = RuleFactory.getInstance();
Stack stack = new Stack();
StringTokenizer tokenizer = new StringTokenizer(expression);
while (tokenizer.hasMoreTokens()) {
//examine each token
String token = tokenizer.nextToken();
if ((token.startsWith("'")) && (token.endsWith("'") && (token.length() > 2))) {
token = token.substring(1, token.length() - 1);
}
if ((token.startsWith("'")) && (token.endsWith("'") && (token.length() == 2))) {
token = "";
}
boolean inText = token.startsWith("'");
if (inText) {
token=token.substring(1);
while (inText && tokenizer.hasMoreTokens()) {
token = token + " " + tokenizer.nextToken();
inText = !(token.endsWith("'"));
}
if (token.length() > 0) {
token = token.substring(0, token.length() - 1);
}
}
//if a symbol is found, pop 2 off the stack, evaluate and push the result
if (factory.isRule(token)) {
Rule r = factory.getRule(token, stack);
stack.push(r);
} else {
//variables or constants are pushed onto the stack
if (token.length() > 0) {
stack.push(token);
}
}
}
if ((stack.size() == 1) && (!(stack.peek() instanceof Rule))) {
//while this may be an attempt at creating an expression,
//for ease of use, convert this single entry to a partial-text
//match on the MSG field
Object o = stack.pop();
stack.push("MSG");
stack.push(o);
return factory.getRule("~=", stack);
}
//stack should contain a single rule if the expression is valid
if ((stack.size() != 1) || (!(stack.peek() instanceof Rule))) {
throw new IllegalArgumentException("invalid expression: " + expression);
} else {
return (Rule) stack.pop();
}
}
}
}