Performance improvement: Avoid linear search in remap code
----------------------------------------------------------
Key: TS-87
URL: https://issues.apache.org/jira/browse/TS-87
Project: Traffic Server
Issue Type: Improvement
Components: Core
Reporter: Manjesh Nilange
Assignee: Manjesh Nilange
Priority: Minor
Currently, the remap code stores all the remap rules in a hash table keyed by
the host field of the "from URL" of the rule. Entries with the same host field
are chained in a linked list. When looking for a mapping, the code has to do a
linear traversal of this list, based on the path of the incoming request to
find a matching rule. This performance should be improved as overhead can be
substantial in cases where there are hundreds of the entries for the same host.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
