Searched refs:Moving (Results 1 – 18 of 18) sorted by relevance
34 use case. Moving the NPI port to an external switch port is hardware possible,
186 - Moving host-specific pattern matching from string_match() to the
4806 bool Moving = ImplicitInitKind == IIK_Move; in BuildImplicitBaseInitializer() local4823 if (Moving) { in BuildImplicitBaseInitializer()4831 Moving ? VK_XValue : VK_LValue, in BuildImplicitBaseInitializer()4876 bool Moving = ImplicitInitKind == IIK_Move; in BuildImplicitMemberInitializer() local4891 if (Moving) { in BuildImplicitMemberInitializer()
1363 Edward M. Reingold A Nonrecursive List Moving Algorithm . . 305--3072433 Douglas W. Clark An Efficient List Moving Algorithm Using
10012 title = "A Nonrecursive List Moving Algorithm",18484 title = "An Efficient List Moving Algorithm Using constant Workspace",
1783 // Moving 32-bit values between GPRs and FPRs can be done using VLVGF
5171 # time. Moving up from 0x10000000 also allows more sbrk(2) space.6898 # time. Moving up from 0x10000000 also allows more sbrk(2) space.
5192 # time. Moving up from 0x10000000 also allows more sbrk(2) space.6921 # time. Moving up from 0x10000000 also allows more sbrk(2) space.
5193 # time. Moving up from 0x10000000 also allows more sbrk(2) space.6922 # time. Moving up from 0x10000000 also allows more sbrk(2) space.
5195 # time. Moving up from 0x10000000 also allows more sbrk(2) space.6923 # time. Moving up from 0x10000000 also allows more sbrk(2) space.
5180 # time. Moving up from 0x10000000 also allows more sbrk(2) space.6903 # time. Moving up from 0x10000000 also allows more sbrk(2) space.
5209 # time. Moving up from 0x10000000 also allows more sbrk(2) space.6933 # time. Moving up from 0x10000000 also allows more sbrk(2) space.
2249 # Moving-Picture Exchange (DPX), v1.0, 18 February 1994
1476 # observing religious ceremonies. Moving time one hour forward in summer
4378 // Moving from XMM to XMM and clear upper 64 bits. Note, there is a bug in