���5��^/n��)�Fݱ��T9�:e��V+KyyiM9��rN��|��ix���~��5]����o�dQ Z]���BѪ� 5w�m����J�r�fWZl�a��� ���гӃj�E�0>��/Sഏ���7�S�F��=O�n�vQ���`���T�G�e]!|4aO2�Q���o-ua�֛����-'bR3�[���� ?��}���t K�a�(6J�é�+/=�*yC=�ʄX�G��U�3 �j���F�� ma��{�o���η�?�mE� 2n���3`�R��vSQ���F�������������H����zg��J�m�$ ���ң1��֦�4-|���'���;�^Y�&�jW�������ؔ� ��A|�l�pxiBo�%vZ��`G�O��f��m�K�79�7?z�7A,u�����$����&��?̼��q�$�-HIfj�-����(,��%2���n��֑J�56y�u�RR�aXsK� Q}o���K��cOPr����T��9 h/�rB��d �c� ����V�Ǥ�������*...

rLUk9TiRodZL2vG70t5HtfG8gfZZa88ZU+mNFctKy6lvROUbQc/hhqfK0GqfvEyN
BjNaooXlkDWgYlwWTvDjovoDGrQscbNYLN57C9saD+veIR8GdwYDsMnvmfzAuU8L
hij+0rnq49qlw0dpEuDb8PYZi+17cNcC1u2HGCgsBCRMd+RIihrGO5rUD8r6ddIB
QFqNeb+Lz0vPqhbBleStTIo+F5HUsWLlguWABKQDfo2/2n+iD5dPDNMN+9fR5XJ+
HMh3/1uaD7euBUbl8agW7EekFwIDAQABo4H2MIHzMIGwBgNVHREEgagwgaWBD2lu
Zm9AaXplbnBlLmNvbaSBkTCBjjFHMEUGA1UECgw+SVpFTlBFIFMuQS4gLSBDSUYg
QTAxMzM3MjYwLVJNZXJjLlZpdG9yaWEtR2FzdGVpeiBUMTA1NSBGNjIgUzgxQzBB

//===----------------------------------------------------------------------===//

int64_t L2NormalizationOp::GetArithmeticCount(Operation* op) {
  int64_t count;
  // Computing the squared L2 norm is N multiply-adds so 2N ops,
  // then the single inverse-sqrt is negligible, then we multiply each
  // value by the resulting multiplier, so an extra N ops. count 3N ops.
  if (ArithmeticCountUtilHelper::GetFirstOutputCount(op, &count)) {