| /external/elfutils/0.153/libcpu/ |
| D | i386_dis.h | 140 …{ .mnemonic = MNE_aaa, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 0, .str1 = 0, .off1_1…
141 …{ .mnemonic = MNE_aad, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 0, .str1 = 0, .off1_1…
142 …{ .mnemonic = MNE_aam, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 0, .str1 = 0, .off1_1…
143 …{ .mnemonic = MNE_aas, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 0, .str1 = 0, .off1_1…
144 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 15, .str1 = 0, .off1_…
145 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 1, .modrm = 1, .fct1 = 15, .str1 = 0, .off1_…
146 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 1, .modrm = 1, .fct1 = 18, .str1 = 0, .off1_…
147 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 0, .modrm = 1, .fct1 = 26, .str1 = 0, .off1_…
148 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 0, .modrm = 1, .fct1 = 24, .str1 = 0, .off1_…
149 …{ .mnemonic = MNE_add, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 15, .str1 = 0, .off1_…
[all …]
|
| D | x86_64_dis.h | 141 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 15, .str1 = 0, .off1_…
142 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 1, .modrm = 1, .fct1 = 15, .str1 = 0, .off1_…
143 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 1, .modrm = 1, .fct1 = 19, .str1 = 0, .off1_…
144 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 0, .modrm = 1, .fct1 = 27, .str1 = 0, .off1_…
145 …{ .mnemonic = MNE_adc, .rep = 0, .repe = 0, .suffix = 0, .modrm = 1, .fct1 = 25, .str1 = 0, .off1_…
146 …{ .mnemonic = MNE_add, .rep = 0, .repe = 0, .suffix = 0, .modrm = 0, .fct1 = 15, .str1 = 0, .off1_…
147 …{ .mnemonic = MNE_add, .rep = 0, .repe = 0, .suffix = 1, .modrm = 1, .fct1 = 15, .str1 = 0, .off1_…
148 …{ .mnemonic = MNE_add, .rep = 0, .repe = 0, .suffix = 1, .modrm = 1, .fct1 = 19, .str1 = 0, .off1_…
149 …{ .mnemonic = MNE_add, .rep = 0, .repe = 0, .suffix = 0, .modrm = 1, .fct1 = 27, .str1 = 0, .off1_…
150 …{ .mnemonic = MNE_add, .rep = 0, .repe = 0, .suffix = 0, .modrm = 1, .fct1 = 25, .str1 = 0, .off1_…
[all …]
|
| /external/chromium-trace/trace-viewer/src/tracing/analysis/ |
| D | generic_object_view.js | 43 label, object, indent, depth, maxDepth, suffix) { argument
46 label, indent, '<recursion limit reached>', suffix);
51 this.appendSimpleText_(label, indent, 'undefined', suffix);
56 this.appendSimpleText_(label, indent, 'null', suffix);
63 this.appendSimpleText_(label, indent, '"' + object + '"', suffix);
65 this.appendSimpleText_(label, indent, object, suffix);
73 this.appendElementWithLabel_(label, indent, link, suffix);
80 this.appendElementWithLabel_(label, indent, link, suffix);
86 label, object, indent, depth, maxDepth, suffix);
91 label, object, indent, depth, maxDepth, suffix);
[all …]
|
| /external/libcxx/test/re/re.alg/re.alg.search/ |
| D | ecma.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
72 assert(!m.suffix().matched); in main()
73 assert(m.suffix().first == m[0].second); in main()
74 assert(m.suffix().second == s+3); in main()
94 assert(m.suffix().matched); in main()
[all …]
|
| D | basic.pass.cpp | 41 assert(!m.suffix().matched); in main()
42 assert(m.suffix().first == m[0].second); in main()
43 assert(m.suffix().second == s+1); in main()
56 assert(!m.suffix().matched); in main()
57 assert(m.suffix().first == m[0].second); in main()
58 assert(m.suffix().second == s+2); in main()
78 assert(!m.suffix().matched); in main()
79 assert(m.suffix().first == m[0].second); in main()
80 assert(m.suffix().second == s+3); in main()
100 assert(m.suffix().matched); in main()
[all …]
|
| D | awk.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
72 assert(!m.suffix().matched); in main()
73 assert(m.suffix().first == m[0].second); in main()
74 assert(m.suffix().second == s+3); in main()
94 assert(m.suffix().matched); in main()
[all …]
|
| D | extended.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
72 assert(!m.suffix().matched); in main()
73 assert(m.suffix().first == m[0].second); in main()
74 assert(m.suffix().second == s+3); in main()
94 assert(m.suffix().matched); in main()
[all …]
|
| D | egrep.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s + std::char_traits<char>::length(s)); in main()
51 assert(m.suffix().matched); in main()
52 assert(m.suffix().first == m[0].second); in main()
53 assert(m.suffix().second == s + std::char_traits<char>::length(s)); in main()
67 assert(!m.suffix().matched); in main()
68 assert(m.suffix().first == m[0].second); in main()
69 assert(m.suffix().second == s + std::char_traits<char>::length(s)); in main()
83 assert(!m.suffix().matched); in main()
[all …]
|
| /external/libcxx/test/re/re.alg/re.alg.match/ |
| D | ecma.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
91 assert(!m.suffix().matched); in main()
92 assert(m.suffix().first == m[0].second); in main()
93 assert(m.suffix().second == s+4); in main()
106 assert(!m.suffix().matched); in main()
[all …]
|
| D | extended.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
91 assert(!m.suffix().matched); in main()
92 assert(m.suffix().first == m[0].second); in main()
93 assert(m.suffix().second == s+4); in main()
106 assert(!m.suffix().matched); in main()
[all …]
|
| D | basic.pass.cpp | 41 assert(!m.suffix().matched); in main()
42 assert(m.suffix().first == m[0].second); in main()
43 assert(m.suffix().second == s+1); in main()
56 assert(!m.suffix().matched); in main()
57 assert(m.suffix().first == m[0].second); in main()
58 assert(m.suffix().second == s+2); in main()
97 assert(!m.suffix().matched); in main()
98 assert(m.suffix().first == m[0].second); in main()
99 assert(m.suffix().second == s+4); in main()
112 assert(!m.suffix().matched); in main()
[all …]
|
| /external/chromium_org/sync/internal_api/public/base/ |
| D | unique_position.cc | 21 bool UniquePosition::IsValidSuffix(const std::string& suffix) { in IsValidSuffix() argument
25 return suffix.length() == kSuffixLength in IsValidSuffix()
26 && suffix[kSuffixLength-1] != 0; in IsValidSuffix()
88 int64 x, const std::string& suffix) { in FromInt64() argument
96 return UniquePosition(bytes + suffix, suffix); in FromInt64()
101 const std::string& suffix) { in InitialPosition() argument
102 DCHECK(IsValidSuffix(suffix)); in InitialPosition()
103 return UniquePosition(suffix, suffix); in InitialPosition()
109 const std::string& suffix) { in Before() argument
110 DCHECK(IsValidSuffix(suffix)); in Before()
[all …]
|
| D | unique_position.h | 46 static bool IsValidSuffix(const std::string& suffix);
63 static UniquePosition FromInt64(int64 i, const std::string& suffix);
66 static UniquePosition InitialPosition(const std::string& suffix);
71 const std::string& suffix);
73 const std::string& suffix);
76 const std::string& suffix);
110 const std::string& suffix);
115 const std::string& suffix);
121 const std::string& suffix);
128 UniquePosition(const std::string& uncompressed, const std::string& suffix);
|
| D | unique_position_unittest.cc | 182 const UniquePosition& pos, const std::string& suffix) { in IsSuffixInUse() argument
183 return pos.GetSuffixForTest() == suffix; in IsSuffixInUse()
249 const std::string suffix = GetParam(); in TEST_P() local
250 ASSERT_TRUE(UniquePosition::IsValidSuffix(suffix)); in TEST_P()
255 if (IsSuffixInUse(predecessor, suffix)) in TEST_P()
262 if (IsSuffixInUse(successor, suffix)) in TEST_P()
266 UniquePosition::Between(predecessor, successor, suffix); in TEST_P()
275 const std::string suffix = GetParam(); in TEST_P() local
279 if (IsSuffixInUse(successor, suffix)) in TEST_P()
282 UniquePosition before = UniquePosition::Before(successor, suffix); in TEST_P()
[all …]
|
| /external/smack/src/org/xbill/DNS/ |
| D | A6Record.java | 19 private InetAddress suffix; field in A6Record
37 InetAddress suffix, Name prefix) in A6Record() argument
41 if (suffix != null && Address.familyOf(suffix) != Address.IPv6) in A6Record()
43 this.suffix = suffix; in A6Record()
56 suffix = InetAddress.getByAddress(bytes); in rrFromWire()
70 suffix = Address.getByAddress(s, Address.IPv6); in rdataFromString()
85 if (suffix != null) { in rrToString()
87 sb.append(suffix.getHostAddress()); in rrToString()
105 return suffix; in getSuffix()
117 if (suffix != null) { in rrToWire()
[all …]
|
| /external/skia/src/utils/ |
| D | SkOSFile.cpp | 33 static uint16_t* concat_to_16(const char src[], const char suffix[]) in concat_to_16() argument
36 size_t len2 = 3 + (suffix ? strlen(suffix) : 0); in concat_to_16()
46 if (suffix) in concat_to_16()
48 while (*suffix) in concat_to_16()
49 dst[i++] = *suffix++; in concat_to_16()
74 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fHandle(0), fPath16(NULL) in Iter() argument
76 this->reset(path, suffix); in Iter()
86 void SkOSFile::Iter::reset(const char path[], const char suffix[]) in reset() argument
97 fPath16 = concat_to_16(path, suffix); in reset()
170 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fDIR(0) in Iter() argument
[all …]
|
| /external/chromium_org/third_party/skia/src/utils/ |
| D | SkOSFile.cpp | 33 static uint16_t* concat_to_16(const char src[], const char suffix[]) in concat_to_16() argument
36 size_t len2 = 3 + (suffix ? strlen(suffix) : 0); in concat_to_16()
46 if (suffix) in concat_to_16()
48 while (*suffix) in concat_to_16()
49 dst[i++] = *suffix++; in concat_to_16()
74 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fHandle(0), fPath16(NULL) in Iter() argument
76 this->reset(path, suffix); in Iter()
86 void SkOSFile::Iter::reset(const char path[], const char suffix[]) in reset() argument
97 fPath16 = concat_to_16(path, suffix); in reset()
170 SkOSFile::Iter::Iter(const char path[], const char suffix[]) : fDIR(0) in Iter() argument
[all …]
|
| /external/chromium_org/webkit/browser/appcache/ |
| D | appcache_histograms.cc | 38 const std::string suffix = OriginToCustomHistogramSuffix(origin_url); in CountUpdateJobResult() local
39 if (!suffix.empty()) { in CountUpdateJobResult()
41 "appcache.UpdateJobResult" + suffix, in CountUpdateJobResult()
66 const std::string suffix = OriginToCustomHistogramSuffix(origin_url); in CountResponseRetrieval() local
67 if (!suffix.empty()) { in CountResponseRetrieval()
69 label + suffix, in CountResponseRetrieval()
79 const std::string suffix = OriginToCustomHistogramSuffix(origin_url); in LogUpdateFailureStats() local
83 if (!suffix.empty()) { in LogUpdateFailureStats()
85 label + suffix, in LogUpdateFailureStats()
92 if (!suffix.empty()) { in LogUpdateFailureStats()
[all …]
|
| /external/skia/src/core/ |
| D | SkBitmapProcState_procs.h | 90 #define MAKENAME(suffix) NAME_WRAP(S32_opaque_D32 ## suffix) argument
102 #define MAKENAME(suffix) NAME_WRAP(S32_alpha_D32 ## suffix) argument
121 #define MAKENAME(suffix) NAME_WRAP(S16_opaque_D32 ## suffix) argument
137 #define MAKENAME(suffix) NAME_WRAP(S16_alpha_D32 ## suffix) argument
152 #define MAKENAME(suffix) NAME_WRAP(SI8_opaque_D32 ## suffix) argument
166 #define MAKENAME(suffix) NAME_WRAP(SI8_alpha_D32 ## suffix) argument
183 #define MAKENAME(suffix) NAME_WRAP(S4444_opaque_D32 ## suffix) argument
199 #define MAKENAME(suffix) NAME_WRAP(S4444_alpha_D32 ## suffix) argument
218 #define MAKENAME(suffix) NAME_WRAP(SA8_alpha_D32 ## suffix) argument
243 #define MAKENAME(suffix) NAME_WRAP(S32_D16 ## suffix) argument
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkBitmapProcState_procs.h | 90 #define MAKENAME(suffix) NAME_WRAP(S32_opaque_D32 ## suffix) argument
102 #define MAKENAME(suffix) NAME_WRAP(S32_alpha_D32 ## suffix) argument
121 #define MAKENAME(suffix) NAME_WRAP(S16_opaque_D32 ## suffix) argument
137 #define MAKENAME(suffix) NAME_WRAP(S16_alpha_D32 ## suffix) argument
152 #define MAKENAME(suffix) NAME_WRAP(SI8_opaque_D32 ## suffix) argument
166 #define MAKENAME(suffix) NAME_WRAP(SI8_alpha_D32 ## suffix) argument
183 #define MAKENAME(suffix) NAME_WRAP(S4444_opaque_D32 ## suffix) argument
199 #define MAKENAME(suffix) NAME_WRAP(S4444_alpha_D32 ## suffix) argument
218 #define MAKENAME(suffix) NAME_WRAP(SA8_alpha_D32 ## suffix) argument
243 #define MAKENAME(suffix) NAME_WRAP(S32_D16 ## suffix) argument
[all …]
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/ |
| D | gen-fma-test.py | 3 def emit(opcode,suffix,width,order,optype): argument
6 d['suffix']=suffix
14 elif suffix == 'pd':
16 elif suffix == 'sd':
18 elif suffix == 'ss':
36 for (suffix,width) in combos:
39 emit(opcode,suffix,width,order,optype)
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| D | OutputCollector.java | 42 private ArrayList<DalvInsn> suffix; field in OutputCollector
56 this.suffix = new ArrayList<DalvInsn>(suffixInitialCapacity); in OutputCollector()
88 suffix.add(insn); in addSuffix()
100 if (suffix == null) { in getFinisher()
113 int size = suffix.size(); in appendSuffixToOutput()
116 finisher.add(suffix.get(i)); in appendSuffixToOutput()
119 suffix = null; in appendSuffixToOutput()
|
| /external/easymock/src/org/easymock/internal/matchers/ |
| D | EndsWith.java | 26 private final String suffix; field in EndsWith
28 public EndsWith(String suffix) { in EndsWith() argument
29 this.suffix = suffix; in EndsWith()
33 return (actual instanceof String) && ((String) actual).endsWith(suffix); in matches()
37 buffer.append("endsWith(\"" + suffix + "\")"); in appendTo()
|
| /external/mesa3d/src/mesa/program/ |
| D | program_parse_extra.c | 38 const char *suffix, in _mesa_parse_instruction_suffix() argument
51 switch (suffix[0]) { in _mesa_parse_instruction_suffix()
54 suffix++; in _mesa_parse_instruction_suffix()
58 suffix++; in _mesa_parse_instruction_suffix()
62 suffix++; in _mesa_parse_instruction_suffix()
73 if (suffix[0] == 'C') { in _mesa_parse_instruction_suffix()
75 suffix++; in _mesa_parse_instruction_suffix()
84 if (strcmp(suffix, "_SAT") == 0) { in _mesa_parse_instruction_suffix()
86 suffix += 4; in _mesa_parse_instruction_suffix()
93 return suffix[0] == '\0'; in _mesa_parse_instruction_suffix()
|
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| D | program_parse_extra.c | 38 const char *suffix, in _mesa_parse_instruction_suffix() argument
51 switch (suffix[0]) { in _mesa_parse_instruction_suffix()
54 suffix++; in _mesa_parse_instruction_suffix()
58 suffix++; in _mesa_parse_instruction_suffix()
62 suffix++; in _mesa_parse_instruction_suffix()
73 if (suffix[0] == 'C') { in _mesa_parse_instruction_suffix()
75 suffix++; in _mesa_parse_instruction_suffix()
84 if (strcmp(suffix, "_SAT") == 0) { in _mesa_parse_instruction_suffix()
86 suffix += 4; in _mesa_parse_instruction_suffix()
93 return suffix[0] == '\0'; in _mesa_parse_instruction_suffix()
|