Home
last modified time | relevance | path

Searched refs:mt2 (Results 1 – 3 of 3) sorted by relevance

/external/toybox/toys/posix/
Ddf.c122 struct mtab_list *mt2, *mt3; in df_main() local
129 for (mt2 = mt->prev; mt2; mt2 = mt2->prev) { in df_main()
130 if (mt->stat.st_dev == mt2->stat.st_dev) { in df_main()
132 if (!strcmp(mt->device, mt2->device)) { in df_main()
134 mt3 = mt2; in df_main()
135 } else mt2->stat.st_dev = 0; in df_main()
/external/v8/test/cctest/
Dtest-types.cc497 for (MapIterator mt2 = T.maps.begin(); mt2 != T.maps.end(); ++mt2) { in Class() local
499 Handle<i::Map> map2 = *mt2; in Class()
928 for (MapIterator mt2 = T.maps.begin(); mt2 != T.maps.end(); ++mt2) { in Is() local
930 Handle<i::Map> map2 = *mt2; in Is()
1171 for (MapIterator mt2 = T.maps.begin(); mt2 != T.maps.end(); ++mt2) { in NowIs() local
1173 Handle<i::Map> map2 = *mt2; in NowIs()
1319 for (MapIterator mt2 = T.maps.begin(); mt2 != T.maps.end(); ++mt2) { in Maybe() local
1321 Handle<i::Map> map2 = *mt2; in Maybe()
/external/v8/benchmarks/
Dcrypto.js562 this.mt2 = 2*m.t;
585 while(x.t <= this.mt2) // pad x so am has enough room later