Lines Matching refs:previous

159 // a previous node of |element|.
162 Node* previous = element.previousSibling();
163 if (!previous)
166 if (previous->isTextNode()) {
167 inferred_label = WTFStringToString16(previous->nodeValue());
171 // If we didn't find text, check for previous paragraph.
174 if (inferred_label.empty() && previous->isElementNode()) {
175 Element* element = static_cast<Element*>(previous);
180 // If we didn't find paragraph, check for previous paragraph to this.
184 Node* sibling = previous->previousSibling();
195 while (inferred_label.empty() && previous) {
196 if (previous->isTextNode()) {
197 inferred_label = WTFStringToString16(previous->nodeValue());
199 } else if (previous->isElementNode()) {
200 Element* element = static_cast<Element*>(previous);
205 previous = previous->previousSibling();
212 while (inferred_label.empty() && previous) {
213 if (previous->isTextNode()) {
214 inferred_label = WTFStringToString16(previous->nodeValue());
216 } else if (previous->isElementNode()) {
217 Element* element = static_cast<Element*>(previous);
227 previous = previous->previousSibling();
244 // Check all previous siblings, skipping non-element nodes, until we find a
246 Node* previous = parent;
247 while(previous) {
248 if (previous->isElementNode()) {
249 Element* e = static_cast<Element*>(previous);
256 previous = previous->previousSibling();
292 Node* previous = parent->previousSibling();
295 while (previous && previous->isTextNode())
296 previous = previous->previousSibling();
298 if (previous && previous->isElementNode()) {
299 element = static_cast<Element*>(previous);