Home
last modified time | relevance | path

Searched refs:word (Results 1 – 23 of 23) sorted by relevance

/system/chre/platform/arm/include/chre/target_platform/
Datomic_base.h54 inline uint32_t swapWord(volatile uint32_t *word, uint32_t newValue) { in swapWord() argument
62 : "=r"(prevValue), "=r"(storeFailed), "=r"(newValue), "=r"(word) in swapWord()
63 : "2"(newValue), "3"(word) in swapWord()
77 inline uint32_t addToWord(volatile uint32_t *word, uint32_t addend) { in addToWord() argument
88 "=r"(word) in addToWord()
89 : "3"(addend), "4"(word) in addToWord()
103 inline uint32_t subFromWord(volatile uint32_t *word, uint32_t arg) { in subFromWord() argument
113 : "=r"(prevValue), "=r"(storeFailed), "=r"(tmp), "=r"(arg), "=r"(word) in subFromWord()
114 : "3"(arg), "4"(word) in subFromWord()
/system/extras/perf_tools/
Dparse_timing.py87 for word in sorted(events, key=events.get, reverse=True):
88 if (events[word]) > timing:
89 print("event:{} \ttiming:{} ".format(word, events[word]))
126 for word in sorted(events, key=events.get, reverse=True):
127 if (events[word]) > 10:
128 … print("{} \tdiff {} \t{} \t{}".format(word, events[word],file1_events[word], file2_events[word]))
Dsbtpull.py109 def find(self, word): argument
112 if item.text.find(word) != -1:
115 def findFirst(self, word): argument
116 itemList = self.find(word)
371 for word in self.keyWords:
372 item = self.logFile.logLineList.findFirst(word)
378 for word in self.keyWords:
379 item = self.logFile.logLineList.findFirst(word)
383 print("Did not find {} ".format(word))
/system/extras/simpleperf/
Dread_symbol_map.cpp50 auto word = ConsumeWord(content_ref); in ConsumeUInt() local
51 if (!word) { in ConsumeUInt()
56 const char* start = word.value().data(); in ConsumeUInt()
59 if (errno != 0 || stop - start != word.value().size()) { in ConsumeUInt()
/system/libhwbinder/
DDebug.cpp221 size_t word; in printHexData() local
223 for (word = 0; word < bytesPerLine; ) { in printHexData()
229 const size_t startIndex = word+align_offset; in printHexData()
234 if (index == 0 && word > 0 && alignment > 0) { in printHexData()
248 if (index == 0 && word > 0) { in printHexData()
264 word += index; in printHexData()
/system/chre/tools/
Dtodo_checker.py141 any(word in line.lower() for word in ['bug:', 'fixes:'])][0]
/system/core/storaged/tools/
Dranker.py70 def is_number(word): argument
72 int(word)
/system/core/rootdir/
DAndroid.mk170 ; mkdir -p $(dir $(TARGET_ROOT_OUT)/$(word 2,$(p))) \
171 ; ln -sf $(word 1,$(p)) $(TARGET_ROOT_OUT)/$(word 2,$(p)))
/system/extras/perf_tools/bats/
Dlcan.py102 for word in reversed(lineTextWords):
103 index = word.find(":")
105 moduleName = word[:index]
444 def find(self, word): argument
445 if (self.lineText.find(word)!=-1):
451 for word in words:
452 if (self.lineText.find(word)==-1):
/system/core/init/
Dsubcontext_test.cpp101 for (const auto& word : expected_words) { in TEST() local
104 word, in TEST()
/system/core/libcrypto_utils/
Dandroid_pubkey.cpp27 #error RSA modulus size must be multiple of the word size!
/system/core/debuggerd/libdebuggerd/
Dtombstone_proto_to_text.cpp227 uint64_t word = 0; in print_thread_memory_dump() local
230 memcpy(&word, mem.memory().data() + offset + i, word_size); in print_thread_memory_dump()
232 StringAppendF(&line, " %0*" PRIx64, word_size * 2, word); in print_thread_memory_dump()
/system/media/camera/docs/
Dhtml.mako41 table { border-collapse:collapse; table-layout: fixed; width: 100%; word-wrap: break-word }
/system/timezone/output_data/icu_overlay/
DLICENSE135 # The word list in cjdict.txt are generated by combining three word lists
136 # listed below with further processing for compound word breaking. The
349 # github.com/kanyawtech/myanmar-karen-word-lists
/system/timezone/testing/data/test3/output_data/icu_overlay/
DLICENSE135 # The word list in cjdict.txt are generated by combining three word lists
136 # listed below with further processing for compound word breaking. The
349 # github.com/kanyawtech/myanmar-karen-word-lists
/system/timezone/testing/data/test1/output_data/icu_overlay/
DLICENSE135 # The word list in cjdict.txt are generated by combining three word lists
136 # listed below with further processing for compound word breaking. The
349 # github.com/kanyawtech/myanmar-karen-word-lists
/system/netd/server/
DNetdNativeService.cpp114 bool contains(const Vector<String16>& words, const String16& word) { in contains() argument
116 if (w == word) return true; in contains()
/system/apex/
Dpylintrc376 # A path to a file that contains private dictionary; one word per line.
/system/tools/mkbootimg/
Dpylintrc369 # A path to a file that contains private dictionary; one word per line.
/system/update_engine/
Dpylintrc178 # A path to a file that contains private dictionary; one word per line.
/system/chre/pal/doc/
DDoxyfile29 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
233 # This tag can be used to specify a number of word-keyword mappings (TCL only).
298 # be prevented in individual cases by putting a % sign in front of the word or
834 # output. The symbol name can be a fully qualified name, a word, or if the
/system/chre/chre_api/doc/
DDoxyfile29 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
233 # This tag can be used to specify a number of word-keyword mappings (TCL only).
298 # be prevented in individual cases by putting a % sign in front of the word or
834 # output. The symbol name can be a fully qualified name, a word, or if the
/system/media/audio_utils/
DDoxyfile29 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
256 # This tag can be used to specify a number of word-keyword mappings (TCL only).
339 # be prevented in individual cases by putting a % sign in front of the word or
883 # output. The symbol name can be a fully qualified name, a word, or if the