Searched refs:node (Results 1 - 25 of 69) sorted by relevance

123

/hardware/libhardware/tests/input/evdev/
H A DInputMocks.cpp30 auto node = new MockInputDeviceNode(); local
31 node->setPath("/dev/input/event0");
32 node->setName("elan-touchscreen");
35 node->setBusType(0);
36 node->setVendorId(0);
37 node->setProductId(0);
38 node->setVersion(0);
42 node->addAbsAxis(ABS_MT_SLOT, nullptr);
43 node->addAbsAxis(ABS_MT_TOUCH_MAJOR, nullptr);
44 node
55 auto node = new MockInputDeviceNode(); local
74 auto node = new MockInputDeviceNode(); local
93 auto node = new MockInputDeviceNode(); local
117 auto node = new MockInputDeviceNode(); local
135 auto node = new MockInputDeviceNode(); local
157 auto node = new MockInputDeviceNode(); local
175 auto node = new MockInputDeviceNode(); local
193 auto node = new MockInputDeviceNode(); local
212 auto node = new MockInputDeviceNode(); local
[all...]
H A DInputDevice_test.cpp70 auto node = std::make_shared<MockInputDeviceNode>(); local
71 auto device = std::make_unique<EvdevDevice>(&mHost, node);
99 auto node = std::make_shared<MockInputDeviceNode>(); local
100 auto device = std::make_unique<EvdevDevice>(&mHost, node);
115 auto node = std::make_shared<MockInputDeviceNode>(); local
116 auto device = std::make_unique<EvdevDevice>(&mHost, node);
132 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexus7v2::getElanTouchscreen()); local
133 auto device = std::make_unique<EvdevDevice>(&mHost, node);
139 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexus7v2::getButtonJack()); local
140 auto device = std::make_unique<EvdevDevice>(&mHost, node);
153 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexus7v2::getHeadsetJack()); local
159 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexus7v2::getH2wButton()); local
165 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexus7v2::getGpioKeys()); local
171 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexusPlayer::getGpioKeys()); local
177 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexusPlayer::getMidPowerBtn()); local
183 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexusPlayer::getNexusRemote()); local
189 auto node = std::shared_ptr<MockInputDeviceNode>(MockNexusPlayer::getAsusGamepad()); local
195 auto node = std::make_shared<MockInputDeviceNode>(); local
[all...]
H A DInputHub_test.cpp57 virtual void onInputEvent(const std::shared_ptr<InputDeviceNode>& node, InputEvent& event,
59 mInputCb(node, event, event_time);
61 virtual void onDeviceAdded(const std::shared_ptr<InputDeviceNode>& node) override {
62 mDeviceAddedCb(node); variable
64 virtual void onDeviceRemoved(const std::shared_ptr<InputDeviceNode>& node) override {
65 mDeviceRemovedCb(node); variable
101 [&](const std::shared_ptr<InputDeviceNode>& node) {
102 pathname = node->getPath();
136 [&](const std::shared_ptr<InputDeviceNode>& node) {
137 tempNode = node;
[all...]
/hardware/libhardware/modules/input/evdev/
H A DInputDeviceManager.cpp28 void InputDeviceManager::onInputEvent(const std::shared_ptr<InputDeviceNode>& node, InputEvent& event, argument
30 if (mDevices[node] == nullptr) {
31 ALOGE("got input event for unknown node %s", node->getPath().c_str());
34 mDevices[node]->processInput(event, event_time);
37 void InputDeviceManager::onDeviceAdded(const std::shared_ptr<InputDeviceNode>& node) { argument
38 mDevices[node] = std::make_shared<EvdevDevice>(mHost, node);
41 void InputDeviceManager::onDeviceRemoved(const std::shared_ptr<InputDeviceNode>& node) { argument
42 if (mDevices[node]
[all...]
H A DInputDeviceManager.h43 virtual void onInputEvent(const std::shared_ptr<InputDeviceNode>& node, InputEvent& event,
45 virtual void onDeviceAdded(const std::shared_ptr<InputDeviceNode>& node) override;
46 virtual void onDeviceRemoved(const std::shared_ptr<InputDeviceNode>& node) override;
H A DInputDevice.cpp45 static InputBus getInputBus(const std::shared_ptr<InputDeviceNode>& node) { argument
46 switch (node->getBusType()) {
111 EvdevDevice::EvdevDevice(InputHostInterface* host, const std::shared_ptr<InputDeviceNode>& node) : argument
112 mHost(host), mDeviceNode(node), mDeviceDefinition(mHost->createDeviceDefinition()) {
114 InputBus bus = getInputBus(node);
116 node->getName().c_str(),
117 node->getProductId(),
118 node->getVendorId(),
120 node->getUniqueId().c_str());
/hardware/intel/img/psb_video/src/
H A Dpsb_ws_driver.c51 struct _ValidateNode *node = malloc(sizeof(*node)); local
53 if (node == NULL) return NULL;
55 node->func = func;
56 node->type_id = 1;
57 return node;
62 * Free an allocated validate list node.
66 psb_free(struct _ValidateNode *node) argument
68 if (node->type_id == 0)
69 free(containerOf(node, struc
83 psb_clear(struct _ValidateNode *node) argument
[all...]
H A Dpsb_ws_driver.h51 psbValReq(struct _ValidateNode *node) { argument
52 return &(containerOf(node, struct _PsbDrmValidateNode, base)->
/hardware/interfaces/audio/effect/2.0/default/
H A DConversions.cpp49 halUuid.node[0],
50 halUuid.node[1],
51 halUuid.node[2],
52 halUuid.node[3],
53 halUuid.node[4],
54 halUuid.node[5]);
/hardware/qcom/gps/msm8909/utils/
H A DLocHeap.cpp46 void swap(LocHeapNode& node);
50 // push a node into the tree stucture, keeping sorted by rank
51 void push(LocHeapNode& node);
53 // pop the head node out of the tree stucture. keeping sorted by rank
56 // remove a specific node from the tree
57 // returns the pointer to the node removed, which would be either the
62 inline bool outRanks(LocHeapNode& node) { return mData->outRanks(*node.mData); } argument
65 // checks if mSize is correct, AND this node is the highest ranking
88 void LocHeapNode::swap(LocHeapNode& node) { argument
107 push(LocHeapNode& node) argument
228 push(LocRankable& node) argument
[all...]
H A DLocHeap.h41 // The pointer of the input node would be stored in the heap.
57 // help beter balance the tree with lower cost. When a node is pushed to the tree,
58 // it is guaranteed that the subtree that is smaller gets to have the new node.
67 // tree by adding the new node to the smaller of the subtrees.
68 // node is reference to an obj that is managed by client, that client
70 // node is popped out from the heap.
71 void push(LocRankable& node);
73 // Peeks the node data on tree top, which has currently the highest ranking
75 // Returns NULL if the tree is empty, otherwise pointer to the node data of
81 // Return - pointer to the node poppe
[all...]
/hardware/qcom/gps/msm8996/utils/
H A DLocHeap.cpp46 void swap(LocHeapNode& node);
50 // push a node into the tree stucture, keeping sorted by rank
51 void push(LocHeapNode& node);
53 // pop the head node out of the tree stucture. keeping sorted by rank
56 // remove a specific node from the tree
57 // returns the pointer to the node removed, which would be either the
62 inline bool outRanks(LocHeapNode& node) { return mData->outRanks(*node.mData); } argument
65 // checks if mSize is correct, AND this node is the highest ranking
88 void LocHeapNode::swap(LocHeapNode& node) { argument
107 push(LocHeapNode& node) argument
228 push(LocRankable& node) argument
[all...]
H A DLocHeap.h41 // The pointer of the input node would be stored in the heap.
57 // help beter balance the tree with lower cost. When a node is pushed to the tree,
58 // it is guaranteed that the subtree that is smaller gets to have the new node.
67 // tree by adding the new node to the smaller of the subtrees.
68 // node is reference to an obj that is managed by client, that client
70 // node is popped out from the heap.
71 void push(LocRankable& node);
73 // Peeks the node data on tree top, which has currently the highest ranking
75 // Returns NULL if the tree is empty, otherwise pointer to the node data of
81 // Return - pointer to the node poppe
[all...]
/hardware/qcom/gps/msm8998/utils/
H A DLocHeap.cpp46 void swap(LocHeapNode& node);
50 // push a node into the tree stucture, keeping sorted by rank
51 void push(LocHeapNode& node);
53 // pop the head node out of the tree stucture. keeping sorted by rank
56 // remove a specific node from the tree
57 // returns the pointer to the node removed, which would be either the
62 inline bool outRanks(LocHeapNode& node) { return mData->outRanks(*node.mData); } argument
65 // checks if mSize is correct, AND this node is the highest ranking
88 void LocHeapNode::swap(LocHeapNode& node) { argument
107 push(LocHeapNode& node) argument
228 push(LocRankable& node) argument
[all...]
/hardware/qcom/media/msm8974/mm-video-legacy/vidc/vdec/inc/
H A DMap.h37 struct node struct in class:Map
41 node* prev;
42 node* next;
43 node(T t, T2 t2,node* p, node* n) : function in struct:Map::node
46 node* head;
47 node* tail;
48 node* tmp;
68 node* tem
[all...]
/hardware/qcom/media/msm8974/mm-video-v4l2/vidc/vdec/inc/
H A DMap.h37 struct node { struct in class:Map
40 node* prev;
41 node* next;
42 node(T t, T2 t2,node* p, node* n) : function in struct:Map::node
45 node* head;
46 node* tail;
47 node* tmp;
69 node* tem
[all...]
/hardware/qcom/media/msm8996/mm-video-v4l2/vidc/vdec/inc/
H A DMap.h36 struct node { struct in class:Map
39 node* prev;
40 node* next;
41 node(T t, T2 t2,node* p, node* n) : function in struct:Map::node
44 node* head;
45 node* tail;
46 node* tmp;
68 node* tem
[all...]
/hardware/qcom/media/msm8998/mm-video-v4l2/vidc/vdec/inc/
H A DMap.h36 struct node { struct in class:Map
39 node* prev;
40 node* next;
41 node(T t, T2 t2,node* p, node* n) : function in struct:Map::node
44 node* head;
45 node* tail;
46 node* tmp;
68 node* tem
[all...]
/hardware/intel/img/hwcomposer/merrifield/ips/common/
H A DWsbmWrapper.c55 struct _ValidateNode * node = malloc(sizeof(*node)); local
56 if(!node) {
57 ETRACE("failed to allocate node");
61 node->func = func;
62 node->type_id = 1;
63 return node;
67 static void pvrFree(struct _ValidateNode * node) argument
70 if(node->type_id == 0) {
71 free(containerOf(node, struc
77 pvrClear(struct _ValidateNode * node) argument
[all...]
/hardware/intel/img/hwcomposer/moorefield_hdmi/ips/common/
H A DWsbmWrapper.c56 struct _ValidateNode * node = malloc(sizeof(*node)); local
57 if(!node) {
58 ELOGTRACE("failed to allocate node");
62 node->func = func;
63 node->type_id = 1;
64 return node;
68 static void pvrFree(struct _ValidateNode * node) argument
71 if(node->type_id == 0) {
72 free(containerOf(node, struc
78 pvrClear(struct _ValidateNode * node) argument
[all...]
/hardware/intel/common/libwsbm/src/
H A Dwsbm_userpool.c81 struct _WsbmMMNode *node; member in struct:_WsbmUserBuffer
224 vBuf->node = wsbmMMSearchFree(&p->agpMM, size, alignment, 1);
225 if (vBuf->node)
226 vBuf->node = wsbmMMGetBlock(vBuf->node, size, alignment);
228 if (vBuf->node) {
230 vBuf->kBuf.gpuOffset = p->agpOffset + vBuf->node->start;
231 vBuf->map = (void *)(p->agpMap + vBuf->node->start);
238 vBuf->node = wsbmMMSearchFree(&p->vramMM, size, alignment, 1);
239 if (vBuf->node)
[all...]
H A Dwsbm_manager.c150 struct _ValidateNode *node; local
156 node = wsbmVNodeFuncs()->alloc(wsbmVNodeFuncs(), 0);
157 if (!node) {
163 node = WSBMLISTENTRY(l, struct _ValidateNode, head);
165 node->buf = item;
166 node->set_flags = flags & mask;
167 node->clr_flags = (~flags) & mask;
168 node->listItem = list->numOnList;
169 WSBMLISTADDTAIL(&node->head, &list->list);
172 WSBMLISTADDTAIL(&node
198 struct _ValidateNode *node; local
228 struct _ValidateNode *node; local
301 struct _ValidateNode *node; local
1063 struct _ValidateNode *node, *cur; local
1122 wsbmBOAddListItem(struct _WsbmBufferList *list, struct _WsbmBufferObject *buf, uint64_t flags, uint64_t mask, int *itemLoc, struct _ValidateNode **node) argument
1226 struct _ValidateNode *node; local
1254 struct _ValidateNode *node; local
[all...]
/hardware/intel/common/libmix/videoencoder/
H A DIntelMetadataBuffer.cpp157 List<ShareMemMap *>::iterator node; local
161 for(node = gShareMemMapList.begin(); node != gShareMemMapList.end(); )
163 if ((*node)->sessionflag == sessionflag) //remove all buffers belong to this session
165 (*node)->membase = NULL;
166 (*node)->gbuffer = NULL;
167 delete (*node);
168 node = gShareMemMapList.erase(node);
171 node
179 List<ShareMemMap *>::iterator node; local
205 List<ShareMemMap *>::iterator node; local
[all...]
/hardware/libhardware/modules/sensors/dynamic_sensor/HidUtils/
H A DHidParser.cpp119 std::shared_ptr<HidTreeNode> node(new HidReportNode(mCurrent, report));
120 mCurrent->addChild(node);
143 void HidParser::filterTree(std::shared_ptr<HidTreeNode> &node) { argument
144 if (node->isReportCollection()) {
146 std::static_pointer_cast<HidReportNode>(node->getChildren().front());
148 reportNode->collapse(node->getFullUsage());
149 node = reportNode;
152 for (auto &i : node->getChildren()) {
166 const std::shared_ptr<HidTreeNode> &node,
172 if (node
165 digest(HidParser::DigestVector *digestVector, const std::shared_ptr<HidTreeNode> &node, const std::unordered_set<unsigned int> &interestedUsage) argument
[all...]
/hardware/qcom/audio/hal/audio_extn/
H A Dsndmonitor.c66 struct listnode node; // membership in sndcards list member in struct:__anon1719
74 struct listnode node; // membership in deviceevents list; member in struct:__anon1720
143 list_add_tail(&sndmonitor.cards, &s->node);
243 sndcard_t * s = node_to_item(n, sndcard_t, node);
259 list_add_tail(&sndmonitor.dev_events, &d->node);
303 dev_event_t * d = node_to_item(n, dev_event_t, node);
420 struct listnode *node; local
421 list_for_each(node, &sndmonitor.cards) {
422 sndcard_t * s = node_to_item(node, sndcard_t, node);
[all...]

Completed in 367 milliseconds

123