HomeSort by relevance Sort by last modified time
    Searched refs:stop (Results 276 - 300 of 3591) sorted by null

<<11121314151617181920>>

  /system/netd/server/
NetlinkManager.h 47 int stop();
  /system/vold/
NetlinkHandler.cpp 39 int NetlinkHandler::stop() { function in class:NetlinkHandler
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/d10v/
instruction_packing-001.s 15 stop
  /external/llvm/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
550 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
552 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
554 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
563 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
567 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
574 /// @return First index with !stopLess(key[i].stop, x), or size.
578 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
529 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
531 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
533 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
542 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
546 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
553 /// @return First index with !stopLess(key[i].stop, x), or size.
557 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
552 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
554 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
556 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
565 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
569 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
576 /// @return First index with !stopLess(key[i].stop, x), or size.
580 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
552 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
554 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
556 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
565 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
569 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
576 /// @return First index with !stopLess(key[i].stop, x), or size.
580 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
IntervalMap.h 28 // value. The interval bounds are accessible through the start() and stop()
52 // KeyT stop() const;
75 // const KeyT &stop() const;
553 // - Traits::stopLess(start(i), stop(i)) - Non-empty, sane intervals.
555 // - Traits::stopLess(stop(i), start(i + 1) - Sorted.
557 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
570 KeyT &stop(unsigned i) { return this->first[i].second; } function in class:llvm::IntervalMapImpl::LeafNode
577 /// @return First index with !stopLess(key[i].stop, x), or size.
581 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) &
    [all...]
  /external/libxaac/decoder/
ixheaacd_tns.c 184 WORD32 f, max_order, start, stop, size, inc; local
223 stop = filt->stop_band;
245 stop = ixheaacd_min32(stop, tmp);
246 stop = ixheaacd_min32(stop, nbands);
247 stop = sfb_offset(stop);
251 if ((size = stop - start) <= 0) continue;
255 shift = stop - 1
    [all...]
  /external/skia/src/core/
SkUtils.cpp 93 const char* stop = utf8 + byteLength; local
95 while (utf8 < stop) {
98 if (!utf8_type_is_valid_leading_byte(type) || utf8 + type > stop) {
272 const uint16_t* stop = src + (byteLength >> 1);
274 while (src < stop) {
278 if (src >= stop) {
358 const uint16_t* stop = utf16 + numberOf16BitValues;
362 while (utf16 < stop) {
367 while (utf16 < stop) {
391 const uint32_t* stop = ptr + (byteLength >> 2)
    [all...]
  /external/skqp/src/core/
SkUtils.cpp 93 const char* stop = utf8 + byteLength; local
95 while (utf8 < stop) {
98 if (!utf8_type_is_valid_leading_byte(type) || utf8 + type > stop) {
272 const uint16_t* stop = src + (byteLength >> 1);
274 while (src < stop) {
278 if (src >= stop) {
358 const uint16_t* stop = utf16 + numberOf16BitValues;
362 while (utf16 < stop) {
367 while (utf16 < stop) {
391 const uint32_t* stop = ptr + (byteLength >> 2)
    [all...]
  /developers/build/prebuilts/gradle/MidiScope/Application/src/main/java/com/example/android/common/midi/
MidiEventThread.java 49 // OK, this is how we stop the thread.
55 * Asynchronously tell the thread to stop.
64 stop(); method
70 * Asks the thread to stop then waits for it to stop.
72 public void stop() { method in class:MidiEventThread
79 "Interrupted while waiting for MIDI EventScheduler thread to stop.");
  /developers/build/prebuilts/gradle/MidiSynth/Application/src/main/java/com/example/android/common/midi/
MidiEventThread.java 49 // OK, this is how we stop the thread.
55 * Asynchronously tell the thread to stop.
64 stop(); method
70 * Asks the thread to stop then waits for it to stop.
72 public void stop() { method in class:MidiEventThread
79 "Interrupted while waiting for MIDI EventScheduler thread to stop.");
  /developers/samples/android/common/src/java/com/example/android/common/midi/
MidiEventThread.java 49 // OK, this is how we stop the thread.
55 * Asynchronously tell the thread to stop.
64 stop(); method
70 * Asks the thread to stop then waits for it to stop.
72 public void stop() { method in class:MidiEventThread
79 "Interrupted while waiting for MIDI EventScheduler thread to stop.");

Completed in 706 milliseconds

<<11121314151617181920>>