code like sqare root or inverse square root can be coded by just utilizing the rsqrtps and sqrtps opcodes, with a 14 bit precision, when working on the sse unit ...
14bit precision would leave a lot to be desired in Pd. Are there high precision operators?
From what i recall, the opcodes are meant to be used iteratively (like in root-finding), then yielding full precision.
Is complying with -fstrict-aliasing enough to take care of the aliasing issues? Do you have any examples of handling alignment issues?
I posted an example of autovectorizing code taking that into account a while ago http://lists.puredata.info/pipermail/pd-dev/2006-11/007880.html
greetings, Thomas