Searched refs:current (Results 1 - 25 of 1554) sorted by relevance

1234567891011>>

/macosx-10.10/WebCore-7600.1.25/dom/
H A DNodeTraversal.cpp34 Node* previousIncludingPseudo(const Node* current, const Node* stayWithin) argument
37 if (current == stayWithin)
39 if ((previous = current->pseudoAwarePreviousSibling())) {
44 return current->isPseudoElement() ? toPseudoElement(current)->hostElement() : current->parentNode();
47 Node* nextIncludingPseudo(const Node* current, const Node* stayWithin) argument
50 if ((next = current->pseudoAwareFirstChild()))
52 if (current == stayWithin)
54 if ((next = current
66 nextIncludingPseudoSkippingChildren(const Node* current, const Node* stayWithin) argument
83 nextAncestorSibling(const Node* current) argument
93 nextAncestorSibling(const Node* current, const Node* stayWithin) argument
106 last(const ContainerNode* current) argument
123 previousSkippingChildren(const Node* current, const Node* stayWithin) argument
138 nextPostOrder(const Node* current, const Node* stayWithin) argument
150 previousAncestorSiblingPostOrder(const Node* current, const Node* stayWithin) argument
162 previousPostOrder(const Node* current, const Node* stayWithin) argument
173 previousSkippingChildrenPostOrder(const Node* current, const Node* stayWithin) argument
[all...]
H A DNodeTraversal.h51 // Does a reverse pre-order traversal to find the node that comes before the current one in document order
79 inline Node* traverseNextTemplate(NodeType* current) argument
81 if (current->firstChild())
82 return current->firstChild();
83 if (current->nextSibling())
84 return current->nextSibling();
85 return nextAncestorSibling(current);
87 inline Node* next(const Node* current) { return traverseNextTemplate(current); } argument
88 inline Node* next(const ContainerNode* current) { retur argument
91 traverseNextTemplate(NodeType* current, const Node* stayWithin) argument
101 next(const Node* current, const Node* stayWithin) argument
102 next(const ContainerNode* current, const Node* stayWithin) argument
105 traverseNextSkippingChildrenTemplate(NodeType* current) argument
111 nextSkippingChildren(const Node* current) argument
112 nextSkippingChildren(const ContainerNode* current) argument
115 traverseNextSkippingChildrenTemplate(NodeType* current, const Node* stayWithin) argument
123 nextSkippingChildren(const Node* current, const Node* stayWithin) argument
124 nextSkippingChildren(const ContainerNode* current, const Node* stayWithin) argument
126 next(const Text* current) argument
127 next(const Text* current, const Node* stayWithin) argument
129 previous(const Node* current, const Node* stayWithin) argument
[all...]
H A DTextNodeTraversal.h66 inline Text* firstTextChildTemplate(NodeType* current) argument
68 Node* node = current->firstChild();
73 inline Text* firstChild(const Node* current) { return firstTextChildTemplate(current); } argument
74 inline Text* firstChild(const ContainerNode* current) { return firstTextChildTemplate(current); } argument
77 inline Text* firstTextWithinTemplate(NodeType* current) argument
79 Node* node = current->firstChild();
81 node = NodeTraversal::next(node, current);
84 inline Text* firstWithin(const Node* current) { retur argument
85 firstWithin(const ContainerNode* current) argument
88 traverseNextTextTemplate(NodeType* current) argument
95 next(const Node* current) argument
96 next(const Text* current) argument
99 traverseNextTextTemplate(NodeType* current, const Node* stayWithin) argument
106 next(const Node* current, const Node* stayWithin) argument
107 next(const Text* current, const Node* stayWithin) argument
109 nextSibling(const Node* current) argument
[all...]
/macosx-10.10/vim-55/src/proto/
H A Dgui_xmdlg.pro2 char_u *gui_xm_select_font __ARGS((char_u *current));
/macosx-10.10/llvmCore-3425.0.34/lib/Support/
H A DMemoryObject.cpp20 uint64_t current = address; local
23 if (current + size > limit)
26 while (current - address < size) {
27 if (readByte(current, &buf[(current - address)]))
30 current++;
34 *copied = current - address;
/macosx-10.10/JavaScriptCore-7600.1.17/API/tests/
H A DNode.c52 NodeLink* current; local
54 for (currentHandle = &node->childNodesTail, current = *currentHandle; current; currentHandle = &current->prev, current = *currentHandle) {
55 if (current->node == child) {
56 Node_deref(current->node);
57 *currentHandle = current->prev;
58 free(current);
67 NodeLink* current; local
[all...]
/macosx-10.10/tcl-105/tcl_ext/incrtcl/incrTcl/itcl/tests/old/
H A DBarFoo.tcl25 lappend WATCH [namespace current]
29 lappend WATCH [namespace current]
H A DFooBar.tcl25 lappend WATCH [namespace current]
29 lappend WATCH [namespace current]
H A DBar.tcl23 lappend WATCH [namespace current]
27 lappend WATCH [namespace current]
H A DMongrel.tcl25 lappend WATCH [namespace current]
29 lappend WATCH [namespace current]
/macosx-10.10/WebCore-7600.1.25/html/shadow/
H A DInsertionPoint.cpp116 for (Node* current = shadowHost()->firstChild(); current; current = current->nextSibling()) {
117 if (matchTypeFor(current) == InsertionPoint::AlwaysMatches)
118 return current;
127 for (Node* current = shadowHost()->lastChild(); current; current = current
[all...]
/macosx-10.10/nano-12/src/
H A Dmove.c32 const filestruct *current_save = openfile->current;
35 openfile->current = openfile->fileage;
45 const filestruct *current_save = openfile->current;
48 openfile->current = openfile->filebot;
64 if (openfile->current->lineno <= editwinrows - 2) {
74 openfile->current = openfile->edittop;
80 for (i = editwinrows - 2; i > 0 && openfile->current !=
82 openfile->current = openfile->current->prev;
84 openfile->current_x = actual_x(openfile->current
[all...]
/macosx-10.10/BerkeleyDB-21/db/java/src/com/sleepycat/util/
H A DErrorBuffer.java5 int first, current; field in class:ErrorBuffer
13 msgs[current] = msg;
14 current = (current + 1) % msgs.length;
15 if (current == first)
21 for (int i = first; i != current; i = (i + 1) % msgs.length) {
23 if ((i + 1) % msgs.length != current)
30 current = first = 0;
/macosx-10.10/CommonCrypto-60061/libcn/
H A Dnormal_crc.c59 crc_normal_update(crcInfoPtr crc, uint8_t *p, size_t len, uint64_t current) argument
63 case 1: current = crc_table_value8(crc->table.bytes, *p, (uint8_t) current); break;
64 case 2: current = crc_table_value16(crc->table.b16, *p, (uint16_t) current); break;
65 case 4: current = crc_table_value32(crc->table.b32, *p, (uint32_t) current); break;
66 case 8: current = crc_table_value64(crc->table.b64, *p, current); break;
70 return current
75 crc_normal_final(crcInfoPtr crc, uint64_t current) argument
86 uint64_t current = crc->descriptor->def.parms.initial_value; local
[all...]
H A Dreverse_crc.c59 crc_reverse_update(crcInfoPtr crc, uint8_t *p, size_t len, uint64_t current) argument
63 case 1: current = crc_table_value8(crc->table.bytes, *p, (uint8_t) current); break;
64 case 2: current = crc_table_value16(crc->table.b16, *p, (uint16_t) current); break;
65 case 4: current = crc_table_value32(crc->table.b32, *p, (uint32_t) current); break;
66 case 8: current = crc_table_value64(crc->table.b64, *p, current); break;
69 return current;
74 crc_reverse_final(crcInfoPtr crc, uint64_t current) argument
85 uint64_t current = crc->descriptor->def.parms.initial_value; local
[all...]
/macosx-10.10/tcl-105/tk/tk/generic/ttk/
H A Dttk.decls10 declare 0 current {
13 declare 1 current {
16 declare 2 current {
19 declare 3 current {
23 declare 4 current {
28 declare 5 current {
36 declare 6 current {
45 declare 7 current {
53 declare 8 current {
61 declare 10 current {
[all...]
/macosx-10.10/ruby-106/ruby/ext/fiddle/lib/
H A Dfiddle.rb7 # Returns the last win32 +Error+ of the current executing +Thread+ or nil
10 Thread.current[:__FIDDLE_WIN32_LAST_ERROR__]
13 # Sets the last win32 +Error+ of the current executing +Thread+ to +error+
15 Thread.current[:__FIDDLE_WIN32_LAST_ERROR__] = error
19 # Returns the last +Error+ of the current executing +Thread+ or nil if none
21 Thread.current[:__FIDDLE_LAST_ERROR__]
24 # Sets the last +Error+ of the current executing +Thread+ to +error+
26 Thread.current[:__DL2_LAST_ERROR__] = error
27 Thread.current[:__FIDDLE_LAST_ERROR__] = error
/macosx-10.10/CPANInternal-159.1/Tree-Simple-VisitorFactory-0.10/t/
H A D95_Tree_Simple_Visitor_LoadClassHierarchy_test.t56 my $current = $tree->getChild(0);
57 is($current->getNodeValue(), 'E', '... got the value we expected');
58 is($current->getChild(0)->getNodeValue(), 'C', '... got the value we expected');
59 is($current->getChild(0)->getChild(0)->getNodeValue(), 'A', '... got the value we expected');
60 is($current->getChild(1)->getNodeValue(), 'D', '... got the value we expected');
61 is($current->getChild(1)->getChild(0)->getNodeValue(), 'A', '... got the value we expected');
62 is($current->getChild(1)->getChild(1)->getNodeValue(), 'B', '... got the value we expected');
82 my $current = $tree;
83 is($current->getNodeValue(), 'E', '... got the value we expected');
84 is($current
[all...]
/macosx-10.10/ruby-106/ruby/ext/tk/sample/tkextlib/vu/
H A Dvu_demo.rb26 current = 50
34 current += 1
36 current -= 1
38 bar.set(current)
39 if current < green
40 current = 100 if current <= 0
42 elsif current < blue
44 elsif current < purple
48 current
[all...]
/macosx-10.10/ruby-106/ruby/lib/rexml/validation/
H A Drelaxng.rb40 attr_accessor :current
50 @root = @current = Sequence.new(self)
52 states = [ @current ]
130 @current = 0
137 return if @current == 0
138 @current = 0
148 #puts "Next (#@current) is #{@events[@current]}"
150 return @previous.pop.next( event ) if @events[@current].nil?
151 expand_ref_in( @events, @current ) i
[all...]
/macosx-10.10/WebCore-7600.1.25/css/
H A DCSSSelectorList.h56 const CSSSelector* current = selectorAt(index); local
57 current = next(current);
58 if (!current)
60 return current - m_selectorArray;
80 inline const CSSSelector* CSSSelectorList::next(const CSSSelector* current) argument
83 while (!current->isLastInTagHistory())
84 current++;
85 return current->isLastInSelectorList() ? 0 : current
[all...]
/macosx-10.10/xnu-2782.1.97/bsd/net/
H A Dinit.c86 struct init_list_entry *current = 0; local
98 current = backward_head;
99 backward_head = current->next;
100 current->next = forward_head;
101 forward_head = current;
106 current = forward_head;
107 forward_head = current->next;
108 current->func();
109 kfree(current, sizeof(*current));
[all...]
/macosx-10.10/cups-408/cups/cups/
H A Darray.c42 * The current implementation uses an insertion sort into an array of
50 current, /* Current element */ member in struct:_cups_array_s
174 * Find the end of the current delimited string and see if we need to add
245 a->current = -1;
277 * 'cupsArrayCurrent()' - Return the current element in the array.
279 * The current element is undefined until you call @link cupsArrayFind@,
296 * Return the current element...
299 if (a->current >= 0 && a->current < a->num_elements)
300 return (a->elements[a->current]);
448 int current, /* Current element */ local
891 current; /* Current element */ local
1026 current; /* Current element */ local
1206 current, /* Current element */ local
[all...]
/macosx-10.10/xnu-2782.1.97/osfmk/kern/
H A Dcall_entry.h110 call_entry_t current; local
114 current = CE(queue_first(queue));
117 current = CE(queue_first(queue));
119 current = CE(queue_next(qe(entry)));
124 if (queue_end(queue, qe(current)) ||
125 deadline < current->deadline) {
126 current = CE(queue_prev(qe(current)));
130 current = CE(queue_next(qe(current)));
[all...]
/macosx-10.10/Security-57031.1.35/Security/include/security_utilities/
H A Dbufferfifo.cpp66 Buffer *current = mBuffers.back(); local
67 size_t length = current->put(data, size);
73 Buffer *current = new Buffer(max(bufferLength, size)); local
74 mBuffers.push(current);
75 assert(current->available() >= size);
76 current->put(data, size);

Completed in 224 milliseconds

1234567891011>>