Lines Matching refs:v1
73 static int p_termless(value v1, type t1, value v2, type t2),
74 p_termlesseq(value v1, type t1, value v2, type t2),
75 p_termgreater(value v1, type t1, value v2, type t2),
76 p_termgreatereq(value v1, type t1, value v2, type t2),
77 p_unify(value v1, type t1, value v2, type t2, value vl, type tl),
82 p_compare_instances4(value vr, type tr, value v1, type t1, value v2, type t2, value vl, type tl),
83 p_merge5(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2, value v, type t),
84 p_number_merge5(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2, value v, type t),
85 p_sort4(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2),
86 p_array_sort(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2),
87 p_number_sort4(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2);
89 static int _instance(int rel, value v1, type t1, value v2, type t2, pword *meta);
130 p_termless(value v1, type t1, value v2, type t2)
132 Succeed_If(ec_compare_terms(v1, t1, v2, t2) < 0);
139 p_termlesseq(value v1, type t1, value v2, type t2)
141 Succeed_If(ec_compare_terms(v1, t1, v2, t2) <= 0);
148 p_termgreater(value v1, type t1, value v2, type t2)
150 Succeed_If(ec_compare_terms(v1, t1, v2, t2) > 0);
157 p_termgreatereq(value v1, type t1, value v2, type t2)
159 Succeed_If(ec_compare_terms(v1, t1, v2, t2) >= 0);
169 p_unify(value v1, type t1, value v2, type t2, value vl, type tl)
174 res = ec_unify_(v1, t1, v2, t2, &list);
191 compare_strings(value v1, value v2)
193 register word len = StringLength(v1);
194 register unsigned char *s1 = (unsigned char *) StringStart(v1);
204 return StringLength(v1) - StringLength(v2);
211 ec_compare_terms(value v1, type t1, value v2, type t2)
220 return IsRef(t2) ? v1.ptr - v2.ptr : LESS;
239 return v1.nint < v2.nint ? LESS :
240 v1.nint > v2.nint ? GREATER : 0;
246 (void) arith_compare(v1, t1, v2, t2, &res);
250 return compare_strings(v1, v2);
257 return IsNil(t2) ? strcmp(DidName(v1.did), DidName(d_.nil)) :
258 strcmp(DidName(v1.did), DidName(v2.did));
263 if (v1.ptr == v2.ptr)
281 wdid = v1.ptr->val.did; /* wdid != d_.list */
290 if (v1.ptr == v2.ptr)
292 wdid = (v1.ptr++)->val.did;
302 _compare_args_: /* (arity, v1, v2) */
305 arg1 = v1.ptr++;
318 v1.all = arg1->val.all;
326 return tag_desc[TagType(t1)].compare(v1, v2);
486 value v1, type t1,
499 code = _instance(ANY_INST, v1, t1, v2, t2, &list);
515 if (!_instance(EQ,v1,t1,v2,t2, &list))
520 code = _instance(EQ|LT,v1,t1,v2,t2, &list);
525 code = _instance(EQ|GT,v1,t1,v2,t2, &list);
543 _instantiate(value v1, type t1)
552 if (IsVar(t1)) Trail_(v1.ptr) else Trail_Tag(v1.ptr);
553 v1.ptr->tag.kernel = TVARNUM;
558 arity = DidArity(v1.ptr->val.did);
559 v1.ptr++;
568 arg1 = v1.ptr++;
574 v1.all = arg1->val.all; /* tail recursion */
587 value v1, type t1,
601 arg1[0].val.ptr = v1.ptr;
615 if (v1.ptr != v2.ptr)
617 if (IsVar(t1)) Trail_(v1.ptr) else Trail_Tag(v1.ptr);
619 v1.ptr->tag.kernel = TVARNUM;
621 v2.ptr->val.ptr = v1.ptr;
632 if (!IsTag(v1.ptr->tag.kernel, TVARNUM))
634 if (IsVar(t1)) Trail_(v1.ptr) else Trail_Tag(v1.ptr);
639 v1.ptr->val.all = v2.all;
640 v1.ptr->tag.all = t2.all;
647 _instantiate(v1, t1);
655 v2.ptr->val.all = v1.all;
661 if (IsTag(t2.kernel, TVARNUM) && v1.ptr == v2.ptr)
665 if (OccurCheckEnabled() && ec_occurs(v1, t1, v2, t2))
668 v1.ptr->val.all = v2.all;
669 v1.ptr->tag.all = t2.all;
674 if (OccurCheckEnabled() && ec_occurs(v2, t2, v1, t1))
677 v2.ptr->val.all = v1.all;
691 if (!IsTag(t2.kernel, TCOMP) || v1.ptr->val.did != v2.ptr->val.did)
693 arity = DidArity(v1.ptr->val.did);
694 v1.ptr++;
699 return (IsString(t2) && !compare_strings(v1, v2)) ? rel : 0;
708 return (SameType(t1, t2) && SimpleEq(t1.kernel, v1, v2)) ? rel : 0;
714 tag_desc[TagType(t1)].equal(v1.ptr, v2.ptr))
725 if (v1.ptr == v2.ptr) /* detect sharing */
730 arg1 = v1.ptr++;
743 v1.all = arg1->val.all; /* tail recursion */
829 * v1,t1 a list or nil (the input list)
873 p_sort4(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2)
892 list = ec_keysort(v1, vk, tk, reverse, keep_duplicates, number_sort, &err);
906 * v1,t1 a list or nil (the input list)
922 p_number_sort4(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2)
957 list = ec_keysort(v1, vk, tk, reverse, keep_duplicates, TRUE, &err);
977 p_array_sort(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2)
986 Check_Array_Or_Nil(v1, t1, &arity);
995 if(IsNil(t1) || ArraySize(v1) < 2)
997 Return_Unify_Pw(v2, t2, v1, t1); /* nothing to sort */
1006 *list = v1.ptr[i];
1009 *list = v1.ptr[i];
1058 ec_keysort(value v1, value vk, type tk, int reverse, int keep_duplicates, int number_sort, int *err)
1071 * We first split the list (v1, t1) into two lists list1 and list2.
1076 h1 = v1.ptr;
1402 * v1,t1 a list or nil (input list)
1417 value v1, type t1, value v2, type t2, value v, type t,
1440 Return_Unify_Pw(v1, t1, v, t);
1444 h1 = v1.ptr;
1572 p_merge5(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2, value v, type t)
1576 return _merge(vk, tk, v1, t1, v2, t2, v, t, reverse, keep_duplicates, number_sort);
1581 p_number_merge5(value vk, type tk, value vo, type to, value v1, type t1, value v2, type t2, value v, type t)
1600 return _merge(vk, tk, v1, t1, v2, t2, v, t, reverse, keep_duplicates, TRUE);