/macosx-10.9.5/CF-855.17/ |
H A D | CFBinaryHeap.h | 78 CFComparisonResult (*compare)(const void *ptr1, const void *ptr2, void *context);
|
H A D | CFStorage.c | 917 uint8_t *ptr1, *ptr2; local 926 ptr1 = ptr2 = NULL; 930 if (loc >= range1.location + range1.length) ptr1 = (uint8_t *)CFStorageGetValueAtIndex(storage1, loc, &range1); 935 if (memcmp(ptr1, ptr2, valueSize * cntThisTime) != 0) return false; 936 ptr1 += valueSize * cntThisTime;
|
H A D | CFString.c | 1663 static Boolean __cStrEqual(const void *ptr1, const void *ptr2) { argument 1664 return (strcmp((const char *)ptr1, (const char *)ptr2) == 0); 3277 static Boolean __rangeEqual(const void *ptr1, const void *ptr2) { argument 3278 CFRange range1 = *(CFRange *)ptr1;
|
H A D | CFUUID.c | 64 static Boolean __CFisEqualUUIDBytes(const void *ptr1, const void *ptr2) { argument 65 CFUUIDBytes *p1 = (CFUUIDBytes *)ptr1;
|
/macosx-10.9.5/ruby-104/ruby/test/fiddle/ |
H A D | test_import.rb | 24 BoundQsortCallback = bind("void *bound_qsort_callback(void*, void*)"){|ptr1,ptr2| ptr1[0] <=> ptr2[0]} 39 CallCallback = bind("void call_callback(void*, void*)"){ | ptr1, ptr2| 40 f = Function.new(ptr1.to_i, [TYPE_VOIDP], TYPE_VOID)
|
/macosx-10.9.5/ruby-104/ruby/ |
H A D | string.c | 2312 const char *ptr1, *ptr2; local 2316 RSTRING_GETMEM(str1, ptr1, len1); 2318 if (ptr1 == ptr2 || (retval = memcmp(ptr1, ptr2, lesser(len1, len2))) == 0) { 2339 const char *ptr1, *ptr2; local 2343 if ((ptr1 = RSTRING_PTR(str1)) == (ptr2 = RSTRING_PTR(str2))) 2345 if (memcmp(ptr1, ptr2, len) == 0)
|
H A D | enumerator.c | 367 struct enumerator *ptr0, *ptr1; local 376 TypedData_Get_Struct(obj, struct enumerator, &enumerator_data_type, ptr1); 378 if (!ptr1) { 382 ptr1->obj = ptr0->obj; 383 ptr1->meth = ptr0->meth; 384 ptr1->args = ptr0->args; 385 ptr1->fib = 0; 386 ptr1->lookahead = Qundef; 387 ptr1->feedvalue = Qundef; 388 ptr1 1193 struct generator *ptr0, *ptr1; local [all...] |
H A D | error.c | 1046 VALUE *ptr1, *ptr2; local 1053 TypedData_Get_Struct(obj1, VALUE, &name_err_mesg_data_type, ptr1); 1056 if (!rb_equal(ptr1[i], ptr2[i]))
|
/macosx-10.9.5/ruby-104/ruby/ext/dl/ |
H A D | cptr.c | 411 void *ptr1, *ptr2; local 415 ptr1 = rb_dlptr2cptr(self); 418 return ptr1 == ptr2 ? Qtrue : Qfalse; 431 void *ptr1, *ptr2; local 436 ptr1 = rb_dlptr2cptr(self); 438 diff = (SIGNED_VALUE)ptr1 - (SIGNED_VALUE)ptr2;
|
/macosx-10.9.5/ruby-104/ruby/ext/fiddle/ |
H A D | pointer.c | 459 void *ptr1, *ptr2; local 463 ptr1 = rb_fiddle_ptr2cptr(self); 466 return ptr1 == ptr2 ? Qtrue : Qfalse; 480 void *ptr1, *ptr2; local 485 ptr1 = rb_fiddle_ptr2cptr(self); 487 diff = (SIGNED_VALUE)ptr1 - (SIGNED_VALUE)ptr2;
|
/macosx-10.9.5/Security-55471.14.18/include/security_cryptkit/ |
H A D | giantIntegers.c | 1423 giantDigit *ptr1; local 1449 ptr1 = ptr2 = ptr; 1453 ptr1 += cur_term - asize; 1465 while(ptr1 < ptr2) { 1467 * temp = *ptr1++ * *ptr2--; 1469 giantMulDigits(*ptr1++, *ptr2--, &tempLo, &tempHi); 1487 if (ptr1 == ptr2) { 1489 * temp = *ptr1; 1492 giantMulDigits(*ptr1, *ptr1, [all...] |
/macosx-10.9.5/Security-55471.14.18/libsecurity_cryptkit/lib/ |
H A D | giantIntegers.c | 1423 giantDigit *ptr1; local 1449 ptr1 = ptr2 = ptr; 1453 ptr1 += cur_term - asize; 1465 while(ptr1 < ptr2) { 1467 * temp = *ptr1++ * *ptr2--; 1469 giantMulDigits(*ptr1++, *ptr2--, &tempLo, &tempHi); 1487 if (ptr1 == ptr2) { 1489 * temp = *ptr1; 1492 giantMulDigits(*ptr1, *ptr1, [all...] |
/macosx-10.9.5/dcerpc-58/dcerpc/ncklib/ |
H A D | comutil.c | 574 unsigned_char_p_t ptr1, ptr2; 585 for (count = 0, ptr1 = ptr2 = string; *ptr1 != '\0'; ptr1++) 590 if (*ptr1 == '\\') 595 *(ptr2++) = *(ptr1++); 601 if (*ptr1 != '\0') 603 *(ptr2++) = *ptr1; 612 if (*ptr1 != ' ' && *ptr1 ! 570 unsigned_char_p_t ptr1, ptr2; local [all...] |
/macosx-10.9.5/dtrace-118.1/test/tst/common/pointers/ |
H A D | tst.PointerAssignment.d | 42 int *ptr1; 51 ptr1 = array; 52 ptr2 = ptr1;
|
/macosx-10.9.5/Security-55471.14.18/include/security_filedb/ |
H A D | DbValue.cpp | 178 BlobValue::Comparator::operator () (const uint8 *ptr1, const uint8 *ptr2, uint32 length) argument 180 return memcmp(ptr1, ptr2, length); 348 StringValue::Comparator::operator () (const uint8 *ptr1, const uint8 *ptr2, uint32 length) argument 350 return strncmp(reinterpret_cast<const char *>(ptr1),
|
H A D | DbValue.h | 139 virtual int operator () (const uint8 *ptr1, const uint8 *ptr2, uint32 length); 173 virtual int operator () (const uint8 *ptr1, const uint8 *ptr2, uint32 length);
|
/macosx-10.9.5/Security-55471.14.18/libsecurity_filedb/lib/ |
H A D | DbValue.cpp | 178 BlobValue::Comparator::operator () (const uint8 *ptr1, const uint8 *ptr2, uint32 length) argument 180 return memcmp(ptr1, ptr2, length); 348 StringValue::Comparator::operator () (const uint8 *ptr1, const uint8 *ptr2, uint32 length) argument 350 return strncmp(reinterpret_cast<const char *>(ptr1),
|
/macosx-10.9.5/emacs-92/emacs/src/ |
H A D | fileio.c | 1919 unsigned char *ptr1 = index (user, ':'); 1920 if (ptr1 != 0 && ptr1 - user < len) 1921 len = ptr1 - user;
|
/macosx-10.9.5/tcl-102/tcl_ext/xotcl/xotcl/generic/ |
H A D | xotcl.c | 761 obj->cmdName->refCount, obj->cmdName->internalRep.twoPtrValue.ptr1,
|
/macosx-10.9.5/tcl-102/tcl84/tcl/generic/ |
H A D | tcl.h | 807 VOID *ptr1; 805 VOID *ptr1; member in struct:Tcl_Obj::__anon12786::__anon12787
|
H A D | tclBasic.c | 5088 (List *) objPtr->internalRep.twoPtrValue.ptr1;
|
H A D | tclObj.c | 198 * twoPtrValue.ptr1 field, and the twoPtrValue.ptr2 field is unused. 3427 resPtr = (ResolvedCmdName *) objPtr->internalRep.twoPtrValue.ptr1; 3467 resPtr = (ResolvedCmdName *) objPtr->internalRep.twoPtrValue.ptr1; 3537 objPtr->internalRep.twoPtrValue.ptr1 = (VOID *) resPtr; 3570 (ResolvedCmdName *) objPtr->internalRep.twoPtrValue.ptr1; 3620 (ResolvedCmdName *) srcPtr->internalRep.twoPtrValue.ptr1; 3622 copyPtr->internalRep.twoPtrValue.ptr1 = (VOID *) resPtr; 3719 objPtr->internalRep.twoPtrValue.ptr1 = (VOID *) resPtr;
|
H A D | tclVar.c | 98 * twoPtrValue.ptr1 = pointer to the corresponding Proc 102 * twoPtrValue.ptr1: pointer to the namespace containing the 107 * twoPtrValue.ptr1 = pointer to the array name Tcl_Obj, 133 * twoPtrValue.ptr1 = searchIdNumber as offset from (char*)NULL 382 if (part1Ptr->internalRep.twoPtrValue.ptr1 != NULL) { 396 part1Ptr = (Tcl_Obj *) part1Ptr->internalRep.twoPtrValue.ptr1; 409 Proc *procPtr = (Proc *) part1Ptr->internalRep.twoPtrValue.ptr1; 430 cachedNsPtr = (Namespace *) part1Ptr->internalRep.twoPtrValue.ptr1; 513 objPtr->internalRep.twoPtrValue.ptr1 = (VOID *) part1Ptr; 556 part1Ptr->internalRep.twoPtrValue.ptr1 [all...] |
/macosx-10.9.5/ruby-104/ruby/test/dl/ |
H A D | test_import.rb | 22 BoundQsortCallback = bind("void *bound_qsort_callback(void*, void*)"){|ptr1,ptr2| ptr1[0] <=> ptr2[0]} 37 CallCallback = bind("void call_callback(void*, void*)"){|ptr1, ptr2| 38 f = Function.new(CFunc.new(ptr1.to_i, TYPE_VOID, "<anonymous>"), [TYPE_VOIDP]) 158 LIBC.qsort(buff, buff.size, 1, LIBC::QsortCallback){|ptr1,ptr2| ptr1[0] <=> ptr2[0]}
|
/macosx-10.9.5/Security-55471.14.18/include/security_cryptkit/CurveParamDocs/ |
H A D | giants.c | 2676 unsigned short *ptr = a->n, *ptr1, *ptr2; local 2694 ptr1 = ptr2 = ptr; 2698 ptr1 += cur_term - asize; 2703 while(ptr1 < ptr2) { 2704 temp = *ptr1++ * *ptr2--; 2708 if (ptr1 == ptr2) { 2709 temp = *ptr1;
|