Searched defs:it (Results 251 - 275 of 609) sorted by relevance

<<11121314151617181920>>

/external/chromium/third_party/libjingle/source/talk/p2p/base/
H A Dsessionmanager.cc54 // Note: Session::Terminate occurs asynchronously, so it's too late to
106 SessionMap::iterator it = session_map_.find(session->id()); local
107 if (it != session_map_.end()) {
110 session_map_.erase(it);
117 SessionMap::iterator it = session_map_.find(sid); local
118 if (it != session_map_.end())
119 return it->second;
190 // it to the session.
285 for (SessionMap::iterator it = session_map_.begin();
286 it !
[all...]
/external/chromium/third_party/libjingle/source/talk/session/phone/
H A Dsrtpfilter.cc29 // one included by the libsrtp headers. Don't use it. Instead, we keep HAVE_SRTP
38 // If LOGGING is not defined, define it to 1 (b/3245816)
170 std::vector<CryptoParams>::const_iterator it; local
171 for (it = offer_params_.begin(); it != offer_params_.end(); ++it) {
172 if (answer_params[0].Matches(*it)) {
177 if (it != offer_params_.end()) {
178 *selected_params = *it;
441 for (std::list<SrtpSession*>::iterator it
[all...]
/external/clang/test/SemaCXX/
H A Dfor-range-examples.cpp30 T it, step; member in class:value_range_detail::value_range_step_iter
32 value_range_step_iter(const T &it, const T &step) : it(it), step(step) {} argument
33 T operator*() const { return it; }
34 bool operator!=(value_range_step_iter end) const { return it != end.it; }
35 value_range_step_iter &operator++() { it += step; return *this; }
40 T it, step, end_; member in class:value_range_detail::value_range_step
42 value_range_step(const T &it, cons argument
[all...]
/external/clang/tools/driver/
H A Ddriver.cpp10 // This is the entry point to the clang driver; it is a thin wrapper
272 // hyphen and everything following it. This allows using something like
334 SmallVectorImpl<const char *>::iterator it = ArgVector.begin(); local
335 if (it != ArgVector.end())
336 ++it;
337 ArgVector.insert(it, SaveStringInSet(SavedStrings, Prefix));
338 ArgVector.insert(it,
/external/icu4c/i18n/
H A Dcsrmbcs.cpp192 // but is not incompatible with our encoding, so don't give it a zero.
242 UBool CharsetRecog_sjis::nextChar(IteratedChar* it, InputText* det) { argument
243 it->index = it->nextIndex;
244 it->error = FALSE;
246 int32_t firstByte = it->charValue = it->nextByte(det);
256 int32_t secondByte = it->nextByte(det);
258 it->charValue = (firstByte << 8) | secondByte;
264 it
290 nextChar(IteratedChar* it, InputText* det) argument
399 nextChar(IteratedChar* it, InputText* det) argument
449 nextChar(IteratedChar* it, InputText* det) argument
[all...]
/external/icu4c/test/intltest/
H A Dcanittst.cpp73 CanonicalIterator it("", status);
81 if(it.getDynamicClassID() != CanonicalIterator::getStaticClassID()){
97 characterTest(s, i, it);
100 characterTest(s, i, it);
149 CanonicalIterator it("", status);
154 it.setSource(testStr, status);
157 //UnicodeString *result = new UnicodeString(it.next());
158 UnicodeString result(it.next());
175 void CanonicalIteratorTest::characterTest(UnicodeString &s, UChar32 ch, CanonicalIterator &it) argument
192 it
[all...]
H A Ddtfmapts.cpp22 // verifies that it works on a basic level.
139 DateFormat *it = DateFormat::createDateInstance(DateFormat::MEDIUM, Locale::getItalian()); local
142 if (def == NULL || fr == NULL || it == NULL || de == NULL){
151 if( *fr == *it ) {
157 if (fr != NULL && it != NULL && de != NULL)
174 res2 = it->format(d, res2, pos2);
209 if (fr != NULL && it != NULL && de != NULL)
222 fr->setLenient(it->isLenient());
223 if(fr->isLenient() != it->isLenient()) {
230 it
[all...]
H A Dtsnmfmt.cpp110 // that the system rand() function is very poor, which it always is.
111 // Call srand(currentTime) in intltest to make it truly random.
132 // that the system rand() function is very poor, which it always is.
133 // Call srand(currentTime) in intltest to make it truly random.
148 double it; local
152 it = randDouble();
153 } while (low > it || it > high);
154 return it;
178 // Assume it'
254 double it = getSafeDouble(100000.0); local
[all...]
/external/llvm/lib/VMCore/
H A DInstruction.cpp23 Instruction::Instruction(Type *ty, unsigned it, Use *Ops, unsigned NumOps, argument
25 : User(ty, Value::InstructionVal + it, Ops, NumOps), Parent(0) {
37 Instruction::Instruction(Type *ty, unsigned it, Use *Ops, unsigned NumOps, argument
39 : User(ty, Value::InstructionVal + it, Ops, NumOps), Parent(0) {
88 /// insert it into the basic block that MovePos lives in, right before
178 /// isIdenticalToWhenDefined - This is like isIdenticalTo, except that it
/external/llvm/unittests/ADT/
H A DSmallVectorTest.cpp266 typename TypeParam::iterator it = this->theVector.begin(); local
267 EXPECT_TRUE(*it == this->theVector.front());
268 EXPECT_TRUE(*it == this->theVector[0]);
269 EXPECT_EQ(1, it->getValue());
270 ++it;
271 EXPECT_TRUE(*it == this->theVector[1]);
272 EXPECT_TRUE(*it == this->theVector.back());
273 EXPECT_EQ(2, it->getValue());
274 ++it;
275 EXPECT_TRUE(it
[all...]
/external/openfst/src/include/fst/
H A Dbi-table.h42 // // Lookup integer ID from entry. If it doesn't exist, then add it.
63 if (id_ref == 0) { // T not found; store and assign it a new ID.
114 typename KeyHashSet::const_iterator it = keys_.find(kCurrentKey); local
115 if (it == keys_.end()) {
121 return *it;
199 if (id_ref == 0) { // T not found; store and assign it a new ID.
266 typename KeyHashSet::const_iterator it = keys_.find(kCurrentKey); local
267 if (it == keys_.end()) {
273 return *it;
375 typename unordered_map<T, I, F>::iterator it = local
[all...]
H A Dflags.h78 typename std::map< string, FlagDescription<T> >::const_iterator it = local
80 return it != flag_table_.end() ? it->second : 0;
122 FlagDescription<T> >::const_iterator it =
124 it != flag_table_.end();
125 ++it) {
126 const string &name = it->first;
127 const FlagDescription<T> &desc = it->second;
148 FlagDescription<T> >::const_iterator it =
150 it !
[all...]
/external/openssl/crypto/asn1/
H A Dtasn_prn.c160 const ASN1_ITEM *it,
168 const ASN1_ITEM *it, int indent,
177 const ASN1_ITEM *it, const ASN1_PCTX *pctx)
185 sname = it->sname;
186 return asn1_item_print_ctx(out, &ifld, indent, it,
191 const ASN1_ITEM *it,
198 const ASN1_AUX *aux = it->funcs;
224 switch(it->itype)
227 if(it->templates)
230 it
176 ASN1_item_print(BIO *out, ASN1_VALUE *ifld, int indent, const ASN1_ITEM *it, const ASN1_PCTX *pctx) argument
190 asn1_item_print_ctx(BIO *out, ASN1_VALUE **fld, int indent, const ASN1_ITEM *it, const char *fname, const char *sname, int nohdr, const ASN1_PCTX *pctx) argument
519 asn1_primitive_print(BIO *out, ASN1_VALUE **fld, const ASN1_ITEM *it, int indent, const char *fname, const char *sname, const ASN1_PCTX *pctx) argument
[all...]
H A Dx_name.c11 * apply to all code found in this distribution, be it the RC4, RSA,
71 const ASN1_ITEM *it,
75 const ASN1_ITEM *it, int tag, int aclass);
76 static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it);
77 static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it);
111 /* Normally that's where it would end: we'd have two nested STACK structures
132 static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it) argument
157 static void x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
173 const unsigned char **in, long len, const ASN1_ITEM *it,
194 /* We've decoded it
172 x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in, long len, const ASN1_ITEM *it, int tag, int aclass, char opt, ASN1_TLC *ctx) argument
224 x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass) argument
[all...]
/external/openssl/crypto/x509v3/
H A Dv3_crld.c376 static int dpn_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument
/external/oprofile/libpp/
H A Dprofile_container.cpp141 profile_t::const_iterator it; local
142 for (it = p_it.first; it != p_it.second ; ++it) {
145 sample.counts[pclass] = it.count();
150 if (abfd.get_linenr(sym_index, it.vma(), filename,
157 sample.vma = (it.vma() - start) + base_vma;
171 symbol_container::symbols_t::iterator it = symbols->begin(); local
174 for (; it != end; ++it) {
216 set<debug_name_id>::const_iterator it = filename_set.begin(); local
[all...]
/external/oprofile/libutil++/
H A Dop_bfd.cpp111 // after creating all symbol it's convenient for user code to access
124 // if there's a problem already, don't try to open it
159 // find .text and use it
198 filepos_map_t::const_iterator it = filepos_map.find(".text"); local
199 if (it != filepos_map.end())
200 return it->second;
247 symbols_found_t::iterator it = symbols.begin(); local
251 while (it != symbols.end()) {
252 symbols_found_t::iterator temp = it;
254 if (temp != symbols.end() && (it
290 symbols_found_t::iterator it; local
[all...]
/external/oprofile/pp/
H A Doparchive.cpp120 list<inverted_profile>::iterator it = iprofiles.begin(); local
124 for (; it != end; ++it) {
126 string exe_name = it->image;
129 classes.extra_found_images.find_image_path(it->image,
142 if (it->error == image_not_found && is_prefix(exe_name, "anon "))
155 copy_one_file(it->error, real_exe_name, exe_archive_file);
159 * find it - executable location + "/.debug"
169 /* found something copy it over */
217 /* copy over the <session-dir>/abi file if it exist
[all...]
H A Dopgprof.cpp68 sample_container::samples_iterator it = samples.begin(); local
70 for (; it != end ; ++it) {
71 if (it->second.vma < min)
72 min = it->second.vma;
73 if (it->second.vma > max)
74 max = it->second.vma;
97 sample_container::samples_iterator it = samples.begin(); local
99 for (; it != end ; ++it) {
196 sample_container::samples_iterator it = samples.begin(*sit); local
233 list<profile_sample_files>::const_iterator it = files.begin(); local
258 list<profile_sample_files>::const_iterator it = files.begin(); local
303 image_group_set::const_iterator it; local
[all...]
/external/protobuf/src/google/protobuf/
H A Drepeated_field_unittest.cc35 // TODO(kenton): Improve this unittest to bring it up to the standards of
57 // Test operations on a RepeatedField which is small enough that it does
173 // to it until it re-allocates its space.
687 RepeatedPtrField<string>::const_iterator it = local
690 EXPECT_EQ(*it, "n");
691 EXPECT_TRUE(it == proto_array_.begin() + 3);
795 RepeatedPtrField<string>::pointer_iterator it = local
799 GOOGLE_CHECK(*it != NULL);
801 EXPECT_EQ(**it, "
[all...]
/external/qemu/distrib/sdl-1.2.15/src/audio/nto/
H A DSDL_nto_audio.c5 This library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Library General Public
10 This library is distributed in the hope that it will be useful,
85 int it; local
92 for (it=0; it<QSA_WA_CARDS; it++)
94 if (SDL_strcmp(buggycards[it].cardname, scardname)==0)
96 if (buggycards[it].bugtype==checkfor)
223 /* This function waits until it i
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Drelabel.h71 typename hash_map<Label, Label>::iterator it = local
73 if (it != input_map.end()) {arc.ilabel = it->second; }
76 it = output_map.find(arc.olabel);
77 if (it != output_map.end()) { arc.olabel = it->second; }
280 typename hash_map<Label, Label>::iterator it = local
282 if (it != input_map_.end()) { arc.ilabel = it->second; }
287 typename hash_map<Label, Label>::iterator it local
[all...]
H A Dsymbol-table.h73 hash_map<int64, string>::const_iterator it = local
75 if (it == key_map_.end()) {
78 return it->second;
92 hash_map<string, int64>::const_iterator it = local
94 if (it == symbol_map_.end()) {
97 return it->second;
/external/stlport/test/unit/
H A Dmap_test.cpp449 typedef map<IncompleteClass, IncompleteClass>::iterator it; typedef in class:IncompleteClass
H A Dset_test.cpp242 set<int>::iterator it = tree.begin(); local
243 int const& int_ref = *it++;
246 CPPUNIT_ASSERT( it == tree.end() );
247 CPPUNIT_ASSERT( it != tree.begin() );
502 typedef set<IncompleteClass>::iterator it; typedef in class:IncompleteClass

Completed in 482 milliseconds

<<11121314151617181920>>