PHP 8.2.30
Preview: pure_eval.py Size: 4.50 KB
/opt/hc_python/lib64/python3.12/site-packages/sentry_sdk/integrations/pure_eval.py

import ast

import sentry_sdk
from sentry_sdk import serializer
from sentry_sdk.integrations import Integration, DidNotEnable
from sentry_sdk.scope import add_global_event_processor
from sentry_sdk.utils import walk_exception_chain, iter_stacks

from typing import TYPE_CHECKING

if TYPE_CHECKING:
    from typing import Optional, Dict, Any, Tuple, List
    from types import FrameType

    from sentry_sdk._types import Event, Hint

try:
    import executing
except ImportError:
    raise DidNotEnable("executing is not installed")

try:
    import pure_eval
except ImportError:
    raise DidNotEnable("pure_eval is not installed")

try:
    # Used implicitly, just testing it's available
    import asttokens  # noqa
except ImportError:
    raise DidNotEnable("asttokens is not installed")


class PureEvalIntegration(Integration):
    identifier = "pure_eval"

    @staticmethod
    def setup_once():
        # type: () -> None

        @add_global_event_processor
        def add_executing_info(event, hint):
            # type: (Event, Optional[Hint]) -> Optional[Event]
            if sentry_sdk.get_client().get_integration(PureEvalIntegration) is None:
                return event

            if hint is None:
                return event

            exc_info = hint.get("exc_info", None)

            if exc_info is None:
                return event

            exception = event.get("exception", None)

            if exception is None:
                return event

            values = exception.get("values", None)

            if values is None:
                return event

            for exception, (_exc_type, _exc_value, exc_tb) in zip(
                reversed(values), walk_exception_chain(exc_info)
            ):
                sentry_frames = [
                    frame
                    for frame in exception.get("stacktrace", {}).get("frames", [])
                    if frame.get("function")
                ]
                tbs = list(iter_stacks(exc_tb))
                if len(sentry_frames) != len(tbs):
                    continue

                for sentry_frame, tb in zip(sentry_frames, tbs):
                    sentry_frame["vars"] = (
                        pure_eval_frame(tb.tb_frame) or sentry_frame["vars"]
                    )
            return event


def pure_eval_frame(frame):
    # type: (FrameType) -> Dict[str, Any]
    source = executing.Source.for_frame(frame)
    if not source.tree:
        return {}

    statements = source.statements_at_line(frame.f_lineno)
    if not statements:
        return {}

    scope = stmt = list(statements)[0]
    while True:
        # Get the parent first in case the original statement is already
        # a function definition, e.g. if we're calling a decorator
        # In that case we still want the surrounding scope, not that function
        scope = scope.parent
        if isinstance(scope, (ast.FunctionDef, ast.ClassDef, ast.Module)):
            break

    evaluator = pure_eval.Evaluator.from_frame(frame)
    expressions = evaluator.interesting_expressions_grouped(scope)

    def closeness(expression):
        # type: (Tuple[List[Any], Any]) -> Tuple[int, int]
        # Prioritise expressions with a node closer to the statement executed
        # without being after that statement
        # A higher return value is better - the expression will appear
        # earlier in the list of values and is less likely to be trimmed
        nodes, _value = expression

        def start(n):
            # type: (ast.expr) -> Tuple[int, int]
            return (n.lineno, n.col_offset)

        nodes_before_stmt = [
            node
            for node in nodes
            if start(node) < stmt.last_token.end  # type: ignore
        ]
        if nodes_before_stmt:
            # The position of the last node before or in the statement
            return max(start(node) for node in nodes_before_stmt)
        else:
            # The position of the first node after the statement
            # Negative means it's always lower priority than nodes that come before
            # Less negative means closer to the statement and higher priority
            lineno, col_offset = min(start(node) for node in nodes)
            return (-lineno, -col_offset)

    # This adds the first_token and last_token attributes to nodes
    atok = source.asttokens()

    expressions.sort(key=closeness, reverse=True)
    vars = {
        atok.get_text(nodes[0]): value
        for nodes, value in expressions[: serializer.MAX_DATABAG_BREADTH]
    }
    return serializer.serialize(vars, is_vars=True)

Directory Contents

Dirs: 10 × Files: 70

Name Size Perms Modified Actions
celery DIR
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
django DIR
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
grpc DIR
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
redis DIR
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
spark DIR
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
- drwxr-xr-x 2025-12-03 08:02:53
Edit Download
12.70 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
14.17 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
911 B lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.70 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.70 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
12.50 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.50 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
6.37 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.61 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
17.65 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.06 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.31 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
6.46 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.59 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.96 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.60 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
9.18 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.93 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.28 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
2.35 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.95 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
9.28 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.48 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
8.54 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
8.26 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
2.75 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.69 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.92 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.94 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.32 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
14.60 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
39.02 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
11.56 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.89 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
9.99 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
11.55 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
13.57 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
6.38 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
19.58 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
820 B lrw-r--r-- 2025-12-03 08:02:53
Edit Download
24.54 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.10 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
3.06 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.50 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
6.23 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.19 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.24 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.20 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
5.18 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
8.87 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
12.66 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.76 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
3.09 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
4.24 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
25.62 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
10.31 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.20 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
8.76 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
13.82 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
2.43 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
6.94 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.04 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.61 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.77 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.03 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
1.71 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
10.56 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
3.11 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
7.38 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download
12.44 KB lrw-r--r-- 2025-12-03 08:02:53
Edit Download

If ZipArchive is unavailable, a .tar will be created (no compression).