Home
last modified time | relevance | path

Searched full:aggregate (Results 1 – 25 of 455) sorted by relevance

12345678910>>...19

/freebsd-src/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestGetAggregate.java50 Aggregate aggregate; in testIncluded() local
58 // Wait up to a full second to obtain aggregate data. Without a in testIncluded()
63 aggregate = consumer.getAggregate(included, null); in testIncluded()
64 } while (aggregate.asMap().isEmpty() && n++ < (1000 / TICK)); in testIncluded()
67 if (aggregate.getAggregation(name) == null) { in testIncluded()
70 "in the aggregate"); in testIncluded()
73 for (Aggregation a : aggregate.getAggregations()) { in testIncluded()
77 "in the aggregate anyway"); in testIncluded()
90 Aggregate aggregate; in testCleared() local
104 aggregate = consumer.getAggregate(null, cleared); in testCleared()
[all …]
H A DTestFunctionLookup.java54 Aggregate a; in main()
92 Aggregate a = consumer.getAggregate(); in main()
/freebsd-src/contrib/llvm-project/clang/lib/CodeGen/
H A DCGValue.h41 /// address of an aggregate value in memory.
45 enum FlavorEnum { Scalar, Complex, Aggregate };
54 // Stores aggregate address. in isScalar()
66 bool isAggregate() const { return Flavor == Aggregate; }
82 /// getAggregateAddr() - Return the Value* of the address of the aggregate. in getAggregatePointer()
84 assert(isAggregate() && "Not an aggregate!"); in getIgnored()
118 // FIXME: Aggregate rvalues need to retain information about whether they are
128 ER.Flavor = Aggregate;
503 /// An aggregate value slot. in MakeMatrixElt()
532 /// This flag controls whether calls that produce the aggregate
40 enum Flavor { Scalar, Complex, Aggregate }; global() enumerator
[all...]
H A DCGExprAgg.cpp1 //===--- CGExprAgg.cpp - Emit LLVM Code from Aggregate Expressions --------===//
9 // This contains code to emit Aggregate Expr nodes as LLVM code.
35 // Aggregate Expression Emitter
76 /// EmitAggLoadOfLValue - Given an expression with aggregate type that
112 CGF.ErrorUnsupported(S, "aggregate expression"); in VisitParenExpr()
247 /// EmitAggLoadOfLValue - Given an expression with aggregate type that
262 /// True if the given aggregate type requires special GC API calls. in TypeRequiresGCollection()
342 assert(src.isAggregate() && "value must be aggregate value!"); in EmitFinalDestCopy()
351 // If Dest is ignored, then we're evaluating an aggregate expression in EmitFinalDestCopy()
388 /// \param type - the type of the aggregate bein in EmitCopy()
[all...]
H A DABIInfo.h100 /// aggregate. Base is set to the base element type, and Members is set
144 /// Returns true if an aggregate which expands to the given type sequence
/freebsd-src/sys/dev/ath/
H A Dif_ath_tx_ht.c447 * in the aggregate. in ath_compute_num_delims()
587 * or aggregate is setup. in ath_get_aggr_limit()
606 * If this is the first frame in an aggregate series,
607 * use the aggregate length.
762 * Form an aggregate packet list. in ath_buf_set_rate()
764 * This function enforces the aggregate restrictions/requirements. in ath_buf_set_rate()
768 * + The aggregate size maximum (64k for AR9160 and later, 8K for in ath_buf_set_rate()
770 * + Maximum number of sub-frames for an aggregate in ath_buf_set_rate()
771 * + The aggregate delimiter size, giving MACs time to do whatever is in ath_buf_set_rate()
791 * dispatch aggregate frame
[all...]
H A Dif_ath_tx.c360 * For aggregates, this is called on each frame in the aggregate.
440 * Make sure the 11n aggregate fields are cleared. in ath_tx_chaindesclist()
443 * aggregate frames; as it'll be called on all in ath_tx_chaindesclist()
452 * If 11n is enabled, set it up as if it's an aggregate in ath_tx_chaindesclist()
465 * aggregate! in ath_tx_chaindesclist()
544 * Setup segments+descriptors for an 11n aggregate.
545 * bf_first is the first buffer in the aggregate.
598 * aggregate header information. in ath_tx_setds_11n()
609 * This is both aggregate and non-aggregate awar in ath_tx_setds_11n()
[all...]
H A Dif_ath_tx_edma.c160 * XXX TODO: push an aggregate as a single FIFO slot, even though
164 * aggregate or otherwise, but it may just make things easier to deal
167 * XXX TODO: track the number of aggregate subframes and put that in the
267 * of the FIFO queue. We don't adjust the aggregate in ath_tx_edma_push_staging_list()
368 * Aggregate check: if we have less than two FIFO slots in ath_edma_tx_fifo_fill()
369 * busy and we have some aggregate frames, queue it. in ath_edma_tx_fifo_fill()
372 * has given us aggregate frames and push them into the FIFO in ath_edma_tx_fifo_fill()
374 * a single aggregate in as one FIFO slot. in ath_edma_tx_fifo_fill()
/freebsd-src/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.h67 // Normally an aggregate (array, vector, or structure) is emitted as a u8[].
68 // However, if either element/field of the aggregate is a non-NULL address,
69 // and all such addresses are properly aligned, then the aggregate is
71 // aggregate is emitted as u8[], and the mask() operator is used for all
74 // We first layout the aggregate in 'buffer' in bytes, except for those
75 // symbol addresses. For the i-th symbol address in the aggregate, its
H A DNVPTXLowerAggrCopies.cpp10 // Lower aggregate copies, memset, memcpy, memmov intrinsics into loops when
53 return "Lower aggregate copies/intrinsics into loops"; in getPassName()
68 // Collect all aggregate loads and mem* calls. in runOnFunction()
147 "Lower aggregate copies, and llvm.mem* intrinsics into loops",
/freebsd-src/sys/contrib/device-tree/Bindings/sound/
H A Dti,tas2781.yaml45 aggregate as one Audio Device to support multiple audio slots.
75 aggregate as one Audio Device to support multiple audio slots.
93 aggregate as one Audio Device to support multiple audio slots.
/freebsd-src/sys/contrib/openzfs/module/zfs/
H A Dvdev_queue.c50 * In addition, the device has an aggregate maximum. Note that the sum of the
51 * per-queue minimums must not exceed the aggregate maximum. If the
52 * sum of the per-queue maximums exceeds the aggregate maximum, then the
64 * the aggregate maximum has not been hit, the scheduler looks for classes
67 * aggregate maximum number of concurrent operations has been hit or if there
196 * To reduce IOPs, we aggregate small adjacent I/Os into one large I/O.
197 * For read I/Os, we also aggregate across small adjacency gaps; for writes
199 * they aren't able to help us aggregate at this level.
224 * there are enough IOs to aggregate together to improve throughput. We want to
667 * We can aggregate I/Os that are sufficiently adjacent and of in vdev_queue_aggregate()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DAnalysis.cpp30 /// Compute the linearized index of a member in a nested aggregate/struct/array
74 /// non-aggregate types that comprise it.
287 /// @param ValLoc If V has aggregate type, we will be interested in a particular in getICmpCondCode()
343 // Value may come from either the aggregate or the scalar in getNoopInput()
347 // The type being inserted is a nested sub-type of the aggregate; we in getNoopInput()
359 // previous aggregate. Combine the two paths to obtain the true address of in getNoopInput()
419 /// For an aggregate type, determine whether a given index is within bounds or in slotOnlyDiscardsData()
435 /// outermost to innermost non-empty aggregate. The element currently in slotOnlyDiscardsData()
444 /// aggregate or a non-aggregate in slotOnlyDiscardsData()
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DAnalysis.h33 /// aggregate/struct/array.
35 /// Given an LLVM IR aggregate type and a sequence of insertvalue or
60 /// non-aggregate types that comprise it.
92 /// non-aggregate types that comprise it.
/freebsd-src/contrib/ofed/infiniband-diags/man/
H A Dperfquery.8120 all counters for all ports, or if multiple ports are specified, aggregate
128 than doing than aggregate operation.
276 perfquery \-a 32 1\-10 # read performance counters from lid 32, port 1\-10, aggregate output
278 perfquery \-a 32 1,4,8 # read performance counters from lid 32, port 1, 4, and 8, aggregate outp…
/freebsd-src/contrib/llvm-project/llvm/lib/Support/Windows/
H A DThreading.inc248 static unsigned aggregate(R &&Range, UnaryPredicate P) {
257 aggregate(getProcessorGroups(), [](const ProcessorGroup &G) {
265 aggregate(getProcessorGroups(),
318 aggregate(getProcessorGroups(),
322 aggregate(getProcessorGroups(), [&](const ProcessorGroup &G) {
/freebsd-src/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/
H A DJDTrace.java447 printAggregate(Aggregate aggregate) in printAggregate() argument
449 printAggregationRecords(aggregate.getOrderedRecords()); in printAggregate()
968 Aggregate aggregate = dtrace.getAggregate(); in main()
969 if (aggregate != null) { in main()
970 printAggregate(aggregate); in main()
1010 Aggregate aggregate = dtrace.getAggregate(); in main()
1011 if (aggregate != null) { in main()
1014 printAggregate(aggregate); in main()
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineVectorOps.cpp50 "Number of aggregate reconstructions turned into reuse of the "
51 "original aggregate");
863 /// Look for chain of insertvalue's that fully define an aggregate, and trace in foldAggregateConstructionIntoAggregateReuse()
865 /// the same source aggregate from the exact same element indexes. in foldAggregateConstructionIntoAggregateReuse()
866 /// If they were, just reuse the source aggregate. in foldAggregateConstructionIntoAggregateReuse()
880 llvm_unreachable("Unhandled aggregate type?"); in foldAggregateConstructionIntoAggregateReuse()
883 // Arbitrary aggregate size cut-off. Motivation for limit of 2 is to be able in foldAggregateConstructionIntoAggregateReuse()
886 assert(NumAggElts > 0 && "Aggregate should have elements."); in foldAggregateConstructionIntoAggregateReuse()
893 // Try to find a value of each element of an aggregate. in foldAggregateConstructionIntoAggregateReuse()
894 // FIXME: deal with more complex, not one-dimensional, aggregate type in foldAggregateConstructionIntoAggregateReuse()
[all...]
/freebsd-src/contrib/diff/doc/
H A Dfdl.texi344 distribution medium, is called an ``aggregate'' if the copyright
347 When the Document is included in an aggregate, this License does not
348 apply to the other works in the aggregate which are not themselves
353 the entire aggregate, the Document's Cover Texts may be placed on
354 covers that bracket the Document within the aggregate, or the
357 aggregate.
/freebsd-src/contrib/llvm-project/clang/lib/CodeGen/Targets/
H A DCSKY.cpp133 // For argument type, the first 4*XLen parts of aggregate will be passed in classifyArgumentType()
136 // For return type, aggregate which <= 2*XLen will be returned in registers. in classifyArgumentType()
137 // Otherwise, aggregate will be returned indirectly. in classifyArgumentType()
/freebsd-src/stand/ficl/softwords/
H A Doo.fr241 \ Aggregate an object into the class...
245 : do-aggregate
256 do-aggregate
259 \ Aggregate an array of objects into a class
269 do-aggregate
272 \ Aggregate a pointer to an object: REF is a member variable
/freebsd-src/contrib/llvm-project/llvm/lib/Target/WebAssembly/Utils/
H A DWebAssemblyTypeUtilities.cpp74 // they reach this point as aggregate Array types with an element type in wasmSymbolSetType()
90 report_fatal_error("Aggregate globals not yet implemented"); in wasmSymbolSetType()
/freebsd-src/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMCallingConv.cpp181 // aggregate. Store the type's required alignment as extra info for later: in in CC_ARM_AAPCS_Custom_Aggregate()
227 llvm_unreachable("Unexpected member type for block aggregate"); in CC_ARM_AAPCS_Custom_Aggregate()
245 // If nothing else has used the stack until this point, a non-HFA aggregate in CC_ARM_AAPCS_Custom_Aggregate()
283 // This will be allocated by the last member of the aggregate in CC_ARM_AAPCS_Custom_Aggregate()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/IR/
H A DGetElementPtrTypeIterator.h35 // In some cases, we need to know the outer aggregate type the index is
36 // applied within, e.g. a struct. In such cases, we store the aggregate type
152 // and the containing aggregate type, as vectors always tightly bit-pack their
/freebsd-src/contrib/llvm-project/clang/lib/AST/
H A DDeclCXX.cpp78 Aggregate(true), PlainOldData(true), Empty(true), Polymorphic(false), in DefinitionData()
205 // An aggregate is [...] a class with [...] no base classes [...]. in setBases()
206 data().Aggregate = false; in setBases()
210 // A POD-struct is an aggregate class... in setBases()
265 // An aggregate is a class with [...] no private or protected base classes in setBases()
267 data().Aggregate = false; in setBases()
281 // An aggregate is a class with [...] no virtual functions. in setBases()
282 data().Aggregate = false; in setBases()
313 // An aggregate is a class with [...] no virtual base classes in setBases()
314 data().Aggregate in setBases()
[all...]

12345678910>>...19