/freebsd/sys/dev/ice/ |
H A D | ice_resmgr.c | 61 * @num_res: the maximum number of resources it can assign 64 * assign up to the requested number of resources. Uses bit strings to track 65 * which resources have been assigned. This type of resmgr is intended to be 71 resmgr->resources = bit_alloc(num_res, M_ICE_RESMGR, M_NOWAIT); in ice_resmgr_init() 72 if (resmgr->resources == NULL) in ice_resmgr_init() 83 * @num_res: the maximum number of resources it can assign 108 * resources have been released. 113 if (resmgr->resources != NULL) { in ice_resmgr_destroy() 117 bit_count(resmgr->resources, 0, resmgr->num_res, &set); in ice_resmgr_destroy() 121 free(resmgr->resources, M_ICE_RESMG in ice_resmgr_destroy() [all...] |
/freebsd/sys/isa/ |
H A D | pnp.c | 219 * Constrain the number of resources we will try to program in pnp_set_config() 243 * Now program the resources. in pnp_set_config() 385 u_char *resources, int len) in pnp_create_devices() argument 396 resp = resources; in pnp_create_devices() 456 * Parse the resources for the previous in pnp_create_devices() 468 * resources. in pnp_create_devices() 501 device_printf(parent, "malformed resources\n"); in pnp_create_devices() 522 * Read 'amount' bytes of resources from the card, allocating memory 527 * number of bytes of resources in '*spacep' and '*lenp' respectively. 536 u_char *resources in pnp_read_bytes() local 584 u_char *resources = *resourcesp; pnp_read_resources() local 645 u_char *resources = NULL; pnp_isolation_protocol() local [all...] |
/freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
H A D | ResourceManager.cpp | 112 : Resources(SM.getNumProcResourceKinds() - 1), in ResourceManager() 130 Resources[Index] = in ResourceManager() 132 Strategies[Index] = getStrategyFor(*Resources[Index]); in ResourceManager() 138 const ResourceState &RS = *Resources[Index]; in ResourceManager() 161 assert(Index < Resources.size() && "Invalid processor resource index!"); in setCustomStrategyImpl() 171 return Resources[getResourceStateIndex(ResourceID)]->getNumUnits(); in getNumUnits() 179 assert(Index < Resources.size() && "Invalid resource use!"); in selectPipe() 180 ResourceState &RS = *Resources[Index]; in selectPipe() 197 ResourceState &RS = *Resources[RSID]; in use() 199 // Remember to update the resource strategy for non-group resources wit in use() [all...] |
H A D | Scheduler.cpp | 36 Resources->dump(); in dump() 42 Resources->canBeDispatched(IR.getInstruction()->getUsedBuffers()); in isAvailable() 76 // Issue the instruction and collect all the consumed resources in issueInstructionImpl() 78 Resources->issueInstruction(D, UsedResources); in issueInstructionImpl() 98 // Release the buffered resources and issue the instruction. 108 Resources->releaseBuffers(Inst.getUsedBuffers()); in issueInstruction() 199 uint64_t BusyResourceMask = Resources->checkAvailability(IS.getDesc()); in select() 253 if (Resources->checkAvailability(IS.getDesc())) in analyzeDataDependencies() 270 // Release consumed resources. in cycleEvent() 271 Resources in cycleEvent() [all...] |
/freebsd/sys/compat/linuxkpi/common/include/linux/ |
H A D | vgaarb.h | 77 * vga_get - acquire & locks VGA resources 80 * @rsrc: bit mask of resources to acquire and lock 83 * This function acquires VGA resources for the given 84 * card and mark those resources locked. If the resource requested 85 * are "normal" (and not legacy) resources, the arbiter will first check 90 * on P2P bridges if necessary, so that the requested resources can 91 * be used. Then, the card is marked as locking these resources and 95 * one of the required resources (or any resource on a different bus 100 * If the card already owns the resources, the function succeeds. 135 * vga_tryget - try to acquire & lock legacy VGA resources [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/ |
H A D | DXILResourceAnalysis.h | 9 /// \file This file contains Analysis for information about DXIL resources. 28 typedef dxil::Resources Result; 29 dxil::Resources run(Module &M, ModuleAnalysisManager &AM); 45 dxil::Resources Resources; 52 dxil::Resources &getDXILResource() { return Resources; } in getDXILResource() 53 const dxil::Resources &getDXILResource() const { return Resources; } 44 dxil::Resources Resources; global() variable
|
H A D | DXILResourceAnalysis.cpp | 9 /// \file This file contains Analysis for information about DXIL resources. 21 dxil::Resources DXILResourceAnalysis::run(Module &M, in run() 23 dxil::Resources R; in run() 32 dxil::Resources Res = AM.getResult<DXILResourceAnalysis>(M); in run() 44 Resources.collect(M); in runOnModule() 51 Resources.print(OS); in print()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/ |
H A D | TargetSchedule.td | 14 // 2. Scheduler Read/Write resources for simple per-opcode cost model. 27 // processor resources and latency with each SchedReadWrite type. 32 // be subtarget specific and can be directly associated with resources 38 // subtarget can directly associate resources with SchedReadWrite 85 // Per-cycle resources tables. 136 // Define a number of interchangeable processor resources. NumUnits 139 // An optional Super resource may be given to model these resources as 140 // a subset of the more general super resources. Using one of these 141 // resources implies using one of the super resources. 143 // ProcResourceUnits normally model a few buffered resources within an [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonHazardRecognizer.cpp | 29 Resources->clearResources(); in Reset() 44 if (!Resources->canReserveResources(*MI)) { in getHazardType() 48 // The .new store version uses different resources so check if it in getHazardType() 54 if (Resources->canReserveResources(*NewMI)) in getHazardType() 74 Resources->clearResources(); in AdvanceCycle() 92 /// store doesn't have resources to fit in the packet (but the .new store may 93 /// have resources). We attempt to schedule the store as soon as possible to 126 if (!Resources->canReserveResources(*MI) || isNewStore(*MI)) { in EmitInstruction() 134 if (Resources->canReserveResources(*NewMI)) in EmitInstruction() 135 Resources->reserveResources(*NewMI); in EmitInstruction() [all …]
|
H A D | HexagonHazardRecognizer.h | 23 DFAPacketizer *Resources; variable 35 // The .new store uses different resources than a normal store, and the 37 // resources available (even if the .new version does). To help, the schedule 51 : Resources(ST.createDFAPacketizer(II)), TII(HII) { } in HexagonHazardRecognizer() 54 if (Resources) in ~HexagonHazardRecognizer() 55 delete Resources; in ~HexagonHazardRecognizer() local
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 51 /// The index within the uniqued set of required resources of Resources. 56 /// Resources are unique across all itineraries. 57 ResourceVector Resources; member 119 "Exceeded maximum number of representable resources"); in collectAllFuncUnits() 149 "Exceeded maximum number of DFA resources"); in collectAllComboFuncs() 178 ResourceVector Resources; in getResourcesForItinerary() local 186 Resources.push_back(StageResources); in getResourcesForItinerary() 188 return Resources; in getResourcesForItinerary() 199 ResourceVector Resources = getResourcesForItinerary(Itinerary); in createScheduleClasses() local 201 {ItineraryIdx, Idx++, UniqueResources.insert(Resources), Resources}); in createScheduleClasses() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
H A D | ResourceManager.h | 46 /// Resource allocation strategy used by hardware scheduler resources. 66 /// processor resources with multiple units. 103 /// this group. The idea is to bias the selection strategy, so that resources 160 /// In this example, resources A, B and C are processor resource units. 161 /// Only resource D is a group resource, and it contains resources B and C. 172 /// For normal (i.e. non-group) resources, the number of bits set in this mask 180 /// Buffered resources will have this field set to a positive number different 184 /// A BufferSize of 1 is used by scheduler resources that force in-order 187 /// A BufferSize of 0 is used to model in-order issue/dispatch resources. 188 /// Since in-order issue/dispatch resources do 339 std::vector<std::unique_ptr<ResourceState>> Resources; global() variable [all...] |
H A D | Scheduler.h | 64 /// resources. 67 /// resources. This class is also responsible for tracking the progress of 76 // Hardware resources that are managed by this scheduler. 77 std::unique_ptr<ResourceManager> Resources; variable 119 // the ready set due to unavailable pipeline resources. 167 : LSU(Lsu), Resources(std::move(RM)), BusyResourceUnits(0), in Scheduler() 182 /// Return SC_AVAILABLE if both scheduler and LS resources are available. 185 /// IR cannot be dispatched to the Scheduler due to unavailable resources. 188 /// Reserves buffer and LSUnit queue resources that are necessary to issue 200 /// Issue an instruction and populates a vector of used pipeline resources, [all...] |
/freebsd/crypto/openssl/doc/man3/ |
H A D | OPENSSL_init_crypto.pod | 32 During normal operation OpenSSL (libcrypto) will allocate various resources at 34 Additionally some resources are allocated on a per thread basis (if the 35 application is multi-threaded), and these resources must be freed prior to the 38 As of version 1.1.0 OpenSSL will automatically allocate all resources that it 192 and libssl). All resources allocated by OpenSSL are freed. Typically there 212 called after deinitialisation of resources local to a thread, but before other 213 process wide resources are freed. In the event that multiple stop handlers are 216 The OPENSSL_thread_stop_ex() function deallocates resources associated 229 resources are cleaned up on library exit) except if thread local resources 256 Resources local to a thread are deallocated automatically when the thread exits [all …]
|
/freebsd/secure/lib/libcrypto/man/man3/ |
H A D | OPENSSL_init_crypto.3 | 91 During normal operation OpenSSL (libcrypto) will allocate various resources at 93 Additionally some resources are allocated on a per thread basis (if the 94 application is multi-threaded), and these resources must be freed prior to the 97 As of version 1.1.0 OpenSSL will automatically allocate all resources that it 230 and libssl). All resources allocated by OpenSSL are freed. Typically there 250 called after deinitialisation of resources local to a thread, but before other 251 process wide resources are freed. In the event that multiple stop handlers are 254 The \fBOPENSSL_thread_stop_ex()\fR function deallocates resources associated 267 resources are cleaned up on library exit) except if thread local resources 293 Resources local to a thread are deallocated automatically when the thread exits [all …]
|
/freebsd/sys/dev/bhnd/bhndb/ |
H A D | bhndbvar.h | 93 struct bhndb_host_resources **resources, 98 struct bhndb_host_resources *resources); 100 struct bhndb_host_resources *resources, 104 struct bhndb_host_resources *resources, 147 struct resource_list resources; /**< child resources. */ member 160 * Host resources allocated for a bridge hardware configuration. 163 device_t owner; /**< device owning the allocated resources */ 166 struct resource **resources; /**< allocated resource table */ member
|
H A D | bhndb_subr.c | 75 * Call BHNDB_SUSPEND_RESOURCE() for all resources in @p rl. 82 /* Suspend all child resources. */ in bhndb_do_suspend_resources() 84 /* Skip non-allocated resources */ in bhndb_do_suspend_resources() 98 * to find the child's resources and call BHNDB_SUSPEND_RESOURCE() for all 99 * child resources, ensuring that the device's allocated bridge resources 102 * Before suspending any resources, @p child is suspended by 129 /* Suspend all child resources. */ in bhnd_generic_br_suspend_child() 140 * to find the child's resources and call BHNDB_RESUME_RESOURCE() for all 141 * child resources, before delegating to bhnd_generic_resume_child(). 166 /* Resume all resources */ in bhnd_generic_br_resume_child() [all …]
|
/freebsd/secure/lib/libcrypto/man/man7/ |
H A D | openssl-quic-concurrency.7 | 67 A QUIC domain is a group of QUIC resources such as listeners (see 69 resources, such as internal pollers, timers and locks. All usage of OpenSSL QUIC 72 These resources can be accessed and used concurrently depending on the 143 resources like any other thread. However, handshake layer events (TLS) are never 160 creation of additional OS resources such as internal file descriptors to allow 161 threads to be woken when necessary. This creation of internal OS resources is 217 Enable reliable support for blocking I/O calls, allocating whatever OS resources 221 Details on the allocated OS resources can be found under "CONSUMPTION OF OS 222 RESOURCES" below. 269 .SH "CONSUMPTION OF OS RESOURCES" [all …]
|
/freebsd/contrib/llvm-project/libcxx/src/experimental/ |
H A D | memory_resource.cpp |
|
/freebsd/sys/contrib/zstd/examples/ |
H A D | multiple_simple_compression.c | 23 } resources; typedef 29 static resources createResources_orDie(int argc, const char** argv, char **ofn, size_t* ofnBufferLe… in createResources_orDie() 44 resources ress; in createResources_orDie() 57 static void freeResources(resources ress, char *outFilename) in freeResources() 66 static void compressFile_orDie(resources ress, const char* fname, const char* oname) in compressFile_orDie() 94 /* memory allocation for outFilename and resources */ in main() 97 resources const ress = createResources_orDie(argc, argv, &outFilename, &outFilenameBufferLen); in main()
|
/freebsd/crypto/krb5/src/windows/leash/htmlhelp/html/ |
H A D | Kerberos_Terminology.htm | 28 network resources that use Kerberos also have unique principals. 39 resources and identities that use Kerberos. Your realm is the home of 40 your Kerberos identity and your point of entry to the network resources 44 group identities and network resources into realms. For example, some 45 installations group all network resources into one realm. Others group 47 resources grouped in other realms. Depending on your installation and 71 access all of the appropriate network resources in the realm you use, 74 When you access one of these resources, MIT Kerberos passes your
|
/freebsd/contrib/llvm-project/llvm/lib/MCA/Stages/ |
H A D | InstructionTables.cpp | 26 // Identify the resources consumed by this instruction. in execute() 28 Desc.Resources) { in execute() 29 // Skip zero-cycle resources (i.e., unused resources). in execute() 46 // This is a group. Obtain the set of resources contained in this in execute() 47 // group. Some of these resources may implement multiple units. in execute()
|
/freebsd/sys/dev/bhnd/cores/pmu/ |
H A D | bhnd_pmureg.h | 401 /* 4716/47162 PMU resources */ 408 /* 5354 PMU resources */ 434 /* 4328 PMU resources */ 456 /* 4325 A0/A1 PMU resources */ 480 /* 4325 B0/C0 PMU resources */ 486 /* 4325 C1 PMU resources */ 489 /* 4325 PMU resources */ 513 /* 4312 PMU resources (all PMU chips with little memory constraint) */ 530 /* 4322 PMU resources */ 546 /* 43236 PMU resources */ [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
H A D | RISCVScheduleV.td | 10 /// Define scheduler resources associated with def operands. 51 // Creates WriteRes for (name, mx, resources) tuple 52 multiclass LMULWriteResMX<string name, list<ProcResourceKind> resources, 54 def : WriteRes<!cast<SchedWrite>(name # "_" # mx), resources>; 56 def : WriteRes<!cast<SchedWrite>(name # "_WorstCase"), resources>; 58 multiclass LMULSEWWriteResMXSEW<string name, list<ProcResourceKind> resources, 60 def : WriteRes<!cast<SchedWrite>(name # "_" # mx # "_E" # sew), resources>; 62 def : WriteRes<!cast<SchedWrite>(name # "_WorstCase"), resources>; 71 list<ProcResourceKind> resources, 80 def nameMX # "_Pred" : SchedWriteRes<resources>{ [all …]
|
/freebsd/crypto/openssl/doc/man7/ |
H A D | openssl-quic-concurrency.pod | 9 A QUIC domain is a group of QUIC resources such as listeners (see 11 resources, such as internal pollers, timers and locks. All usage of OpenSSL QUIC 14 These resources can be accessed and used concurrently depending on the 113 resources like any other thread. However, handshake layer events (TLS) are never 133 creation of additional OS resources such as internal file descriptors to allow 134 threads to be woken when necessary. This creation of internal OS resources is 209 Enable reliable support for blocking I/O calls, allocating whatever OS resources 213 Details on the allocated OS resources can be found under L</CONSUMPTION OF OS 214 RESOURCES> below. 279 =head1 CONSUMPTION OF OS RESOURCES [all …]
|