Home
last modified time | relevance | path

Searched full:previous (Results 1 – 25 of 3778) sorted by relevance

12345678910>>...152

/freebsd/sys/contrib/ck/include/spinlock/
H A Dhclh.h42 struct ck_spinlock_hclh *previous; member
52 unowned->previous = NULL; in ck_spinlock_hclh_init()
78 struct ck_spinlock_hclh *previous, *local_tail; in ck_spinlock_hclh_lock() local
84 /* Make sure previous->previous doesn't appear to be NULL */ in ck_spinlock_hclh_lock()
85 thread->previous = *local_queue; in ck_spinlock_hclh_lock()
90 /* Mark current request as last request. Save reference to previous request. */ in ck_spinlock_hclh_lock()
91 previous = ck_pr_fas_ptr(local_queue, thread); in ck_spinlock_hclh_lock()
92 thread->previous = previous; in ck_spinlock_hclh_lock()
94 /* Wait until previous thread from the local queue is done with lock. */ in ck_spinlock_hclh_lock()
96 if (previous->previous != NULL) { in ck_spinlock_hclh_lock()
[all …]
H A Dclh.h41 struct ck_spinlock_clh *previous; member
49 unowned->previous = NULL; in ck_spinlock_clh_init()
71 struct ck_spinlock_clh *previous; in ck_spinlock_clh_lock() local
78 * Mark current request as last request. Save reference to previous in ck_spinlock_clh_lock()
81 previous = ck_pr_fas_ptr(queue, thread); in ck_spinlock_clh_lock()
82 thread->previous = previous; in ck_spinlock_clh_lock()
84 /* Wait until previous thread is done with lock. */ in ck_spinlock_clh_lock()
86 while (ck_pr_load_uint(&previous->wait) == true) in ck_spinlock_clh_lock()
96 struct ck_spinlock_clh *previous; in ck_spinlock_clh_unlock() local
105 previous = thread[0]->previous; in ck_spinlock_clh_unlock()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Serialization/
H A DASTDeserializationListener.h70 ASTDeserializationListener *Previous; variable
75 ASTDeserializationListener *Previous, bool DeletePrevious) in DelegatingDeserializationListener() argument
76 : Previous(Previous), DeletePrevious(DeletePrevious) {} in DelegatingDeserializationListener()
79 delete Previous; in ~DelegatingDeserializationListener() local
88 if (Previous) in ReaderInitialized()
89 Previous->ReaderInitialized(Reader); in ReaderInitialized()
93 if (Previous) in IdentifierRead()
94 Previous->IdentifierRead(ID, II); in IdentifierRead()
97 if (Previous) in MacroRead()
98 Previous->MacroRead(ID, MI); in MacroRead()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Format/
H A DContinuationIndenter.cpp42 const FormatToken *Previous = Tok.getPreviousNonComment(); in shouldUnindentNextOperator() local
43 return Previous && (Previous->getPrecedence() == prec::Assignment || in shouldUnindentNextOperator()
44 Previous->isOneOf(tok::kw_return, TT_RequiresClause)); in shouldUnindentNextOperator()
128 return Tok.isMemberAccess() && Tok.Previous && Tok.Previous->closesScope(); in startsSegmentOfBuilderTypeCall()
142 assert(Current.Previous); in startsNextOperand()
143 const auto &Previous = *Current.Previous; in startsNextOperand() local
144 return isAlignableBinaryOperator(Previous) && !Current.isTrailingComment(); in startsNextOperand()
164 (LessTok.Previous && LessTok.Previous->is(tok::equal)))); in opensProtoMessageField()
300 const FormatToken &Previous = *Current.Previous; in canBreak() local
302 assert(&Previous == Current.Previous); in canBreak()
[all …]
H A DTokenAnnotator.cpp67 if (Left->Previous && Left->Previous->is(tok::greater) && in isLambdaParameterList()
68 Left->Previous->MatchingParen && in isLambdaParameterList()
69 Left->Previous->MatchingParen->is(TT_TemplateOpener)) { in isLambdaParameterList()
70 Left = Left->Previous->MatchingParen; in isLambdaParameterList()
74 return Left->Previous && Left->Previous->is(tok::r_square) && in isLambdaParameterList()
75 Left->Previous->MatchingParen && in isLambdaParameterList()
76 Left->Previous->MatchingParen->is(TT_LambdaLSquare); in isLambdaParameterList()
91 if (Tok.Previous && Tok.Previous->is(tok::at)) in isCppAttribute()
153 auto *Left = CurrentToken->Previous; // The '<'. in parseAngle()
160 const auto *BeforeLess = Left->Previous; in parseAngle()
[all …]
H A DFormatToken.cpp65 if (LBrace->Previous && LBrace->Previous->is(tok::equal)) in isBlockIndentedInitRBrace()
90 if (!State.NextToken || !State.NextToken->Previous) in formatAfterToken()
98 State.NextToken->Previous->getPreviousNonComment(); in formatAfterToken()
108 Style.ColumnLimit - State.Column + State.NextToken->Previous->ColumnWidth; in formatAfterToken()
127 // If the previous token was one of our commas, we are now on the next item. in formatAfterToken()
128 if (Item < Commas.size() && State.NextToken->Previous == Commas[Item]) { in formatAfterToken()
220 !ItemEnd->Previous->isTrailingComment()) { in precomputeFormattingInfos()
227 ItemEnd = Token->MatchingParen->Previous; in precomputeFormattingInfos()
325 assert(Current.Previous); in startsNextParameter()
326 const auto &Previous = *Current.Previous; in startsNextParameter() local
[all …]
/freebsd/sys/contrib/ck/include/gcc/ppc64/
H A Dck_pr.h155 uint64_t previous; in ck_pr_cas_64_value() local
164 : "=&r" (previous) in ck_pr_cas_64_value()
170 *value = previous; in ck_pr_cas_64_value()
171 return (previous == compare); in ck_pr_cas_64_value()
177 void *previous; in ck_pr_cas_ptr_value() local
186 : "=&r" (previous) in ck_pr_cas_ptr_value()
192 ck_pr_md_store_ptr(value, previous); in ck_pr_cas_ptr_value()
193 return (previous == compare); in ck_pr_cas_ptr_value()
199 uint64_t previous; in ck_pr_cas_64() local
208 : "=&r" (previous) in ck_pr_cas_64()
[all …]
/freebsd/lib/libdevstat/
H A Ddevstat.383 .Fa "struct devstat *previous"
450 .Fa previous ,
459 .Fa previous .
464 .Fa previous
495 .Fa previous
506 .Fa previous
514 .Fa previous
526 .Fa previous
534 .Fa previous
546 .Fa previous
[all …]
/freebsd/sys/contrib/ck/include/gcc/arm/
H A Dck_pr.h214 T previous; \
225 :"=&r" (previous), "=&r" (tmp) \
229 *value = previous; \
301 void *previous, *tmp; in ck_pr_cas_ptr_value() local
309 : "=&r" (previous), in ck_pr_cas_ptr_value()
315 *(void **)value = previous; in ck_pr_cas_ptr_value()
316 return (previous == compare); in ck_pr_cas_ptr_value()
322 void *previous, *tmp; in ck_pr_cas_ptr() local
330 : "=&r" (previous), in ck_pr_cas_ptr()
336 return (previous == compare); in ck_pr_cas_ptr()
[all …]
/freebsd/sys/contrib/ck/include/gcc/ppc/
H A Dck_pr.h153 T previous; \
161 : "=&r" (previous) \
166 *(T *)value = previous; \
167 return (previous == compare); \
172 T previous; \
180 : "=&r" (previous) \
185 return (previous == compare); \
201 T previous; \
206 : "=&r" (previous) \
210 return (previous); \
[all …]
/freebsd/sys/contrib/ck/include/gcc/aarch64/
H A Dck_pr_llsc.h104 T previous; \
113 : "=&r" (previous), \
119 *(T *)value = previous; \
120 return (previous == compare); \
125 T previous; \
135 : "=&r" (previous), \
141 return (previous == compare); \
167 T previous; \
173 : "=&r" (previous), \
178 return (previous); \
[all …]
H A Dck_pr_lse.h113 T previous = compare; \
116 : "+&r" (previous) \
120 return (previous == compare); \
146 T previous; \
149 : "=&r" (previous) \
153 return (previous); \
248 uintptr_t previous; in ck_pr_faa_ptr() local
252 : "=r" (previous) in ck_pr_faa_ptr()
257 return (void *)(previous); in ck_pr_faa_ptr()
263 uint64_t previous; in ck_pr_faa_64() local
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_pr.h224 T previous; \
227 previous = (T)punt; \
229 (C)previous, \
230 (C)(previous P value), \
231 &previous) == false) \
493 T previous; \
496 previous = (T)punt; \
497 while (ck_pr_cas_##S##_value(target, (C)previous, \
498 (C)(previous P (R ((T)1 << offset))), &previous) == false) \
500 return ((previous >> offset) & 1); \
[all …]
H A Dck_tflock.h84 uint32_t previous; in ck_tflock_ticket_write_lock() local
86 previous = ck_tflock_ticket_fca_32(&lock->request, CK_TFLOCK_TICKET_WC_TOPMSK, in ck_tflock_ticket_write_lock()
89 while (ck_pr_load_32(&lock->completion) != previous) in ck_tflock_ticket_write_lock()
109 uint32_t previous; in ck_tflock_ticket_read_lock() local
111 previous = ck_tflock_ticket_fca_32(&lock->request, in ck_tflock_ticket_read_lock()
118 CK_TFLOCK_TICKET_W_MASK) != previous) { in ck_tflock_ticket_read_lock()
H A Dck_brlock.h49 struct ck_brlock_reader *previous; member
146 reader->previous = NULL; in ck_brlock_read_register()
153 reader->next->previous = reader; in ck_brlock_read_register()
167 reader->next->previous = reader->previous; in ck_brlock_read_unregister()
169 if (reader->previous != NULL) in ck_brlock_read_unregister()
170 reader->previous->next = reader->next; in ck_brlock_read_unregister()
/freebsd/usr.sbin/etcupdate/
H A Detcupdate.8102 keeps copies of the current and previous versions of files that it manages.
106 .Dq previous
113 .Dq previous
141 .Dq previous
154 .Dq previous
160 .Dq previous
163 .Dq previous
179 .Dq previous
321 .Dq previous
419 .Dq previous
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenCommonISel.cpp134 MachineBasicBlock::iterator Previous = SplitPoint; in findSplitPointForStackProtector() local
136 --Previous; in findSplitPointForStackProtector()
137 } while (Previous != Start && Previous->isDebugInstr()); in findSplitPointForStackProtector()
140 Previous->getOpcode() == TII.getCallFrameDestroyOpcode()) { in findSplitPointForStackProtector()
158 --Previous; in findSplitPointForStackProtector()
159 if (Previous->isCall()) in findSplitPointForStackProtector()
161 } while(Previous->getOpcode() != TII.getCallFrameSetupOpcode()); in findSplitPointForStackProtector()
163 return Previous; in findSplitPointForStackProtector()
166 while (MIIsInTerminatorSequence(*Previous)) { in findSplitPointForStackProtector()
167 SplitPoint = Previous; in findSplitPointForStackProtector()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DPGOCtxProfReader.h47 IndexNode *Previous = nullptr; variable
52 Next->Previous = Previous; in ~IndexNode()
53 if (Previous) in ~IndexNode()
54 Previous->Next = Next; in ~IndexNode()
62 Previous = Other.Previous; in IndexNode()
66 Other.Next->Previous = this; in IndexNode()
67 if (Other.Previous) in IndexNode()
68 Other.Previous->Next = this; in IndexNode()
72 Other.Previous = nullptr; in IndexNode()
/freebsd/contrib/ofed/opensm/opensm/
H A Dosm_perfmgr_db.c282 * Dump a reading vs the previous reading to stdout
359 perfmgr_db_err_reading_t *previous = NULL; in perfmgr_db_add_err_reading() local
371 previous = &(node->ports[port].err_previous); in perfmgr_db_add_err_reading()
375 epi_pe_data.time_diff_s = (reading->time - previous->time); in perfmgr_db_add_err_reading()
379 /* calculate changes from previous reading */ in perfmgr_db_add_err_reading()
381 (reading->symbol_err_cnt - previous->symbol_err_cnt); in perfmgr_db_add_err_reading()
384 (reading->link_err_recover - previous->link_err_recover); in perfmgr_db_add_err_reading()
387 (reading->link_downed - previous->link_downed); in perfmgr_db_add_err_reading()
389 epi_pe_data.rcv_err = (reading->rcv_err - previous->rcv_err); in perfmgr_db_add_err_reading()
392 (reading->rcv_rem_phys_err - previous->rcv_rem_phys_err); in perfmgr_db_add_err_reading()
[all …]
/freebsd/contrib/llvm-project/libunwind/src/
H A DFrameHeaderCache.hpp94 CacheEntry *Previous = nullptr; in find() local
104 if (Previous) { in find()
105 // If there is no Previous, then Current is already the in find()
107 Previous->Next = Current->Next; in find()
114 Previous = Current; in find()
130 CacheEntry *Previous = nullptr; in add() local
132 Previous = Current; in add()
135 Previous->Next = nullptr; in add()
/freebsd/contrib/libarchive/libarchive/
H A Darchive_entry_link_resolver.c72 struct links_entry *previous; member
315 if (le->previous != NULL) in find_entry()
316 le->previous->next = le->next; in find_entry()
318 le->next->previous = le->previous; in find_entry()
355 le->next->previous = le->previous; in next_entry()
356 if (le->previous != NULL) in next_entry()
357 le->previous->next = le->next; in next_entry()
399 res->buckets[bucket]->previous = le; in insert_entry()
402 le->previous = NULL; in insert_entry()
434 new_buckets[bucket]->previous = le; in grow_hash()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Dshaintrin.h77 /// message elements using previous message elements from the 128-bit
85 /// A 128-bit vector of [4 x i32] containing previous message elements.
87 /// A 128-bit vector of [4 x i32] containing previous message elements.
97 /// elements using previous message elements from the 128-bit vectors of
107 /// A 128-bit vector of [4 x i32] containing previous message values.
149 /// message elements using previous message elements from the 128-bit
157 /// A 128-bit vector of [4 x i32] containing previous message elements.
159 /// A 128-bit vector of [4 x i32] containing previous message elements.
169 /// elements using previous message elements from the 128-bit vectors of
179 /// A 128-bit vector of [4 x i32] containing previous message values.
/freebsd/sys/contrib/ck/src/
H A Dck_hs.c257 struct ck_hs_map *map, *previous; in ck_hs_reset_size() local
259 previous = hs->map; in ck_hs_reset_size()
265 ck_hs_map_destroy(hs->m, previous, true); in ck_hs_reset_size()
272 struct ck_hs_map *previous; in ck_hs_reset() local
274 previous = hs->map; in ck_hs_reset()
275 return ck_hs_reset_size(hs, previous->capacity); in ck_hs_reset()
338 const void *previous, **bucket; in ck_hs_grow() local
352 previous = map->entries[k]; in ck_hs_grow()
353 if (previous == CK_HS_EMPTY || previous == CK_HS_TOMBSTONE) in ck_hs_grow()
358 previous = CK_HS_VMA(previous); in ck_hs_grow()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DRedeclarable.h36 // - the "previous" (temporal) element in the chain
43 // - Most links in the chain point to previous, except the link out of
46 // - Elements are called "first", "previous", "latest" or
98 using Previous = Decl *; variable
101 /// we've not yet set the previous decl or there isn't one), or to a known
102 /// previous declaration.
103 using NotKnownLatest = llvm::PointerUnion<Previous, UninitializedLatest>;
113 DeclLink(PreviousTag, decl_type *D) : Link(NotKnownLatest(Previous(D))) {} in DeclLink()
122 if (auto *Prev = dyn_cast<Previous>(NKL)) in getPrevious()
136 Link = Previous(D); in setPrevious()
[all …]
/freebsd/share/man/man9/
H A Dvm_map_entry_resize_free.9138 updates both the new entry and the previous entry, and that
140 updates the previous entry.
164 then you should resize the previous entry.
183 which updates both the new entry and the previous entry.
204 changes the amount of free space following the previous entry,
207 to update the previous entry.

12345678910>>...152