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

/haiku/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/src/apps/haikudepot/util/
H A DLanguageMenuUtils.h38 static int _LanguagesPresentationCompareFn(const LanguageRef& l1,
40 static bool _IsLanguagePresentationBefore(const LanguageRef& l1,
H A DLanguageMenuUtils.cpp112 LanguageMenuUtils::_LanguagesPresentationCompareFn(const LanguageRef& l1, const LanguageRef& l2) argument
119 if (l1->GetName(name1) == B_OK && l2->GetName(name2) == B_OK)
122 result = strcmp(l1->ID(), l2->ID());
129 LanguageMenuUtils::_IsLanguagePresentationBefore(const LanguageRef& l1, const LanguageRef& l2) argument
131 return _LanguagesPresentationCompareFn(l1, l2) < 0;
/haiku/src/apps/haikudepot/model/
H A DLanguageModel.h53 static int _LanguagesCompareFn(const LanguageRef& l1, const LanguageRef& l2);
54 static bool _IsLanguageBefore(const LanguageRef& l1, const LanguageRef& l2);
H A DLanguageModel.cpp282 LanguageModel::_LanguagesCompareFn(const LanguageRef& l1, const LanguageRef& l2) argument
284 int result = _NullSafeStrCmp(l1->Code(), l2->Code());
286 result = _NullSafeStrCmp(l1->CountryCode(), l2->CountryCode());
288 result = _NullSafeStrCmp(l1->ScriptCode(), l2->ScriptCode());
294 LanguageModel::_IsLanguageBefore(const LanguageRef& l1, const LanguageRef& l2) argument
296 return _LanguagesCompareFn(l1, l2) < 0;
/haiku/headers/os/bluetooth/
H A DLinkKeyUtils.h43 uint8 l0, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11, l12, l13, l14, l15; local
45 "%hhx:%hhx:%hhx:%hhx:%hhx:%hhx:%hhx:%hhxs", &l0, &l1, &l2, &l3,
50 return (linkkey_t){{l0, l1, l2, l3, l4, l5, l6, l7, l8,
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Daddmul_1.S52 ldx [%o4+%o7],%l1
72 addcc %l1,%i0,%i0
74 add %g5,1,%l1
75 movcs %xcc,%l1,%g5
H A Dsubmul_1.S51 ldx [%o4+%o7],%l1
71 subcc %l1,%i0,%i0
73 add %g5,1,%l1
74 movcs %xcc,%l1,%g5
/haiku/src/system/libnetwork/netresolv/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/headers/posix/arch/sparc64/
H A Dsignal.h34 ulong l1; member in struct:vregs
/haiku/src/system/libroot/posix/stdlib/
H A Dmerge.c104 u_char *f1, *f2, *t, *b, *tp2, *q, *l1, *l2; local
132 f2 = l1 = list1 + (p2 - list2);
136 while (f1 < l1 && f2 < l2) {
139 b = f1, t = l1;
208 } else if (f1 < l1) {
210 ICOPY_LIST(f1, tp2, l1);
212 CCOPY_LIST(f1, tp2, l1);
/haiku/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/src/system/libroot/os/arch/sparc/
H A Dfpu_explode.c268 uint64_t l0 = 0, l1; local
297 l1 = __fpu_getreg64((reg & ~1) + 2);
298 s = __fpu_qtof(fp, l0 >> 32, l0 & 0xffffffff, l1 >> 32,
299 l1 & 0xffffffff);
/haiku/headers/libs/agg/
H A Dagg_line_aa_basics.h154 void bisectrix(const line_parameters& l1,
/haiku/src/bin/network/telnet/
H A Dcommands.c2730 int l1 = strlen(m1);
2768 if (strncasecmp(line, m1, l1) == 0)
2769 strncpy(line, &line[l1], sizeof(line) - l1);
2721 int l1 = strlen(m1); local

Completed in 129 milliseconds