| /device/linaro/bootloader/edk2/MdeModulePkg/Core/PiSmmCore/ |
| PiSmmCore.h | 6 This program and the accompanying materials are licensed and made available
221 @retval EFI_OUT_OF_RESOURCES There is not enough memory available to complete the operation.
743 Place holder function until all the SMM System Table Service are available.
998 BOOLEAN Available;
|
| /external/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 13 /// block. It also provides a mechanism to make registers available by evicting
333 "No available scavenger restore location!");
366 BitVector Available = getRegsAvailable(RC);
367 Available &= Candidates;
368 if (Available.any())
369 Candidates = Available;
381 // Find an available scavenging slot with size and alignment matching
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.h | 136 ReadyQueue Available;
146 /// MinReadyCycle - Cycle of the soonest available instruction.
155 DAG(nullptr), SchedModel(nullptr), Available(ID, Name+".A"),
172 return Available.getID() == ConvergingVLIWScheduler::TopQID;
|
| /external/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 363 BitVector Available = rs.getRegsAvailable(&Mips::CPU16RegsRegClass);
364 Available &= Candidates;
372 Reg = Available.find_first();
384 Available.reset(Reg);
388 SpReg = Available.find_first();
400 Available.reset(SpReg);
|
| /prebuilts/go/darwin-x86/src/bufio/ |
| bufio.go | 232 // If no byte is available, returns an error.
582 // Available returns how many bytes are unused in the buffer.
583 func (b *Writer) Available() int { return len(b.buf) - b.n }
593 for len(p) > b.Available() && b.err == nil {
621 if b.Available() <= 0 && b.Flush() != nil {
642 n := b.Available()
647 n = b.Available()
664 for len(s) > b.Available() && b.err == nil {
689 if b.Available() == 0 {
713 if b.Available() == 0
[all...] |
| /prebuilts/go/linux-x86/src/bufio/ |
| bufio.go | 232 // If no byte is available, returns an error.
582 // Available returns how many bytes are unused in the buffer.
583 func (b *Writer) Available() int { return len(b.buf) - b.n }
593 for len(p) > b.Available() && b.err == nil {
621 if b.Available() <= 0 && b.Flush() != nil {
642 n := b.Available()
647 n = b.Available()
664 for len(s) > b.Available() && b.err == nil {
689 if b.Available() == 0 {
713 if b.Available() == 0
[all...] |
| /external/v8/src/heap/ |
| spaces-inl.h | 275 added += category->available();
614 size_t LargeObjectSpace::Available() {
615 return ObjectSizeFor(heap()->memory_allocator()->Available());
|
| heap.cc | 239 size_t Heap::Available() {
245 total += space->Available();
280 // Note that MemoryAllocator->MaxAvailable() undercounts the memory available
283 // and does not count available bytes already in the old space or code
331 " available: %6" PRIuS " KB\n",
333 memory_allocator()->Available() / KB);
336 ", available: %6" PRIuS
339 new_space_->Size() / KB, new_space_->Available() / KB,
343 ", available: %6" PRIuS
346 old_space_->SizeOfObjects() / KB, old_space_->Available() / KB
[all...] |
| spaces.h | 189 size_t available() const { return available_; } function in class:v8::internal::FreeListCategory
213 // |available_|: Total available bytes in all blocks of this free list
763 void add_available_in_free_list(size_t available) {
764 DCHECK_LE(available, area_size());
765 available_in_free_list_.Increment(available);
767 void remove_available_in_free_list(size_t available) {
768 DCHECK_LE(available, area_size());
769 DCHECK_GE(available_in_free_list(), available); local
770 available_in_free_list_.Decrement(available);
886 // Return the available bytes without growing
1719 size_t available = 0; local
[all...] |
| /frameworks/base/packages/Osu/src/com/android/hotspot2/flow/ |
| OSUInfo.java | 31 Available // Icon data retrieved
167 mIconStatus = IconStatus.Available;
|
| /tools/tradefederation/core/tests/src/com/android/tradefed/device/ |
| MockDeviceManager.java | 38 // acts as an available device queue
205 DeviceAllocationState.Allocated, DeviceAllocationState.Available);
260 mDvcMon.notifyDeviceStateChange(d.getSerialNumber(), DeviceAllocationState.Available,
|
| /device/linaro/bootloader/edk2/OvmfPkg/XenBusDxe/ |
| XenStore.c | 347 free region available for output in a ring buffer.
352 @param LenPtr The amount of contiguous storage available.
376 data available to read from a ring buffer.
381 @param LenPtr The amount of contiguous data available to read.
383 @return A pointer to the start location of the available data.
467 UINT32 Available;
494 Dest = XenStoreGetOutputChunk (Cons, Prod, xs.XenStore->req, &Available);
495 if (Available > Len) {
496 Available = Len;
499 CopyMem (Dest, Data, Available);
[all...] |
| /device/linaro/bootloader/edk2/UefiCpuPkg/Universal/Acpi/S3Resume2Pei/ |
| S3Resume.c | 10 are licensed and made available under the terms and conditions
95 UINT64 Available:3; // Available for use by system software
97 UINT64 AvabilableHigh:11; // Available for use by system software
117 UINT64 Available:3; // Available for use by system software
121 UINT64 AvabilableHigh:11; // Available for use by system software
141 UINT64 Available:3; // Available for use by system software
145 UINT64 AvabilableHigh:11; // Available for use by system software
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 128 /// MachineSchedRegistry provides a selection of available machine instruction
599 ReadyQueue Available;
617 /// MinReadyCycle - Cycle of the soonest available instruction.
662 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
674 return Available.getID() == TopQID;
748 /// Call this before applying any other heuristics to the Available queue.
749 /// Updates the Available/Pending Q's if necessary and returns the single
750 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 114 /// MachineSchedRegistry provides a selection of available machine instruction
584 ReadyQueue Available;
606 /// MinReadyCycle - Cycle of the soonest available instruction.
651 DAG(nullptr), SchedModel(nullptr), Rem(nullptr), Available(ID, Name+".A"),
665 return Available.getID() == TopQID;
747 /// Call this before applying any other heuristics to the Available queue.
748 /// Updates the Available/Pending Q's if necessary and returns the single
749 /// available instruction, or NULL if there are multiple candidates.
[all...] |
| /prebuilts/go/darwin-x86/src/net/http/ |
| h2_bundle.go | 485 // It is an error to read when no data is available.
536 func (f *http2flow) available() int32 { func
545 if n > f.available() {
[all...] |
| /prebuilts/go/linux-x86/src/net/http/ |
| h2_bundle.go | 485 // It is an error to read when no data is available.
536 func (f *http2flow) available() int32 { func
545 if n > f.available() {
[all...] |
| /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-directconnect/1.11.18/ |
| aws-java-sdk-directconnect-1.11.18.jar | |
