1 /* 2 * libjingle 3 * Copyright 2004--2005, Google Inc. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are met: 7 * 8 * 1. Redistributions of source code must retain the above copyright notice, 9 * this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright notice, 11 * this list of conditions and the following disclaimer in the documentation 12 * and/or other materials provided with the distribution. 13 * 3. The name of the author may not be used to endorse or promote products 14 * derived from this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED 17 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 18 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 19 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 20 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 22 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 23 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 24 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 25 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 */ 27 28 #include "talk/base/scoped_ptr.h" 29 #include "talk/xmpp/constants.h" 30 #include "talk/xmpp/discoitemsquerytask.h" 31 #include "talk/xmpp/xmpptask.h" 32 33 namespace buzz { 34 35 DiscoItemsQueryTask::DiscoItemsQueryTask(XmppTaskParentInterface* parent, 36 const Jid& to, 37 const std::string& node) 38 : IqTask(parent, STR_GET, to, MakeRequest(node)) { 39 } 40 41 XmlElement* DiscoItemsQueryTask::MakeRequest(const std::string& node) { 42 XmlElement* element = new XmlElement(QN_DISCO_ITEMS_QUERY, true); 43 if (!node.empty()) { 44 element->AddAttr(QN_NODE, node); 45 } 46 return element; 47 } 48 49 void DiscoItemsQueryTask::HandleResult(const XmlElement* stanza) { 50 const XmlElement* query = stanza->FirstNamed(QN_DISCO_ITEMS_QUERY); 51 if (query) { 52 std::vector<DiscoItem> items; 53 for (const buzz::XmlChild* child = query->FirstChild(); child; 54 child = child->NextChild()) { 55 DiscoItem item; 56 const buzz::XmlElement* child_element = child->AsElement(); 57 if (ParseItem(child_element, &item)) { 58 items.push_back(item); 59 } 60 } 61 SignalResult(items); 62 } else { 63 SignalError(this, NULL); 64 } 65 } 66 67 bool DiscoItemsQueryTask::ParseItem(const XmlElement* element, 68 DiscoItem* item) { 69 if (element->HasAttr(QN_JID)) { 70 return false; 71 } 72 73 item->jid = element->Attr(QN_JID); 74 item->name = element->Attr(QN_NAME); 75 item->node = element->Attr(QN_NODE); 76 return true; 77 } 78 79 } // namespace buzz 80