157 lines
3.6 KiB
Python
157 lines
3.6 KiB
Python
# This file is part of 'NTLM Authorization Proxy Server' http://sourceforge.net/projects/ntlmaps/
|
|
# Copyright 2001 Dmitry A. Rozmanov <dima@xenon.spb.ru>
|
|
#
|
|
# This library is free software: you can redistribute it and/or
|
|
# modify it under the terms of the GNU Lesser General Public
|
|
# License as published by the Free Software Foundation, either
|
|
# version 3 of the License, or (at your option) any later version.
|
|
|
|
# This library is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
# Lesser General Public License for more details.
|
|
|
|
# You should have received a copy of the GNU Lesser General Public
|
|
# License along with this library. If not, see <http://www.gnu.org/licenses/> or <http://www.gnu.org/licenses/lgpl.txt>.
|
|
|
|
from __future__ import division
|
|
import six
|
|
|
|
C = 0x1000000000
|
|
|
|
|
|
def norm(n):
|
|
return n & 0xFFFFFFFF
|
|
|
|
|
|
class U32:
|
|
v = 0
|
|
|
|
def __init__(self, value=0):
|
|
if not isinstance(value, six.integer_types):
|
|
value = six.byte2int(value)
|
|
|
|
self.v = C + norm(abs(int(value)))
|
|
|
|
def set(self, value=0):
|
|
self.v = C + norm(abs(int(value)))
|
|
|
|
def __repr__(self):
|
|
return hex(norm(self.v))
|
|
|
|
def __long__(self):
|
|
return int(norm(self.v))
|
|
|
|
def __int__(self):
|
|
return int(norm(self.v))
|
|
|
|
def __chr__(self):
|
|
return chr(norm(self.v))
|
|
|
|
def __add__(self, b):
|
|
r = U32()
|
|
r.v = C + norm(self.v + b.v)
|
|
return r
|
|
|
|
def __sub__(self, b):
|
|
r = U32()
|
|
if self.v < b.v:
|
|
r.v = C + norm(0x100000000 - (b.v - self.v))
|
|
else:
|
|
r.v = C + norm(self.v - b.v)
|
|
return r
|
|
|
|
def __mul__(self, b):
|
|
r = U32()
|
|
r.v = C + norm(self.v * b.v)
|
|
return r
|
|
|
|
def __div__(self, b):
|
|
r = U32()
|
|
r.v = C + (norm(self.v) // norm(b.v))
|
|
return r
|
|
|
|
def __truediv__(self, b):
|
|
r = U32()
|
|
r.v = C + (norm(self.v) / norm(b.v))
|
|
return r
|
|
|
|
def __mod__(self, b):
|
|
r = U32()
|
|
r.v = C + (norm(self.v) % norm(b.v))
|
|
return r
|
|
|
|
def __neg__(self):
|
|
return U32(self.v)
|
|
|
|
def __pos__(self):
|
|
return U32(self.v)
|
|
|
|
def __abs__(self):
|
|
return U32(self.v)
|
|
|
|
def __invert__(self):
|
|
r = U32()
|
|
r.v = C + norm(~self.v)
|
|
return r
|
|
|
|
def __lshift__(self, b):
|
|
r = U32()
|
|
r.v = C + norm(self.v << b)
|
|
return r
|
|
|
|
def __rshift__(self, b):
|
|
r = U32()
|
|
r.v = C + (norm(self.v) >> b)
|
|
return r
|
|
|
|
def __and__(self, b):
|
|
r = U32()
|
|
r.v = C + norm(self.v & b.v)
|
|
return r
|
|
|
|
def __or__(self, b):
|
|
r = U32()
|
|
r.v = C + norm(self.v | b.v)
|
|
return r
|
|
|
|
def __xor__(self, b):
|
|
r = U32()
|
|
r.v = C + norm(self.v ^ b.v)
|
|
return r
|
|
|
|
def __not__(self):
|
|
return U32(not norm(self.v))
|
|
|
|
def truth(self):
|
|
return norm(self.v)
|
|
|
|
def __cmp__(self, b):
|
|
if norm(self.v) > norm(b.v):
|
|
return 1
|
|
elif norm(self.v) < norm(b.v):
|
|
return -1
|
|
else:
|
|
return 0
|
|
|
|
def __lt__(self, other):
|
|
return self.v < other.v
|
|
|
|
def __gt__(self, other):
|
|
return self.v > other.v
|
|
|
|
def __eq__(self, other):
|
|
return self.v == other.v
|
|
|
|
def __le__(self, other):
|
|
return self.v <= other.v
|
|
|
|
def __ge__(self, other):
|
|
return self.v >= other.v
|
|
|
|
def __ne__(self, other):
|
|
return self.v != other.v
|
|
|
|
def __nonzero__(self):
|
|
return norm(self.v)
|