Home
last modified time | relevance | path

Searched refs:node (Results 1901 - 1925 of 2756) sorted by relevance

1...<<71727374757677787980>>...111

/third_party/skia/modules/skottie/src/layers/shapelayer/
H A DRoundCorners.cpp32 this->node()->setRadius(fRadius);
/third_party/skia/third_party/externals/swiftshader/src/Pipeline/
H A DSpirvShaderDebugger.cpp859 // ValueNode is a tree node of debug::Value definitions.
860 // Each node in the tree represents an element in the type tree.
863 // NoDebugValueIndex indicates that this node is never assigned a value.
1190 debug::LocalVariable::ValueNode const *node);
1201 debug::LocalVariable::ValueNode const *const node;
1808 auto node = &value->local->values;
1814 auto it = node->children.find(idx);
1815 if(it != node->children.end())
1817 node = it->second.get();
1821 auto parent = node;
[all...]
/third_party/mesa3d/src/broadcom/compiler/
H A Dqpu_schedule.c51 /* Longest cycles + instruction_latency() of any parent of this node. */
462 list_for_each_entry(struct schedule_node, node, schedule_list, link) in calculate_forward_deps()
463 calculate_deps(&state, node); in calculate_forward_deps()
477 list_for_each_entry_rev(struct schedule_node, node, schedule_list, in calculate_reverse_deps()
479 calculate_deps(&state, (struct schedule_node *)node); in calculate_reverse_deps()
1427 /** Recursive computation of the delay member of a node. */
1429 compute_delay(struct dag_node *node, void *state) in compute_delay() argument
1431 struct schedule_node *n = (struct schedule_node *)node; in compute_delay()
1464 struct schedule_node *node) in mark_instruction_scheduled()
1466 if (!node) in mark_instruction_scheduled()
1461 mark_instruction_scheduled(const struct v3d_device_info *devinfo, struct dag *dag, uint32_t time, struct schedule_node *node) mark_instruction_scheduled() argument
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dbrotli_bit_stream.c440 HuffmanTree* node = tree; in BrotliBuildAndStoreHuffmanTreeFast() local
446 InitHuffmanTree(node, histogram[l], -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
448 InitHuffmanTree(node, count_limit, -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
450 ++node; in BrotliBuildAndStoreHuffmanTreeFast()
454 const int n = (int)(node - tree); in BrotliBuildAndStoreHuffmanTreeFast()
456 int i = 0; /* Points to the next leaf node. */ in BrotliBuildAndStoreHuffmanTreeFast()
457 int j = n + 1; /* Points to the next non-leaf node. */ in BrotliBuildAndStoreHuffmanTreeFast()
469 *node++ = sentinel; in BrotliBuildAndStoreHuffmanTreeFast()
470 *node++ = sentinel; in BrotliBuildAndStoreHuffmanTreeFast()
488 /* The sentinel node become in BrotliBuildAndStoreHuffmanTreeFast()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbrotli_bit_stream.c440 HuffmanTree* node = tree; in BrotliBuildAndStoreHuffmanTreeFast() local
446 InitHuffmanTree(node, histogram[l], -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
448 InitHuffmanTree(node, count_limit, -1, (int16_t)l); in BrotliBuildAndStoreHuffmanTreeFast()
450 ++node; in BrotliBuildAndStoreHuffmanTreeFast()
454 const int n = (int)(node - tree); in BrotliBuildAndStoreHuffmanTreeFast()
456 int i = 0; /* Points to the next leaf node. */ in BrotliBuildAndStoreHuffmanTreeFast()
457 int j = n + 1; /* Points to the next non-leaf node. */ in BrotliBuildAndStoreHuffmanTreeFast()
469 *node++ = sentinel; in BrotliBuildAndStoreHuffmanTreeFast()
470 *node++ = sentinel; in BrotliBuildAndStoreHuffmanTreeFast()
488 /* The sentinel node become in BrotliBuildAndStoreHuffmanTreeFast()
[all...]
/third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/
H A Dlibcpuset.c135 /* Stashed copy of cpunodemap[], mapping each cpu to its node. */
181 * /sys/devices/system/node/nodeN/distance
184 * which say that for cpu on node N (from the path above), the
189 static const char *distance_directory = "/sys/devices/system/node";
204 * node 2 001c14#0 local asic SHub_1.1, nasid 0x4, dist 46:66:10:20
206 * which says that for each CPU on node 2, the distance to nodes
210 * keywords than "node". Ignore these other lines.
214 static const char *sn_top_node_prefix = "node ";
1121 * to the node on which that cpu resides or cpuset_mems_nbits().
1182 int *map; /* map[cpumask_sz]: maps cpu to its node */
1436 parse_distmap_line(unsigned int node, char *buf) parse_distmap_line() argument
1485 parse_distance_file(unsigned int node, const char *path) parse_distance_file() argument
1539 unsigned int node; build_distmap() local
1580 unsigned long c, n, node; parse_distmap_line_sn() local
3449 int node = -1; cpuset_addr2node() local
[all...]
/drivers/peripheral/usb/ddk/device/src/
H A Dusbfn_dev_mgr.c204 const char *udcName, struct UsbFnDeviceDesc *des, const struct DeviceResourceNode *node) in UsbFnMgrDeviceCreate()
229 fnDevMgr->node = node; in UsbFnMgrDeviceCreate()
298 if (fnDevMgr->node) { in UsbFnMgrDeviceRemove()
203 UsbFnMgrDeviceCreate( const char *udcName, struct UsbFnDeviceDesc *des, const struct DeviceResourceNode *node) UsbFnMgrDeviceCreate() argument
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_lower_parallelcopy.c393 * reached some other node than n_1: in _handle_copies()
408 * a node somewhere along the way being the destination of 2 copies in _handle_copies()
544 list_del(&instr->node); in ir3_lower_copies()
559 list_del(&instr->node); in ir3_lower_copies()
573 list_del(&instr->node); in ir3_lower_copies()
575 list_del(&instr->node); in ir3_lower_copies()
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_rt_common.c106 /* node->children[i] -> uint */ in intersect_ray_amd_software_box()
110 /* node->coords[i][0], node->coords[i][1] -> vec3 */ in intersect_ray_amd_software_box()
126 /* vec3 bound0 = (node->coords[i][0] - origin) * inv_dir; */ in intersect_ray_amd_software_box()
128 /* vec3 bound1 = (node->coords[i][1] - origin) * inv_dir; */ in intersect_ray_amd_software_box()
147 /* if (!isnan(node->coords[i][0].x) && tmax >= max(0.0f, tmin) && tmin < ray_tmax) { */ in intersect_ray_amd_software_box()
153 /* child_indices[i] = node->children[i]; */ in intersect_ray_amd_software_box()
190 /* node->coords[0], node->coords[1], node in intersect_ray_amd_software_tri()
344 nir_ssa_def *node = nir_ushr_imm(b, addr, 3); build_addr_to_node() local
349 build_node_to_addr(struct radv_device *device, nir_builder *b, nir_ssa_def *node) build_node_to_addr() argument
[all...]
/third_party/node/src/
H A Djs_native_api_v8.h101 std::move(cb), node::CallbackFlags::kRefed); in RequestInterrupt()
103 node::Mutex::ScopedLock lock(native_immediates_threadsafe_mutex_); in RequestInterrupt()
241 typedef node::CallbackQueue<void, JSVM_Env__*> NativeImmediateQueue;
242 node::Mutex native_immediates_threadsafe_mutex_;
459 // the reference with appropriate node-api calls.
H A Dnode_worker.cc18 using node::kAllowedInEnvvar;
19 using node::kDisallowedInEnvvar;
43 namespace node { namespace
215 // (Refs: https://github.com/nodejs/node/issues/30846) in ~WorkerThreadData()
850 node::performance::NODE_PERFORMANCE_MILESTONE_LOOP_START]; in LoopStartTime()
853 (loop_start_time - node::performance::timeOrigin) / 1e6); in LoopStartTime()
962 } // namespace node
964 NODE_BINDING_CONTEXT_AWARE_INTERNAL(worker, node::worker::InitWorker)
966 node::worker::RegisterExternalReferences)
/third_party/node/deps/v8/src/interpreter/
H A Dbytecode-generator.h51 #define DECLARE_VISIT(type) void Visit##type(type* node);
381 int AllocateBlockCoverageSlotIfEnabled(AstNode* node, SourceRangeKind kind);
382 int AllocateNaryBlockCoverageSlotIfEnabled(NaryOperation* node, size_t index);
384 void BuildIncrementBlockCoverageCounterIfEnabled(AstNode* node,
/third_party/vk-gl-cts/executor/tools/
H A DxeCommandLineExecutor.cpp416 const xe::TestNode* node = *iter; in printBatchResultSummary() local
417 if (node->getNodeType() == xe::TESTNODETYPE_TEST_CASE && testSet.hasNode(node)) in printBatchResultSummary()
419 const xe::TestCase* testCase = static_cast<const xe::TestCase*>(node); in printBatchResultSummary()
/third_party/pulseaudio/src/modules/
H A Dmodule-udev-detect.c324 * cause an inotify event on the device node which in verify_access()
533 const char *node) { in pcm_node_belongs_to_device()
539 b = pa_startswith(node, cd); in pcm_node_belongs_to_device()
547 const char *node) { in control_node_belongs_to_device()
553 b = pa_streq(node, cd); in control_node_belongs_to_device()
531 pcm_node_belongs_to_device( struct device *d, const char *node) pcm_node_belongs_to_device() argument
545 control_node_belongs_to_device( struct device *d, const char *node) control_node_belongs_to_device() argument
/third_party/python/Modules/
H A D_lsprof.c517 static int statsForSubEntry(rotating_node_t *node, void *arg) in statsForSubEntry() argument
519 ProfilerSubEntry *sentry = (ProfilerSubEntry*) node; in statsForSubEntry()
538 static int statsForEntry(rotating_node_t *node, void *arg) in statsForEntry() argument
540 ProfilerEntry *entry = (ProfilerEntry*) node; in statsForEntry()
/third_party/skia/modules/skottie/src/
H A DSkottie.cpp87 this->node()->setOpacity(fOpacity * 0.01f);
135 const auto dispatched = this->dispatchOpacityProperty(adapter->node()); in attachOpacity()
139 if (!dispatched && adapter->node()->getOpacity() >= 1) { in attachOpacity()
147 return adapter->node(); in attachOpacity()
/third_party/eudev/src/udev/
H A Dudevd.c87 struct udev_list_node node; member
105 static inline struct event *node_to_event(struct udev_list_node *node) { in node_to_event() argument
106 return container_of(node, struct event, node); in node_to_event()
119 struct udev_list_node node; member
136 udev_list_node_remove(&event->node); in event_free()
309 * Take a shared lock on the device node; this establishes in worker_spawn()
336 /* apply rules, create node, symlinks */ in worker_spawn()
498 udev_list_node_append(&event->node, &event_list); in event_queue_insert()
1522 /* device node watc in main()
[all...]
/third_party/glslang/glslang/MachineIndependent/
H A Dlocalintermediate.h514 TIntermTyped* addConversion(TBasicType convertTo, TIntermTyped* node) const;
533 TIntermAggregate* makeAggregate(TIntermNode* node);
534 TIntermAggregate* makeAggregate(TIntermNode* node, const TSourceLoc&);
564 // If a type is provided, the node's type will be set to it.
574 TIntermTyped* foldDereference(TIntermTyped* node, int index, const TSourceLoc&);
575 TIntermTyped* foldSwizzle(TIntermTyped* node, TSwizzleSelectors<TVectorSelector>& fields, const TSourceLoc&);
1034 TIntermTyped* createConversion(TBasicType convertTo, TIntermTyped* node) const;
1127 bool isConversionAllowed(TOperator op, TIntermTyped* node) const;
H A Dreflection.cpp83 virtual bool visitBinary(TVisit, TIntermBinary* node);
341 // the base offset of this node, that children are relative to in blowUpActiveAggregate()
543 // Handles the situation where the left node is at the correct or too coarse a
684 TIntermSymbol* findBase(const TIntermBinary* node) in findBase() argument
686 TIntermSymbol *base = node->getLeft()->getAsSymbolNode(); in findBase()
689 TIntermBinary* left = node->getLeft()->getAsBinaryNode(); in findBase()
1032 bool TReflectionTraverser::visitBinary(TVisit /* visit */, TIntermBinary* node) in visitBinary() argument
1034 switch (node->getOp()) { in visitBinary()
1038 addDereferencedUniform(node); in visitBinary()
1206 // If we just want reflect only live node, w in addStage()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUtility.java575 int node = 0; in RLEStringToByteArray()
596 // if we could look ahead, but we can't, so we use 'node' to in RLEStringToByteArray()
598 switch (node) { in RLEStringToByteArray()
600 // Normal idle node in RLEStringToByteArray()
602 node = 1; in RLEStringToByteArray()
613 node = 0; in RLEStringToByteArray()
619 node = 2; in RLEStringToByteArray()
626 node = 0; in RLEStringToByteArray()
631 if (node != 0) in RLEStringToByteArray()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DUtility.java578 int node = 0; in RLEStringToByteArray()
599 // if we could look ahead, but we can't, so we use 'node' to in RLEStringToByteArray()
601 switch (node) { in RLEStringToByteArray()
603 // Normal idle node in RLEStringToByteArray()
605 node = 1; in RLEStringToByteArray()
616 node = 0; in RLEStringToByteArray()
622 node = 2; in RLEStringToByteArray()
629 node = 0; in RLEStringToByteArray()
634 if (node != 0) in RLEStringToByteArray()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_opt_if.c86 * condition is a phi node of two constants and moves half of the if to above
196 foreach_list_typed(nir_cf_node, cf_node, node, entry_list) { in opt_peel_loop_initial_if()
246 cf_node.node)); in opt_peel_loop_initial_if()
331 * Splits ALU instructions that have a source that is a phi node
339 * - At least one source of the instruction is a phi node from the header block.
345 * - The phi node selects a constant or undef from the block before the loop or
352 * on. A new phi node is added to the header block that selects either the
519 /* Make a new phi node that selects a value from prev_block and the in opt_split_alu_of_phi()
562 * - The phi node representing the condition of the bcsel instruction chooses
567 * from the continue block. Since each of these sources is also a phi node i
[all...]
/drivers/hdf_core/adapter/uhdf2/manager/src/
H A Ddevmgr_query_device.c44 DLIST_FOR_EACH_ENTRY(hostClnt, &devMgrSvc->hosts, struct DevHostServiceClnt, node) { in DevFillQueryDeviceInfo()
/drivers/hdf_core/framework/model/sensor/driver/gas/
H A Dsensor_gas_driver.h85 struct SensorCfgData *GasCreateCfgData(const struct DeviceResourceNode *node);
/drivers/hdf_core/framework/model/network/wifi/platform/include/message/
H A Dmessage_router_inner.h57 ErrorCode CreateLocalNode(MessageNode **node);

Completed in 42 milliseconds

1...<<71727374757677787980>>...111