/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/ |
D | WebAssemblyExceptionInfo.cpp | 55 auto *WE = new WebAssemblyException(EHPad); in recalculate() local 56 discoverAndMapException(WE, MDT, MDF); in recalculate() 57 Exceptions.push_back(WE); in recalculate() 63 WebAssemblyException *WE = getExceptionFor(MBB); in recalculate() local 64 for (; WE; WE = WE->getParentException()) in recalculate() 65 WE->addBlock(MBB); in recalculate() 69 for (auto *WE : Exceptions) { in recalculate() local 70 if (WE->getParentException()) in recalculate() 71 WE->getParentException()->getSubExceptions().push_back(WE); in recalculate() 73 addTopLevelException(WE); in recalculate() [all …]
|
D | WebAssemblyExceptionInfo.h | 60 void setParentException(WebAssemblyException *WE) { ParentException = WE; } in setParentException() argument 62 bool contains(const WebAssemblyException *WE) const { in contains() argument 63 if (WE == this) in contains() 65 if (!WE) in contains() 67 return contains(WE->getParentException()); in contains() 116 raw_ostream &operator<<(raw_ostream &OS, const WebAssemblyException &WE); 123 void discoverAndMapException(WebAssemblyException *WE, 152 void changeExceptionFor(MachineBasicBlock *MBB, WebAssemblyException *WE) { in changeExceptionFor() argument 153 if (!WE) { in changeExceptionFor() 157 BBMap[MBB] = WE; in changeExceptionFor() [all …]
|
/external/libxml2/result/ |
D | ent9.rde | 21 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 26 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 31 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 36 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 41 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 46 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 51 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 56 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 61 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 66 2 3 #text 0 1 WE need lot of garbage now to trigger the problem [all …]
|
D | ent9.rdr | 11 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 16 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 21 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 26 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 31 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 36 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 41 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 46 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 51 2 3 #text 0 1 WE need lot of garbage now to trigger the problem 56 2 3 #text 0 1 WE need lot of garbage now to trigger the problem [all …]
|
D | ent9.sax | 28 SAX.characters( WE need lot of garbage now to, 50) 33 SAX.characters( WE need lot of garbage now to, 50) 38 SAX.characters( WE need lot of garbage now to, 50) 43 SAX.characters( WE need lot of garbage now to, 50) 48 SAX.characters( WE need lot of garbage now to, 50) 53 SAX.characters( WE need lot of garbage now to, 50) 58 SAX.characters( WE need lot of garbage now to, 50) 63 SAX.characters( WE need lot of garbage now to, 50) 68 SAX.characters( WE need lot of garbage now to, 50) 73 SAX.characters( WE need lot of garbage now to, 50) [all …]
|
D | ent9.sax2 | 28 SAX.characters( WE need lot of garbage now to, 50) 33 SAX.characters( WE need lot of garbage now to, 50) 38 SAX.characters( WE need lot of garbage now to, 50) 43 SAX.characters( WE need lot of garbage now to, 50) 48 SAX.characters( WE need lot of garbage now to, 50) 53 SAX.characters( WE need lot of garbage now to, 50) 58 SAX.characters( WE need lot of garbage now to, 50) 63 SAX.characters( WE need lot of garbage now to, 50) 68 SAX.characters( WE need lot of garbage now to, 50) 73 SAX.characters( WE need lot of garbage now to, 50) [all …]
|
/external/libxml2/result/noent/ |
D | ent9.sax2 | 27 SAX.characters( WE need lot of garbage now to, 50) 32 SAX.characters( WE need lot of garbage now to, 50) 37 SAX.characters( WE need lot of garbage now to, 50) 42 SAX.characters( WE need lot of garbage now to, 50) 47 SAX.characters( WE need lot of garbage now to, 50) 52 SAX.characters( WE need lot of garbage now to, 50) 57 SAX.characters( WE need lot of garbage now to, 50) 62 SAX.characters( WE need lot of garbage now to, 50) 67 SAX.characters( WE need lot of garbage now to, 50) 72 SAX.characters( WE need lot of garbage now to, 50) [all …]
|
/external/libcxx/test/std/language.support/cmp/cmp.common/ |
D | common_comparison_category.pass.cpp | 38 using WE = std::weak_equality; in main() typedef 58 test_cat<WE, WE>(); in main() 59 test_cat<WE, SO, WE, SO>(); in main() 60 test_cat<WE, SE, SO, PO>(); in main() 61 test_cat<WE, WO, SO, SE>(); in main()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
D | ValueMapper.cpp | 637 auto &WE = Worklist.back(); in createPOT() local 638 if (MDNode *N = visitOperands(G, WE.Op, WE.N->op_end(), WE.HasChanged)) { in createPOT() 645 assert(WE.N->isUniqued() && "Expected only uniqued nodes"); in createPOT() 646 assert(WE.Op == WE.N->op_end() && "Expected to visit all operands"); in createPOT() 647 auto &D = G.Info[WE.N]; in createPOT() 648 AnyChanges |= D.HasChanged = WE.HasChanged; in createPOT() 650 G.POT.push_back(WE.N); in createPOT() 1003 WorklistEntry WE; in scheduleMapGlobalInitializer() local 1004 WE.Kind = WorklistEntry::MapGlobalInit; in scheduleMapGlobalInitializer() 1005 WE.MCID = MCID; in scheduleMapGlobalInitializer() [all …]
|
/external/llvm/lib/Transforms/Utils/ |
D | ValueMapper.cpp | 624 auto &WE = Worklist.back(); in createPOT() local 625 if (MDNode *N = visitOperands(G, WE.Op, WE.N->op_end(), WE.HasChanged)) { in createPOT() 632 assert(WE.N->isUniqued() && "Expected only uniqued nodes"); in createPOT() 633 assert(WE.Op == WE.N->op_end() && "Expected to visit all operands"); in createPOT() 634 auto &D = G.Info[WE.N]; in createPOT() 635 AnyChanges |= D.HasChanged = WE.HasChanged; in createPOT() 637 G.POT.push_back(WE.N); in createPOT() 984 WorklistEntry WE; in scheduleMapGlobalInitializer() local 985 WE.Kind = WorklistEntry::MapGlobalInit; in scheduleMapGlobalInitializer() 986 WE.MCID = MCID; in scheduleMapGlobalInitializer() [all …]
|
/external/python/dateutil/dateutil/test/ |
D | test_imports.py | 59 from dateutil.relativedelta import MO, TU, WE, TH, FR, SA, SU 61 for var in (relativedelta, MO, TU, WE, TH, FR, SA, SU): 83 from dateutil.rrule import MO, TU, WE, TH, FR, SA, SU 88 MO, TU, WE, TH, FR, SA, SU)
|
D | test_relativedelta.py | 9 from dateutil.relativedelta import relativedelta, MO, TU, WE, FR, SU 121 self.assertEqual(self.today+relativedelta(weekday=WE), 125 self.assertEqual(self.today+relativedelta(days=+1, weekday=WE),
|
/external/llvm/utils/TableGen/ |
D | CodeGenSchedule.cpp | 290 WE = SchedWrites.end(); WI != WE; ++WI) { in collectSchedRW() local 554 for (IdxIter WI = SC.Writes.begin(), WE = SC.Writes.end(); WI != WE; ++WI) in collectSchedClasses() local 571 for (IdxIter WI = Writes.begin(), WE = Writes.end(); WI != WE; ++WI) in collectSchedClasses() local 1036 WI = WSI->begin(), WE = WSI->end(); WI != WE; ++WI) { in hasVariant() local 1355 for (IdxIter WI = WriteSeq.begin(), WE = WriteSeq.end(); WI != WE; ++WI) in inferFromRW() local 1850 WI = WSI->begin(), WE = WSI->end(); WI != WE; ++WI) { in dump() local
|
/external/u-boot/include/linux/mtd/ |
D | st_smi.h | 48 #define WE 0x00000800 /* Write Enable */ macro
|
/external/python/dateutil/docs/ |
D | relativedelta.rst | 132 >>> TODAY+relativedelta(weekday=WE(+1)) 139 >>> TODAY+relativedelta(days=+1, weekday=WE(+1))
|
D | rrule.rst | 447 >>> list(rrule(MONTHLY, count=3, byweekday=(TU,WE,TH), 459 >>> list(rrule(MONTHLY, count=3, byweekday=(MO,TU,WE,TH,FR), 560 from dateutil.rrule import MO, TU, WE, TH, FR, SA, SU
|
D | examples.rst | 130 >>> TODAY+relativedelta(weekday=WE(+1)) 137 >>> TODAY+relativedelta(days=+1, weekday=WE(+1)) 649 >>> list(rrule(MONTHLY, count=3, byweekday=(TU,WE,TH), 661 >>> list(rrule(MONTHLY, count=3, byweekday=(MO,TU,WE,TH,FR), 762 from dateutil.rrule import MO, TU, WE, TH, FR, SA, SU
|
/external/curl/tests/data/ |
D | test8 | 46 Set-Cookie: nocookie=yes; path=/WE;
|
/external/skia/src/compute/skc/platforms/cl_12/kernels/ |
D | paths_reclaim.cl | 102 // FOR WIDER SUBGROUPS WITH BIG BLOCKS, WE WILL WANT TO USE A VECTOR 154 // WE MIGHT WANT TO HAVE THE GRID LIMIT ITSELF TO A FRACTIONAL
|
D | paths_copy.cl | 174 …// FIXME ^^^^^ THE IDX PROBABLY DOESN'T NEED TO BE SHIFTED TWICE AND WE CAN SAVE A FEW INSTRUCTIONS 289 …// FIXME ^^^^^ THE IDX PROBABLY DOESN'T NEED TO BE SHIFTED TWICE AND WE CAN SAVE A FEW INSTRUCTIONS 327 …// FIXME ^^^^^ THE IDX PROBABLY DOESN'T NEED TO BE SHIFTED TWICE AND WE CAN SAVE A FEW INSTRUCTIONS
|
D | rasters_reclaim.cl | 129 // FOR WIDER SUBGROUPS WITH BIG BLOCKS, WE WILL WANT TO USE A VECTOR 181 // WE MIGHT WANT TO HAVE THE GRID LIMIT ITSELF TO A FRACTIONAL
|
/external/skqp/src/compute/skc/platforms/cl_12/kernels/ |
D | paths_reclaim.cl | 102 // FOR WIDER SUBGROUPS WITH BIG BLOCKS, WE WILL WANT TO USE A VECTOR 154 // WE MIGHT WANT TO HAVE THE GRID LIMIT ITSELF TO A FRACTIONAL
|
D | paths_copy.cl | 174 …// FIXME ^^^^^ THE IDX PROBABLY DOESN'T NEED TO BE SHIFTED TWICE AND WE CAN SAVE A FEW INSTRUCTIONS 289 …// FIXME ^^^^^ THE IDX PROBABLY DOESN'T NEED TO BE SHIFTED TWICE AND WE CAN SAVE A FEW INSTRUCTIONS 327 …// FIXME ^^^^^ THE IDX PROBABLY DOESN'T NEED TO BE SHIFTED TWICE AND WE CAN SAVE A FEW INSTRUCTIONS
|
D | rasters_reclaim.cl | 129 // FOR WIDER SUBGROUPS WITH BIG BLOCKS, WE WILL WANT TO USE A VECTOR 181 // WE MIGHT WANT TO HAVE THE GRID LIMIT ITSELF TO A FRACTIONAL
|
/external/honggfuzz/examples/apache-httpd/corpus_http2/ |
D | 6a9f512cd41d7884ba8247f8195c864d.0000e7a0.honggfuzz.cov | 39 …����aFL^��ѧ���?�>��u]=}��Lf�d���5L���+qwx�.�K]��d���@�*o���Sʎ��WE�A$��aS�U��0��K��… 47 … ���1Z����ٯ�$�xu�?�ۯk�r�����F�I���?�x(�9����H�n�0�p�-d�]��>��1�y�k�WE��^!v�e_��n7ҪOd��'�…
|