similar to: xfs_rename error and brick offline

Displaying 20 results from an estimated 200 matches similar to: "xfs_rename error and brick offline"

2017 Nov 16
0
xfs_rename error and brick offline
On Thu, Nov 16, 2017 at 6:23 AM, Paul <flypen at gmail.com> wrote: > Hi, > > I have a 5-nodes GlusterFS cluster with Distributed-Replicate. There are > 180 bricks in total. The OS is CentOS6.5, and GlusterFS is 3.11.0. I find > many bricks are offline when we generate some empty files and rename them. > I see xfs call trace in every node. > > For example, > Nov 16
2015 Sep 21
2
Centos 6.6, apparent xfs corruption
Hi all - After several months of worry-free operation, we received the following kernel messages about an xfs filesystem running under CentOS 6.6. The proximate causes appear to be "Internal error xfs_trans_cancel" and "Corruption of in-memory data detected. Shutting down filesystem". The filesystem is back up, mounted, appears to be working OK underlying a Splunk datastore.
2014 Jul 01
3
corruption of in-memory data detected (xfs)
Hi All, I am having an issue with an XFS filesystem shutting down under high load with very many small files. Basically, I have around 3.5 - 4 million files on this filesystem. New files are being written to the FS all the time, until I get to 9-11 mln small files (35k on average). at some point I get the following in dmesg: [2870477.695512] Filesystem "sda5": XFS internal error
2015 Sep 21
0
Centos 6.6, apparent xfs corruption
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I think you need to read this from the bottom up: "Corruption of in-memory data detected. Shutting down filesystem" so XFS calls xfs_do_force_shutdown to shut down the filesystem. The call comes from fs/xfs/xfs_trans.c which fails, and so reports "Internal error xfs_trans_cancel". In other words, I would look at the memory
2023 Aug 10
2
orphaned snapshots
I?ve never had such situation and I don?t recall someone sharing something similar. Most probably it?s easier to remove the node from the TSP and re-add it.Of course , test the case in VMs just to validate that it?s possible to add a mode to a cluster with snapshots. I have a vague feeling that you will need to delete all snapshots. Best Regards,Strahil Nikolov? On Thursday, August 10, 2023, 4:36
2023 Aug 09
1
orphaned snapshots
Hi Due to an outage of one node, after bringing it up again, the node has some orphaned snapshosts, which are already deleted on the other nodes. How can I delete these orphaned snapshots? Trying the normal way produceses these errors: |[2023-08-08 19:34:03.667109 +0000] E [MSGID: 106115] [glusterd-mgmt.c:118:gd_mgmt_v3_collate_errors] 0-management: Pre Validation failed on B742. Please
2010 Nov 01
2
frame size for a given quality?
Jeff, It's in the manual: http://www.speex.org/docs/manual/speex-manual/node10.html (table 3 and 4). However, if you're asking this, you're probably trying to do something wrong, or the hard way. You probably shouldn't be taking speex output, and trying to "count bytes". If you are using the API, then you will just get the bits out, and then you'll know how
2005 Nov 28
1
nodebytes,leafwords
hello all, we are developing and porting vorbis1decoder on a 24 bit platform. in the process we came across somedoubts about node bytes and leaf words. from the specification we got that we are arranging the huffman codeword tree into an array. the nodebytes are the number of bytes that are required to represent a node and leafwords are the no. of bytes required to represent the leaf i.e the
2005 Dec 09
0
RE: nodebytes and leafwords
hi kuhlen, what you said is correct. i am talking about how you are going to arrange these codewords into an array, i.e. in the function _make_decode_table. there he uses node bytes and leaf words for memory management. i got a 24 bit platform. so if i assume that max. codeword length that could be possible as 24 bits can i allocate a memory of (2 * used entries - 2), to arrange the whole tree in
2010 Nov 01
1
frame size for a given quality?
Have you tried typing "speex rtp" into google code search? It gives lots of examples of real applications which do exactly that. http://www.google.com/codesearch?as_q=speex+rtp -SteveK On 11/1/10 1:13 PM, "Jeff Ramin" <jeff.ramin at singlewire.com> wrote: > >Thanks again Steve. I'll search for the term you mention below. > >What I really want is to
2005 Aug 08
3
Reg. getting codewords from codelengths
Hi, I am a bit confused on how code-words are derived from the codeword lengths. I will appreciate if someone can point me in the correct direction. I will take the example of an actual codebook that i found in a valid vorbis encoded file as shown below. [SK] +------Codebook [0] -------- [SK] Codebook Dimensions = 1 [SK] Codebook Entries = 8 [SK] Unordered [SK] 1, 6, 3, 7, 2, 5, 4, 7, [SK] NO
2010 Jan 31
2
[LLVMdev] Crash in PBQP register allocator
Hi Sebastian, It boils down to this: The previous heuristic solver could return infinite cost solutions in some rare cases (despite finite-cost solutions existing). The new solver is still heuristic, but it should always return a finite cost solution if one exists. It does this by avoiding early reduction of infinite spill cost nodes via R1 or R2. To illustrate why the early reductions can be a
2007 Apr 13
1
request bit allocation info!
Folks, I would like to use Speex for an speech enhancement project and it requires manipulation of coded parameters. I was wondering whether any of you could provide some info. on the following queries, /*Encode the frame*/ speex_encode(state, input, &bits); Can I print the ASCII values of these bits (I mean how?). I did read the bit allocation available at below url, so that I could
2009 Jun 03
1
using speex in a wireless network
Hello, ????????at the beginning I want to underline that I've read SpeeX documentation and did some tests. I know that SpeeX was designed for networks in which packets arrive without errors, or don't arrive at all. SpeeX is very attractive if we consider low bit rates. I need to use SpeeX in very noisy environment, where speech quality doesn't matter, I'm interested in 2kb/s
2009 Jun 11
0
Computational complexity vs mode (bit-rate)
Dear all, I was interested to get an idea on how the computational complexity is affected by different modes, assuming a fixed complexity setting. I saw in the documentation (Table 4 http://www.speex.org/docs/manual/speex-manual/node10.html) that going to higher data bit rate does not always increase the complexity (e.g. 11 kbps require 14 mflops while 15 kbps require 11 mflops). Is this
2003 Nov 20
0
newer iproute2: no support for "ip link set dev $DEV promisc on"
Greetings all, I have tried to find a discussion of the removal of support for the PROMISC interface flag with the iproute2 tools. - it used to work (iproute2-2.2.4-$ANCIENT) - there''s a comment about it in the iproute docs [0] - (un-)setting the flag with ifconfig still works Can anybody point me to the discussion (linux-net, maybe?) where support for setting the PROMISC flag
2012 Jul 19
1
duplicate domain ids!?
Somehow I've ended up with duplicate domids. domid=15 name=node14 (names sanitized) # virsh list --all Id Name State ---------------------------------------------------- 1 node1 running 2 node2 running 3 node3 running 5 node4 running 6
2010 Nov 01
0
frame size for a given quality?
Thanks again Steve. I'll search for the term you mention below. What I really want is to take the output of the speex encoder and spit it out on the network via RTP. I haven't been able to find a library or code example that does that. On 11/01/2010 12:03 PM, Steve Kann wrote: > Jeff, > > It's in the manual: > >
2010 Nov 01
0
frame size for a given quality?
Yes, I have made that search, but I'm restricted to Java. On 11/01/2010 12:21 PM, Steve Kann wrote: > Have you tried typing "speex rtp" into google code search? It gives lots > of examples of real applications which do exactly that. > > http://www.google.com/codesearch?as_q=speex+rtp > > > -SteveK > > > On 11/1/10 1:13 PM, "Jeff
2010 Nov 01
1
frame size for a given quality?
Jeff, RFC-5574 is standards-track: http://tools.ietf.org/html/rfc5574 so, while it's not an approved standard, it's more standardized than a lot of interoperable traffic on the internets these days. The RFC specifies packetization guidelines, which is basically that you put one or more frames in a packet, and then pad the rest with 0 bits until you have a while number of octets.