Lines Matching refs:closure
190 # Compute the transitive closure
194 # Out: transitive closure of all modules from those in $1. Always includes
203 -ndk-mod-get-closure = $(strip \
209 $(call -ndk-mod-closure-visit,$(_ndk_mod_module))\
211 $(call -ndk-mod-closure-recursive)\
216 # Used internally to visit a new node during -ndk-mod-get-closure.
218 -ndk-mod-closure-visit = \
222 -ndk-mod-closure-recursive = \
228 $(call -ndk-mod-closure-visit,$(_ndk_mod_dep))\
231 $(if $(_ndk_mod_wq),$(call -ndk-mod-closure-recursive))
233 -test-ndk-mod-get-closure.empty = \
235 $(call test-expect,,$(call -ndk-mod-get-closure,,-local-deps))
237 -test-ndk-mod-get-closure.single = \
240 $(call test-expect,A,$(call -ndk-mod-get-closure,A,-local-deps))
242 -test-ndk-mod-get-closure.double = \
246 $(call test-expect,A B,$(call -ndk-mod-get-closure,A,-local-deps))
248 -test-ndk-mod-get-closure.circular-deps = \
253 $(call test-expect,A B C,$(call -ndk-mod-get-closure,A,-local-deps))
255 -test-ndk-mod-get-closure.ABCDE = \
262 $(call test-expect,A B C D E,$(call -ndk-mod-get-closure,A,-local-deps))
307 # Return the topologically ordered closure of all nodes from a top-level
321 $(eval _ndk_mod_nodes := $(call -ndk-mod-get-closure,$1,$2))\
329 # Given a closure list of nodes, count their incoming edges.
330 # $1: list of nodes, must be a graph closure.
399 # Return the topologically ordered closure of all dependencies from a
