Searched defs:duplicate (Results 1 - 25 of 41) sorted by relevance

12

/external/javassist/sample/duplicate/
H A DMain.java1 package sample.duplicate;
21 First, run sample.duplicate.Viewer without a metaobject.
23 % java sample.duplicate.Viewer
28 of sample.duplicate.DuplicatedObject.
30 % java sample.duplicate.Main
33 sample.duplicate.Viewer is loaded by javassist.tools.reflect.Loader so that
39 cl.makeReflective("sample.duplicate.Ball",
40 "sample.duplicate.DuplicatedObject",
42 cl.run("sample.duplicate.Viewer", args);
H A DDuplicatedObject.java1 package sample.duplicate;
H A DBall.java1 package sample.duplicate;
H A DViewer.java1 package sample.duplicate;
/external/icu4c/common/
H A Dmutex.cpp21 void *&duplicate,
23 duplicate=NULL;
38 // to the "duplicate" parameter, and the caller deletes it.
49 duplicate=instance;
71 void *&duplicate,
73 duplicate=NULL;
99 // to the "duplicate" parameter, and the caller deletes it.
114 // Record a duplicate if we lost the race, or
116 duplicate=instance;
20 getInstance(InstantiatorFn *instantiator, const void *context, void *&duplicate, UErrorCode &errorCode) argument
70 getInstance(InstantiatorFn *instantiator, const void *context, void *&duplicate, UErrorCode &errorCode) argument
H A Dmutex.h98 * created yet. In a race condition, the duplicate may not be NULL.
99 * The caller must delete the duplicate.
100 * The caller need not initialize the duplicate before the call.
103 void *&duplicate,
118 * Takes care of the duplicate deletion and type casting.
130 void *duplicate; local
131 T *instance=(T *)singleton.getInstance(instantiator, context, duplicate, errorCode);
132 delete (T *)duplicate;
152 * created yet. In a race condition, the duplicate may not be NULL.
153 * The caller must delete the duplicate
186 void *duplicate; local
[all...]
H A Dutrie2.cpp732 void *duplicate; local
733 UTrie2 *instance=(UTrie2 *)singleton.getInstance(instantiator, context, duplicate, errorCode);
734 utrie2_close((UTrie2 *)duplicate);
H A Dnormalizer2impl.cpp1756 void *duplicate; local
1758 (CanonIterData *)singleton.getInstance(createInstance, this, duplicate, errorCode);
1759 delete (CanonIterData *)duplicate;
H A Duloc.c665 UBool duplicate = FALSE; local
724 /* If this is a duplicate keyword, then ignore it */
727 duplicate = TRUE;
731 if (!duplicate) {
738 UBool duplicate = FALSE; local
740 /* Search for duplicate; if found, do nothing. Explicit keyword
744 duplicate = TRUE;
748 if (!duplicate) {
2337 while(*s==',') { /* eat duplicate commas */
/external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/String/
H A Dregress-179068.js52 * > var long_str = duplicate(LONG_STR_SEED, N);
64 * > var long_str = duplicate(LONG_STR_SEED, N);
86 * duplicate function and this is faster then doing recursion like in the
106 var long_str = duplicate(LONG_STR_SEED, N);
122 function duplicate(str, count) function
/external/chromium/chrome/browser/
H A Dbrowsing_data_local_storage_helper.cc209 bool duplicate = false; local
214 duplicate = true;
218 if (duplicate)
H A Dbrowsing_data_database_helper.cc219 bool duplicate = false; local
224 duplicate = true;
228 if (duplicate)
H A Dbrowsing_data_indexed_db_helper.cc263 bool duplicate = false; local
268 duplicate = true;
272 if (duplicate)
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DAbstractContainerTester.java175 public final E duplicate; field in class:AbstractContainerTester.ArrayWithDuplicate
177 private ArrayWithDuplicate(E[] elements, E duplicate) { argument
179 this.duplicate = duplicate;
184 * @return an array of the proper size with a duplicate element.
189 E duplicate = elements[(elements.length / 2) - 1];
190 elements[(elements.length / 2) + 1] = duplicate;
191 return new ArrayWithDuplicate<E>(elements, duplicate);
/external/llvm/lib/Analysis/
H A DPathProfileVerifier.cpp93 unsigned duplicate = 0; local
98 duplicate++;
99 else duplicate = 0;
101 arrayMap[BB][TI->getSuccessor(s)][duplicate] = i++;
156 << " duplicate number " << duplicateNumber
/external/icu4c/i18n/
H A Dcsdetect.cpp293 // Remove duplicate charsets from the results.
305 // Not a duplicate.
309 CharsetMatch *duplicate = resultArray[j]; local
314 resultArray[resultCount] = duplicate;
/external/bluetooth/bluedroid/stack/hcic/
H A Dhciblecmds.c329 BOOLEAN btsnd_hcic_ble_set_scan_enable (UINT8 scan_enable, UINT8 duplicate) argument
346 UINT8_TO_STREAM (pp, duplicate);
/external/llvm/lib/CodeGen/
H A DTargetInstrInfoImpl.cpp240 MachineInstr *TargetInstrInfoImpl::duplicate(MachineInstr *Orig, function in class:TargetInstrInfoImpl
/external/qemu/distrib/sdl-1.2.15/src/joystick/linux/
H A DSDL_sysjoystick.c416 int n, duplicate; local
459 duplicate = 0;
460 for (n=0; (n<numjoysticks) && !duplicate; ++n) {
462 duplicate = 1;
465 if (duplicate) {
/external/wpa_supplicant_6/wpa_supplicant/src/eap_peer/
H A Deap.c579 int duplicate; local
581 duplicate = (sm->reqId == sm->lastId) && sm->rxReq;
582 if (sm->workaround && duplicate &&
586 * duplicate EAP requests. However, this misses cases where the
589 * an extra verification for the packets being duplicate to
595 "duplicate packet");
596 duplicate = 0;
599 return duplicate;
605 int duplicate = eap_peer_req_is_duplicate(sm); local
625 else if (sm->rxReq && duplicate)
[all...]
/external/wpa_supplicant_8/hostapd/src/eap_peer/
H A Deap.c616 int duplicate; local
618 duplicate = (sm->reqId == sm->lastId) && sm->rxReq;
619 if (sm->workaround && duplicate &&
623 * duplicate EAP requests. However, this misses cases where the
626 * an extra verification for the packets being duplicate to
632 "duplicate packet");
633 duplicate = 0;
636 return duplicate;
642 int duplicate = eap_peer_req_is_duplicate(sm); local
662 else if (sm->rxReq && duplicate)
[all...]
/external/wpa_supplicant_8/src/eap_peer/
H A Deap.c616 int duplicate; local
618 duplicate = (sm->reqId == sm->lastId) && sm->rxReq;
619 if (sm->workaround && duplicate &&
623 * duplicate EAP requests. However, this misses cases where the
626 * an extra verification for the packets being duplicate to
632 "duplicate packet");
633 duplicate = 0;
636 return duplicate;
642 int duplicate = eap_peer_req_is_duplicate(sm); local
662 else if (sm->rxReq && duplicate)
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/eap_peer/
H A Deap.c616 int duplicate; local
618 duplicate = (sm->reqId == sm->lastId) && sm->rxReq;
619 if (sm->workaround && duplicate &&
623 * duplicate EAP requests. However, this misses cases where the
626 * an extra verification for the packets being duplicate to
632 "duplicate packet");
633 duplicate = 0;
636 return duplicate;
642 int duplicate = eap_peer_req_is_duplicate(sm); local
662 else if (sm->rxReq && duplicate)
[all...]
/external/chromium/third_party/libjingle/source/talk/base/
H A Dsigslot.h311 virtual _connection_base0* duplicate(has_slots<mt_policy>* pnewdest) = 0;
322 virtual _connection_base1<arg1_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
333 virtual _connection_base2<arg1_type, arg2_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
344 virtual _connection_base3<arg1_type, arg2_type, arg3_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
355 virtual _connection_base4<arg1_type, arg2_type, arg3_type, arg4_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
370 arg5_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
385 arg5_type, arg6_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
400 arg5_type, arg6_type, arg7_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
415 arg5_type, arg6_type, arg7_type, arg8_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) = 0;
616 m_connected_slots.push_back((*it)->duplicate(newtarge
1766 virtual _connection_base0<mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection0
1811 virtual _connection_base1<arg1_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection1
1857 virtual _connection_base2<arg1_type, arg2_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection2
1903 virtual _connection_base3<arg1_type, arg2_type, arg3_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection3
1951 virtual _connection_base4<arg1_type, arg2_type, arg3_type, arg4_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection4
2004 arg5_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection5
2058 arg5_type, arg6_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection6
2112 arg5_type, arg6_type, arg7_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection7
2168 arg5_type, arg6_type, arg7_type, arg8_type, mt_policy>* duplicate(has_slots<mt_policy>* pnewdest) function in class:sigslot::_connection8
[all...]
/external/elfutils/src/
H A Dunstrip.c744 size_t *duplicate;
1627 s->duplicate = NULL;
1637 /* This is a duplicate. Its twin will get the next slot. */
1639 s->duplicate = n->map;
1670 if (symbols[i].duplicate == NULL)
1674 assert (*symbols[i].duplicate != STN_UNDEF);
1675 *symbols[i].map = *symbols[i].duplicate;
742 size_t *duplicate; member in union:symbol::__anon5340

Completed in 510 milliseconds

12