X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=automated-tests%2Fsrc%2Fdali-toolkit%2Fdali-toolkit-test-utils%2Ftest-trace-call-stack.cpp;h=231603681c956027101022c63dcb16143b10ecaa;hb=abc8459e18c5a7f8730c9493885fd067126520cb;hp=9ed53ece90cb59de825d7c1db0b07a774abf1227;hpb=998d982768c7f211d948cfd7921ec27ff739ce49;p=platform%2Fcore%2Fuifw%2Fdali-toolkit.git diff --git a/automated-tests/src/dali-toolkit/dali-toolkit-test-utils/test-trace-call-stack.cpp b/automated-tests/src/dali-toolkit/dali-toolkit-test-utils/test-trace-call-stack.cpp index 9ed53ec..2316036 100644 --- a/automated-tests/src/dali-toolkit/dali-toolkit-test-utils/test-trace-call-stack.cpp +++ b/automated-tests/src/dali-toolkit/dali-toolkit-test-utils/test-trace-call-stack.cpp @@ -1,5 +1,5 @@ /* - * Copyright (c) 2014 Samsung Electronics Co., Ltd. + * Copyright (c) 2022 Samsung Electronics Co., Ltd. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -16,23 +16,67 @@ */ #include "test-trace-call-stack.h" +#include +#include +#include "dali-test-suite-utils.h" namespace Dali { +std::string ToString(int x) +{ + std::stringstream out; + out << x; + return out.str(); +} + +std::string ToString(unsigned int x) +{ + std::stringstream out; + out << x; + return out.str(); +} + +std::string ToString(float x) +{ + std::stringstream out; + out << x; + return out.str(); +} + /** * Constructor */ -TraceCallStack::TraceCallStack() : mTraceActive(false) { } +TraceCallStack::TraceCallStack(bool logging, std::string prefix) +: mTraceActive(false), + mLogging(logging), + mPrefix(prefix) +{ +} /** * Destructor */ -TraceCallStack::~TraceCallStack() { } +TraceCallStack::~TraceCallStack() +{ +} /** * Turn on / off tracing */ -void TraceCallStack::Enable(bool enable) { mTraceActive = enable; } +void TraceCallStack::Enable(bool enable) +{ + mTraceActive = enable; +} + +bool TraceCallStack::IsEnabled() +{ + return mTraceActive; +} + +void TraceCallStack::EnableLogging(bool enablelogging) +{ + mLogging = enablelogging; +} /** * Push a call onto the stack if the trace is active @@ -43,10 +87,25 @@ void TraceCallStack::PushCall(std::string method, std::string params) { if(mTraceActive) { - std::vector< std::string > functionCall; - functionCall.push_back(method); - functionCall.push_back(params); - mCallStack.push_back( functionCall ); + FunctionCall stackFrame(method, params); + mCallStack.push_back(stackFrame); + } + if(mLogging) + { + fprintf(stderr, "%s%s(%s)\n", mPrefix.c_str(), method.c_str(), params.c_str()); + } +} + +void TraceCallStack::PushCall(std::string method, std::string params, const TraceCallStack::NamedParams& altParams) +{ + if(mTraceActive) + { + FunctionCall stackFrame(method, params, altParams); + mCallStack.push_back(stackFrame); + } + if(mLogging) + { + fprintf(stderr, "%s%s(%s)\n", mPrefix.c_str(), method.c_str(), params.c_str()); } } @@ -58,17 +117,72 @@ void TraceCallStack::PushCall(std::string method, std::string params) bool TraceCallStack::FindMethod(std::string method) const { bool found = false; - for( size_t i=0; i < mCallStack.size(); i++ ) + for(size_t i = 0; i < mCallStack.size(); i++) { - if( 0 == mCallStack[i][0].compare(method) ) + if(0 == mCallStack[i].method.compare(method)) { found = true; break; } } + if(!found) + { + fprintf(stderr, "Search for %s failed\n", method.c_str()); + } return found; } +bool TraceCallStack::FindMethodAndGetParameters(std::string method, std::string& params) const +{ + bool found = false; + for(size_t i = 0; i < mCallStack.size(); i++) + { + if(0 == mCallStack[i].method.compare(method)) + { + found = true; + params = mCallStack[i].paramList; + break; + } + } + if(!found) + { + fprintf(stderr, "Search for %s() failed\n", method.c_str()); + } + return found; +} + +bool TraceCallStack::FindMethodAndGetParameters(std::string method, NamedParams& params) const +{ + bool found = false; + for(size_t i = 0; i < mCallStack.size(); i++) + { + if(0 == mCallStack[i].method.compare(method)) + { + found = true; + params = mCallStack[i].namedParams; + break; + } + } + if(!found) + { + fprintf(stderr, "Search for %s() failed\n", method.c_str()); + } + return found; +} + +int TraceCallStack::CountMethod(std::string method) const +{ + int numCalls = 0; + for(size_t i = 0; i < mCallStack.size(); i++) + { + if(0 == mCallStack[i].method.compare(method)) + { + numCalls++; + } + } + return numCalls; +} + /** * Search for a method in the stack with the given parameter list * @param[in] method The name of the method @@ -77,16 +191,126 @@ bool TraceCallStack::FindMethod(std::string method) const */ bool TraceCallStack::FindMethodAndParams(std::string method, std::string params) const { - bool found = false; - for( size_t i=0; i < mCallStack.size(); i++ ) + return FindIndexFromMethodAndParams(method, params) > -1; +} + +bool TraceCallStack::FindMethodAndParams(std::string method, const NamedParams& params) const +{ + return FindIndexFromMethodAndParams(method, params) > -1; +} + +bool TraceCallStack::FindMethodAndParamsFromStartIndex(std::string method, std::string params, size_t& startIndex) const +{ + for(size_t i = startIndex; i < mCallStack.size(); ++i) { - if( 0 == mCallStack[i][0].compare(method) && 0 == mCallStack[i][1].compare(params) ) + if((mCallStack[i].method.compare(method) == 0) && (mCallStack[i].paramList.compare(params) == 0)) { - found = true; + startIndex = i; + return true; + } + } + return false; +} + +/** + * Search for a method in the stack with the given parameter list + * @param[in] method The name of the method + * @param[in] params A comma separated list of parameter values + * @return index in the stack where the method was found or -1 otherwise + */ +int32_t TraceCallStack::FindIndexFromMethodAndParams(std::string method, std::string params) const +{ + int32_t index = -1; + for(size_t i = 0; i < mCallStack.size(); i++) + { + if(0 == mCallStack[i].method.compare(method) && 0 == mCallStack[i].paramList.compare(params)) + { + index = static_cast(i); break; } } - return found; + if(index == -1) + { + fprintf(stderr, "Search for %s(%s) failed\n", method.c_str(), params.c_str()); + } + return index; +} + +int TraceCallStack::FindIndexFromMethodAndParams(std::string method, const TraceCallStack::NamedParams& params) const +{ + int32_t index = -1; + for(size_t i = 0; i < mCallStack.size(); i++) + { + if(0 == mCallStack[i].method.compare(method)) + { + // Test each of the passed in parameters: + bool match = true; + + for(auto iter = params.mParams.begin(); iter != params.mParams.end(); ++iter) + { + auto paramIter = mCallStack[i].namedParams.find(iter->parameterName); + std::string value = paramIter->value.str(); + std::string iValue = iter->value.str(); + + if(paramIter == mCallStack[i].namedParams.end() || value.compare(iValue)) + { + match = false; + break; + } + } + if(match == true) + { + index = static_cast(i); + break; + } + } + } + + if(index == -1) + { + fprintf(stderr, "Search for %s(%s) failed\n", method.c_str(), params.str().c_str()); + } + + return index; +} + +const TraceCallStack::NamedParams* TraceCallStack::FindLastMatch(std::string method, const TraceCallStack::NamedParams& params) const +{ + int index = -1; + + if(mCallStack.size() > 0) + { + for(index = static_cast(mCallStack.size() - 1); index >= 0; --index) + { + if(0 == mCallStack[index].method.compare(method)) + { + // Test each of the passed in parameters: + bool match = true; + + for(auto iter = params.mParams.begin(); iter != params.mParams.end(); ++iter) + { + auto paramIter = mCallStack[index].namedParams.find(iter->parameterName); + std::string value = paramIter->value.str(); + std::string iValue = iter->value.str(); + + if(paramIter == mCallStack[index].namedParams.end() || value.compare(iValue)) + { + match = false; + break; + } + } + if(match == true) + { + break; + } + } + } + } + if(index >= 0) + { + return &mCallStack[index].namedParams; + } + return nullptr; } /** @@ -97,7 +321,7 @@ bool TraceCallStack::FindMethodAndParams(std::string method, std::string params) */ bool TraceCallStack::TestMethodAndParams(int index, std::string method, std::string params) const { - return ( 0 == mCallStack[index][0].compare(method) && 0 == mCallStack[index][1].compare(params) ); + return (0 == mCallStack[index].method.compare(method) && 0 == mCallStack[index].paramList.compare(params)); } /** @@ -108,5 +332,17 @@ void TraceCallStack::Reset() mCallStack.clear(); } +bool TraceCallStack::NamedParams::NameValue::operator==(int match) const +{ + std::ostringstream matchStr; + matchStr << match; + std::string valueStr = value.str(); + bool retval = !valueStr.compare(matchStr.str()); + if(!retval) + { + tet_printf("Comparing parameter \"%s\": %s with %s failed\n", parameterName.c_str(), value.str().c_str(), matchStr.str().c_str()); + } + return retval; +} } // namespace Dali