Searched refs:l1 (Results 1 - 25 of 39) sorted by relevance

12

/haiku-fatelf/src/libs/agg/src/
H A Dagg_line_aa_basics.cpp51 void bisectrix(const line_parameters& l1, argument
55 double k = double(l2.len) / double(l1.len);
56 double tx = l2.x2 - (l2.x1 - l1.x1) * k;
57 double ty = l2.y2 - (l2.y1 - l1.y1) * k;
60 //If the next point is on the left (l1 => l2.2)
62 if(double(l2.x2 - l2.x1) * double(l2.y1 - l1.y1) <
63 double(l2.y2 - l2.y1) * double(l2.x1 - l1.x1) + 100.0)
74 *x = (l2.x1 + l2.x1 + (l2.y1 - l1.y1) + (l2.y2 - l2.y1)) >> 1;
75 *y = (l2.y1 + l2.y1 - (l2.x1 - l1.x1) - (l2.x2 - l2.x1)) >> 1;
/haiku-fatelf/src/bin/diffutils/src/
H A Ded.c43 lin f0, l0, f1, l1;
51 changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1);
65 for (i = f1; i <= l1; i++)
97 lin i, f0, l0, f1, l1;
100 enum changes changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1);
118 for (i = f1; i <= l1; i++)
140 lin i, f0, l0, f1, l1;
144 enum changes changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1);
165 translate_range (&files[1], f1, l1, &tf1, &tl1);
169 for (i = f1; i <= l1;
42 lin f0, l0, f1, l1; local
95 lin i, f0, l0, f1, l1; local
137 lin i, f0, l0, f1, l1; local
[all...]
H A Dcmp.c572 word const *l0, *l1; /* Pointers into each buffer. */
585 for (l0 = p0, l1 = p1; (l = *l0) == *l1; l0++, l1++)
597 for (c0 = (char const *) l0, c1 = (char const *) l1;
616 word const *l0, *l1;
622 for (l0 = p0, l1 = p1; *l0 == *l1; l0++, l1++)
627 for (c0 = (char const *) l0, c1 = (char const *) l1;
567 word const *l0, *l1; /* Pointers into each buffer. */ local
610 word const *l0, *l1; local
[all...]
H A Dutil.c660 lin l0, l1;
680 l1 = next->line1 + next->inserted - 1;
694 for (i = next->line1; i <= l1 && trivial; i++)
707 *last1 = l1;
651 lin l0, l1; local
/haiku-fatelf/src/libs/fluidsynth/src/
H A Dfluid_list.c163 fluid_list_sort_merge(fluid_list_t *l1, fluid_list_t *l2, fluid_compare_func_t compare_func) argument
169 while (l1 && l2) {
170 if (compare_func(l1->data,l2->data) < 0) {
171 l = l->next = l1;
172 l1 = l1->next;
178 l->next= l1 ? l1 : l2;
186 fluid_list_t *l1, *l2; local
195 l1
[all...]
/haiku-fatelf/src/system/libroot/posix/crypt/
H A Dcrypt.c41 ufc_long *_ufc_doit(l1, l2, r1, r2, itr)
42 ufc_long l1, l2, r1, r2, itr;
54 l1 ^= SBA(sb1, s & 0xffff); l2 ^= SBA(sb1, (s & 0xffff)+4);
55 l1 ^= SBA(sb0, s >>= 16); l2 ^= SBA(sb0, (s) +4);
57 l1 ^= SBA(sb3, s & 0xffff); l2 ^= SBA(sb3, (s & 0xffff)+4);
58 l1 ^= SBA(sb2, s >>= 16); l2 ^= SBA(sb2, (s) +4);
60 s = *k++ ^ l1;
67 s=l1; l1=r1; r1=s; s=l2; l2=r2; r2=s;
69 ary[0] = l1; ar
[all...]
H A Dcrypt_util.c657 ufc_long *_ufc_dofinalperm(l1, l2, r1, r2)
658 ufc_long l1,l2,r1,r2;
662 x = (l1 ^ l2) & current_saltbits; l1 ^= x; l2 ^= x;
665 v1=v2=0; l1 >>= 3; l2 >>= 3; r1 >>= 3; r2 >>= 3;
682 v1 |= efp[ 3][ l1 & 0x3f][0]; v2 |= efp[ 3][ l1 & 0x3f][1];
683 v1 |= efp[ 2][(l1 >>= 6) & 0x3f][0]; v2 |= efp[ 2][ l1 & 0x3f][1];
684 v1 |= efp[ 1][(l1 >>
783 { ufc_long l1, l2, r1, r2, *s; local
[all...]
/haiku-fatelf/headers/os/bluetooth/
H A DLinkKeyUtils.h44 int l0, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11, l12, l13, l14, l15; local
46 "%2X:%2X:%2X:%2X:%2X:%2X:%2X:%2X", &l0, &l1, &l2, &l3,
51 return (linkkey_t){{l0, l1, l2, l3, l4, l5, l6, l7, l8,
/haiku-fatelf/src/kits/network/libbind/dst/
H A Dmd5_locl.h119 #define l2cn(l1,l2,c,n) { \
126 case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
127 case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
128 case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
129 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Dbit-ops.c49 unsigned char l1 = line[single_length]; local
50 if (l0 || l1)
57 ((l1 & (1 << 7)) >> 0) +
58 ((l1 & (1 << 6)) >> 1) +
59 ((l1 & (1 << 5)) >> 2) +
60 ((l1 & (1 << 4)) >> 3);
66 ((l1 & (1 << 3)) << 4) +
67 ((l1 & (1 << 2)) << 3) +
68 ((l1 & (1 << 1)) << 2) +
69 ((l1
86 unsigned char l1 = line[single_length]; local
232 unsigned char l1 = line[single_length]; local
[all...]
/haiku-fatelf/src/system/libroot/posix/stdlib/
H A Dmerge.c111 u_char *l1; local
150 f2 = l1 = list1 + (p2 - list2);
154 while (f1 < l1 && f2 < l2) {
157 b = f1, t = l1;
226 } else if (f1 < l1) {
228 ICOPY_LIST(f1, tp2, l1);
230 CCOPY_LIST(f1, tp2, l1);
/haiku-fatelf/src/bin/bash/lib/intl/
H A Dlocalcharset.c150 size_t l1, l2; local
172 l1 = strlen (buf1);
176 res_size = l1 + 1 + l2 + 1;
181 res_size += l1 + 1 + l2 + 1;
190 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
/haiku-fatelf/src/bin/coreutils/lib/
H A Dlocalcharset.c196 size_t l1, l2; local
217 l1 = strlen (buf1);
222 res_size = l1 + 1 + l2 + 1;
227 res_size += l1 + 1 + l2 + 1;
238 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
/haiku-fatelf/src/bin/findutils/gnulib/lib/
H A Dlocalcharset.c154 size_t l1, l2; local
175 l1 = strlen (buf1);
180 res_size = l1 + 1 + l2 + 1;
185 res_size += l1 + 1 + l2 + 1;
196 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
/haiku-fatelf/src/bin/gawk/intl/
H A Dlocalcharset.c149 size_t l1, l2; local
171 l1 = strlen (buf1);
175 res_size = l1 + 1 + l2 + 1;
180 res_size += l1 + 1 + l2 + 1;
189 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
/haiku-fatelf/src/bin/network/wget/lib/
H A Dlocalcharset.c160 size_t l1, l2; local
181 l1 = strlen (buf1);
186 res_size = l1 + 1 + l2 + 1;
191 res_size += l1 + 1 + l2 + 1;
202 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
/haiku-fatelf/src/libs/iconv/
H A Dlocalcharset.c155 size_t l1, l2; local
176 l1 = strlen (buf1);
181 res_size = l1 + 1 + l2 + 1;
186 res_size += l1 + 1 + l2 + 1;
197 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
/haiku-fatelf/src/bin/bash/lib/sh/
H A Dstringlist.c151 int i, n, l1, l2; local
153 l1 = m1 ? m1->list_len : 0;
156 sl = strlist_create (l1 + l2 + 1);
157 for (i = n = 0; i < l1; i++, n++)
/haiku-fatelf/src/bin/rcs/
H A Dco.c718 int l1, l2, l3; local
721 l1 = countnumflds(r1);
723 if ((2<l1 || 2<l2) && cmpnum(r1,r2)!=0) {
731 VOID partialno(&t1, r1, l1>2 ? 2 : l1);
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/
H A Dlist.h119 xmlListMerge (xmlListPtr l1,
/haiku-fatelf/src/bin/gdb/gdb/
H A Dlanguage.c552 int l1 = TYPE_LENGTH (t1);
561 return TYPE_CODE (t2) == TYPE_CODE_FLT && l2 > l1 ?
564 return TYPE_CODE (t1) == TYPE_CODE_FLT && l1 > l2 ?
566 else if (TYPE_UNSIGNED (t1) && l1 > l2)
568 else if (TYPE_UNSIGNED (t2) && l2 > l1)
571 return l1 > l2 ? VALUE_TYPE (v1) : VALUE_TYPE (v2);
574 /* If we are doing type-checking, l1 should equal l2, so this is
576 return l1 > l2 ? VALUE_TYPE (v1) : VALUE_TYPE (v2);
/haiku-fatelf/src/add-ons/input_server/methods/canna/rk/
H A Dnword.c1391 int l, l1; local
1404 l1 = w->nw_ylen;
1405 if (l1 <= 0) {
1410 L1 = l1;
1415 else if (OnlyBunmatu(w) && xq[l1].tree->nw_lit == 0) {
1428 if (l1 <= maxary) {
1429 if (!ul2[l1].l2)
1431 evalSplit(cx, xq[l1].tree, &ul2[l1]);
1433 evalSplit(xq[l1]
[all...]
/haiku-fatelf/headers/libs/agg/
H A Dagg_line_aa_basics.h154 void bisectrix(const line_parameters& l1,
/haiku-fatelf/src/bin/gawk/
H A Dbuiltin.c309 register size_t l1, l2; local
333 l1 = s1->stlen;
349 while (l1 > 0) {
350 if (l2 > l1)
355 ret = 1 + s1->stlen - l1;
358 /* Update l1, and p1. */
359 mbclen = mbrlen(p1, l1, &mbs1);
365 l1 -= mbclen;
371 ret = 1 + s1->stlen - l1;
374 l1
[all...]
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dlist.c710 * @l1: the original list
717 xmlListMerge(xmlListPtr l1, xmlListPtr l2) argument
719 xmlListCopy(l1, l2);

Completed in 146 milliseconds

12