Change instances of wether in comments to whether. No functional change intended.
This commit is contained in:
parent
157046ce4b
commit
0e35d5d2e5
@ -198,8 +198,8 @@ thread_is_interrupted(Thread* thread, uint32 flags)
|
||||
}
|
||||
|
||||
|
||||
/*! Checks wether the given thread is currently blocked (i.e. still waiting for
|
||||
something).
|
||||
/*! Checks whether the given thread is currently blocked (i.e. still waiting
|
||||
for something).
|
||||
|
||||
If a stable answer is required, the caller must hold the scheduler lock.
|
||||
Alternatively, if waiting is not interruptible and cannot time out, holding
|
||||
|
@ -100,7 +100,7 @@ static void scsi_insert_new_request( scsi_device_info *device,
|
||||
// request are sorted monotically increasing
|
||||
//
|
||||
// the first exception should help if the queue is short (not sure
|
||||
// wether this actually hurts if we have a long queue), the
|
||||
// whether this actually hurts if we have a long queue), the
|
||||
// second one maximizes monotonic ranges
|
||||
last = first->prev;
|
||||
|
||||
|
@ -266,7 +266,7 @@ GetEdidFromBIOS(edid1_raw& edidRaw)
|
||||
|
||||
status = vm86_do_int(&vmState, 0x10);
|
||||
if (status == B_OK) {
|
||||
// AH contains the error code, and AL determines wether or not the
|
||||
// AH contains the error code, and AL determines whether or not the
|
||||
// function is supported.
|
||||
if (vmState.regs.eax != 0x4f)
|
||||
status = B_NOT_SUPPORTED;
|
||||
|
@ -509,7 +509,7 @@ GetEdidFromBIOS(edid1_raw& edidRaw)
|
||||
|
||||
status = vm86_do_int(&vmState, 0x10);
|
||||
if (status == B_OK) {
|
||||
// AH contains the error code, and AL determines wether or not the
|
||||
// AH contains the error code, and AL determines whether or not the
|
||||
// function is supported.
|
||||
if (vmState.regs.eax != 0x4f)
|
||||
status = B_NOT_SUPPORTED;
|
||||
|
@ -1402,7 +1402,7 @@ static int remaining_bits(WMAProDecodeCtx *s, GetBitContext *gb)
|
||||
*@param s codec context
|
||||
*@param gb bitstream reader context
|
||||
*@param len length of the partial frame
|
||||
*@param append decides wether to reset the buffer or not
|
||||
*@param append decides whether to reset the buffer or not
|
||||
*/
|
||||
static void save_bits(WMAProDecodeCtx *s, GetBitContext* gb, int len,
|
||||
int append)
|
||||
|
@ -66,7 +66,7 @@ typedef struct {
|
||||
int index; ///< index in mxf_essence_container_uls table
|
||||
const UID *codec_ul;
|
||||
int order; ///< interleaving order if dts are equal
|
||||
int interlaced; ///< wether picture is interlaced
|
||||
int interlaced; ///< whether picture is interlaced
|
||||
int temporal_reordering;
|
||||
AVRational aspect_ratio; ///< display aspect ratio
|
||||
int closed_gop; ///< gop is closed, used in mpeg-2 frame parsing
|
||||
|
@ -258,7 +258,7 @@ EbmlElement * EbmlElement::FindNextID(IOCallback & DataStream, const EbmlCallbac
|
||||
}
|
||||
if (PossibleId[0] & BitMask) {
|
||||
// this is the last octet of the ID
|
||||
// check wether that's the one we're looking for
|
||||
// check whether that's the one we're looking for
|
||||
/* if (PossibleID == ClassInfos.GlobalId) {
|
||||
break;
|
||||
} else {
|
||||
@ -529,7 +529,7 @@ EbmlElement *EbmlElement::CreateElementUsingContext(const EbmlId & aID, const Eb
|
||||
return &Context.MasterElt->Create();
|
||||
}
|
||||
|
||||
// check wether it's not part of an upper context
|
||||
// check whether it's not part of an upper context
|
||||
if (Context.UpTable != NULL) {
|
||||
LowLevel++;
|
||||
MaxLowerLevel++;
|
||||
|
@ -108,7 +108,8 @@ class EBML_DLL_API EbmlSemantic {
|
||||
EbmlSemantic(bool aMandatory, bool aUnique, const EbmlCallbacks & aGetCallbacks)
|
||||
:Mandatory(aMandatory), Unique(aUnique), GetCallbacks(aGetCallbacks) {}
|
||||
|
||||
bool Mandatory; ///< wether the element is mandatory in the context or not
|
||||
bool Mandatory;
|
||||
///< whether the element is mandatory in the context or not
|
||||
bool Unique;
|
||||
const EbmlCallbacks & GetCallbacks;
|
||||
};
|
||||
|
@ -66,7 +66,7 @@ class EBML_DLL_API EbmlMaster : public EbmlElement {
|
||||
uint64 UpdateSize(bool bKeepIntact = false, bool bForceRender = false);
|
||||
|
||||
/*!
|
||||
\brief Set wether the size is finite (size is known in advance when writing, or infinite size is not known on writing)
|
||||
\brief Set whether the size is finite (size is known in advance when writing, or infinite size is not known on writing)
|
||||
*/
|
||||
bool SetSizeInfinite(bool aIsInfinite = true) {bSizeIsFinite = !aIsInfinite; return true;}
|
||||
|
||||
|
@ -203,7 +203,7 @@ bool KaxInternalBlock::AddFrame(const KaxTrackEntry & track, uint64 timecode, Da
|
||||
return false;
|
||||
|
||||
if (lacing == LACING_XIPH)
|
||||
// decide wether a new frame can be added or not
|
||||
// decide whether a new frame can be added or not
|
||||
// a frame in a lace is not efficient when the place necessary to code it in a lace is bigger
|
||||
// than the size of a simple Block. That means more than 6 bytes (4 in struct + 2 for EBML) to code the size
|
||||
return (buffer.Size() < 6*0xFF);
|
||||
|
@ -99,13 +99,13 @@ class MATROSKA_DLL_API FileMatroska {
|
||||
void SelectReadingTrack(Track * aTrack, bool select = true);
|
||||
|
||||
/*!
|
||||
\return wether the frame has been added or not
|
||||
\return whether the frame has been added or not
|
||||
*/
|
||||
bool AddFrame(Track * aTrack, const uint32 aTimecode, const binary *aFrame, const uint32 aFrameSize,
|
||||
const bool aKeyFrame = true, const bool aBFrame = false);
|
||||
|
||||
/*!
|
||||
\return wether the frame has been read or not
|
||||
\return whether the frame has been read or not
|
||||
*/
|
||||
bool ReadFrame(Track * & aTrack, uint32 & aTimecode, const binary * & aFrame, uint32 & aFrameSize,
|
||||
bool & aKeyFrame, bool & aBFrame);
|
||||
|
@ -28,7 +28,7 @@ WonderBrushImage::SetTo(BPositionIO* stream)
|
||||
return B_BAD_VALUE;
|
||||
|
||||
// try to load the stream as a BMessage and probe it
|
||||
// to see wether it might be a WonderBrush image
|
||||
// to see whether it might be a WonderBrush image
|
||||
fArchive.MakeEmpty();
|
||||
status_t status = fArchive.Unflatten(stream);
|
||||
if (status < B_OK)
|
||||
|
@ -94,7 +94,7 @@ BTokenSpace::RemoveToken(int32 token)
|
||||
}
|
||||
|
||||
|
||||
/*! Checks wether or not the \a token exists with the specified
|
||||
/*! Checks whether or not the \a token exists with the specified
|
||||
\a type in the token space or not.
|
||||
*/
|
||||
bool
|
||||
|
@ -554,7 +554,7 @@ BBitmap::Bounds() const
|
||||
/*! \brief Returns the bitmap's creating flags.
|
||||
|
||||
This method informs about which flags have been used to create the
|
||||
bitmap. It would for example tell you wether this is an overlay
|
||||
bitmap. It would for example tell you whether this is an overlay
|
||||
bitmap. If bitmap creation succeeded, all flags are fulfilled.
|
||||
|
||||
\return The bitmap's creation flags.
|
||||
|
@ -3281,7 +3281,7 @@ BWindow::_DetermineTarget(BMessage* message, BHandler* target)
|
||||
|
||||
case B_PULSE:
|
||||
case B_QUIT_REQUESTED:
|
||||
// TODO: test wether R5 will let BView dispatch these messages
|
||||
// TODO: test whether R5 will let BView dispatch these messages
|
||||
return this;
|
||||
|
||||
case _MESSAGE_DROPPED_:
|
||||
|
@ -941,7 +941,7 @@ PackageWriterImpl::_UpdateCheckEntryCollisions(Attribute* parentAttribute,
|
||||
|
||||
SubPathAdder pathAdder(fListener, pathBuffer, fileName);
|
||||
|
||||
// Check wether there's an entry attribute for this entry. If not, we can
|
||||
// Check whether there's an entry attribute for this entry. If not, we can
|
||||
// ignore this entry.
|
||||
Attribute* entryAttribute = parentAttribute->FindEntryChild(fileName);
|
||||
if (entryAttribute == NULL)
|
||||
|
@ -307,7 +307,7 @@ class BContainerWindow : public BWindow {
|
||||
|
||||
class WindowStateNodeOpener {
|
||||
// this class manages opening and closing the proper node for
|
||||
// state restoring / saving; the constructor knows how to decide wether
|
||||
// state restoring / saving; the constructor knows how to decide whether
|
||||
// to use a special directory for root, etc.
|
||||
// setter calls used when no attributes can be read from a node and defaults
|
||||
// are to be substituted
|
||||
|
@ -85,7 +85,7 @@ class FavoritesMenu : public BSlowMenu {
|
||||
int32 fIndex;
|
||||
int32 fSectionItemCount;
|
||||
bool fAddedSeparatorForSection;
|
||||
// keeps track wether a separator will be needed before the
|
||||
// keeps track whether a separator will be needed before the
|
||||
// next inserted item
|
||||
BMessage fItems;
|
||||
|
||||
|
@ -367,7 +367,7 @@ IconRenderer::_Render(const BRect& r)
|
||||
continue;
|
||||
|
||||
// add the style either with global transformation or with
|
||||
// the shapes transformation, depending on wether there
|
||||
// the shapes transformation, depending on whether there
|
||||
// is a gradient and its settings
|
||||
Gradient* gradient = style->Gradient();
|
||||
bool styleAdded = false;
|
||||
|
@ -64,7 +64,7 @@ DataTranslationsApplication::_InstallError(const char* name, status_t status)
|
||||
status_t
|
||||
DataTranslationsApplication::_Install(BDirectory& target, BEntry& entry)
|
||||
{
|
||||
// Find out wether we need to copy it
|
||||
// Find out whether we need to copy it
|
||||
status_t status = entry.MoveTo(&target, NULL, true);
|
||||
if (status == B_OK)
|
||||
return B_OK;
|
||||
@ -145,7 +145,7 @@ DataTranslationsApplication::RefsReceived(BMessage* message)
|
||||
// the original file will be replaced
|
||||
}
|
||||
|
||||
// find out wether we need to copy it or not
|
||||
// find out whether we need to copy it or not
|
||||
|
||||
status = _Install(target, entry);
|
||||
if (status == B_OK) {
|
||||
|
@ -1579,7 +1579,7 @@ Window::SubsetWorkspaces() const
|
||||
}
|
||||
|
||||
|
||||
/*! Returns wether or not a window is in the subset workspace list with the
|
||||
/*! Returns whether or not a window is in the subset workspace list with the
|
||||
specified \a index.
|
||||
See SubsetWorkspaces().
|
||||
*/
|
||||
|
@ -350,7 +350,7 @@ vesa_get_edid(edid1_info *info)
|
||||
|
||||
TRACE(("EDID1: %lx\n", regs.eax));
|
||||
// %ah contains the error code
|
||||
// %al determines wether or not the function is supported
|
||||
// %al determines whether or not the function is supported
|
||||
if (regs.eax != 0x4f)
|
||||
return B_NOT_SUPPORTED;
|
||||
|
||||
|
2
src/system/kernel/cache/BlockMap.cpp
vendored
2
src/system/kernel/cache/BlockMap.cpp
vendored
@ -97,7 +97,7 @@ BlockMap::~BlockMap()
|
||||
}
|
||||
|
||||
|
||||
/** Checks wether or not the construction of the BlockMap were successful.
|
||||
/** Checks whether or not the construction of the BlockMap were successful.
|
||||
*/
|
||||
|
||||
status_t
|
||||
|
4
src/system/kernel/cache/block_cache.cpp
vendored
4
src/system/kernel/cache/block_cache.cpp
vendored
@ -687,7 +687,7 @@ static object_cache* sBlockCache;
|
||||
// #pragma mark - notifications/listener
|
||||
|
||||
|
||||
/*! Checks wether or not this is an event that closes a transaction. */
|
||||
/*! Checks whether or not this is an event that closes a transaction. */
|
||||
static inline bool
|
||||
is_closing_event(int32 event)
|
||||
{
|
||||
@ -1792,7 +1792,7 @@ put_cached_block(block_cache* cache, off_t blockNumber)
|
||||
there, or reads it from the disk.
|
||||
You need to have the cache locked when calling this function.
|
||||
|
||||
\param _allocated tells you wether or not a new block has been allocated
|
||||
\param _allocated tells you whether or not a new block has been allocated
|
||||
to satisfy your request.
|
||||
\param readBlock if \c false, the block will not be read in case it was
|
||||
not already in the cache. The block you retrieve may contain random
|
||||
|
@ -265,7 +265,7 @@ find_debugger_command(const char *name, bool partialMatch, bool& ambiguous)
|
||||
}
|
||||
|
||||
|
||||
/*! Returns wether or not a debugger command is currently being invoked.
|
||||
/*! Returns whether or not a debugger command is currently being invoked.
|
||||
*/
|
||||
bool
|
||||
in_command_invocation(void)
|
||||
|
@ -1067,7 +1067,7 @@ DirectoryWatcher::EventOccurred(NotificationService& service,
|
||||
const char *name = event->GetString("name", NULL);
|
||||
|
||||
if (opcode == B_ENTRY_MOVED) {
|
||||
// Determine wether it's a move within, out of, or into one
|
||||
// Determine whether it's a move within, out of, or into one
|
||||
// of our watched directories.
|
||||
ino_t from = event->GetInt64("from directory", -1);
|
||||
ino_t to = event->GetInt64("to directory", -1);
|
||||
|
@ -742,7 +742,7 @@ NodeMonitorService::NotifyStatChanged(dev_t device, ino_t node,
|
||||
// ... for the volume
|
||||
_GetInterestedVolumeListeners(device, B_WATCH_STAT,
|
||||
interestedListeners, interestedListenerCount);
|
||||
// ... for the node, depending on wether its an interim update or not
|
||||
// ... for the node, depending on whether its an interim update or not
|
||||
_GetInterestedMonitorListeners(device, node,
|
||||
(statFields & B_STAT_INTERIM_UPDATE) != 0
|
||||
? B_WATCH_INTERIM_STAT : B_WATCH_STAT,
|
||||
|
@ -203,7 +203,7 @@ int_io_interrupt_handler(int vector, bool levelTriggered)
|
||||
#endif
|
||||
|
||||
// For level-triggered interrupts, we actually handle the return
|
||||
// value (ie. B_HANDLED_INTERRUPT) to decide wether or not we
|
||||
// value (ie. B_HANDLED_INTERRUPT) to decide whether or not we
|
||||
// want to call another interrupt handler.
|
||||
// For edge-triggered interrupts, however, we always need to call
|
||||
// all handlers, as multiple interrupts cannot be identified. We
|
||||
|
@ -1215,7 +1215,7 @@ DirectoryWatcher::EventOccurred(NotificationService& service,
|
||||
const char *name = event->GetString("name", NULL);
|
||||
|
||||
if (opcode == B_ENTRY_MOVED) {
|
||||
// Determine wether it's a move within, out of, or into one
|
||||
// Determine whether it's a move within, out of, or into one
|
||||
// of our watched directories.
|
||||
directory = event->GetInt64("to directory", -1);
|
||||
if (!sModuleNotificationService.HasNode(device, directory)) {
|
||||
|
@ -2324,7 +2324,7 @@ _user_set_signal_stack(const stack_t* newUserStack, stack_t* oldUserStack)
|
||||
return B_BAD_ADDRESS;
|
||||
|
||||
if (thread->signal_stack_enabled) {
|
||||
// determine wether or not the user thread is currently
|
||||
// determine whether or not the user thread is currently
|
||||
// on the active signal stack
|
||||
onStack = arch_on_signal_stack(thread);
|
||||
}
|
||||
|
@ -173,7 +173,7 @@ static fssh_mutex sNotificationsLock;
|
||||
// #pragma mark - notifications/listener
|
||||
|
||||
|
||||
/*! Checks wether or not this is an event that closes a transaction. */
|
||||
/*! Checks whether or not this is an event that closes a transaction. */
|
||||
static inline bool
|
||||
is_closing_event(int32_t event)
|
||||
{
|
||||
@ -709,7 +709,7 @@ put_cached_block(block_cache* cache, fssh_off_t blockNumber)
|
||||
/*! Retrieves the block \a blockNumber from the hash table, if it's already
|
||||
there, or reads it from the disk.
|
||||
|
||||
\param _allocated tells you wether or not a new block has been allocated
|
||||
\param _allocated tells you whether or not a new block has been allocated
|
||||
to satisfy your request.
|
||||
\param readBlock if \c false, the block will not be read in case it was
|
||||
not already in the cache. The block you retrieve may contain random
|
||||
|
Loading…
Reference in New Issue
Block a user