← Back
Editing: reorder.cpython-311.pyc
� cR�a � �p � d Z ddlZddlmZ ddlmZ ddlmZ ddl m Z ddl m Z d� Z G d� d e� � ZdS ) �E Reorder top-level functions to prevent circular type dependencies. � N)�OrderedGlobalDeclarations)�Transformation)�PythranSyntaxError)�TypeDependenciesc �^ � t � � }g }t � � }|�| � � � }|D ]�}||v r�|g}|r�|d }||v r|� � � �#|� |� � g }| | D ]6} | |vr0| |v rt j d| z � � �|� | � � �7|r|� |� � n>|� |� � |� |� � |� � � |�ό�t t |� � � � S )N���z Graph contains a cycle at %s.) �set�nodes�pop�add�graph� Unfeasible�append�extend�list�reversed) �G�nbunch�seen�order�explored�v�fringe�w� new_nodes�ns �7/usr/lib/python3/dist-packages/pythran/types/reorder.py�topological_sortr sP � � �5�5�D� �E��u�u�H� �~������� � � �� ��=�=� ����� ��r� �A��H�}�}�� � � � � �� �H�H�Q�K�K�K��I��q�T� (� (���H�$�$��D�y�y� #� .� ;�a� ?� A� A� A� �$�$�Q�'�'�'��� �� � �i�(�(�(�(�� � �Q����� � �Q����� � � � � �' � ��( ����� � � � c �2 � � e Zd ZdZ� fd�Z� fd�Zd� Z� xZS )�Reorderr c �n �� t t | � � � t t � � dS )z' Trigger others analysis informations. N)�superr" �__init__r r )�self� __class__s �r r% zReorder.__init__3 s: �� � �g�t� � �%�%�&6�&?� A� A� A� A� Ar c �( �� t t | � � � |� � | j � t j � � }|r�t � � }|D ]�}t | j � |� � � � D ]8}t j | j ||� � r| j � ||� � �9|| j � |� � vr-|� | j � |� � � � ��|}|��dS dS )z@ Format type dependencies information to use if for reordering. N) r$ r" �prepare�type_dependencies� successorsr �NoDepsr � predecessorsr �has_path� remove_edger )r& �node� candidates�new_candidatesr �pr' s �r r) zReorder.prepare8 s& �� � �g�t� � �$�$�T�*�*�*��+�6�6� � #�%� %� �, � (� !�V�V�N� � P� P�� �d� 4� A� A�!� D� D�E�E� A� A�A� �~�d�&<�a��C�C� A� �.�:�:�1�a�@�@�@���D� 2� =� =�a� @� @�@�@�"�)�)�$�*@�*K�*K�A�*N�*N�O�O�O��'�J� � (� (� (� (� (r c �� � t � � }t � � }|j D ]G}t |t j � � r|� |� � �2|� |� � �H t | j | j � � }d� |D � � }n"# t j $ r t d� � �w xY wt |� � t |� � k s J d� � �||z |_ d| _ |S )z� Keep everything but function definition then add sorted functions. Most of the time, many function sort work so we use function calldepth as a "sort hint" to simplify typing. c �F � g | ] }t |t j � � � |�� S � )� isinstance�ast� FunctionDef)�.0�fs r � <listcomp>z(Reorder.visit_Module.<locals>.<listcomp>n s) � �J�J�J�A�:�a�� �+I�+I�J�a�J�J�Jr zInfinite function recursionz A function have been lost...T)r �bodyr7 r8 r9 r r r* �ordered_global_declarationsr r r r �update)r& r0 �newbody�olddef�stmt�newdefs r � visit_ModulezReorder.visit_Module\ s � � �&�&�������I� %� %�D��$���0�0� %�� � �d�#�#�#�#����t�$�$�$�$� D�%��&��0�2� 2�F� K�J��J�J�J�F�F��� � D� D� D�$�%B�C�C� C� D���� �6�{�{�c�&�k�k�)�)�)�+I�)�)�)��f�$�� ��� �� s �-&B � B3)�__name__� __module__� __qualname__�__doc__r% r) rD � __classcell__)r' s @r r" r" / sl �� � � � � �O�O�A� A� A� A� A� "(� "(� "(� "(� "(�H� � � � � � r r" )rH �gastr8 �pythran.analysesr �pythran.passmanagerr �pythran.syntaxr � pythran.types.type_dependenciesr � pythran.graphr r r" r6 r r �<module>rP s� �� K� K� � � � � 6� 6� 6� 6� 6� 6� .� .� .� .� .� .� -� -� -� -� -� -� <� <� <� <� <� <� � � � � � � !� !� !�FF� F� F� F� F�n� F� F� F� F� Fr
Save File
Cancel