2 # -*- coding: utf-8 -*-
3 ##############################################################################
5 # OpenERP, Open Source Management Solution
6 # Copyright (C) 2004-2009 Tiny SPRL (<http://tiny.be>).
8 # This program is free software: you can redistribute it and/or modify
9 # it under the terms of the GNU Affero General Public License as
10 # published by the Free Software Foundation, either version 3 of the
11 # License, or (at your option) any later version.
13 # This program is distributed in the hope that it will be useful,
14 # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 # GNU Affero General Public License for more details.
18 # You should have received a copy of the GNU Affero General Public License
19 # along with this program. If not, see <http://www.gnu.org/licenses/>.
21 ##############################################################################
23 from tools import flatten, reverse_enumerate
27 class expression(object):
29 parse a domain expression
30 use a real polish notation
31 leafs are still in a ('foo', '=', 'bar') format
32 For more info: http://christophe-simonis-at-tiny.blogspot.com/2008/08/new-new-domain-notation.html
35 def _is_operator(self, element):
36 return isinstance(element, (str, unicode)) and element in ['&', '|', '!']
38 def _is_leaf(self, element, internal=False):
39 OPS = ('=', '!=', '<>', '<=', '<', '>', '>=', '=?', '=like', '=ilike', 'like', 'not like', 'ilike', 'not ilike', 'in', 'not in', 'child_of')
40 INTERNAL_OPS = OPS + ('inselect',)
41 return (isinstance(element, tuple) or isinstance(element, list)) \
42 and len(element) == 3 \
43 and (((not internal) and element[1] in OPS) \
44 or (internal and element[1] in INTERNAL_OPS))
46 def __execute_recursive_in(self, cr, s, f, w, ids, op, type):
47 # todo: merge into parent query as sub-query
50 if op in ['<','>','>=','<=']:
51 cr.execute('SELECT "%s"' \
53 ' WHERE "%s" %s %s' % (s, f, w, op, ids[0]))
54 res.extend([r[0] for r in cr.fetchall()])
56 for i in range(0, len(ids), cr.IN_MAX):
57 subids = ids[i:i+cr.IN_MAX]
58 cr.execute('SELECT "%s"' \
60 ' WHERE "%s" in (%s)' % (s, f, w, ','.join(['%s']*len(subids))),
62 res.extend([r[0] for r in cr.fetchall()])
64 cr.execute('SELECT distinct("%s")' \
65 ' FROM "%s" where "%s" is not null' % (s, f, s)),
66 res.extend([r[0] for r in cr.fetchall()])
69 def __init__(self, exp):
70 # check if the expression is valid
71 if not reduce(lambda acc, val: acc and (self._is_operator(val) or self._is_leaf(val)), exp, True):
72 raise ValueError('Bad domain expression: %r' % (exp,))
74 self.__tables = {} # used to store the table to use for the sql generation. key = index of the leaf
76 self.__main_table = None # 'root' table. set by parse()
77 self.__DUMMY_LEAF = (1, '=', 1) # a dummy leaf that must not be parsed or sql generated
80 def parse(self, cr, uid, table, context):
81 """ transform the leafs of the expression """
85 def _rec_get(ids, table, parent=None, left='id', prefix=''):
86 if table._parent_store and (not table.pool._init):
87 # TODO: Improve where joins are implemented for many with '.', replace by:
88 # doms += ['&',(prefix+'.parent_left','<',o.parent_right),(prefix+'.parent_left','>=',o.parent_left)]
90 for o in table.browse(cr, uid, ids, context=context):
93 doms += ['&', ('parent_left', '<', o.parent_right), ('parent_left', '>=', o.parent_left)]
95 return [(left, 'in', table.search(cr, uid, doms, context=context))]
98 def rg(ids, table, parent):
101 ids2 = table.search(cr, uid, [(parent, 'in', ids)], context=context)
102 return ids + rg(ids2, table, parent)
103 return [(left, 'in', rg(ids, table, parent or table._parent_name))]
105 self.__main_table = table
108 while i + 1<len(self.__exp):
111 if self._is_operator(e) or e == self.__DUMMY_LEAF:
113 left, operator, right = e
114 working_table = table
116 fargs = left.split('.', 1)
118 if fargs[0] in table._inherit_fields:
120 field = main_table._columns.get(fargs[0], False)
122 working_table = main_table
123 self.__tables[i] = working_table
125 working_table = main_table.pool.get(main_table._inherit_fields[fargs[0]][0])
126 if working_table not in self.__tables.values():
127 self.__joins.append(('%s.%s=%s.%s' % (working_table._table, 'id', main_table._table, main_table._inherits[working_table._name]), working_table._table))
128 self.__tables[index] = working_table
130 main_table = working_table
132 field = working_table._columns.get(fargs[0], False)
134 if left == 'id' and operator == 'child_of':
135 dom = _rec_get(right, working_table)
136 self.__exp = self.__exp[:i] + dom + self.__exp[i+1:]
139 field_obj = table.pool.get(field._obj)
141 if field._type == 'many2one':
142 right = field_obj.search(cr, uid, [(fargs[1], operator, right)], context=context)
143 self.__exp[i] = (fargs[0], 'in', right)
144 # Making search easier when there is a left operand as field.o2m or field.m2m
145 if field._type in ['many2many','one2many']:
146 right = field_obj.search(cr, uid, [(fargs[1], operator, right)], context=context)
147 right1 = table.search(cr, uid, [(fargs[0],'in', right)], context=context)
148 self.__exp[i] = ('id', 'in', right1)
151 if field._properties and ((not field.store) or field._fnct_search):
152 # this is a function field
153 if not field._fnct_search:
154 # the function field doesn't provide a search function and doesn't store
155 # values in the database, so we must ignore it : we generate a dummy leaf
156 self.__exp[i] = self.__DUMMY_LEAF
158 subexp = field.search(cr, uid, table, left, [self.__exp[i]], context=context)
159 # we assume that the expression is valid
160 # we create a dummy leaf for forcing the parsing of the resulting expression
162 self.__exp.insert(i + 1, self.__DUMMY_LEAF)
163 for j, se in enumerate(subexp):
164 self.__exp.insert(i + 2 + j, se)
165 # else, the value of the field is store in the database, so we search on it
167 elif field._type == 'one2many':
168 # Applying recursivity on field(one2many)
169 if operator == 'child_of':
170 if isinstance(right, basestring):
171 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], 'like', context=context, limit=None)]
174 if field._obj != working_table._name:
175 dom = _rec_get(ids2, field_obj, left=left, prefix=field._obj)
177 dom = _rec_get(ids2, working_table, parent=left)
178 self.__exp = self.__exp[:i] + dom + self.__exp[i+1:]
184 if isinstance(right, basestring):
185 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], operator, context=context, limit=None)]
189 if not isinstance(right,list):
194 if operator in ['like','ilike','in','=']:
195 #no result found with given search criteria
197 self.__exp[i] = ('id','=',0)
200 operator = 'in' # operator changed because ids are directly related to main object
204 if operator in ['not like','not ilike','not in','<>','!=']:
206 self.__exp[i] = ('id', o2m_op, self.__execute_recursive_in(cr, field._fields_id, field_obj._table, 'id', ids2, operator, field._type))
210 if operator in ['not like','not ilike','not in','<>','!=']:
212 self.__exp[i] = ('id', o2m_op, self.__execute_recursive_in(cr, field._fields_id, field_obj._table, 'id', [], operator, field._type) or [0])
214 elif field._type == 'many2many':
216 if operator == 'child_of':
217 if isinstance(right, basestring):
218 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], 'like', context=context, limit=None)]
222 def _rec_convert(ids):
223 if field_obj == table:
225 return self.__execute_recursive_in(cr, field._id1, field._rel, field._id2, ids, operator, field._type)
227 dom = _rec_get(ids2, field_obj)
228 ids2 = field_obj.search(cr, uid, dom, context=context)
229 self.__exp[i] = ('id', 'in', _rec_convert(ids2))
233 if isinstance(right, basestring):
234 res_ids = [x[0] for x in field_obj.name_search(cr, uid, right, [], operator, context=context)]
238 if not isinstance(right, list):
243 if operator in ['like','ilike','in','=']:
244 #no result found with given search criteria
245 call_null_m2m = False
246 self.__exp[i] = ('id','=',0)
249 operator = 'in' # operator changed because ids are directly related to main object
251 call_null_m2m = False
253 if operator in ['not like','not ilike','not in','<>','!=']:
256 self.__exp[i] = ('id', m2m_op, self.__execute_recursive_in(cr, field._id1, field._rel, field._id2, res_ids, operator, field._type) or [0])
259 if operator in ['not like','not ilike','not in','<>','!=']:
261 self.__exp[i] = ('id', m2m_op, self.__execute_recursive_in(cr, field._id1, field._rel, field._id2, [], operator, field._type) or [0])
263 elif field._type == 'many2one':
264 if operator == 'child_of':
265 if isinstance(right, basestring):
266 ids2 = [x[0] for x in field_obj.name_search(cr, uid, right, [], 'like', limit=None)]
267 elif isinstance(right, (int, long)):
272 self.__operator = 'in'
273 if field._obj != working_table._name:
274 dom = _rec_get(ids2, field_obj, left=left, prefix=field._obj)
276 dom = _rec_get(ids2, working_table, parent=left)
277 self.__exp = self.__exp[:i] + dom + self.__exp[i+1:]
279 if isinstance(right, basestring): # and not isinstance(field, fields.related):
281 c['active_test'] = False
282 res_ids = field_obj.name_search(cr, uid, right, [], operator, limit=None, context=c)
283 right = map(lambda x: x[0], res_ids)
284 self.__exp[i] = (left, 'in', right)
287 # add the time part to datetime field when it's not there:
288 if field._type == 'datetime' and self.__exp[i][2] and len(self.__exp[i][2]) == 10:
290 self.__exp[i] = list(self.__exp[i])
292 if operator in ('>', '>='):
293 self.__exp[i][2] += ' 00:00:00'
294 elif operator in ('<', '<='):
295 self.__exp[i][2] += ' 23:59:59'
297 self.__exp[i] = tuple(self.__exp[i])
300 if operator in ('like', 'ilike', 'not like', 'not ilike'):
301 right = '%%%s%%' % right
303 operator = operator == '=like' and 'like' or operator
305 query1 = '( SELECT res_id' \
306 ' FROM ir_translation' \
311 #Covering in,not in operators with operands (%s,%s) ,etc.
312 if operator in ['in','not in']:
313 instr = ','.join(['%s'] * len(right))
314 query1 += ' AND value ' + operator + ' ' +" (" + instr + ")" \
317 ' FROM "' + working_table._table + '"' \
318 ' WHERE "' + left + '" ' + operator + ' ' +" (" + instr + "))"
320 query1 += ' AND value ' + operator + instr + \
323 ' FROM "' + working_table._table + '"' \
324 ' WHERE "' + left + '" ' + operator + instr + ")"
326 query2 = [working_table._name + ',' + left,
327 context.get('lang', False) or 'en_US',
333 self.__exp[i] = ('id', 'inselect', (query1, query2))
337 def __leaf_to_sql(self, leaf, table):
338 if leaf == self.__DUMMY_LEAF:
340 left, operator, right = leaf
342 if operator == 'inselect':
343 query = '(%s.%s in (%s))' % (table._table, left, right[0])
345 elif operator in ['in', 'not in']:
346 params = right and right[:] or []
347 len_before = len(params)
348 for i in range(len_before)[::-1]:
349 if params[i] == False:
352 len_after = len(params)
353 check_nulls = len_after != len_before
358 instr = ','.join(['%s'] * len_after)
360 instr = ','.join([table._columns[left]._symbol_set[0]] * len_after)
361 query = '(%s.%s %s (%s))' % (table._table, left, operator, instr)
363 # the case for [field, 'in', []] or [left, 'not in', []]
365 query = '(%s.%s IS NULL)' % (table._table, left)
367 query = '(%s.%s IS NOT NULL)' % (table._table, left)
369 query = '(%s OR %s.%s IS NULL)' % (query, table._table, left)
373 if right == False and (leaf[0] in table._columns) and table._columns[leaf[0]]._type=="boolean" and (operator == '='):
374 query = '(%s.%s IS NULL or %s.%s = false )' % (table._table, left,table._table, left)
375 elif (((right == False) and (type(right)==bool)) or (right is None)) and (operator == '='):
376 query = '%s.%s IS NULL ' % (table._table, left)
377 elif right == False and (leaf[0] in table._columns) and table._columns[leaf[0]]._type=="boolean" and (operator in ['<>', '!=']):
378 query = '(%s.%s IS NOT NULL and %s.%s != false)' % (table._table, left,table._table, left)
379 elif (((right == False) and (type(right)==bool)) or right is None) and (operator in ['<>', '!=']):
380 query = '%s.%s IS NOT NULL' % (table._table, left)
381 elif (operator == '=?'):
383 if (right is False or right is None):
385 if left in table._columns:
386 format = table._columns[left]._symbol_set[0]
387 query = '(%s.%s %s %s)' % (table._table, left, op, format)
388 params = table._columns[left]._symbol_set[1](right)
390 query = "(%s.%s %s '%%s')" % (table._table, left, op)
395 query = '%s.id %s %%s' % (table._table, operator)
398 like = operator in ('like', 'ilike', 'not like', 'not ilike')
400 op = {'=like':'like','=ilike':'ilike'}.get(operator,operator)
401 if left in table._columns:
402 format = like and '%s' or table._columns[left]._symbol_set[0]
403 query = '(%s.%s %s %s)' % (table._table, left, op, format)
405 query = "(%s.%s %s '%s')" % (table._table, left, op, right)
409 if isinstance(right, str):
411 elif isinstance(right, unicode):
412 str_utf8 = right.encode('utf-8')
414 str_utf8 = str(right)
415 params = '%%%s%%' % str_utf8
416 add_null = not str_utf8
417 elif left in table._columns:
418 params = table._columns[left]._symbol_set[1](right)
421 query = '(%s OR %s IS NULL)' % (query, left)
423 if isinstance(params, basestring):
425 return (query, params)
431 for i, e in reverse_enumerate(self.__exp):
432 if self._is_leaf(e, internal=True):
433 table = self.__tables.get(i, self.__main_table)
434 q, p = self.__leaf_to_sql(e, table)
439 stack.append('(NOT (%s))' % (stack.pop(),))
441 ops = {'&': ' AND ', '|': ' OR '}
444 stack.append('(%s %s %s)' % (q1, ops[e], q2,))
446 query = ' AND '.join(reversed(stack))
447 joins = ' AND '.join(map(lambda j: j[0], self.__joins))
449 query = '(%s) AND (%s)' % (joins, query)
450 return (query, flatten(params))
452 def get_tables(self):
453 return ['"%s"' % t._table for t in set(self.__tables.values()+[self.__main_table])]
455 # vim:expandtab:smartindent:tabstop=4:softtabstop=4:shiftwidth=4: