48 lines
1.4 KiB
Python
48 lines
1.4 KiB
Python
|
# SPDX-License-Identifier: GPL-2.0-or-later
|
||
|
|
|
||
|
|
from typing import Dict, Set
|
||
|
|
import bpy
|
||
|
|
from bpy.types import ID
|
||
|
|
|
||
|
|
|
||
|
|
__all__ = (
|
||
|
|
"get_id_reference_map",
|
||
|
|
"get_all_referenced_ids",
|
||
|
|
)
|
||
|
|
|
||
|
|
|
||
|
|
def get_id_reference_map() -> Dict[ID, Set[ID]]:
|
||
|
|
"""Return a dictionary of direct datablock references for every datablock in the blend file."""
|
||
|
|
inv_map = {}
|
||
|
|
for key, values in bpy.data.user_map().items():
|
||
|
|
for value in values:
|
||
|
|
if value == key:
|
||
|
|
# So an object is not considered to be referencing itself.
|
||
|
|
continue
|
||
|
|
inv_map.setdefault(value, set()).add(key)
|
||
|
|
return inv_map
|
||
|
|
|
||
|
|
|
||
|
|
def recursive_get_referenced_ids(
|
||
|
|
ref_map: Dict[ID, Set[ID]], id: ID, referenced_ids: Set, visited: Set
|
||
|
|
):
|
||
|
|
"""Recursively populate referenced_ids with IDs referenced by id."""
|
||
|
|
if id in visited:
|
||
|
|
# Avoid infinite recursion from circular references.
|
||
|
|
return
|
||
|
|
visited.add(id)
|
||
|
|
for ref in ref_map.get(id, []):
|
||
|
|
referenced_ids.add(ref)
|
||
|
|
recursive_get_referenced_ids(
|
||
|
|
ref_map=ref_map, id=ref, referenced_ids=referenced_ids, visited=visited
|
||
|
|
)
|
||
|
|
|
||
|
|
|
||
|
|
def get_all_referenced_ids(id: ID, ref_map: Dict[ID, Set[ID]]) -> Set[ID]:
|
||
|
|
"""Return a set of IDs directly or indirectly referenced by id."""
|
||
|
|
referenced_ids = set()
|
||
|
|
recursive_get_referenced_ids(
|
||
|
|
ref_map=ref_map, id=id, referenced_ids=referenced_ids, visited=set()
|
||
|
|
)
|
||
|
|
return referenced_ids
|